A generic complete dynamic logic for reasoning about purity and effects

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

Volumn 4961 LNCS, Issue , 2008, Pages 199-214

  Mossakowski, Till ^a,b   Schröder, Lutz ^a,b   Goncharov, Sergey ^b  

^a GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CATEGORICAL SEMANTICS; CONFERENCES (CHEMICAL INDUSTRY); DYNAMIC LOGICS; EUROPEAN; GENERIC FRAMEWORKS; HEIDELBERG (CO); HOARE LOGICS; INTERNATIONAL (CO); INTERNATIONAL CONFERENCES; LANGUAGES (TRADITIONAL); LOGICAL FORMULAS; POSTCONDITIONS;

C (PROGRAMMING LANGUAGE); COMPUTER SOFTWARE; CORUNDUM; DYNAMIC PROGRAMMING; ENCAPSULATION; INFORMATION THEORY; JAVA PROGRAMMING LANGUAGE; SOFTWARE ENGINEERING;

FUZZY LOGIC;

EID: 47249134300     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78743-3_15     Document Type: Conference Paper

References (29)

1. Beckert, B.: A dynamic logic for the formal verification of Java Card programs. In: Attali, I., Jensen, T. (eds.) JavaCard 2000. LNCS, vol. 2041, pp. 6-24. Springer, Heidelberg (2001)
2. Boehm, H.-J.: Side effects and aliasing can have simple axiomatic descriptions. ACM Trans. Program. Lang. Syst 7, 637-655 (1985)
3. Bonniot, D., Keller, B.: The Nice user's manual (2003), http://nice.sourceforge.net
4. Bright, W.: The D programming language. Dr. Dobb's Journal of Software Tools 27(2), 36-40 (2002)
5. Cok, D.R., Kiniry, J.R.: ESC/Java2: Uniting ESC/Java and JML. In: Barthe, G., Burdy, L., Huisman, M., Lanet, J.-L., Muntean, T. (eds.) CASSIS 2004. LNCS, vol. 3362, pp. 108-128. Springer, Heidelberg (2005)
6. Findler, R.B., Felleisen, M.: Contracts for higher-order functions. In: ICFP, pp. 48-59 (2002)
7. Goncharov, S., Schröder, L., Mossakowski, T.: Completeness of global evaluation logic. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 447-458. Springer, Heidelberg (2006)
8. Hoare,: An axiomatic basis for computer programming. CACM 12 (1969)
9. Huisman, M.: Java program verification in higher order logic with PVS and Isabelle. PhD thesis, University of Nijmegen (2001)
10. Jacobs, B., Poll, E.: Coalgebras and Monads in the Semantics of Java. Theoret. Comput. Sci. 291, 329-349 (2003)
11. Mac Lane, S.: Categories for the Working Mathematician. Springer, Heidelberg (1997)
12. Meyer, B.: Eiffel: The Language. Prentice-Hall, Englewood Cliffs (1992)
13. Moggi, E.: Notions of computation and monads. Inform. and Comput. 93, 55-92 (1991)
14. Moggi, E.: A semantics for evaluation logic. Fund. Inform. 22, 117-152 (1995)
15. Naumann, D.A.: Observational purity and encapsulation. Theoret. Comput. Sci 376, 205-224 (2007)
16. Nipkow, T.: Hoare logics in Isabelle/HOL. In: Schwichtenberg, H., Steinbrüggen, R. (eds.) Proof and System-Reliability, pp. 341-367. Kluwer Academic Publishers, Dordrecht (2002)
17. Omohundro, S.M.: The Sather language. Technical report, International Computer Science Institute, Berkeley (1991)
18. Peyton-Jones, S. (ed.): Haskell 98 Language and Libraries - The Revised Report, Cambridge (2003), also: J. Funct. Programming 13 (2003)
19. Pitts, A.: Evaluation logic. In: Higher Order Workshop, Workshops in Computing, pp. 162-189. Springer, Heidelberg (1991)
20. Pratt, V.: Semantical considerations on Floyd-Hoare logic. In: Foundations of Conputer Science, FOCS 1976, pp. 109-121. IEEE, Los Alamitos (1976)
21. Schröder, L., Mossakowski, T.: Monad-independent Hoare logic in HasCasl. In: Pezzè, M. (ed.) FASE 2003. LNCS, vol. 2621, pp. 261-277. Springer, Heidelberg (2003)
22. Schröder, L., Mossakowski, T.: Generic Exception Handling and the Java Monad. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol. 3116, pp. 443-459. Springer, Heidelberg (2004)
23. Schröder, L., Mossakowski, T.: Monad-independent dynamic logic in HasCasl. J. Logic Comput. 14, 571-619 (2004)
24. Sonntag, B., Colnet, D.: Lisaac: the power of simplicity at work for operating system. In: Technology of Object-Oriented Languages and Systems, TOOLS Pacific 2002. CRPIT, vol. 10, pp. 45-52. ACS (2002)
25. Stenzel, K.: A formally verified calculus for full Java Card. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol. 3116, pp. 491-505. Springer, Heidelberg (2004)
26. van den Berg, J., Jacobs, B.: The LOOP compiler for Java and JML. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 299-312. Springer, Heidelberg (2001)
27. von Oheimb, D.: Hoare logic for Java in Isabelle/HOL. Concurrency and Computation: Practice and Experience 13, 1173-1214 (2001)
28. Walter, D.: Monadic dynamic logic: Application and implementation. Master's thesis, University of Bremen (2005), http://www.cs.chalmers.se/ ∼denniswa
29. Walter, D., Schröder, L., Mossakowski, T.: Parametrized exceptions. In: Fiadeiro, J.L., Har-man, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 424-438. Springer, Heidelberg (2005)