Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Counting polynomial roots in isabelle/hol: a formal proof of the budan-fourier theorem., and . CPP, page 52-64. ACM, (2019)Mechanizing Set Theory., and . J. Autom. Reason., 17 (3): 291-323 (1996)Roth's Theorem on Arithmetic Progressions., , and . Arch. Formal Proofs, (2021)Relations Between Secrets: Two Formal Analyses of the Yahalom Protocol.. J. Comput. Secur., 9 (3): 197-216 (2001)A Higher-Order Implementation of Rewriting.. Sci. Comput. Program., 3 (2): 119-149 (1983)A compiler generator for semantic grammars.. Stanford University, USA, (1981)Should your specification language be typed., and . ACM Trans. Program. Lang. Syst., 21 (3): 502-526 (1999)Making Sense of Specifications: The Formalization of SET (Transcript of Discussion).. Security Protocols Workshop, volume 2133 of Lecture Notes in Computer Science, page 82-86. Springer, (2000)Deriving Structural Induction in LCF.. Semantics of Data Types, volume 173 of Lecture Notes in Computer Science, page 197-214. Springer, (1984)Reasoning About Coding Theory: The Benefits We Get from Computer Algebra., and . AISC, volume 1476 of Lecture Notes in Computer Science, page 55-66. Springer, (1998)