Skip to main content
SpringerLink
Log in

Rewriting logic as a semantic framework for concurrency: a progress report

  • Invited Talk
  • Conference paper
  • First Online:
Book cover CONCUR '96: Concurrency Theory (CONCUR 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1119))

Included in the following conference series:

Abstract

This paper surveys the work of many researchers on rewriting logic since it was first introduced in 1990. The main emphasis is on the use of rewriting logic as a semantic framework for concurrency. The goal in this regard is to express as faithfully as possible a very wide range of concurrency models, each on its own terms, avoiding any encodings or translations. Bringing very different models under a common semantic framework makes easier to understand what different models have in common and how they differ, to find deep connections between them, and to reason across their different formalisms. It becomes also much easier to achieve in a rigorous way the integration and interoperation of different models and languages whose combination offers attractive advantages. The logic and model theory of rewriting logic are also summarized, a number of current research directions are surveyed, and some concluding remarks about future directions are made.

Supported by Office of Naval Research Contracts N00014-95-C-0225 and N00014-96-C-0114, National Science Foundation Grant CCR-9224005, and by the Information Technology Promotion Agency, Japan, as a part of the Industrial Science and Technology Frontier Program “New Models for Software Architecture” sponsored by NEDO (New Energy and Industrial Technology Development Organization).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Peter Aczel. A general Church-Rosser theorem. Manuscript, University of Manchester, 1978.

    Google Scholar 

  2. G. Agha. Actors. MIT Press, 1986.

    Google Scholar 

  3. G. Agha and C. Hewitt. Concurrent programming using actors. In A. Yonezawa and M. Tokoro, editors, Object-Oriented Concurrent Programming, pages 37–53. MIT Press, 1988.

    Google Scholar 

  4. R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3–34, 1995.

    Google Scholar 

  5. R. Alur, C. Courcoubetis, T. A. Henzinger, and P.-H. Ho. Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems. In R.L. Grossman, A. Nerode, A.P. Ravn, and H. Rischel, editors, Workshop on Theory of Hybrid Systems, pages 209–229. Springer LNCS 739, 1993.

    Google Scholar 

  6. Rajeev Alur and David Dill. The theory of timed automata. In J.W. de Bakker, G. Huizing, W. P. de Roever, and G. Rozenberg, editors, Real-Time: Theory in Practice, volume 600 of Lecture Notes in Computer Science, 1991.

    Google Scholar 

  7. J.-P. Banâtre and D. Le Mètayer. The Gamma model and its discipline of programming. Science of Computer Programming, 15:55–77, 1990.

    Google Scholar 

  8. E. Battiston, V. Crespi, F. De Cindio, and G. Mauri. Semantic frameworks for a class of modular algebraic nets. In M. Nivat, C. Rattray, T. Russ, and G. Scollo, editors, Proc. of the 3rd International AMAST Conference, Workshops in Computing. Springer-Verlag, 1994.

    Google Scholar 

  9. M. Bauderon and B. Courcelle. Graph expressions and graph rewriting. Math. Systems Theory, 20:83–127, 1987.

    Google Scholar 

  10. Gérard Berry and Gérard Boudol. The chemical abstract machine. Theoretical Computer Science, 96(1):217–248, 1992.

    Google Scholar 

  11. E. Best and R. Devillers. Sequential and concurrent behavior in Petri net theory. Theoretical Computer Science, 55:87–136, 1989.

    Google Scholar 

  12. M. Bettaz and M. Maouche. How to specify nondeterminism and true concurrency with algebraic term nets. In M. Bidoit and C. Choppy, editors, Recent Trends in Data Type Specification, pages 164–180. Springer LNCS 655, 1993.

    Google Scholar 

  13. M. Bettaz and M. Maouche. Modeling of object based systems with hidden sorted ECATNets. In Proc. of MASCOTS'95, Durham, North Carolina, pages 307–311. IEEE, 1995.

    Google Scholar 

  14. P. Borovanský. Implementation of higher-order unification based on calculus of explicit substitutions. In M. Bartosek, J. Staudek, and J. Wiedermann, editors, Proc. SOFTSEM'95, pages 363–368. Springer LNCS 1012, 1995.

    Google Scholar 

  15. P. Borovanský, C. Kirchner, and H. Kirchner. Controlling rewriting by rewriting. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996.

    Google Scholar 

  16. P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, and M. Vittek. ELAN: A logical framework based on computational systems. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996.

    Google Scholar 

  17. G. Boudol. Computational semantics of term rewriting systems. In Maurice Nivat and John Reynolds, editors, Algebraic Methods in Semantics, pages 169–236. Cambridge University Press, 1985.

    Google Scholar 

  18. C. Castro. An approach to solving binary CSP using computational systems. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996.

    Google Scholar 

  19. K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.

    Google Scholar 

  20. A. Chien. Concurrent Aggregates. MIT Press, 1993.

    Google Scholar 

  21. A. Ciampolini, E. Lamma, P. Mello, and C. Stefanelli. Distributed logic objects: a fragment of rewriting logic and its implementation. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996.

    Google Scholar 

  22. Manuel G. Clavel, Steven Eker, Patrick Lincoln, and José Meseguer. Principles of Maude. To appear in Proc. 1st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996.

    Google Scholar 

  23. Manuel G. Clavel and José Meseguer. Axiomatizing reflective logics and languages. In Gregor Kiczales, editor, Proceedings of Reflection'96, San Francisco, California, April 1996, pages 263–288. Xerox PARC, 1996.

    Google Scholar 

  24. A. Corradini and F. Gadducci. CPO models for infinite term rewriting. In Proc. AMAST'95, pages 368–384. Springer LNCS 936, 1995.

    Google Scholar 

  25. A. Corradini, F. Gadducci, and U. Montanari. Relating two categorical models of term rewriting. In J. Hsiang, editor, Proc. Rewriting Techniques and Applications, Kaiserslautern, pages 225–240, 1995.

    Google Scholar 

  26. Andrea Corradini and Ugo Montanari. An algebra of graphs and graph rewriting. In D.H. Pitt et al., editor, Category Theory and Computer Science, pages 236–260. Springer LNCS 530, 1991.

    Google Scholar 

  27. B. Courcelle. Graph rewriting: an algebraic and logic approach. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, pages 193–242. North-Holland, 1990.

    Google Scholar 

  28. P. Degano, J. Meseguer, and U. Montanari. Axiomatizing net computations and processes. In Proc. LICS'89, pages 175–185. IEEE, 1989.

    Google Scholar 

  29. P. Degano, J. Meseguer, and U. Montanari. Axiomatizing the algebra of net computations and processes. To appear in Acta Informatica, 1996.

    Google Scholar 

  30. G. Denker and M. Gogolla. Translating TROLL light concepts to Maude. In H. Ehrig and F. Orejas, editors, Recent Trends in Data Type Specification, volume 785 of LNCS, pages 173–187. Springer-Verlag, 1994.

    Google Scholar 

  31. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, pages 243–320. North-Holland, 1990.

    Google Scholar 

  32. R. Diaconescu. Hidden sorted rewriting logic. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996.

    Google Scholar 

  33. H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors. Graph Grammars and their Application to Computer Science. Springer LNCS 532, 1991.

    Google Scholar 

  34. Steven Eker. Fast matching in combination of regular equational theories. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996.

    Google Scholar 

  35. J. Engelfriet, G. Leih, and G. Rozenberg. Parallel object-based systems and Petri nets, I and II. Technical Report 90-04,90-05, Dept. of Computer Science, University of Leiden, February 1990.

    Google Scholar 

  36. J. Engelfriet, G. Leih, and G. Rozenberg. Net-based description of parallel object-based systems, or POTs and POPs. In J. W. de Bakker, W. P. de Roever, and G. Rozenberg, editors, Foundations of Object-Oriented Languages, Noordwijkerhout, The Netherlands, May/June 1990, pages 229–273. Springer LNCS 489, 1991.

    Google Scholar 

  37. K. Futatsugi and T. Sawada. Cafe as an extensible specification environment. To appear in Proc. of the Kunming International CASE Symposium, Kunming, China, November, 1994.

    Google Scholar 

  38. F. Gadducci and U. Montanari. Enriched categories as models of computation. In Proc. 5th Italian Conference on Theoretical Computer Science, Ravello, 1995.

    Google Scholar 

  39. F. Giunchiglia, C.L. Pecchiari, and C. Talcott. Reasonig theories: towards an architecture for open mechanized reasoning systems. Technical Report 9409-15, IRST, University of Trento, November 1994.

    Google Scholar 

  40. Joseph Goguen and José Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science, 105:217–273, 1992. Originally given as lecture at Seminar on Types, Carnegie-Mellon University, June 1983; several draft and technical report versions were circulated since 1985.

    Google Scholar 

  41. T.A. Henzinger, Z. Manna, and A. Pnueli. Timed transition systems. In J.W. de Bakker, G. Huizing, W. P. de Roever, and G. Rozenberg, editors, Real-Time: Theory in Practice, volume 600 of Lecture Notes in Computer Science, 1991.

    Google Scholar 

  42. ISO. IS8807: Information Processing Systems — Open System Interconnection — LOTOS — A formal description technique based on the temporal ordering of observational behavior. ISO, February 1989.

    Google Scholar 

  43. R. Jagannathan. Dataflow models. In E.Y. Zoyama, editor, Parallel and Distributed Computing Handbook, pages 223–238. McGraw Hill, 1996.

    Google Scholar 

  44. R. Junglclaus, G. Saake, T. Hartmann, and C. Sernadas, editors. Object-oriented specification of information systems: the TROLL language. Technische Universität Braunschweig, Information-Berichte 91-04, 1991.

    Google Scholar 

  45. G.M. Kelly and R. Street. Review of the elements of 2-categories. In G.M. Kelly, editor, Category Seminar, Sydney 1972/73, pages 75–103. Springer Lecture Notes in Mathematics No. 420, 1974.

    Google Scholar 

  46. C. Kirchner, H. Kirchner, and M. Vittek. Designing constraint logic programming languages using computational systems. In V. Saraswat and P. van Hentryck, editors, Principles and Practice of Constraint Programming: The Newport Papers, pages 133–160. MIT Press, 1995.

    Google Scholar 

  47. C. Kirchner and P. Viry. Implementing parallel rewriting. In B. Fronhöfer and G. Wrightson, editors, Parallelization in Inference Systems, pages 123–138. Springer LNAI 590, 1992.

    Google Scholar 

  48. H. Kirchner and P.-E. Moreau. Computational reflection and extension in ELAN. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996.

    Google Scholar 

  49. H. Kirchner and P.-E. Moreau. Prototyping completion with constraints using computational systems. In J. Hsiang, editor, Proc. Rewriting Techniques and Applications, Kaiserslautern, 1995.

    Google Scholar 

  50. P. Kosiuczenko and M. Wirsing. Timed rewriting logic, 1995. Working material for the 1995 Marktoberdorf International Summer School “Logic of Computation”.

    Google Scholar 

  51. C. Landauer. Discrete event systems in rewriting logic. To appear in Proc. 1st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996.

    Google Scholar 

  52. C. Laneve and U. Montanari. Axiomatizing permutation equivalence in the λ-calculus. In H. Kirchner and G. Levi, editors, Proc. Third Int. Conf. on Algebraic and Logic Programming, Volterra, Italy, September 1992, volume 632 of LNCS, pages 350–363. Springer-Verlag, 1992.

    Google Scholar 

  53. C. Laneve and U. Montanari. Axiomatizing permutation equivalence. Mathematical Structures in Computer Science, 1994. To appear.

    Google Scholar 

  54. F. William Lawvere. Functorial semantics of algebraic theories. Proceedings, National Academy of Sciences, 50:869–873, 1963. Summary of Ph.D. Thesis, Columbia University.

    Google Scholar 

  55. U. Lechner. Object-oriented specification of distributed systems in the Μ-calculus and Maude. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996.

    Google Scholar 

  56. U. Lechner and C. Lengauer. Modal Μ-Maude. To appear in Object Orientation with Parallelism and Persistence, B. Freitag, C.B. Jones, C. Lengauer and H.-J. Schek, editors, Kluwer, 1996.

    Google Scholar 

  57. U. Lechner, C. Lengauer, F. Nickl, and M. Wirsing. How to overcome the inheritance anomaly. To appear in Proc.ECOOP'96, Springer LNCS, 1996.

    Google Scholar 

  58. U. Lechner, C. Lengauer, and M. Wirsing. An object-oriented airport. In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data Type Specification, Santa Margherita, Italy, May/June 1994, pages 351–367. Springer LNCS 906, 1995.

    Google Scholar 

  59. J. Levy. A higher order unification algorithm for bi-rewriting systems. In J. Agustí and P. García, editors, Segundo Congreso Programación Declarativa, pages 291–305, Blanes, Spain, September 1993. CSIC.

    Google Scholar 

  60. J. Levy and J. Agustí. Bi-rewriting, a term rewriting technique for monotonic order relations. In C. Kirchner, editor, Proc. Fifth Int. Conf. on Rewriting Techniques and Applications, Montreal, Canada, June 1993, volume 690 of LNCS, pages 17–31. Springer-Verlag, 1993.

    Google Scholar 

  61. J.-J. Lévy. Optimal reductions in the lambda calculus. In J. P. Seldin and J. R. Hindley, editors, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 159–191. Academic Press, 1980.

    Google Scholar 

  62. Patrick Lincoln, Narciso Martí-Oliet, and José Meseguer. Specification, transformation, and programming of concurrent systems in rewriting logic. In G.E. Blelloch, K.M. Chandy, and S. Jagannathan, editors, Specification of Parallel Algorithms, pages 309–339. DIMACS Series, Vol. 18, American Mathematical Society, 1994.

    Google Scholar 

  63. Patrick Lincoln, Narciso Martí-Oliet, José Meseguer, and Livio Ricciulli. Compiling rewriting onto SIMD and MIMD/SIMD machines. In Proceedings of PARLE'94, 6th International Conference on Parallel Architectures and Languages Europe, pages 37–48. Springer LNCS 817, 1994.

    Google Scholar 

  64. Patrick Lincoln, José Meseguer, and Livio Ricciulli. The Rewrite Rule Machine Node Architecture and its Performance. In Proceedings of CONPAR'94, Linz, Austria, September 1994, pages 509–520. Springer LNCS 854, 1994.

    Google Scholar 

  65. R.P. Lippmann. An introduction to computing with neural nets. IEEE ASSP Magazine, pages 4–22, April 1987.

    Google Scholar 

  66. The Chemical Abstract Machine. Gérard Berry and Gérard Boudol. In Proc. POPL'90, pages 81–94. ACM, 1990.

    Google Scholar 

  67. Saunders MacLane. Categories for the working mathematician. Springer-Verlag, 1971.

    Google Scholar 

  68. Narciso Martí-Oliet and José Meseguer. Rewriting logic as a logical and semantic framework. Technical Report SRI-CSL-93-05, SRI International, Computer Science Laboratory, August 1993. To appear in D. Gabbay, ed., Handbook of Philosophical Logic, Oxford University Press.

    Google Scholar 

  69. Narciso Martí-Oliet and José Meseguer. General logics and logical frameworks. In D. Gabbay, editor, What is a Logical System?, pages 355–392. Oxford University Press, 1994.

    Google Scholar 

  70. Narciso Martí-Oliet and José Meseguer. Action and change in rewriting logic. In R. Pareschi and B. Fronhoefer, editors, Theoretical Approaches to Dynamic Worlds in Artificial Intelligence and Computer Science. 1996. To be published by Kluwer Academic Publisher.

    Google Scholar 

  71. Satoshi Matsuoka and Akinori Yonezawa. Analysis of inheritance anomaly in object-oriented concurrent programming languages. In Gul Agha, Peter Wegner, and Akinori Yonezawa, editors, Research Directions in Concurrent Object-Oriented Programming, pages 107–150. MIT Press, 1993.

    Google Scholar 

  72. José Meseguer. A logical theory of concurrent objects. In ECOOP-OOPSLA '90 Conference on Object-Oriented Programming, Ottawa, Canada, October 1990, pages 101–115. ACM, 1990.

    Google Scholar 

  73. José Meseguer. Rewriting as a unified model of concurrency. In Proceedings of the Concur'90 Conference, Amsterdam, August 1990, pages 384–400. Springer LNCS 458, 1990.

    Google Scholar 

  74. José Meseguer. Rewriting as a unified model of concurrency. Technical Report SRI-CSL-90-02, SRI International, Computer Science Laboratory, February 1990. Revised June 1990.

    Google Scholar 

  75. José Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73–155, 1992.

    Google Scholar 

  76. José Meseguer. A logical theory of concurrent objects and its realization in the Maude language. In Gul Agha, Peter Wegner, and Akinori Yonezawa, editors, Research Directions in Concurrent Object-Oriented Programming, pages 314–390. MIT Press, 1993.

    Google Scholar 

  77. José Meseguer. Solving the inheritance anomaly in concurrent object-oriented programming. In Oscar M. Nierstrasz, editor, Proc. ECOOP'93, pages 220–246. Springer LNCS 707, 1993.

    Google Scholar 

  78. José Meseguer, Kokichi Futatsugi, and Timothy 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 Architecture, Tokyo, Japan, November 1992, pages 61–106. Research Institute of Software Engineering, 1992.

    Google Scholar 

  79. José Meseguer and Joseph Goguen. Order-sorted algebra solves the constructorselector, multiple representation and coercion problems. Information and Computation, 103(1):114–158, 1993.

    Google Scholar 

  80. José Meseguer and Ugo Montanari. Petri nets are monoids. Information and Computation, 88:105–155, 1990.

    Google Scholar 

  81. José Meseguer and Xiaolei Qian. A logical semantics for object-oriented databases. In Proc. International SIGMOD Conference on Management of Data, pages 89–98. ACM, 1993.

    Google Scholar 

  82. José Meseguer and Carolyn Talcott. Reasoning theories and rewriting logic. Manuscript, Stanford University, June 1996.

    Google Scholar 

  83. José Meseguer and Timothy Winkler. Parallel programming in Maude. In J.-P. Banâtre and D. Le Mètayer, editors, Research Directions in High-level Parallel Programming Languages, pages 253–293. Springer LNCS 574, 1992. Also Technical Report SRI-CSL-91-08, SRI International, Computer Science Laboratory, November 1991.

    Google Scholar 

  84. Robin Milner. Functions as processes. Mathematical Structures in Computer Science, 2(2):119–141, 1992.

    Google Scholar 

  85. U. Montanari and F. Rossi. Contextual nets. Acta Informatica, 32:545–596, 1995.

    Google Scholar 

  86. K. Ohmaki, K. Futatsugi, and K. Takahashi. A basic LOTOS simulator in OBJ. In Proceedings of the International Conference of Information Technology Commemorating the 30th Anniversary of the Information Processing Society of Japan (InfoJapan'90), pages 497–504. IPSJ, October 1990.

    Google Scholar 

  87. Peter Csaba ölveczky, Piotr Kosiuczenko, and Martin Wirsing. An objectoriented algebraic steam-boiler control specification. In Jean-Raymond Abrial, Egon Börger, and Hans Langmaack, editors, The Steam-Boiler Case Study Book. Springer-Verlag, 1996. To appear.

    Google Scholar 

  88. Peter Csaba ölveczky and José Meseguer. Specifying real-time systems in rewriting logic. Paper in preparation.

    Google Scholar 

  89. Isabel Pita and Narciso Martí-Oliet. A Maude specification of an object oriented database model for telecomunication networks. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996.

    Google Scholar 

  90. J.-C. Raoult and F. Voisin. Set-theoretic graph rewriting. In H.-J. Schneider and H. Ehrig, editors, Graph Transformations in Computer Science, pages 312–325. Springer LNCS 776, 1994.

    Google Scholar 

  91. H. Reichel. An approach to object semantics based on terminal co-algebras. To appear in Mathematical Structures in Computer Science, 1995. Presented at Dagstuhl Seminar on Specification and Semantics, Schloss Dagstuhl, Germany, May 1993.

    Google Scholar 

  92. G. Saake and A. Sernadas, editors. Information Systems—Correctness and Reusability. Technische Universität Braunschweig, Information-Berichte 91-03, 1991.

    Google Scholar 

  93. Vladimiro Sassone, José Meseguer, and Ugo Montanari. Inductive completion of monoidal categories and infinite net computations. Submitted for publication.

    Google Scholar 

  94. H.-J. Schneider and H. Ehrig, editors. Graph Transformations in Computer Science. Springer LNCS 776, 1994.

    Google Scholar 

  95. M. Schorlemmer. Bi-rewriting rewriting logic. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996.

    Google Scholar 

  96. Wolfgang Schreiner. Parallel functional programming: an annotated bibliography. Technical report, Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria, 1993.

    Google Scholar 

  97. M. R. Sleep, M. J. Plasmeijer, and M. C. J. D. vanEekelen, editors. Term Graph Rewriting. Wiley, 1993.

    Google Scholar 

  98. J.G. Stell. Modelling term rewriting systems by sesqui-categories. Technical Report TR94-02, Keele University, 1994. Also in shorter form in Proc. C.A.E.N., 1994, pp. 121–127.

    Google Scholar 

  99. C. L. Talcott. An actor rewrite theory. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996.

    Google Scholar 

  100. C. L. Talcott. Interaction semantics for components of distributed systems. In 1 st IFIP Workshop on Formal Methods for Open Object-based Distributed Systems, FMOODS'96, 1996.

    Google Scholar 

  101. P. Viry. Input/output for ELAN. To appear in Proc. 1st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996.

    Google Scholar 

  102. P. Viry. Rewriting: An effective model of concurrency. In C. Halatsis et al., editors, PARLE'94, Proc. Sixth Int. Conf. on Parallel Architectures and Languages Europe, Athens, Greece, July 1994, volume 817 of LNCS, pages 648–660. Springer-Verlag, 1994.

    Google Scholar 

  103. M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. PhD thesis, Université Henry Poincaré — Nancy I, 1994.

    Google Scholar 

  104. M. Walicki and S. Meldal. Algebraic approaches to nondeterminism—an overview. To appear in Computing Surveys.

    Google Scholar 

  105. M. Wirsing. A formal approach to object-oriented software enginering. To appear in Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996.

    Google Scholar 

  106. M. Wirsing, F. Nickl, and U. Lechner. Concurrent object-oriented design specification in SPECTRUM. Technical report, Institut für Informatik, Universität München, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SRI International, 94025, Menlo Park, CA

    José Meseguer

Authors
  1. José Meseguer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ugo Montanari Vladimiro Sassone

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meseguer, J. (1996). Rewriting logic as a semantic framework for concurrency: a progress report. In: Montanari, U., Sassone, V. (eds) CONCUR '96: Concurrency Theory. CONCUR 1996. Lecture Notes in Computer Science, vol 1119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61604-7_64

Download citation

  • DOI: https://doi.org/10.1007/3-540-61604-7_64

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61604-7

  • Online ISBN: 978-3-540-70625-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation