Semantic foundations for generalized rewrite theories

Theoretical Computer Science

Volumn 360, Issue 1-3, 2006, Pages 386-414

  Bruni, Roberto ^a   Meseguer, José ^b  

^a UNIVERSITY OF PISA   (Italy)

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

Author keywords

Conditional rewriting logic; Contextual rewrites; Membership equational logic; Semantics

Indexed keywords

CONCURRENCY CONTROL; LOGIC PROGRAMMING; MEMBERSHIP FUNCTIONS; SEMANTICS; SPECIFICATIONS;

CONCURRENT SYSTEMS; CONDITIONAL REWRITING LOGIC; CONTEXTUAL REWRITES; MEMBERSHIP EQUATIONAL LOGIC;

FORMAL LOGIC;

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

References (41)

1. P. Baldan, C. Bertolissi, H. Cirstea, C. Kirchner, A rewriting calculus for cyclic higher-order term graphs, in: M. Fernández (Ed.), Proc. of TERMGRAPH 2004, Second Internat. Workshop on Term Graph Rewriting, Electronic Notes in Theoretical Computer Science, Vol. 127.5, Elsevier Science, Amsterdam, 2005.
2. Barbanera F., Fernández M., and Geuvers H. Modularity of strong normalization in the algebraic-lambda-cube. J. Funct. Programming 7 6 (1997) 613-660
3. G. Barthe, H. Cirstea, C. Kirchner, L. Liquori, Pure pattern type systems, in: Proc. of POPL 2003, 30th SIGPLAN-SIGACT Symp. on Principles of Programming Languages, ACM SIGPLAN Notices, Vol. 38(1), Association for Computing Machinery, 2003, pp. 250-261.
4. Basin D., Clavel M., and Meseguer J. Reflective metalogical frameworks. ACM Trans. Comput. Log. 5 3 (2004) 528-576
5. Blanqui F., Jouannaud J.-P., and Okada M. Inductive-data-type systems. Theoret. Comput. Sci. 272 1-2 (2002) 41-68
6. Bouhoula A., Jouannaud J.-P., and Meseguer J. Specification and proof in membership equational logic. Theoret. Comput. Sci. 236 (2000) 35-132
7. C. Braga, J. Meseguer, Modular rewriting semantics in practice, in: N. Martí-Oliet (Ed.), Proc. of WRLA 2004, Fifth Internat. Workshop on Rewriting Logic and its Applications, Vol. 117, Electronic Notes in Theoretical Computer Science, Elsevier Science, Amsterdam, 2005, 393-416.
8. R. Bruni, J. Meseguer, Generalized rewrite theories, in: J.C.M. Baeten, J.K. Lenstra, J. Parrow, G.J. Woeginger (Eds.), Proc. of ICALP 2003, 30th Internat. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 2719, Springer, Berlin, 2003, pp. 252-266.
9. H. Cirstea, G. Faure, C. Kirchner, A rho-calculus of explicit constraint application, in: N. Martí-Oliet (Ed.), Proc. of WRLA 2004, Fifth Internat. Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, Vol. 117, Elsevier Science, Amsterdam, 2005.
10. H. Cirstea, C. Kirchner, L. Liquori, The rho cube, in: F. Honsell, M. Miculan (Eds.), Proc. of FOSSACS 2001, Fourth Internat. Conf. on Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science, Vol. 2030, Springer, Berlin, 2001, pp. 168-183.
11. Clavel M. Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications (2000), CSLI Publications
12. M. Clavel, The ITPTool 's home page, 2005, 〈http://maude.sip.ucm.es/itp/〉.
13. Clavel M., Durán F., Eker S., Lincoln P., Martí-Oliet N., Meseguer J., and Quesada J. Maude: specification and programming in rewriting logic. Theoret. Comput. Sci. 285 (2002) 187-243
14. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, C. Talcott, Maude 2.1 manual, 2005, 〈http://maude.cs.uiuc.edu〉.
15. M. Clavel, F. Durán, S. Eker, J. Meseguer, Building equational proving tools by reflection in rewriting logic, in: Proc. of the CafeOBJ Symposium '98, Numazu, Japan. CafeOBJ Project, 1998, 〈http://maude.cs.uiuc.edu〉.
16. E. Deplagne, Système de preuve modulo récurrence, Thèse de doctorat, Université Nancy 1, 2002.
17. E. Deplagne, C. Kirchner, Induction as deduction modulo. Rapport de recherche, 2004.
18. E. Deplagne, C. Kirchner, H. Kirchner, Q.-H. Nguyen, Proof search and proof check for equational and inductive theorems, in: F. Baader (Ed.), Proc. of CADE 2003, 19th Internat. Conf. on Automated Deduction, Lecture Notes in Computer Science, Vol. 2741, Springer, Berlin, 2003, pp. 297-316.
19. R. Diaconescu, K. Futatsugi, CafeOBJ Report: the language, proof techniques, and methodologies for object-oriented algebraic specification, AMAST Series in Computing, Vol. 6, World Scientific, Singapore, 1998.
20. Dowek G., Hardin T., and Kirchner C. Theorem proving modulo. J. Automat. Reasoning 31 1 (2003) 33-72
21. K. Futatsugi (Ed.), Proc. of WRLA 2000, Third Internat. Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier Science, Amsterdam, 2000.
22. F. Gadducci, U. Montanari, The tile model, in: G. Plotkin, C. Stirling, M. Tofte (Eds.), Proof, Language and Interaction: Essays in Honour of Robin Milner, MIT Press, Cambridge, MA, 2000, pp. 133-166. Also Technical Report TR-27/96, Dipartimento di Informatica, Università di Pisa, 1996.
23. F. Gadducci, U. Montanari (Eds.). Proc. of WRLA 2002, Fourth Internat. Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, Vol. 71, Elsevier Science, Amsterdam, 2002.
24. Jouannaud J.-P., and Okada M. Abstract data type systems. Theoret. Comput. Sci. 173 2 (1997) 349-391
25. C. Kirchner, H. Kirchner (Eds.), Proc. of WRLA'98, Second Internat. Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier Science, Amsterdam, 1998.
26. Knuth D.E., and Bendix P.B. Simple word problems in universal algebra. In: Leech J. (Ed). Computational Problems in Abstract Algebras (1970), Pergamon Press, Oxford 263-297
27. S. Lucas, Termination of rewriting with strategy annotations, in: Proc. of LPAR 2001, Eighth Internat. Conf. on Logic for Programming, Artificial Intelligence and Reasoning, Lecture Notes in Artificial Intelligence, Vol. 2250, Springer, Berlin, 2001, pp. 669-684.
28. N. Martí-Oliet (Ed.), Proc. of WRLA 2004, Fifth Internat. Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, Vol. 117, Elsevier Science, Amsterdam, 2005.
29. N. Martí-Oliet, J. Meseguer, Rewriting logic as a logical and semantic framework, in: D.M. Gabbay, F. Guenthner (Eds.), Handbook of Philosophical Logic, second ed., Vol. 9, Kluwer Academic Publishers, Dordrecht, 2002, pp. 1-87.
30. Martí-Oliet N., and Meseguer J. Rewriting logic: roadmap and bibliography. Theoret. Comput. Sci. 285 2 (2002) 121-154
31. N. Martí-Oliet, K. Sen, P. Thati, An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0, in: F. Gadducci, U. Montanari (Eds.), Proc. of WRLA 2002, Fourth Internat. Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, Vol. 71, 2002.
32. N. Martí-Oliet, A. Verdejo, Executable structural operational semantics in Maude, Technical Report 134-03, Dpto. Sistemas Informáticos y Programación, Universidad Complutense de Madrid, 2003.
33. J. Meseguer, Rewriting as a unified model of concurrency, Technical Report SRI-CSL-90-02R, SRI International, Computer Science Laboratory, 1990.
34. Meseguer J. Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci. 96 (1992) 73-155
35. J. Meseguer (Ed.), Proc. of WRLA'96, First Internat. Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier Science, Amsterdam, 1996.
36. J. Meseguer, Membership algebra as a logical framework for equational specification, in: F. Parisi-Presicce (Ed.), Proc. of WADT'97, 12th Workshop on Recent Trends in Algebraic Development Techniques, Lecture Notes in Computer Science, Vol. 1376, Springer, Berlin, 1998, pp. 18-61.
37. J. Meseguer, Functorial semantics of rewrite theories, in: H.-J. Kreowski, U. Montanari, F. Orejas, G. Rozenberg, G. Taentzer (Eds.), Formal Methods in Software and Systems Modeling: Essays Dedicated to Hartmut Ehrig, on the Occasion of His 60th Birthday, Lecture Notes in Computer Science, Vol. 3393, Springer, Berlin, 2005, pp. 220-235.
38. J. Meseguer, P.C. Ölveczky, M.-O. Stehr, Rewriting logic as a unifying framework for Petri nets, in: H. Ehrig, G. Juhás, J. Padberg, G. Rozenberg (Eds.), Advances in Petri Nets: Unifying Petri Nets, Lecture Notes in Computer Science, Vol. 2128, Springer, Berlin, 2001, pp. 250-303.
39. J. Meseguer, M.-O. Stehr, Pure type systems in rewriting logic, in: From Object-Orientation to Formal Methods: Dedicated to The Memory of Ole-Johan Dahl, Lecture Notes in Computer Science, Vol. 2128, Springer, Berlin, 2004, pp. 250-303.
40. Protheo Team, The ELAN home page, 2005, 〈http://elan.loria.fr〉.
41. M.-O. Stehr, Programming, specification, and interactive theorem proving-towards a unified language based on equational logic, rewriting logic, and type theory, Ph.D. Thesis, Universität Hamburg, Fachbereich Informatik, Germany, 2002, 〈http://www.sub.uni-hamburg.de/disse/810/〉.