The rewriting logic semantics project

Theoretical Computer Science

Volumn 373, Issue 3, 2007, Pages 213-237

  Meseguer, José ^a   Roşu, Grigore ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Rewriting logic; Semantics and analysis of programming languages

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; FORMAL LOGIC; SEMANTICS;

COMPUTATIONAL OBSERVABILITY; FORMAL TOOLS; PROGRAM ANALYSIS; REWRITING LOGIC; SEMANTIC DEFINITIONS;

LOGIC PROGRAMMING;

EID: 33947139569     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.12.018     Document Type: Article

References (72)

1. Ahrendt W., Roth A., and Sasse R. Automatic validation of transformation rules for Java verification against a rewriting semantics. In: Sutcliffe G., and Voronkov A. (Eds). Proceedings of LPAR'05. LNCS vol. 3835 (2005), Springer 412-426
2. Basin D., and Denker G. Maude versus Haskell: An experimental comparison in security protocol analysis. In: Futatsugi K. (Ed). Proceedings of WRLA'00. ENTCS vol. 36 (2000), Elsevier
3. Beckert B. A dynamic logic for the formal verification of Java Card programs. In: Attali I., and Jensen T. (Eds). Java on Smart Cards: Programming and Security. Revised Papers, Java Card 2000, International Workshop. LNCS vol. 2041 (2001), Springer 6-24
4. Berry G., and Boudol G. The chemical abstract machine. Theoretical Computer Science 96 1 (1992) 217-248
5. Bouhoula A., Jouannaud J.-P., and Meseguer J. Specification and proof in membership equational logic. Theoretical Computer Science 236 (2000) 35-132
6. C. Braga, Rewriting logic as a semantic framework for modular structural operational semantics, Ph.D. Thesis, Departamento de Informática, Pontificia Universidade Católica de Rio de Janeiro, Brasil, 2001
7. Braga C., and Meseguer J. Modular rewriting semantics in practice. Proceedings of WRLA'04. ENTCS vol. 117 (2004), Elsevier
8. Broy M., Wirsing M., and Pepper P. On the algebraic definition of programming languages. ACM Transactions on Programming Languages and Systems 9 1 (1987) 54-99
9. Bruni R., and Meseguer J. Generalized rewrite theories. Proceedings of ICALP'03. LNCS vol. 2719 (2003) 252-266
10. Cervesato I., and Stehr M.-O. Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types. In: Degano P. (Ed). Proceedings of WRLA'04. ENTCS vol. 117 (2004), Elsevier
11. F. Chalub, An implementation of modular SOS in Maude, Master's Thesis, Universidade Federal Fluminense, May 2005,http://www.ic.uff.br/~frosario/dissertation.pdf
12. Chalub F., and Braga C. A modular rewriting semantics for CML. Journal of Universal Computer Science 10 7 (2004) 789-807. http://www.jucs.org/jucs_10_7/a_modular_rewriting_semantics
13. F. Chen, G. Roşu, Rewriting logic semantics of Java 1.4, http://fsl.cs.uiuc.edu/index.php/Rewriting_Logic_Semantics_of_Java
14. Chen F., and Roşu G. Certifying measurement unit safety policy. Proceedings of ASE'03 (2003), IEEE 304-309
15. Chen F., Roşu G., and Venkatesan R.P. Rule-based analysis of dimensional safety. Proceedings of RTA'03. LNCS vol. 2706 (2003), Springer 197-207
16. Clarke E.M., Grumberg O., and Peled D.A. Model Checking (2001), MIT Press
17. Clavel M., Durán F., Eker S., Lincoln P., Martí-Oliet N., Meseguer J., and Quesada J. Maude: Specification and programming in rewriting logic. Theoretical Computer Science 285 (2002) 187-243
18. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, C. Talcott, Maude 2.0 Manual, June 2003, http://maude.cs.uiuc.edu
19. Clavel M., Durán F., Eker S., and Meseguer J. Building equational proving tools by reflection in rewriting logic. CAFE: An Industrial-Strength Algebraic Formal Method (2000), Elsevier. http://maude.cs.uiuc.edu
20. M. Clavel, M. Palomino, The ITP tool's manual. Universidad Complutense, Madrid, April 2005, http://maude.sip.ucm.es/itp/
21. Clavel M., and Santa-Cruz J. ASIP+ITP: A verification tool based on algebraic semantics. Proceedings of PROLE'05 (2005). http://maude.sip.ucm.es/itp/asip/
22. Clément D., Despeyroux J., Hascoet L., and Kahn G. Natural semantics on the computer. In: Fuchi K., and Nivat M. (Eds). Proceedings, France-Japan AI and CS Symposium (1986), ICOT 49-89 Also, Information Processing Society of Japan, Technical Memorandum PL-86-6
23. d'Amorim M., and Roşu G. An equational specification for the scheme language. Journal of Universal Computer Science 11 7 (2005) 1327-1348
24. Eker S., Meseguer J., and Sridharanarayanan A. The Maude LTL model checker. In: Gadducci F., and Montanari U. (Eds). Proceedings of WRLA'02. ENTCS vol. 117 (2002), Elsevier
25. Farzan A., Chen F., Meseguer J., and Roşu G. Formal analysis of Java programs in JavaFAN. Proceedings of CAV'04. LNCS vol. 3114 (2004), Springer 501-505
26. A. Farzan, J. Meseguer, Making partial order reduction tools language-independent, in: G. Denker, C. Talcott (Eds.), Proc. 6th. Intl. Workshop on Rewriting Logic and its Applications, in: ENTCS, Elsevier, 2006 (in press)
27. Farzan A., Meseguer J., and Roşu G. Formal JVM code analysis in JavaFAN. Proceedings of AMAST'04. LNCS vol. 3116 (2004) 132-147
28. Felleisen M., and Freidman D.P. Control operators, the SECD machine, and the λ-calculus. Formal Description of Programming Concepts III, Proceedings of IFIP TC2 Working Conference (1987), North Holland 193-217
29. A. Garrido, Program refactoring in the presence of preprocessor directives, Ph.D. Thesis, University of Illinois at Urbana-Champaign, 2005
30. A. Garrido, J. Meseguer, R. Johnson, Algebraic semantics of the C preprocessor and correctness of its refactorings, Technical Report UIUCDCS-R-2006-2688, University of Illinois at Urbana-Champaign, February 2006
31. Goguen J.A., and Malcolm G. Algebraic Semantics of Imperative Programs (1996), MIT Press
32. Goguen J.A., and Parsaye-Ghomi K. Algebraic denotational semantics using parameterized abstract modules. In: Diaz J., and Ramos I. (Eds). Formalizing Programming Concepts. LNCS vol. 107 (1981), Springer 292-309
33. Goguen J.A., Thatcher J.W., Wagner E.G., and Wright J. Initial algebra semantics and continuous algebras. Journal of the Association for Computing Machinery 24 1 (1977) 68-95
34. Hartel P.H. LETOS-a lightweight execution tool for operational semantics. Software: Practice and Experience 29 (1999) 1379-1416
35. Hennessy M. The Semantics of Programming Languages: An Elementary Introduction Using Structural Operational Semantics (1990), John Wiley & Sons
36. M. Hills, T.F. Şerbǎnuţǎ, G. Roşu, A rewrite framework for language definitions and for generation of efficient interpreters, in: Proceedings of WRLA'06, in: ENTCS, Elsevier, 2006 (in press)
37. Johnsen E.B., Owe O., and Axelsen E.W. A runtime environment for concurrent objects with asynchronous method calls. In: Martí-Oliet N. (Ed). Proceedings of WRLA'04. ENTCS vol. 117 (2004), Elsevier
38. M. Katelman, J. Meseguer, A rewriting semantics for abel with applications to hardware/software co-design and analysis, in: G. Denker, C. Talcott (Eds.), Proceedings of WRLA'06, in: ENTCS, Elsevier, 2006 (in press)
39. Lowry M., Pressburger T., and Roşu G. Certifying domain-specific policies. Proceedings of ASE'01 (2001), IEEE 81-90
40. Meseguer J. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96 1 (1992) 73-155
41. Meseguer J. Membership algebra as a logical framework for equational specification. In: Parisi-Presicce F. (Ed). Proceedings of WADT'97. LNCS vol. 1376 (1998), Springer 18-61
42. Meseguer J. Software specification and verification in rewriting logic. In: Broy M., and Pizka M. (Eds). Models, Algebras, and Logic of Engineering Software. NATO Advanced Study Institute, Marktoberdorf, Germany, July 30-August 11, 2002 (2003), IOS Press 133-193
43. J. Meseguer, Lecture notes on program verification. CS 476, University of Illinois, Spring 2005, http://www.cs.uiuc.edu/class/fa05/cs476/
44. Meseguer J., and Braga C. Modular rewriting semantics of programming languages. Proceedings of AMAST'04. LNCS vol. 3116 (2004), Springer 364-378
45. Meseguer J., and Roşu G. Rewriting logic semantics: From language specifications to formal analysis tools. Proceedings of IJCAR'04. LNAI vol. 3097 (2004), Springer 1-44
46. J. Meseguer, G. Roşu, The rewriting logic semantics project, Technical Report UIUCDCS-R-2005-2639, University of Illinois at Urbana-Champaign, 2005. Ask authors for the complete Maude code
47. Milner R. Functions as processes. Mathematical Structures in Computer Science 2 2 (1992) 119-141
48. J. Moore, R. Krug, H. Liu, G. Porter, Formal models of Java at the JVM level-a survey from the ACL2 perspective, in: Proc. Workshop on Formal Techniques for Java Programs, in Association with ECOOP 2001, 2002
49. Mosses P.D. Unified algebras and action semantics. Proceedings of STACS'89. LNCS vol. 349 (1989), Springer 17-35
50. Mosses P.D. Denotational semantics. In: van Leeuwen J. (Ed). Handbook of Theoretical Computer Science, Vol. B (1990), North-Holland (Chapter 11)
51. Mosses P.D. Foundations of modular SOS. Proceedings of MFCS'99. LNCS vol. 1672 (1999), Springer 70-80
52. Mosses P.D. Pragmatics of modular SOS. Proceedings of AMAST'02. LNCS vol. 2422 (2002), Springer 21-40
53. Mosses P.D. Modular structural operational semantics. Journal of Logic and Algebraic Programming 60-61 (2004) 195-228
54. Pettersson M. Compiling Natural Semantics. LNCS vol. 1549 (1999), Springer
55. Plotkin G.D. A structural approach to operational semantics. Journal of Logic and Algebraic Programming 60-61 (2004) 17-139 Previously published as technical report DAIMI FN-19, Computer Science Department, Aarhus University, 1981
56. G. Roşu, Programming language design and semantics classes, Department of Computer Science, University of Illinois at Urbana-Champaign. http://fsl.cs.uiuc.edu/~grosu/classes/
57. G. Roşu, K: A Rewrite Logic Framework for Language Design, Semantics, Analysis and Implementation, Technical Report UIUCDCS-R-2005-2672, Department of Computer Science, University of Illinois at Urbana-Champaign, 2005
58. Roşu G., Venkatesan R.P., Whittle J., and Leuştean L. Certifying optimality of state estimation programs. Proceedings of CAV'03. LNCS vol. 2725 (2003), Springer 301-314
59. R. Sasse, Taclets vs. rewriting logic-relating semantics of Java, Master's Thesis, Fakultät für Informatik, Universität Karlsruhe, Technical Report in Computing Science No. 2005-16, Germany, May 2005, http://www.ubka.uni-karlsruhe.de/cgi-bin/psview?document=ira/2005/16
60. R. Sasse, J. Meseguer, Java+ITP: A verification tool based on Hoare logic and algebraic semantics, in: G. Denker, C. Talcott (Eds), Proceedings of WRLA'06, in: ENTCS, Elsevier, 2006 (in press)
61. Schmidt D.A. Denotational Semantics-A Methodology for Language Development (1986), Allyn and Bacon, Boston, MA
62. D. Scott, Outline of a mathematical theory of computation, in: Proceedings, Fourth Annual Princeton Conference on Information Sciences and Systems, Princeton University, 1970, pp. 169-176. Also appeared as Technical Monograph PRG 2, Oxford University, Programming Research Group
63. Scott D., and Strachey C. Toward a mathematical semantics for computer languages. Proc. Symp. on Comp. and Automata. Microwave Research Institute Symposia Series vol. 21 (1971), Polytechnical Institute of Brooklyn
64. Stehr M.-O., Cervesato I., and Reich S. An execution environment for the MSR cryptoprotocol specification language. http://formal.cs.uiuc.edu/stehr/msr.html
65. Stehr M.-O., and Talcott C. PLAN in Maude: Specifying an active network programming language. In: Gadducci F., and Montanari U. (Eds). Proceedings of WRLA'02. ENTCS vol. 117 (2002), Elsevier
66. M.-O. Stehr, C.L. Talcott, Practical techniques for language design and prototyping, in: J.L. Fiadeiro, U. Montanari, M. Wirsing (Eds.), Abstracts Collection of the Dagstuhl Seminar 05081 on Foundations of Global Computing, February 20-25, 2005, Schloss Dagstuhl, Wadern, Germany, 2005
67. Thati P., Sen K., and Martí-Oliet N. An executable specification of asynchronous Pi-calculus semantics and may testing in Maude 2.0. In: Gadducci F., and Montanari U. (Eds). Proceedings of WRLA'02. ENTCS vol. 117 (2002), Elsevier
68. A. Verdejo, Maude como marco semántico ejecutable, Ph.D. Thesis, Facultad de Informática, Universidad Complutense, Madrid, Spain, 2003
69. A. Verdejo, N. Martí-Oliet, Executable structural operational semantics in Maude, Manuscript, Dto. Sistemas Informáticos y Programación, Universidad Complutense, Madrid, August 2003
70. Verdejo A., and Martí-Oliet N. Implementing CCS in Maude 2. In: Gadducci F., and Montanari U. (Eds). Proceedings of WRLA'02. ENTCS vol. 117 (2002), Elsevier
71. Viry P. Equational rules for rewriting logic. Theoretical Computer Science 285 (2002) 487-517
72. Wand M. First-order identities as a defining language. Acta Informatica 14 (1980) 337-357