Encoding object-Z in Isabelle/HOL

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

Volumn 2272, Issue , 2002, Pages 82-99

  Smith, Graeme ^a   Kammüller, Florian ^b   Santen, Thomas ^b  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Higher order logic; Isabelle; Object Z; Reference semantics

Indexed keywords

COMPUTER CIRCUITS; ENCODING (SYMBOLS); FORMAL LOGIC; SEMANTICS; SIGNAL ENCODING;

DENOTATIONAL SEMANTICS; FORMALISATION; HIGHER ORDER LOGIC; ISABELLE; ISABELLE/HOL; OBJECT ORIENTED; OBJECT Z; THEOREM PROVERS;

THEOREM PROVING;

EID: 23044529816     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45648-1_5     Document Type: Conference Paper

References (15)

1. H. Barendregt. Lambda calculi with types. In Handbook of Logic in Computer Science, Vol. 2. Oxford University Press, 1992.
2. J. Bowen and M. Gordon. A shallow embedding of Z in HOL. Information and Software Technology, 37(5–6):269–276, 1995.
3. M.J.C. Gordon and T.F. Melham, editors. Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993.
4. A. Griffiths. A Formal Semantics to Support Modular Reasoning in Object-Z. PhD thesis, University of Queensland, 1997.
5. A. Griffiths. Object-oriented operations have two parts. In D.J. Duke and A.S. Evans, editors, 2nd BCS-FACS Northern Formal Methods Workshop, Electronic Workshops in Computing. Springer-Verlag, 1997.
6. F. Kammüller. Modular Reasoning in Isabelle. PhD thesis, Computer Laboratory, University of Cambridge, 1999. Technical Report 470.
7. Kolyang, T. Santen, and B. Wolff. A structure preserving encoding of Z in Isabelle/ HOL. In J. von Wright, J. Grundy, and J. Harrison, editors, Theorem Proving in Higher Order Logics (TPHOLs 96), volume 1125 of Lecture Notes in Computer Science, pages 283–298. Springer-Verlag, 1996.
8. L.C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994.
9. T. Santen. A theory of structured model-based specifications in Isabelle/HOL. In E.L. Gunter and A. Felty, editors, Theorem Proving in Higher-Order Logics (TPHOLs 97), volume 1275 of Lecture Notes in Computer Science, pages 243–258. Springer-Verlag, 1997.
10. T. Santen. On the semantic relation of Z and HOL. In J. Bowen and A. Fett, editors, ZUM’98: The Z Formal Specification Notation, LNCS 1493, pages 96–115. Springer-Verlag, 1998.
11. T. Santen. Isomorphisms – a link between the shallow and the deep. In Y. Bertot, G. Dowek, A. Hirschowitz, C. Paulin, and L. Théry, editors, Theorem Proving in Higher Order Logics, LNCS 1690, pages 37–54. Springer-Verlag, 1999.
12. T. Santen. A Mechanized Logical Model of Z and Object-Oriented Specification. Shaker-Verlag, 2000. Dissertation, Fachbereich Informatik, Technische Universität Berlin, (1999).
13. G. Smith. The Object-Z Specification Language. Kluwer Academic Publishers, 2000.
14. G. Smith. Recursive schema definitions in Object-Z. In A. Galloway J. Bowen, S. Dunne and S. King, editors, International Conference of B and Z Users (ZB 2000), volume 1878 of Lecture Notes in Computer Science, pages 42–58. Springer- Verlag, 2000.
15. H. Tej and B. Wolff. A corrected failure-divergence model for CSP in Isabelle/HOL. In J. Fitzgerald, C.B. Jones, and P. Lucas, editors, Formal Methods Europe (FME 97), volume 1313 of Lecture Notes in Computer Science, pages 318–337. Springer- Verlag, 1997.