Hoare logic for Java in Isabelle/HOL

Concurrency and Computation: Practice and Experience

Volumn 13, Issue 13, 2001, Pages 1173-1214

  Von Oheimb, David ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Auxiliary variables; Axiomatic semantics; Completeness; Dynamic binding; Exception handling; Hoare logic; Isabelle HOL; Java; Mutual recursion; Side effects; Soundness; Type safety; Verification

Indexed keywords

OBJECT ORIENTED PROGRAMMING; SECURITY OF DATA; SEMANTICS; THEOREM PROVING;

AXIOMATIC SEMANTICS;

JAVA PROGRAMMING LANGUAGE;

EID: 0035506099     PISSN: 15320626     EISSN: None     Source Type: Journal    
DOI: 10.1002/cpe.598     Document Type: Article

References (56)

1. Proving Java type soundness
2. Describing the semantics of Java and proving type soundness
3. Reasoning about Java classes (preliminary report)
4. Java program verification via a Hoare logic with abrupt termination
5. A formal executable semantics for Java
6. Checking Java programs via guarded commands
7. A logic of object-oriented programs
8. Implementing a program logic of objects in a higher-order logic theorem prover
9. A logic for the Java Modeling Language JML
10. A programming logic for sequential Java
11. Universes: A type system for controlling representation exposure
12. A WP-calculus for OO
13. ℓight
14. ℓight in Isabelle/HOL
15. An axiomatic basis for computer programming
16. Ten years of Hoare logic: A survey-part I
17. Isabelle: A generic theorem prover
18. A formulation of the simple theory of types
19. Edinburgh LCF: A mechanised logic of computation
20. Isabelle's logics: HOL
21. Machine-checking the Java specification: Proving type-safety
22. Fundamental concepts in programming languages
23. A technique for software module specification with examples
24. Experience with embedding hardware description languages in HOL
25. Soundness and completeness of an axiom system for program verification
26. Auxiliary variables and recursive procedures
27. A mechanically verified verification condition generator
28. Axiomatic approach to side effects and general jumps
29. Side effects and aliasing can have simple axiomatic descriptions
30. Hoare logic for mutual recursion and local variables
31. Mechanical verification of mutually recursive procedures
32. An architecture for interactive program provers