Modular rewriting semantics of programming languages

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

Volumn 3116, Issue , 2004, Pages 364-378

  Meseguer, José ^a   Braga, Christiano ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LOGIC; SEMANTICS; SOFTWARE ENGINEERING; SPECIFICATIONS;

ALGEBRAIC SEMANTIC; GENERAL METHOD; LANGUAGE SPECIFICATION; OPERATIONAL SEMANTICS; REWRITE THEORY; REWRITING SEMANTICS;

ALGEBRA;

EID: 33646350087     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27815-3_29     Document Type: Article

References (34)

1. P. Borovanský, G. Kirchner, H. Kirchner, and P.-E. Moreau. ELAN from a rewriting logic point of view. Theoretical Computer Science, 285:155-185, 2002.
2. C. Braga. Rewriting Logic as a Semantic Framework for Modular Structural Operational Semantics. PhD thesis, Departamento de Informática, Pontificia Universidade Católica de Rio de Janeiro, Brasil, 2001.
3. G. Braga, E. H. Haeusler, J. Meseguer, and P. D. Mosses. Maude Action Tool: Using reflection to map action semantics to rewriting logic. In T. Rus, editor, Algebraic Methodology and Software Technology, 8th International Conference, AMAST 2000, Iowa City, Iowa, USA, May 20-27, 2000, Proceedings, volume 1816 of Springer LNCS, pages 407-421, 2000.
4. C. Braga, E. H. Haeusler, J. Meseguer, and P. D. Mosses. Mapping modular SOS to rewriting logic. In M. Leuschel, editor, 12th International Workshop, LOPSTR 2002, Madrid, Spain, volume2664 of Springer LNCS, pages 262-277, 2002.
5. C. Braga and J. Meseguer. Modular rewriting semantics in practice, in Proc. WRLA'04, ENTCS.
6. R. Bruni and J. Meseguer. Generalized rewrite theories. In J. Baeten, J. Lenstra, J. Parrow, and G. Woeginger, editors, Proceedings of ICALP 2003, 30th International Colloquium on Automata, Languages and Programming, volume 2719 of Springer LNCS, pages 252-266, 2003.
7. P. Chen, G. Roşu, and R. P. Venkatesan. Rule-based analysis of dimensional safety. In Rewriting Techniques and Applications (RTA'03), volume2706 of Springer LNCS, pages 197-207, 2003.
8. M. Clavel, P. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and C. Talcott. Maude 2.0 Manual. June 2003, http://maude.cs.uiuc. edu.
9. M. Clavel, P. Durán, S. Eker, and J. Meseguer. Building equational proving tools by reflection in rewriting logic. In CAFE: An Industrial-Strength Algebraic Formal Method. Elsevier, 2000. http://maude.cs.uiuc.edu.
10. A. Farzan, J. Meseguer, and G. Roşu. Formal JVM code analysis in JavaFAN. This volume.
11. K. Futatsugi and R. Diaconescu. CafeOBJ Report. World Scientific, AMAST Series, 1998.
12. J. A. Goguen and G. Malcolm. Algebraic Semantics of Imperative Programs. MIT Press, 1996.
13. J. A. Goguen and K. Parsaye-Ghomi. Algebraic denotational semantics using parameterized abstract modules. In J. Diaz and I. Ramos, editors, Formalizing Programming Concepts, pages 292-309. Springer-Verlag, 1981. LNCS, Volume 107.
14. N. Martí-Oliet and J. Meseguer. Rewriting logic as a logical and semantic framework. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, 2nd. Edition, pages 1-87. Kluwer Academic Publishers, 2002. First published as SRI Tech. Report SRI-CSL-93-05, August 1993.
15. N. Martí-Oliet and J. Meseguer. Rewriting logic: roadmap and bibliography. Theoretical Computer Science, 285:121-154, 2002.
16. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73-155, 1992.
17. J. Meseguer. Membership algebra as a logical framework for equational specification. In F. Parisi-Presicce, editor, Proc. WADT'97, pages 18-61. Springer LNCS 1376, 1998.
18. J. Meseguer. Software specification and verification in rewriting logic. In M. Broy and M. Pizka, editors, Models, Algebras, and Logic of Engineering Software, NATO Advanced Study Institute, Marktoberdorf, Germany, July 30 - August 11, 2002, pages 133-193. IOS Press, 2003.
19. J. Meseguer and C. Braga. Modular rewriting semantics of programming languages. January 2004, http://maude.cs.uiuc.edu.
20. J. Meseguer, K. Futatsugi, and T. Winkler. Using rewriting logic to specify, program, integrate, and reuse open concurrent systems of cooperating agents. In Proceedings of the 1992 International Symposium on New Models for Software Archi-lecture, Tokyo, Japan, November 1992, pages 61-106. Research Institute of Software Engineering, 1992.
21. P. D. Mosses. Definitive semantics. Version 0.2, May 31, 2003, http://www.mimuw. edu.pl/~mosses/DS-03.
22. P. D. Mosses. Modular structural operational semantics. Manuscript, September 2003, to appear in J. Logic and Algebraic Programming.
23. P. D. Mosses. Semantics, modularity, and rewriting logic. Proc. 2nd Intl. Workshop on Rewriting Logic and its Applications, ENTCS, Vol. 15, North Holland, 1998.
24. P. D. Mosses. Unified algebras and action semantics. In Proc. Symp. on Theoretical Aspects of Computer Science, STACS'89. Springer LNCS 349, 1989.
25. P. D. Mosses. Foundations of modular SOS. In Proceedings of MFCS'99, 24th International Symposium on Mathematical Foundations of Computer Science, pages 70-80. Springer LNCS 1672, 1999.
26. P. D. Mosses. Pragmatics of modular SOS. In Proceedings of AMAST '02, 9th Intl. Conf. on Algebraic Methodology and Software Technology, pages 21-40. Springer LNCS 2422, 2002.
27. G. D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Dept., Aarhus University, 1981.
28. G. Roşu, R. P. Venkatesan, J. Whittle, and L. Leustean. Certifying optimality of state estimation programs. In Computer Aided Verification (CAV'03), pages 301-314. Springer, 2003. LNCS 2725.
29. M.-O. Stehr and C. Talcott. Plan in Maude: Specifying an active network programming language. In F. Gadducci and U. Montanari, editors, Proc. 4th. Intl. Workshop on Rewriting Logic and its Applications. ENTCS, Elsevier, 2002.
30. P. Thati, K. Sen, and N. Martí-Oliet. An executable specification of asynchronous Pi-Calculus semantics and may testing in Maude 2.0. In F. Gadducci and U. Montanari, editors, Proc. 4th. Intl. Workshop on Rewriting Logic and its Applications. ENTCS, Elsevier, 2002.
31. A. Verdejo. Maude como marco semdntico executable. PhD thesis, Facultad de Informática, Universidad Complutense, Madrid, Spain, 2003.
32. A. Verdejo and N. Martf-Oliet. Executable structural operational semantics in Maude. Manuscript, Dto. Sistemas Informáticos y Programación, Universidad Complutense, Madrid, August 2003.
33. A. Verdejo and N. Martí-Oliet. Executing and verifying CCS in Maude. Technical Report 99-00, Dto. Sistemas Informáticos y Programación, Universidad Complutense, Madrid; also, http://maude.cs. uiuc.edu.
34. A. Verdejo and N. Martí-Oliet. Implementing CCS in Maude 2. In F. Gadducci and U. Montanari, editors, Proc. 4th. Intl. Workshop on Rewriting Logic and its Applications. ENTCS, Elsevier, 2002.