Animating the formalised semantics of a Java-like language

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

Volumn 6898 LNCS, Issue , 2011, Pages 216-232

  Lochbihler, Andreas ^a   Bulwahn, Lukas ^b  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BYTECODES; CODE GENERATION; DEFINITE DESCRIPTIONS; EXECUTABLE CODES; FORMAL SPECIFICATION; FORMALISATION; ISABELLE; ISABELLE/HOL; JAVA PROGRAM; JAVA SOURCE; MULTITHREADED; TRANSITIVE CLOSURE;

COMPUTER SOFTWARE; NETWORK COMPONENTS; PLANT SHUTDOWNS; PROBLEM SOLVING; PROGRAM INTERPRETERS; SEMANTICS; THEOREM PROVING; USER INTERFACES;

JAVA PROGRAMMING LANGUAGE;

EID: 80052146208     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22863-6_17     Document Type: Conference Paper

References (20)

1. Atkey, R.: CoqJVM: An Executable Specification of the Java Virtual Machine Using Dependent Types. In: Miculan, M., Scagnetto, I., Honsell, F. (eds.) TYPES 2007. LNCS, vol. 4941, pp. 18-32. Springer, Heidelberg (2008)
2. Ballarin, C.: Interpretation of locales in Isabelle: Theories and proof contexts. In: Borwein, J.M., Farmer, W.M. (eds.) MKM 2006. LNCS (LNAI), vol. 4108, pp. 31-43. Springer, Heidelberg (2006)
3. Barthe, G., Crégut, P., Grégoire, B., Jensen, T., Pichardie, D.: The MOBIUS proof carrying code infrastructure. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2007. LNCS, vol. 5382, pp. 1-24. Springer, Heidelberg (2008)
4. Bauer, G., Nipkow, T.: Flyspeck I: Tame graphs. In: Klein, G., Nipkow, T., Paulson, L. (eds.) The Archive of Formal Proofs (2006), http://afp. sourceforge.net/entries/Flyspeck-Tame.shtml, Formal proof development
5. Berghofer, S., Bulwahn, L., Haftmann, F.: Turning inductive into equational specifications. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 131-146. Springer, Heidelberg (2009)
6. Bulwahn, L., Krauss, A., Haftmann, F., Erkök, L., Matthews, J.: Imperative functional programming with Isabelle/HOL. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 134-149. Springer, Heidelberg (2008)
7. Farzan, A., Bevilacqua, V., Roşu, G.: Formal JVM code analysis in JavaFAN. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol. 3116, pp. 147-150. Springer, Heidelberg (2004)
8. Haftmann, F.: Data refinement (raffinement) in Isabelle/HOL This is a draft of an envisaged publication still to be elaborated which, applying the usual rules of academic confidentiality, can be inspected at, http://www4.in.tum.de/~haftmann/pdf/data-refinement-haftmann.pdf
9. Haftmann, F., Nipkow, T.: Code generation via higher-order rewrite systems. In: Blume, M., Kobayashi, N., Vidal, G. (eds.) FLOPS 2010. LNCS, vol. 6009, pp. 103-117. Springer, Heidelberg (2010)
10. Klein, G., Nipkow, T.: A machine-checked model for a Java-like language, virtual machine and compiler. ACM Trans. Progr. Lang. Sys. 28, 619-695 (2006)
11. Lammich, P., Lochbihler, A.: The Isabelle Collections Framework. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol. 6172, pp. 339-354. Springer, Heidelberg (2010)
12. Leroy, X.: A formally verified compiler back-end. J. Autom. Reasoning 43(4), 363-446 (2009)
13. Letouzey, P.: Extraction in Coq: An overview. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 359-369. Springer, Heidelberg (2008)
14. Liu, H., Moore, J.S.: Executable JVM model for analytical reasoning: A study. In: IVME 2003, pp. 15-23. ACM, New York (2003)
15. Lochbihler, A.: Type safe nondeterminism - a formal semantics of Java threads. In: Workshop on Foundations of Object-Oriented Languages, FOOL 2008 (2008)
16. Lochbihler, A.: Verifying a compiler for Java threads. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 427-447. Springer, Heidelberg (2010)
17. Lochbihler, A.: Jinja with threads. In: Klein, G., Nipkow, T., Paulson, L. (eds.) The Archive of Formal Proofs (2007), http://afp.sourceforge.net/ entries/JinjaThreads.shtml, Formal proof development
18. Lochbihler, A.: Formalising FinFuns - Generating code for functions as data from Isabelle/HOL. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 310-326. Springer, Heidelberg (2009)
19. Marić, F.: Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL. Theor. Comput. Sci. 411(50), 4333-4356 (2010)
20. Thiemann, R., Sternagel, C.: Certification of termination proofs using CeTA. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 452-468. Springer, Heidelberg (2009)