Using theory morphisms for implementing formal methods tools

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

Volumn 2646, Issue , 2003, Pages 59-77

  Brucker, Achim D ^a   Wolff, Burkhart ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Formal Methods; Formal Semantics; OCL; Shallow Embeddings; Theorem Proving

Indexed keywords

COMPUTATIONAL LINGUISTICS; CONFORMAL MAPPING; FORMAL METHODS; FORMAL SPECIFICATION; SEMANTICS; SPECIFICATION LANGUAGES; SPECIFICATIONS;

CONSERVATIVE EXTENSIONS; DIFFERENT TREATMENTS; EMBEDDINGS; FORMAL METHODS TOOLS; FORMAL SEMANTICS; OCL; SEMANTIC PROPERTIES; STRUCTURED THEORIES;

THEOREM PROVING;

EID: 35248899301     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39185-1_4     Document Type: Article

References (33)

1. Winskel, G.: The Formal Semantics of Programming Languages. MIT Press (1993)
2. Nipkow, T.: Winskel is (almost) right: Towards a mechanized semantics textbook. Formal Aspects of Computing 10 (1998) 171-186
3. Spivey, J.M.: The Z Notation: A Reference Manual. 2nd edn. Prentice Hall International Series in Computer Science (1992)
4. Kolyang, Santen, T., Wolff, B.: A structure preserving encoding of Z in Isabelle/HOL. In von Wright, J., Grundy, J., Harrison, J., eds.: TPHOLs. LNCS 1125, Springer (1996)
5. Gordon, M.J.C., Melham, T.F.: Introduction to HOL. Cambridge Press (1993)
6. Nipkow, T., von Oheimb, D., Pusch, C.: μJava: Embedding a programming language in a theorem prover. In Bauer, F.L., Steinbrüggen, R., eds.: Foundations of Secure Computation. Volume 175 of NATO Science Series F: Computer and Systems Sciences., IOS Press (2000) 117-144
7. http://www.nuprl.org.
8. http://pauillac.inria.fr/coq/.
9. http://isabelle.in.tum.de.
10. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL - A Proof Assistant for Higher-Order Logic. Volume 2283 of LNCS. Springer (2002)
11. http://www.ora.on.ca/z-eves/welcome.html.
12. http://svrc.it.uq.edu.au/pages/Ergo.html.
13. http://i11www.ira.uka.de/kiv/.
14. Reetz, R.: Deep Embedding VHDL. In E.T. Schubert, P.J. Windley, J. Alves-Foss, eds.: 8th International Workshop on Higher Order Logic Theorem Proving and its Applications. Volume 971 of Lecture Notes in Computer Science., Springer (1995) 277-292
15. Ozols, M.A., Eastaughffe, K.A., Cant, A., Collignon, S.: DOVE: A tool for design modelling and verification in safety critical systems. In: 16th International System Safety Conference. (1998)
16. Brucker, A.D., Rittinger, F., Wolff, B.: HOL-Z 2.0: A proof environment for Z-specifications. Journal of Universal Computer Science 9 (2003)
17. Brucker, A.D., Wolff, B.: A proposal for a formal OCL semantics in Isabelle/HOL. In Muñoz, C., Tahar, S., Carreño, V., eds.: Theorem Proving in Higher Order Logics. Number 2410 in LNCS. Springer (2002) 99-114
18. Brucker, A.D., Wolff, B.: HOL-OCL: Experiences, consequences and design choices. In Jezequel, J.M., Hussmann, H., Cook, S., eds.: UML 2002: Model Engineering, Concepts and Tools. Number 2460 in LNCS. Springer (2002)
19. OMG: Object Constraint Language Specification. [22] chapter 6
20. Warmer, J., Kleppe, A.: The Object Contraint Language: Precise Modelling with UML. Addison-Wesley (1999)
21. Warmer, J., Kleppe, A., Clark, T., Ivner, A., Högström, J., Gogolla, M., Richters, M., Hussmann, H., Zschaler, S., Johnston, S., Frankel, D.S., Bock, C.: Response to the UML 2.0 OCL RfP. Technical report (2001)
22. OMG: Unified Modeling Language Specification (Version 1.4). (2001)
23. Goguen, J.A., Burstall, R.M.: Institutions: abstract model theory for specification and programming. Journal of the ACM (JACM) 39 (1992) 95-146
24. Nipkow, T.: Order-sorted polymorphism in Isabelle. In Huet, G., Plotkin, G., eds.: Logical Environments. (1993) 164-188
25. Church, A.: A formulation of the simple theory of types. Journal of Symbolic Logic 5 (1940) 56-68
26. Andrews, P.B.: An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Academic Press (1986)
27. Barendregt, H.: Lambda Calculi with Types. In: Handbook of Logic in Computer Science. Clarendon Press (1992) 117-309
28. Frank Pfenning, C.E.: Higher-order abstract syntax. In: PLDI 1988. (1988) 199-208
29. G. Huet, B.L.: Proving and applying program transformations expressed with second order patterns. (Acta Informatica)
30. Boulton, R., Gordon, A., Gordon, M., Harrison, J., Herbert, J., Tassel, J.V.: Experience with embedding hardware description languages in HOL. In Stavridou, V., Melham, T.F., Boute, R.T., eds.: Proceedings of the IFIP TC10/WG 10.2 International Conference on Theorem Provers in Circuit Design: Theory, Practice and Experience. Volume A-10 of IFIP Transactions., Nijmegen, The Netherlands, North-Holland/Elsevier (1992) 129-156
31. Wadler, P.: Comprehending monads. In: Proc. 1990 ACM Conference on Lisp and Functional Programming. (1990)
32. King, D.J., Wadler, P.: Combining monads. In: Glasgow functional programming workshop. (1992)
33. Altenkirch, T., Gaspes, V., Nordström, B., von Sydow, B.: A User's Guide to ALF. Chalmers University of Technology, Sweden. (1994)