Abstract
Formal specification and verification techniques can improve the quality of programs by enabling the analysis and proof of semantic program properties. This paper describes the modular architecture of an interactive program prover that we are currently developing for a Java subset. In particular, it discusses the integration of a programming language-specific prover component with a general purpose theorem prover. © Springer-Verlag Berlin Heidelberg 2000.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Cite
CITATION STYLE
Meyer, J., & Poetzsch-Heffter, A. (2000). An architecture for interactive program provers. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1785, 63–77. https://doi.org/10.1007/3-540-46419-0_6
Readers over time
Readers' Seniority
Readers' Discipline
