Embedding programming languages in theorem provers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1632, Issue , 1999, Pages

  Nipkow, Tobias ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957616575     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48660-7_38     Document Type: Conference Paper

References (4)

1. M. Gordon. Mechanizing programming logics in higher order logic. In G. Birtwistle and P. Subrahmanyam, editors, Current Trends in Hardware Verification and Automated Theorem Proving. Springer-Verlag, 1989.
2. T. Nipkow and D. v. Oheimb. Javaught is type-safe — definitely. In Proc. 25th ACM Symp. Principles of Programming Languages, pages 161-170. ACM Press, 1998.
3. D. v. Oheimb and T. Nipkow. Machine-checking the Java specification: Proving type-safety. In J. Alves-Foss, editor, Formal Syntax and Semantics of Java, volume 1523 of Lect. Notes in Comp. Sci. Springer-Verlag, 1999.
4. C. Pusch. Proving the soundness of a Java bytecode verifier specification in Isabelle/HOL. In W. Cleaveland, editor, Tools and Algorithms for the Construction and Analysis of Systems (TACAS’99), volume 1579 of Lect. Notes in Comp. Sci., pages 89-103. Springer-Verlag, 1999.