Trace-based coinductive operational semantics for while

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

Volumn 5674 LNCS, Issue , 2009, Pages 375-390

  Nakata, Keiko ^a   Uustalu, Tarmo ^a  

^a TALLINN UNIVERSITY OF TECHNOLOGY   (Estonia)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONAL SEMANTICS; OPERATIONAL SEMANTICS; RELATIONAL SEMANTICS;

FORMAL LOGIC; PROBLEM SOLVING; THEOREM PROVING;

SEMANTICS;

EID: 70350325123     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03359-9_26     Document Type: Conference Paper

References (18)

1. Bertot, Y., Castéran, P.: Coq'Art: Interactive Theorem Proving and Program Development. Springer, Heidelberg (2004)
2. Bertot, Y.: Filters on coinductive streams, an application to Eratosthenes' sieve. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol. 3461, pp. 102-115. Springer, Heidelberg (2005)
3. Bertot, Y.: A survey of programming language semantics styles. Coq development (2007), http://www-sop.inria.fr/marelle/Yves.Bertot/proofs.html
4. Capretta, V.: General recursion via coinductive types. Logical Methods in Computer Science 1(2), 1-18 (2005)
5. Cousot, P., Cousot, R.: Inductive definitions, semantics and abstract interpretation. In: Conf. Record of 19th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 1992, Albuquerque, NM, pp. 83-94. ACM Press, New York (1992)
6. Cousot, P., Cousot, R.: Bi-inductive structural semantics. Inform. and Comput. 207(2), 258-283 (2009)
7. Giménez, E.: Codifying guarded definitions with recursive schemes. In: Smith, J., Dybjer, P., Nordström, B. (eds.) TYPES 1994. LNCS, vol. 996, pp. 39-59. Springer, Heidelberg (1995)
8. Giménez, E.: Structural recursive definitions in type theory. In: Larsen, K.G., Skyum, S.,Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 397-408. Springer, Heidelberg (1998)
9. Glesner, S.: A proof calculus for natural semantics based on greatest fixed point semantics. In: Knoop, J., Necula, G.C., Zimmermann, W. (eds.) Proc. of 3rd Int. Wksh. on Compiler Optimization Meets Compiler Verification, COCV 2004, Barcelona. Electron. Notes in Theor. Comput. Sci., vol. 132(1), pp. 73-93. Elsevier, Amsterdam (2005)
10. Glesner, S., Leitner, J., Blech, J.O.: Coinductive verification of program optimizations using similarity relations. In: Knoop, J., Necula, G.C., Zimmermann, W. (eds.) Proc. of 5th Int. Wksh. on Compiler Optimization Meets Compiler Verification, COCV 2006, Vienna. Electron. Notes in Theor. Comput. Sci., vol. 176(3), pp. 61-77. Elsevier, Amsterdam (2007)
11. Gonthier, G., Mahboubi, A.: A small scale reflection extension for the Coq system. Technical Report RR-6455, INRIA (2008)
12. Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Logical Methods in Comput. Sci. 3(4), article 11(2007)
13. Leroy, X.: The Compcert verified compiler. Commented Coq development (2008), http://compcert.inria.fr/doc/
14. Leroy, X., Grall, H.: Coinductive big-step operational semantics. Inform. and Comput. 207(2), 285-305 (2009)
15. McBride, C.: Elimination with a motive. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R. (eds.) TYPES 2000. LNCS, vol. 2277, pp. 197-216. Springer, Heidelberg (2002)
16. Nestra, H.: Fractional semantic. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol. 4019, pp. 278-292. Springer, Heidelberg (2006)
17. Nestra, H.: Transfinite semantics in the form of greatest fixpoint. J. of Logic and Algebr. Program (to appear)
18. Rutten, J.: A note on coinduction and weak bisimilarity forWhile programs. Theor. Inform. and Appl. 33(4-5), 393-400 (1999)