×

zbMATH — the first resource for mathematics

Rewriting logic: Roadmap and bibliography. (English) Zbl 1027.68613

MSC:
68Q42 Grammars and rewriting systems
Software:
CafeOBJ; ELAN; JPAX; Maude; Nuprl
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] A. Albarrán, F. Durán, A. Vallecillo, From Maude specifications to SOAP distributed implementations: a smooth transition, In: Proc. VI Jornadas de Ingenierı́a del Software y Bases de Datos, JISBD 2001, Almagro, Spain, November 21-23, 2001.
[2] A. Albarrán, F. Durán, A. Vallecillo, Maude meets CORBA, in: Proc. 2nd Argentine Symp. on Software Engineering, Buenos Aires, Argentina, September 10-11, 2001.
[3] A. Albarrán, F. Durán, A. Vallecillo, On the smooth implementation of component-based system specifications, in: Proc. 6th ECOOP Internat. Workshop on Component-Oriented Programming, WCOP’01, Budapest, Hungary, June, 2001.
[4] N. Aoumeur, G. Saake, On the specification and validation of cooperative information systems using an extended Maude, in: K. Futatsugi, J.A. Goguen, J. Meseguer (Eds.), OBJ/CafeOBJ/Maude Workshop at Formal Methods ’99: Formal Specification, Proof, and Applications, Theta, Bucharest, 1999, pp. 95-114.
[5] Astesiano, E.; Reggio, G., Algebraic specification of concurrency, (), 1-39
[6] E. Astesiano, G. Reggio, Labelled transition logic: an outline, Technical Report DISI-TR-96-20, Dipartimento di Informatica e Scienze dell’Informazione, Università di Genoa, Italy, 1996. · Zbl 1025.68056
[7] E. Astesiano, G. Reggio, On the relationship between labelled transition logic and rewriting logic, Technical Report DISI-TR-97-23, Dipartimento di Informatica e Scienze dell’Informazione, Università di Genoa, Italy, 1997. · Zbl 1025.68056
[8] Astesiano, E.; Broy, M.; Reggio, G., Algebraic specification of concurrent systems, (), 467-520 · Zbl 0973.68150
[9] J. Van Baalen, J.L. Caldwell, S. Mishra, Specifying and checking fault-tolerant agent-based protocols using Maude, in: First Goddard Workshop on Formal Approaches to Agent-Based Systems, Greenbelt, MD, USA, April 5-7, 2000, Proceedings, Lecture Notes in Computer Science, Springer, Berlin, to appear. · Zbl 0988.68743
[10] D. Basin, G. Denker, Maude versus Haskell: an experimental comparison in security protocol analysis, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 235-256. . · Zbl 0962.68056
[11] D. Basin, M. Clavel, J. Meseguer, Reflective metalogical frameworks, in: Proc. of LFM’99: Workshop on Logical Frameworks and Meta-languages, Paris, France, September 28, 1999, . · Zbl 1407.03045
[12] Basin, D.; Clavel, M.; Meseguer, J., Rewriting logic as a metalogical framework, (), 55-80 · Zbl 1044.03020
[13] D. Basin, M. Clavel, J. Meseguer, Rewriting logic as a metalogical framework, Manuscript, Computer Science Laboratory, SRI International, 2000, submitted for publication. · Zbl 1044.03020
[14] E. Beffara, O. Bournez, H. Kacem, C. Kirchner, Verification of timed automata using rewrite rules and strategies, in: N. Dershowitz, A. Frank (Eds.), Proc. BISFAI 2001, 7th Biennial Bar-Ilan International Symposium on the Foundations of Artificial Intelligence, Ramat-Gan, Israel, June 25-27, 2001.
[15] Borovanský, P., Implementation of higher-order unification based on calculus of explicit substitutions, (), 363-368
[16] P. Borovanský, Controlling rewriting: study and implementation of a strategy formalism, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 63-74. .
[17] P. Borovanský, Le Contrôle de la Réécriture: Étude et Implantation d’un Formalisme de Stratégies, Ph.D. Thesis, Université Henri Poincaré — Nancy I, October, 1998.
[18] P. Borovanský, C. Castro, Cooperation of constraint solvers: using the new process control facilities of ELAN, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 379-398, .
[19] P. Borovanský, H. Kirchner, Strategies of ELAN: meta-interpretation and partial evaluation, in: M.P.A. Sellink (Ed.), 2nd Internat. Workshop on the Theory and Practice of Algebraic Specifications, Amsterdam, The Netherlands, September 25-26, 1997, Electronic Workshops in Computing. Springer, Berlin, 1998, .
[20] P. Borovanský, H. Cirstea, H. Dubois, C. Kirchner, H. Kirchner, P.-E. Moreau, C. Ringeissen, M. Vittek, ELAN v 3.3 user manual, 3rd ed., Technical report, INRIA Lorraine & LORIA, Nancy, France, December, 1998.
[21] P. Borovanský, S. Jamoussi, P.-E. Moreau, C. Ringeissen, Handling ELAN rewrite programs via an exchange format, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 207-224, .
[22] P. Borovanský, C. Kirchner, H. Kirchner, Controlling rewriting by rewriting, in: J. Meseguer, (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3-6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 168-188, . · Zbl 0912.68088
[23] P. Borovanský, C. Kirchner, H. Kirchner, Strategies and rewriting in ELAN, in: B. Gramlich, H. Kirchner, (Eds.), Proc. of the CADE-14 Workshop on Strategies in Automated Deduction, Townsville, Australia, July, 1997, pp. 13-24.
[24] Borovanský, P.; Kirchner, C.; Kirchner, H., A functional view of rewriting and strategies for a semantics of ELAN, (), 143-167
[25] P. Borovanský, C. Kirchner, H. Kirchner, Rewriting as a unified specification tool for logic and control: the ELAN language, in: M.P.A. Sellink (Ed.), 2nd Internat. Workshop on the Theory and Practice of Algebraic Specifications, Amsterdam, The Netherlands, September 25-26, 1997, Electronic Workshops in Computing, Springer, Berlin, 1998, .
[26] P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, ELAN from the rewriting logic point of view, Theoret. Comput. Sci., 2002, submitted for publication. · Zbl 1001.68057
[27] P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, C. Ringeissen, An overview of ELAN, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 329-344, .
[28] P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, M. Vittek, ELAN: a logical framework based on computational systems, in: J. Meseguer, (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3-6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 35-50, . · Zbl 0912.68091
[29] Borovanský, P.; Kirchner, C.; Kirchner, H.; Ringeissen, C., Rewriting with strategies in ELAN: a functional semantics, Internat. J. foundations comput. sci., 12, 69-95, (2001) · Zbl 1319.68125
[30] Bouhoula, A.; Jouannaud, J.-P.; Meseguer, J., Specification and proof in membership equational logic, (), 67-92 · Zbl 0938.68057
[31] Bouhoula, A.; Jouannaud, J.-P.; Meseguer, J., Specification and proof in membership equational logic, Theoret. comput. sci., 236, 35-132, (2000) · Zbl 0938.68057
[32] Braga, C.; Haeusler, H.; Meseguer, J.; Mosses, P., Maude action tool: using reflection to map action semantics to rewriting logic, (), 407-421 · Zbl 0983.68519
[33] R. Bruni, A logic for modular descriptions of asynchronous and synchronized concurrent systems, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 225-236, . · Zbl 0917.68099
[34] R. Bruni, Tile logic for synchronized rewriting of concurrent systems, Ph.D. Thesis, Dipartimento di Informatica, Università di Pisa, 1999, Technical Report TD-1/99, .
[35] R. Bruni, U. Montanari, Cartesian closed double categories, their lambda-notation, and the pi-calculus, in: Proc., 14th Annual IEEE Symp. on Logic in Computer Science, Trento, July 2-5, 1999. IEEE Computer Society, Silverspring, MD, pp. 246-265.
[36] Bruni, R.; de Frutos-Escrig, D.; Martı́-Oliet, N.; Montanari, U., Bisimilarity congruences for open terms and term graphs via tile logic, (), 259-274 · Zbl 0999.68142
[37] R. Bruni, D. de Frutos-Escrig, N. Martı́-Oliet, U. Montanari, Tile bisimilarity congruences for open terms and term graphs, Technical Report TR-00-06, Dipartimento di Informatica, Università di Pisa, 2000, . · Zbl 0999.68142
[38] Bruni, R.; Meseguer, J.; Montanari, U., Implementing tile systemssome examples from process calculi, (), 168-179
[39] R. Bruni, J. Meseguer, U. Montanari, Internal strategies in a rewriting implementation of tile systems, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 95-116, . · Zbl 0917.68104
[40] R. Bruni, J. Meseguer, U. Montanari, Process and term tile logic. Technical Report SRI-CSL-98-06, Computer Science Laboratory, SRI International, July, 1998. Also TR-98-09, Dipartimento di Informatica, Università di Pisa, . · Zbl 0917.68104
[41] Bruni, R.; Meseguer, J.; Montanari, U., Executable tile specifications for process calculi, (), 60-76
[42] R. Bruni, J. Meseguer, U. Montanari, Symmetric monoidal and cartesian double categories as a semantic framework for tile logic, Math. Struct. Comput. Sci. (2002), to appear. · Zbl 0993.68058
[43] R. Bruni, U. Montanari, F. Rossi, An interactive semantics of logic programming, Manuscript, Dipartimento di Informatica, Università di Pisa, 2000, submitted for publication. · Zbl 1066.68512
[44] Bruni, R.; Montanari, U.; Sassone, V., Open ended systems, dynamic bisimulation and tile logic, (), 440-456 · Zbl 0998.68087
[45] G. Carabetta, P. Degano, F. Gadducci, CCS semantics via proved transition systems and rewriting logic, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 253-272, . · Zbl 0917.68126
[46] C. Castro, An approach to solving binary CSP using computational systems, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3-6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 245-264, .
[47] C. Castro, Binary CSP solving as an inference process, in: Proc. of the 8th Internat. Conf. on Tools in Artificial Intelligence, ICTAI’96, Toulouse, France, November, 1996, pp. 462-463.
[48] C. Castro, Constraint manipulation using rewrite rules and strategies, in: Proc. of the Second ESSLLI Student Session, 9th Europ. Summer School in Logic, Language and Information, ESSLLI’97, Aix-en-Provence, France, August, 1997, pp. 45-56.
[49] Castro, C., Building constraint satisfaction problem solvers using rewrite rules and strategies, Fund. informat., 34, 3, 263-293, (1998) · Zbl 0943.68095
[50] C. Castro, Une approche déductive de la résolution de problèmes de satisfaction de contraintes, Ph.D. Thesis, Université Henri Poincaré — Nancy I, 1998.
[51] M.V. Cengarle, The rewriting logic institution, Technical Report 9801, Institut für Informatik, Ludwig-Maximilians-Universität München, May, 1998.
[52] A. Ciampolini, E. Lamma, P. Mello, C. Stefanelli, Distributed logic objects: a fragment of rewriting logic and its implementation, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3-6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 109-124, . · Zbl 0912.68090
[53] H. Cirstea, Specifying authentication protocols in ELAN, in: Workshop on Modelling and Verification, Besançon, France, December, 1999.
[54] H. Cirstea, Calcul de réécriture: fondements et applications, Ph.D. Thesis, Université Henri Poincaré — Nancy I, October, 2000.
[55] H. Cirstea, C. Kirchner, Theorem proving using computational systems: the case of the B predicate prover, Presented at CCL’97 Workshop, Schloss Dagstuhl, Germany, September, 1997.
[56] H. Cirstea, C. Kirchner, Using rewriting and strategies for describing the B predicate prover, in: B. Gramlich, F. Pfenning (Eds.), Proc. of the CADE-15 Workshop on Strategies in Automated Deduction, Lindau, Germany, July, 1998.
[57] Cirstea, H.; Kirchner, C., Combining higher-order and first-order computations using ρ-calculus: towards a semantics of ELAN, (), 95-121 · Zbl 1004.68080
[58] H. Cirstea, C. Kirchner, The simply typed rewriting calculus, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 23-41, . · Zbl 0962.68084
[59] Cirstea, H.; Kirchner, C., The rewriting calculus — part I, Logic J. interest group pure appl. logics, 9, 3, 363-399, (2001)
[60] Cirstea, H.; Kirchner, C., The rewriting calculus — part II, Logic J. interest group pure appl. logics, 9, 3, 401-434, (2001)
[61] Cirstea, H.; Kirchner, C.; Liquori, L., Matching power, (), 77-92 · Zbl 0981.68065
[62] Cirstea, H.; Kirchner, C.; Liquori, L., The rho cube, (), 168-183 · Zbl 0978.68072
[63] M. Clavel, Reflection in general logics and in rewriting logic, with applications to the Maude language, Ph.D. Thesis, Universidad de Navarra, Spain, February, 1998.
[64] M. Clavel, Reflection in general logics, rewriting logic, and Maude, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 317-328, .
[65] Clavel, M., Reflection in rewriting logic: metalogical foundations and metaprogramming applications, (2000), CSLI Publications Stanford, CA · Zbl 1003.03032
[66] M. Clavel, J. Meseguer, Axiomatizing reflective logics and languages, in: G. Kiczales (Ed.), Proc. of Reflection’96, San Francisco, CA, April, 1996, pp. 263-288.
[67] M. Clavel, J. Meseguer, Reflection and strategies in rewriting logic, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3-6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 125-147, . · Zbl 0917.68107
[68] M. Clavel, J. Meseguer, Internal strategies in a reflective logic, in: B. Gramlich, H. Kirchner (Eds.), Proc. of the CADE-14 Workshop on Strategies in Automated Deduction, Townsville, Australia, July 1997, pp. 1-12.
[69] M. Clavel, J. Meseguer, Reflection in rewriting logic and its applications in the Maude language, in: Proc. IMSA’97, Information-Technology Promotion Agency, Japan, 1997, pp. 128-139.
[70] M. Clavel, J. Meseguer, Reflection in conditional rewriting logic, Theoret. Comput. Sci. (2002), submitted for publication. · Zbl 1001.68060
[71] M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martı́-Oliet, J. Meseguer, Metalevel computation in Maude, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 3-24, . · Zbl 0917.68024
[72] M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martı́-Oliet, J. Meseguer, J.F. Quesada, Language prototyping in the Maude metalanguage, Manuscript, Computer Science Laboratory, SRI International, November, 1998.
[73] M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martı́-Oliet, J. Meseguer, J.F. Quesada, Maude as a metalanguage, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 237-250, . · Zbl 0917.68106
[74] M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martı́-Oliet, J. Meseguer, J.F. Quesada, Maude: specification and programming in rewriting logic, Manual distributed as documentation of the Maude system, Computer Science Laboratory, SRI International, January, 1999, .
[75] Clavel, M.; Durán, F.; Eker, S.; Lincoln, P.; Martı́-Oliet, N.; Meseguer, J.; Quesada, J.F., The maude system, (), 240-243 · Zbl 0962.68108
[76] M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martı́-Oliet, J. Meseguer, J.F. Quesada, A Maude tutorial, Tutorial distributed as documentation of the Maude system, Computer Science Laboratory, SRI International. Presented at the Europ. Joint Conf. on Theory and Practice of Software, ETAPS 2000, Berlin, Germany, March 25, 2000, . · Zbl 0962.68108
[77] M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martı́-Oliet, J. Meseguer, J.F. Quesada, Towards Maude 2.0, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 297-318, .
[78] Clavel, M.; Durán, F.; Eker, S.; Lincoln, P.; Martı́-Oliet, N.; Meseguer, J.; Quesada, J.F., Using maude, (), 371-374 · Zbl 0962.68108
[79] M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martı́-Oliet, J. Meseguer, J.F. Quesada, Maude: specification and programming in rewriting logic, Theoret. Comput. Sci. 2002, submitted for publication. · Zbl 1001.68059
[80] M. Clavel, F. Durán, S. Eker, J. Meseguer, Building equational proving tools by reflection in rewriting logic, in: K. Futatsugi (Ed.), Proc. of the CafeOBJ Symposium ’98, Numazu, Japan, CafeOBJ Project, April, 1998, .
[81] M. Clavel, F. Durán, S. Eker, J. Meseguer, Design and implementation of the Cafe prover and the Church-Rosser checker tools, Technical report, Computer Science Laboratory, SRI International, March, 1998, .
[82] M. Clavel, F. Durán, S. Eker, J. Meseguer, Building equational proving tools by reflection in rewriting logic, in: K. Futatsugi, A.T. Nakagawa, T. Tamai (Eds.), Cafe: an Industrial-Strength Algebraic Formal Method, Elsevier, Amsterdam, 2000, pp. 1-31, .
[83] Clavel, M.; Durán, F; Eker, S.; Meseguer, J.; Stehr, M.-O., Maude as a formal meta-tool, (), 1684-1703
[84] M. Clavel, F. Durán, N. Martı́-Oliet, Polytypic programming in Maude, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 339-360, . · Zbl 0962.68030
[85] M. Clavel, S. Eker, P. Lincoln, J. Meseguer, Principles of Maude, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3-6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 65-89, .
[86] Corradini, A.; Gadducci, F., CPO models for infinite term rewriting, (), 368-384
[87] Corradini, A.; Gadducci, F.; Montanari, U., Relating two categorical models of term rewriting, (), 225-240
[88] Corradini, A.; Heckel, R.; Montanari, U., Tile transition systems as structured coalgebras, (), 13-38 · Zbl 0944.18006
[89] P. Degano, F. Gadducci, C. Priami, A causal semantics for CCS via rewriting logic, Manuscript, Dipartimento di Informatica, Università di Pisa, 2000, submitted for publication. · Zbl 1026.68075
[90] G. Denker, From rewrite theories to temporal logic theories, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 273-294, . · Zbl 0917.68103
[91] Denker, G.; Gogolla, M., Translating TROLL light concepts to maude, (), 173-187
[92] G. Denker, J. Millen, CAPSL and CIL language design: a common authentication protocol specification language and its intermediate language, Technical Report SRI-CSL-99-02, Computer Science Laboratory, SRI International, 1999, .
[93] G. Denker, J. Millen, CAPSL intermediate language, in: N. Heintze, E. Clarke (Eds.), Proc. of Workshop on Formal Methods and Security Protocols, FMSP’99, July 1999, Trento, Italy, 1999, .
[94] G. Denker, J. Millen, CAPSL integrated protocol environment, in: D. Maughan, G. Koob, S. Saydjari (Eds.), Proc. DARPA Information Survivability Conference and Exposition, DISCEX 2000, Hilton Head Island, SC, January 25-27, 2000, IEEE Computer Society Press, 2000, Silverspring, MD, pp. 207-222, .
[95] G. Denker, J. Millen, The CAPSL integrated protocol environment, Technical Report SRI-CSL-2000-02, Computer Science Laboratory, SRI International, 2000, .
[96] G. Denker, J.J. Garcı́a-Luna-Aceves, J. Meseguer, P.C. Ölveczky, J. Raju, B. Smith, C.L. Talcott, Specification and analysis of a reliable broadcasting protocol in Maude, in: B. Hajek, R.S. Sreenivas (Eds.), Proc. 37th Allerton Conference on Communication, Control and Computation, University of Illinois, 1999, pp. 738-747, .
[97] G. Denker, J.J. Garcı́a-Luna-Aceves, J. Meseguer, P.C. Ölveczky, J. Raju, B. Smith, C.L. Talcott, Specifying a reliable broadcasting protocol in Maude, Technical report, Computer Science Laboratory, SRI International, 1999, .
[98] G. Denker, J. Meseguer, C.L. Talcott, Protocol specification and analysis in Maude, in: N. Heintze, J. Wing (Eds.), Proc. of Workshop on Formal Methods and Security Protocols, June 25, 1998, Indianapolis, Indiana, 1998, .
[99] G. Denker, J. Meseguer, C.L. Talcott, Formal specification and analysis of active networks and communication protocols: the Maude experience, in: D. Maughan, G. Koob, S. Saydjari (Eds.), Proc. DARPA Information Survivability Conference and Exposition, DISCEX 2000, Hilton Head Island, SC, January 25-27, 2000, IEEE Computer Society Press, Silverspring, MD, 2000, pp. 251-265, .
[100] G. Denker, J. Meseguer, C.L. Talcott, Rewriting semantics of meta-objects and composable distributed services, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 407-427, . · Zbl 0962.68081
[101] E. Deplagne, Sequent calculus viewed modulo, in: C. Pilière (Ed.), Proc. of the 5th ESSLLI Student Session, University of Birmingham, August, 2000, pp. 66-76, .
[102] R. Diaconescu, Behavioural rewriting logic: semantic foundations and proof theory, Manuscript, October, 1996, submitted for publication, . · Zbl 0912.68092
[103] R. Diaconescu, Foundations of behavioural specification in rewriting logic, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3-6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 225-244, . · Zbl 0912.68092
[104] Diaconescu, R.; Futatsugi, K., Cafeobj report, the language, proof techniques, and methodologies for object-oriented algebraic specification, AMAST series in computing, Vol. 6, (1998), World Scientific Singapore
[105] R. Diaconescu, K. Futatsugi, Logical foundations of CafeOBJ, Theoret. Comput. Sci. (2002), submitted for publication. · Zbl 1001.68079
[106] Diaconescu, R.; Futatsugi, K.; Iida, S., Component-based algebraic specification and verification in cafeobj, (), 1644-1663
[107] Diaconescu, R.; Futatsugi, K.; Iida, S., Cafeobj jewels, (), 33-60
[108] R. Diaconescu, K. Futatsugi, M. Ishisone, T. Sawada, A.T. Nakagawa, An overview of CafeOBJ, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 75-88, .
[109] G. Dowek, T. Hardin, C. Kirchner, Theorem proving modulo, Technical Report RR-3400, INRIA, Institut National de Recherche en Informatique et en Automatique, April 1998, . · Zbl 1049.03011
[110] Dowek, G.; Hardin, T.; Kirchner, C., Higher order unification via explicit substitutions, Inform. comput., 157, 1/2, 183-235, (2000) · Zbl 1005.03016
[111] Dowek, G.; Hardin, T.; Kirchner, C., HOL-λσ: an intentional first-order expression of higher-order logic, Math. struct. comput. sci., 11, 1, 21-45, (2001) · Zbl 0972.03012
[112] H. Dubois, H. Kirchner, Actions and plans in ELAN, in: B. Gramlich, F. Pfenning (Eds.), Proc. of the CADE-15 Workshop on Strategies in Automated Deduction, Lindau, Germany, July 1998, pp. 35-45, also Technical Report LORIA 98-R-275.
[113] H. Dubois, H. Kirchner, Modelling planning problems with rules and strategies, Technical Report 99-R-029, LORIA, Nancy, France, March, 1999, Poster Session at JFPLC’99, Lyon, France, June, 1999.
[114] H. Dubois, H. Kirchner, Objects, rules, and strategies in ELAN, in: Proc. of the 2nd AMAST Workshop on Algebraic Methods in Language Processing, Iowa City, Iowa, USA, 1999.
[115] Dubois, H.; Kirchner, H., Rule based programming with constraints and strategies, (), 274-297
[116] F. Durán, A reflective module algebra with applications to the Maude language, Ph.D. Thesis, Universidad de Málaga, Spain, June, 1999, .
[117] F. Durán, Coherence checker and completion tools for Maude specifications, Manuscript, Computer Science Laboratory, SRI International, 2000, .
[118] Durán, F., The extensibility of Maude’s module algebra, (), 422-437 · Zbl 0983.68522
[119] F. Durán, Termination checker and Knuth-Bendix completion tools for Maude equational specifications, Manuscript, Computer Science Laboratory, SRI International, 2000, .
[120] F. Durán, J. Meseguer, An extensible module algebra for Maude, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 185-206, .
[121] F. Durán, J. Meseguer, The Maude specification of Full Maude, Manuscript, Computer Science Laboratory, SRI International, February, 1999, .
[122] F. Durán, J. Meseguer, Structured theories and institutions. in: M. Hofmann, G. Rosolini, D. Pavlović (Eds.), Proc. of 8th Conference on Category Theory and Computer Science, Edinburgh, Scotland, September 1999, Electronic Notes in Theoretical Computer Science, Vol. 29, Elsevier, Amsterdam, 1999, pp. 71-90, .
[123] F. Durán, J. Meseguer, A Church-Rosser checker tool for Maude equational specifications, Manuscript, Computer Science Laboratory, SRI International, 2000, .
[124] F. Durán, J. Meseguer, Parameterized theories and views in Full Maude 2.0, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 319-337, .
[125] F. Durán, J. Meseguer, Structured theories and institutions, Manuscript, Computer Science Laboratory, SRI International, 2000, submitted for publication.
[126] F. Durán, J. Meseguer, Maude’s module algebra, Theoret. Comput. Sci. (2002), to appear, .
[127] F. Durán, A. Vallecillo, Writing ODP enterprise specifications in Maude, in: Proc. Workshop on Open Distributed Processing: Enterprise, Computation, Knowledge, Engineering and Realisation, WOODPECKER 2001, Setúbal, Portugal, July, 2001, .
[128] Durán, F.; Eker, S.; Lincoln, P.; Meseguer, J., Principles of mobile maude, (), 73-85
[129] S. Eker, Fast matching in combination of regular equational theories, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3-6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 90-108, . · Zbl 0912.68057
[130] S. Eker, Term rewriting with operator evaluation strategy. in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 45-62, . · Zbl 0917.68113
[131] Fernández, J.L.; Toval, A., Can intuition become rigorous? foundations for UML model verification tools, (), 344-355
[132] J.L. Fernández, A. Toval, Seamless formalizing the UML semantics through metamodels, in: K. Siau, T. Halpin (Eds.), Unified Modeling Language: Systems Analysis, Design, and Development Issues, Idea Group Publishing, 2001, pp. 224-248.
[133] Ferrari, G.; Montanari, U., A tile-based coordination view of asynchronous pi-calculus, (), 52-70 · Zbl 0941.68089
[134] G. Ferrari, U. Montanari, Tiles for concurrent and located calculi, in: C. Palamidessi, J. Parrow (Eds.), Proc. EXPRESS’97, Electronic Notes in Theoretical Computer Science, Vol. 7, Elsevier, Amsterdam, 1997. . · Zbl 0911.68056
[135] Ferrari, G.; Montanari, U., Tile formats for located and mobile systems, Inform. comput., 156, 1/2, 173-235, (2000) · Zbl 1046.68619
[136] Fiadeiro, J.L.; Maibaum, T.; Martı́-Oliet, N.; Meseguer, J.; Pita, I., Towards a verification logic for rewriting logic, (), 438-458 · Zbl 0966.68123
[137] B. Fischer, G. Roşu, Interpreting abstract interpretations in membership equational logic, Technical Report RIACS 01.16, Research Institute for Advanced Computer Science, May, 2001. · Zbl 1268.68066
[138] K. Futatsugi (Ed.), Proc. of the CafeOBJ Symposium ’98, Numazu, Japan, CafeOBJ Project, April, 1998.
[139] K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000. .
[140] K. Futatsugi, A.T. Nakagawa, An overview of CAFE specification environment — an algebraic approach for creating, verifying, and maintaining formal specifications over networks, in: 1st Internat. Conf. on Formal Engineering Methods, Hiroshima, Japan, November, 1997, .
[141] K. Futatsugi, T. Sawada, Cafe as an extensible specification environment, in: Proc. of the Kunming International CASE Symposium, Kunming, China, November, 1994.
[142] K. Futatsugi, J.A. Goguen, J. Meseguer (Eds.), OBJ/CafeOBJ/Maude Workshop at Formal Methods ’99: Formal Specification, Proof, and Applications, Theta, Bucharest, 1999.
[143] Futatsugi, K.; Nakagawa, A.T.; Tamai, T., Cafe: an industrial-strength algebraic formal method, (2000), Elsevier Amsterdam
[144] F. Gadducci, On the algebraic approach to concurrent term rewriting, Ph.D. Thesis, Dipartimento di Informatica, Università di Pisa, March, 1996, Technical Report TD-2/96.
[145] Gadducci, F.; Montanari, U., Enriched categories as models of computation, (), 20-42
[146] F. Gadducci, U. Montanari, Tiles, rewriting rules, and CCS, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3-6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 1-19, . · Zbl 0917.68115
[147] 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, The MIT Press, Cambridge, MA, 2000, .
[148] F. Gadducci, U. Montanari, Comparing logics for rewriting: rewriting logic, action calculi and tile logic, Theoret. Comput. Sci. (2002), submitted for publication. · Zbl 1001.68056
[149] T. Genet, Contraintes d’ordre et automates d’arbres pour les preuves de terminaison, Ph.D. Thesis, Université Henri Poincaré — Nancy I, 1998.
[150] Genet, T., Decidable approximations of sets of descendants and sets of normal forms, (), 151-165
[151] F. Giunchiglia, The OMRS project: state of the art and future developments, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, . · Zbl 0917.68175
[152] J.A. Goguen, K. Lin, G. Roşu, Behavioral and coinductive rewriting, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 1-22, . · Zbl 0962.68078
[153] González-Moreno, J.C.; Hortalá-González, M.T.; López-Fraguas, F.J.; Rodrı́guez-Artalejo, M., An approach to declarative programming based on a rewriting logic, J. logic programming, 40, 47-87, (1999) · Zbl 0942.68060
[154] N.A. Harman, Correctness and verification of hardware systems using Maude, Technical Report 3-2000, Department of Computer Science, University of Wales Swansea, 2000, .
[155] N.A. Harman, Verifying a simple pipelined microprocessor using Maude, Technical Report 4-2000, Department of Computer Science, University of Wales Swansea, 2000, . · Zbl 1043.68571
[156] N.A. Harman, Verifying a microprocessor using Maude, in: M. Cerioli, P.D. Mosses, G. Reggio (Eds.), Proc. WADT/CoFI’01, 15th Internat. Workshop on Algebraic Development Techniques and General Workshop of the CoFI WG, Genova, Italy, April 1-3, 2001. · Zbl 1043.68571
[157] K. Havelund, G. Roşu, Java PathExplorer — a runtime verification tool, in: Proc. 6th Internat. Symp. on Artificial Intelligence, Robotics and Automation in Space, ISAIRAS’01, Montreal, Canada, June, 18-22, 2001.
[158] K. Havelund, G. Roşu, Monitoring Java programs with Java PathExplorer, in: Proc. 1st Workshop on Runtime Verification, RV’01, Paris, France, July 23, 2001, Electronic Notes in Theoretical Computer Science, Vol. 55 (2), Elsevier, Amsterdam, 2001, .
[159] K. Havelund, G. Roşu, Monitoring programs using rewriting, Technical report, Research Institute for Advanced Computer Science, 2001.
[160] K. Havelund, G. Roşu, Testing linear temporal logic formulae on finite execution traces, Technical Report RIACS 01.08, Research Institute for Advanced Computer Science, May, 2001.
[161] H. Hilberdink, Foundations for rewriting logic, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 43-69, . · Zbl 0966.68088
[162] S. Iida, M. Matsumoto, R. Diaconescu, K. Futatsugi, D. Lucanu, Concurrent object composition in CafeOBJ, Technical Report JAIST IS-RR-98-0009S, Japan Advanced Institute of Science and Technology, 1998, .
[163] H. Ishikawa, K. Futatsugi, T. Watanabe, An operational semantics of GAEA in CafeOBJ, in: K. Futatsugi, J.A. Goguen, J. Meseguer (Eds.), OBJ/CafeOBJ/Maude Workshop at Formal Methods ’99: Formal Specification, Proof, and Applications, Theta, Bucharest, 1999, pp. 213-227.
[164] H. Ishikawa, J. Meseguer, T. Watanabe, K. Futatsugi, H. Nakashima, On the semantics of GAEA — an object-oriented specification of a concurrent reflective language in rewriting logic, in: Proc. IMSA’97, Information-Technology Promotion Agency, Japan, 1997, pp. 70-109.
[165] M. Ishisone, T. Sawada, Brute: brute force rewriting engine, in: K. Futatsugi (Ed.), Proc. of the CafeOBJ Symposium ’98, Numazu, Japan, CafeOBJ Project, April, 1998.
[166] J.-P. Jouannaud, Membership equational logic, calculus of inductive constructions, and rewrite logic, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 89-94, .
[167] Kirchner, H., On the use of constraints in automated deduction, (), 128-146
[168] Kirchner, H., Some extensions of rewriting, (), 54-73
[169] H. Kirchner, ELAN, in: F. Fages (Ed.) JFPLC’99, Journées Francophones de Programmation Logique et Programmation par Constraintes, Lyon, France, HERMES Science Publications, May, 1999, pp. 241-248, Also Technical Report 99-R-129, LORIA, Nancy, France.
[170] Kirchner, H., Term rewriting, (), 273-320 · Zbl 0960.68087
[171] H. Kirchner, I. Gnaedig, Termination and normalisation under strategy — proofs in ELAN, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 93-115, . · Zbl 0962.68082
[172] C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, .
[173] Kirchner, H.; Moreau, P.-E., Prototyping completion with constraints using computational systems, (), 438-443
[174] H. Kirchner, P.-E. Moreau, A reflective extension of ELAN, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3-6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 148-167, . · Zbl 0912.68085
[175] Kirchner, H.; Moreau, P.-E., Non-deterministic computations in ELAN, (), 168-182
[176] Kirchner, H.; Moreau, P.-E., Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories, J. funct. programming, 11, 2, 207-251, (2001) · Zbl 0979.68055
[177] Kirchner, H.; Ringeissen, C., Combining symbolic constraint solvers on algebraic domains, J. symbolic comput., 18, 2, 113-155, (1994) · Zbl 0819.68111
[178] Kirchner, H.; Ringeissen, C., Constraint solving by narrowing in combined algebraic domains, (), 617-631
[179] H. Kirchner, C. Ringeissen, Executing CASL equational specifications with the ELAN rewrite engine, Technical Report 99-R-278, LORIA, Nancy, France, 1999.
[180] Kirchner, C.; Ringeissen, C., Rule-based constraint programming, Fund. inform., 34, 3, 225-262, (1998) · Zbl 0943.68094
[181] H. Kirchner, L. Vigneron, Deduction with constraints for theory reasoning: completeness and simplification problems, in: Proc. CADE-12 Workshop: Theory Reasoning in Automated Deduction, Nancy, France, 1994.
[182] Kirchner, C.; Kirchner, H.; Vittek, M., Implementing computational systems with constraints, (), 166-175
[183] Kirchner, C.; Kirchner, H.; Vittek, M., Designing constraint logic programming languages using computational systems, (), 133-160
[184] A. Knapp, Case studies with CafeOBJ, in: K. Futatsugi (Ed.), Proc. of the CafeOBJ Symposium’98, Numazu, Japan, CafeOBJ Project, April, 1998.
[185] Knapp, A., Generating rewrite theories from UML collaborations, (), 97-120
[186] A. Knapp, A Formal Approach to Object-Oriented Software Engineering, Shaker Verlag, Aachen, Germany, 2001, Ph.D. Thesis, Institut für Informatik, Universität München, 2000.
[187] Kosiuczenko, P.; Wirsing, M., Timed rewriting logic for the specification of time-sensitive systems, (), 229-264 · Zbl 0876.03015
[188] Kosiuczenko, P.; Wirsing, M., Timed rewriting logic with an application to object-based specification, Sci. comput. programming, 28, 2-3, 225-246, (1997) · Zbl 0877.68071
[189] M. Kulas̆, C. Beirle, Defining standard prolog in rewriting logic, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 155-171, .
[190] H. Kuruma, K. Futatsugi, Incremental specification based on the combination of data types in: K. Futatsugi, J.A. Goguen, J. Mesegner (Eds.), OBJ/CafeOBJ/Maude Workshop at Formal Methods’99: Formal Specification, Proof, and Applications, Theta, 1999, Bucharest, pp. 95-114.
[191] C. Landauer, Discrete event systems in rewriting logic, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’ 96, Asilomar, CA, September 3-6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 309-320, . · Zbl 0912.68089
[192] Laneve, C.; Montanari, U., Axiomatizing permutation equivalence in the λ-calculus, (), 350-363
[193] Laneve, C.; Montanari, U., Axiomatizing permutation equivalence, Math. struct. comput. sci., 6, 3, 219-249, (1996) · Zbl 0884.68070
[194] U. Lechner, Object-oriented specifications of distributed systems in the μ-calculus and Maude, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’ 96, Asilomar, CA, September 3-6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 384-403. http://www.elsevier.nl/locate/entcs/volume4.html.
[195] U. Lechner. Object-oriented specification of distributed systems. Ph.D. Thesis, Fakultät für Mathematik und Informatik, Universität Passau, June, 1997. · Zbl 0887.68067
[196] Lechner, U., Constructs, concepts, and criteria for reuse in concurrent object-oriented languages, (), 171-187
[197] U. Lechner, Object-oriented specification of distributed systems, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 1998, pp. 405-414, . · Zbl 0917.68069
[198] Lechner, U.; Lengauer, C., Modal μ-maude — properties and specification of concurrent objects, (), 41-62
[199] Lechner, U.; Lengauer, C.; Nickl, F.; Wirsing, M., (objects + concurrency) & reusability — a proposal to circumvent the inheritance anomaly, (), 232-247
[200] Lechner, U.; Lengauer, C.; Wirsing, M., An object-oriented airport, (), 351-367
[201] M. Leucker, T. Noll, Rewriting logic as a framework for generic verification tools, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 117-133, . · Zbl 0962.68080
[202] P. Lincoln, J. Meseguer, Strategic reflection, in: B. Gramlich, F. Pfenning (Eds.), Proc. of the CADE-15 Workshop on Strategies in Automated Deduction, Lindau, Germany, July, 1998, pp. 3-9.
[203] Lincoln, P.; Martı́-Oliet, N.; Meseguer, J., Specification, transformation, and programming of concurrent systems in rewriting logic, (), 309-339
[204] Lincoln, P.; Martı́-Oliet, N.; Meseguer, J.; Ricciulli, L., Compiling rewriting onto SIMD and MIMD/SIMD machines, (), 37-48
[205] M. Lowry, T. Pressburger, G. Roşu, Certifying domain-specific policies, Technical report, Research Institute for Advanced Computer Science, 2001.
[206] D. Lucanu, Algebraic specification of object aggregation — an event oriented approach, in: K. Futatsugi, J.A. Goguen, J. Meseguer (Eds.), OBJ/CafeOBJ/Maude Workshop at Formal Methods’99: Formal Specification, Proof, and Applications, Theta, Bucharest, 1999, pp. 115-132.
[207] D. Lucanu, Relaxed models for rewriting logic, Manuscript, July, 2000, submitted for publication. · Zbl 1018.68036
[208] N. Martı́-Oliet, J. Meseguer, Rewriting logic as a logical and semantic framework, D. Gabbay (Ed.), Handbook of Philosophical Logic, Second Edition, Vol. 9, Kluwer Academic Publishers, Dordrecht, 2002, . · Zbl 0912.68096
[209] Martı́-Oliet, N.; Meseguer, J., General logics and logical frameworks, (), 355-392 · Zbl 0817.03005
[210] N. Martı́-Oliet, J. Meseguer, Rewriting logic as a logical and semantic framework, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Application, WRLA’ 96, Asilomar, CA, September 3-6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 189-224, . · Zbl 0912.68096
[211] Martı́-Oliet, N.; Meseguer, J., Action and change in rewriting logic, (), 1-53 · Zbl 0930.03028
[212] Mason, I.A.; Talcott, C.L., A semantics preserving actor translation, (), 369-378 · Zbl 1401.68026
[213] I.A. Mason, C.L. Talcott, Simple network protocol simulation within Maude, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 277-294, . · Zbl 0966.68514
[214] Meseguer, J., A logical theory of concurrent objects, (), 101-115
[215] J. Meseguer, Rewriting as a unified model of concurrency, Technical Report SRI-CSL-90-02R, SRI International, Computer Science Laboratory, February, 1990, Revised June, 1990. Appendices on functorial semantics have not been published elsewhere.
[216] Meseguer, J., Rewriting as a unified model of concurrency, (), 384-400
[217] Meseguer, J., Conditional rewriting logicdeduction, models and concurrency, (), 64-91
[218] Meseguer, J., Conditional rewriting logic as a unified model of concurrency, Theoret. comput. sci., 96, 1, 73-155, (1992) · Zbl 0758.68043
[219] Meseguer, J., Multiparadigm logic programming, (), 158-200
[220] Meseguer, J., A logical theory of concurrent objects and its realization in the maude language, (), 314-390
[221] Meseguer, J., Solving the inheritance anomaly in concurrent object-oriented programming, (), 220-246
[222] J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3-6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996. .
[223] Meseguer, J., Rewriting logic as a semantic framework for concurrency: a progress report, (), 331-372
[224] J. Meseguer, Formal interoperability, in: Proc. of the 1998 Conference on Mathematics in Artificial Intelligence, Fort Laurerdale, Florida, January, 1998, . Presented also at the 14th IMACS World Congress, Atlanta, Georgia, July, 1994.
[225] Meseguer, J., A logical framework for distributed systems and communication protocols, (), 327-333
[226] Meseguer, J., Membership algebra as a logical framework for equational specification, (), 18-61 · Zbl 0903.08009
[227] Meseguer, J., Research directions in rewriting logic, (), 347-398 · Zbl 0940.68069
[228] Meseguer, J., Rewriting logic and maudea wide-spectrum semantic framework for object-based distributed systems, (), 89-117 · Zbl 0968.68079
[229] Meseguer, J., Rewriting logic and maude: concepts and applications, (), 1-26 · Zbl 0964.68069
[230] Meseguer, J.; Martı́-Oliet, N., From abstract data types to logical frameworks, (), 48-80
[231] Meseguer, J.; Montanari, U., Mapping tile logic into rewriting logic, (), 62-91 · Zbl 0903.08010
[232] J. Meseguer, C.L. Talcott, Using rewriting logic to interoperate architectural description languages (I and II), Lectures at the Santa Fe and Seattle DARPA-EDCS Workshops, March and July 1997, .
[233] J. Meseguer, C.L. Talcott, Mapping OMRS to rewriting logic, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 345-366, . Full version in preparation.
[234] Meseguer, J.; Talcott, C.L., A partial order event model for concurrent objects, (), 415-430 · Zbl 0939.68084
[235] Meseguer, J.; Winkler, T., Parallel programming in maude, (), 253-293
[236] Meseguer, J.; Qian, X., A logical semantics for object-oriented databases, (), 89-98
[237] J. Meseguer, K. Futatsugi, T. Winkler, Using rewriting logic to specify, program, integrate, and reuse open concurrent systems of cooperating agents, in: Proc. of the 1992 International Symposium on New Models for Software Architecture, Tokyo, Japan, November 1992, Research Institute of Software Engineering, pp. 61-106.
[238] J. Meseguer, M.-O. Stehr, C.L. Talcott, Specifying the PLAN language in Maude, 2000, Slides available at .
[239] J. Millen, Applications of term rewriting to cryptographic protocol analysis, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 229-234, . · Zbl 0962.68057
[240] H. Miyoshi, Modelling conditional rewriting logic in structured categories. in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3-6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 20-34, . · Zbl 0912.68094
[241] U. Montanari, C.L. Talcott, Can actors and pi-agents live together? in: A.D. Gordon, A.M. Pitts, C.L. Talcott (Eds.), Proc. 2nd Workshop on Higher-Order Operational Techniques in Semantics, HOOTS’98, Electronic Notes in Theoretical Computer Science, Vol. 10, Elsevier, Amsterdam, 1998. · Zbl 0925.68116
[242] P.-E. Moreau, A choice-point library for backtrack programming, in: JICSLP’98 Post-Conf. Workshop on Implementation Technologies for Programming Languages based on Logic, June, 1998.
[243] P.-E. Moreau, Compilation de Règles de Réécriture et de Stratégies Non-Déterministes, Ph.D. Thesis, Université Henri Poincaré — Nancy I, June, 1999.
[244] P.-E. Moreau, H. Kirchner, Compilation of associative-commutative normalisation with strategies in ELAN (full version), Technical Report 97-R-129, LORIA, Nancy, France, 1997.
[245] P.-E. Moreau, H. Kirchner, Compilation techniques for associative-commutative normalisation, in: M.P.A. Sellink (Ed.), 2nd Internat. Workshop on the Theory and Practice of Algebraic Specifications, Amsterdam, The Netherlands, September 25-26, 1997, Electronic Workshops in Computing, Springer, Berlin, 1998, .
[246] Moreau, P.-E.; Kirchner, H., A compiler for rewrite programs in associative-commutative theories, (), 230-249
[247] P.D. Mosses, Semantics, modularity, and rewriting logic, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, . · Zbl 0917.68110
[248] Mosses, P.D., Logical specification of operational semantics, (), 32-49 · Zbl 0969.68098
[249] E. Najm, J.-B. Stefani, A formal operational semantics for the ODP computational model with signals, explicit binding, and reactive objects, Manuscript, ENST, Paris, France, 1994.
[250] Najm, E.; Stefani, J.-B., A formal semantics for the ODP computational model, Comput. networks ISDN systems, 27, 1305-1329, (1995)
[251] Najm, E.; Stefani, J.-B., Computational models for open distributed systems, (), 157-176
[252] S. Nakajima, Encoding mobility in CafeOBJ: an exercise of describing mobile code-based software architecture, in: K. Futatsugi (Ed.), Proc. of the CafeOBJ Symposium ’98, Numazu, Japan, CafeOBJ Project, April, 1998.
[253] Nakajima, S., Using algebraic specification techniques in development of object-oriented frameworks, (), 1664-1683
[254] S. Nakajima, K. Futatsugi, An object-oriented modeling method for algebraic specifications in CafeOBJ, in: Proc. 19th Internat. Conf. on Software Engineering, Boston, MA, May 1997, IEEE Computer Society Press, Silverspring, MD, pp. 34-44.
[255] M. Nakamura, K. Ogata, The evaluation strategy for head normal form with and without on-demand flags, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 211-227, . · Zbl 0962.68083
[256] H. Nakashima, Cyber assistance for situated human information processing, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 295-296, .
[257] P. Naumov, M.-O. Stehr, J. Meseguer, The HOL/NuPRL proof translator — a practical approach to formal interoperability, in: Theorem Proving in Higher Order Logics, 14th Internat. Conf. TPHOLs’2001, Edinburgh, Scotland, UK, September 3-6, 2001, Proceedings, Lecture Notes in Computer Science, Springer, Berlin, 2001. · Zbl 1005.68542
[258] Noll, T., On coherence properties in term rewriting models of concurrency, (), 478-493 · Zbl 0934.03045
[259] M. Numazawa, M. Kurihara, A. Ohuchi, A reflective language based on conditional term rewriting, Technical report, Division of Systems and Information Engineering, Hokkaido University, Sapporo, Japan, 1996. · Zbl 0939.68677
[260] Ogata, K.; Futatsugi, K., An abstract machine for order-sorted conditional term rewriting systems, (), 335-338
[261] K. Ogata, K. Futatsugi, Specification and verification of some classical mutual exclusion algorithms with CafeOBJ, in: K. Futatsugi, J.A. Goguen, J. Meseguer (Eds.), OBJ/CafeOBJ/Maude Workshop at Formal Methods ’99: Formal Specification, Proof, and Applications, Theta, Bucharest, 1999, pp. 159-178.
[262] P.C. Ölveczky, Specification and analysis of real-time and hybrid systems in rewriting logic, Ph.D. Thesis, University of Bergen, Norway, 2000, .
[263] P.C. Ölveczky, S. Meldal, Specification and prototyping of network protocols in rewriting logic, in: Proc. of NIK’98, Norsk Informatikk Konferanse, 1998.
[264] P.C. Ölveczky, J. Meseguer, Specifying real-time systems in rewriting logic, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3-6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 283-308, . · Zbl 0912.68098
[265] P.C. Ölveczky, J. Meseguer, Real-time Maude: a tool for simulating and analyzing real-time and hybrid systems, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam 2000, pp. 361-383, . · Zbl 0962.68109
[266] P.C. Ölveczky, J. Meseguer, Specification of real-time and hybrid systems in rewriting logic, Theoret. Comput. Sci. (2002), submitted for publication. · Zbl 1001.68061
[267] P.C. Ölveczky, J. Meseguer, Specifying and analyzing real-time object systems in real-time Maude, Manuscript, Computer Science Laboratory, SRI International, 2001, submitted for publication.
[268] P.C. Ölveczky, M. Keaton, J. Meseguer, C.L. Talcott, S. Zabele, Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude, in: H. Hussmann (Ed.), Fundamental Approaches to Software Engineering, 4th Internat. Conf., FASE 2001, Held as Part of ETAPS 2001, Genova, Italy, April 2001, Proceedings, Lecture Notes in Computer Science, Vol. 2029, Springer, Berlin, 2001, pp. 333-347. . · Zbl 0977.68865
[269] Ölveczky, P.C.; Kosiuczenko, P.; Wirsing, M., An object-oriented algebraic steam-boiler control specification, (), 379-402
[270] D. Pattinson, Modal logic for rewriting theories, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam 2000, pp. 173-191, .
[271] I. Pita, N. Martı́-Oliet, A Maude specification of an object oriented database model for telecommunication networks, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3-6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 404-422, . · Zbl 0912.68024
[272] Pita, I.; Martı́-Oliet, N., Using reflection to specify transaction sequences in rewriting logic, (), 261-276
[273] I. Pita, N. Martı́-Oliet, A Maude specification of an object-oriented model for telecommunication networks, Theoret. Comput. Sci. 2002, submitted for publication. · Zbl 1001.68004
[274] J.F. Quesada, The Maude parser: parsing and meta-parsing β-extended context-free grammars, Technical report, Computer Science Laboratory, SRI International, 2001, to appear.
[275] Ringeissen, C., Prototyping combination of unification algorithms with the ELAN rule-based programming language, (), 323-326 · Zbl 1379.68204
[276] C. Ringeissen, Handling relations over finite domains in the rule-based system ELAN, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam 2000, pp. 193-210, . · Zbl 0962.68099
[277] D.E. Rodrı́guez, Case studies in the specification and analysis of protocols in Maude, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam 2000, pp. 257-275, .
[278] G. Roşu, K. Havelund, Generating optimal monitors from temporal formulae, Technical report, Research Institute for Advanced Computer Science, 2001.
[279] B. Salmansberger, Objektorientierte Spezifikation von verteilten Systemen in Maude am Beispiel eines Flughafens, Master’s Thesis, Fakultät für Mathematik und Informatik, Universität Passau, December, 1993.
[280] Sánchez, M.; Herrero, J.L.; Murillo, J.M.; Hernández, J., Guaranteing coherent software systems when composing coordinated components, (), 341-346
[281] C. Scharff, Déduction avec Contraintes et Simplification dans les Théories Équationnelles, Ph.D. Thesis, Université Henri Poincaré — Nancy I, September, 1999.
[282] W.M. Schorlemmer, Bi-rewriting rewriting logic, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3-6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996. pp. 265-282, . · Zbl 0912.68087
[283] W.M. Schorlemmer, Rewriting logic as a logic of special relations, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-á-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 163-184. . · Zbl 0917.68109
[284] W.M. Schorlemmer, On specifying and reasoning with special relations, Ph.D. Thesis, Universitat Politècnica de Catalunya, March, 1999. · Zbl 0924.03048
[285] Schorlemmer, W.M., Term rewriting in a logic of special relations, (), 178-195 · Zbl 0924.03048
[286] Skillicorn, D.B.; Talia, D., Models and languages for parallel computation, ACM comput. surveys, 30, 2, 123-169, (1998)
[287] Steggles, L.J., Rewriting logic and elan: prototyping tools for Petri nets with time, (), 363-381 · Zbl 0986.68091
[288] L.J. Steggles, P. Kosiuczenko, A timed rewriting logic semantics for SDL: a case study of the alternating bit protocol, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-á-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 295-316, . · Zbl 0917.68116
[289] Steggles, L.J.; Kosiuczenko, P., A formal model for SDL specifications based on timed rewriting logic, Automat. software eng., 7, 1, 61-90, (2000)
[290] M.-O. Stehr, CINNI — A generic calculus of explicit substitutions and its application to λ-, ς- and π-calculi, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam 2000, pp. 71-92, http://www.elsevier.nl/locate/entcs/volume36.html.
[291] M.-O. Stehr, A rewriting semantics for algebraic nets, in: C. Girault, R. Valk (Eds.), Petri Nets for System Engineering — A Guide to Modeling, Verification, and Applications, Springer, Berlin, 2001.
[292] M.-O. Stehr, Rewriting logic and type theory — from applications to unification, Ph.D. Thesis, Computer Science Department, University of Hamburg, Germany, 2002, in preparation.
[293] M.-O. Stehr, J. Meseguer, Pure type systems in rewriting logic, in: Proc. of LFM’99: Workshop on Logical Frameworks and Meta-languages, Paris, France, September, 28, 1999, .
[294] M.-O. Stehr, J. Meseguer, P.C. Ölvczky, Representation and execution of Petri nets using rewriting logic as a uniform framework, in: J. Padberg (Ed.), Proc. UNIGRA’2001, Uniform Approaches to Graphical Process Specification Techniques, Electronic Notes in Theoretical Computer Science, Genova, Italy, March/April 2001, Elsevier, Amsterdam, to appear.
[295] M.-O. Stehr, J. Meseguer, P.C. Ölveczky, Rewriting logic as a unifying framework for Petri nets, in: H. Ehrig, G. Juhas, J. Padberg, G. Rozenberg (Eds.), Unifying Petri Nets, Lecture Notes in Computer Science, Springer, Berlin, 2001, to appear. · Zbl 1017.68080
[296] M.-O. Stehr, P. Naumov, J. Meseguer, A proof-theoretic approach to the HOL-Nuprl connection with applications to proof translation, in: M. Cerioli, P.D. Mosses, G. Reggio (Eds.), Proc. WADT/CoFI’01, 15th Internat. Workshop on Algebraic Development Techniques and General Workshop of the CoFI WG, Genova, Italy, April 1-3, 2001, . · Zbl 1005.68542
[297] Tahara, Y.; Kumeno, F.; Ohsuga, A.; Honiden, S., An algebraic semantics of reflective objects, (), 173-189
[298] C.L. Talcott, An actor rewriting theory, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3-6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 360-383, .
[299] Talcott, C.L., Composable semantic models for actor theories, (), 321-364 · Zbl 0934.68058
[300] Talcott, C.L., Interaction semantics for components of distributed systems, (), 154-169
[301] Talcott, C.L., Towards a toolkit for actor system specification, (), 391-406 · Zbl 0983.68134
[302] C.L. Talcott, Actor theories in rewriting logic, Theoret. Comput. Sci. (2001), submitted for publication. · Zbl 1001.68055
[303] M.P. Tarjuelo, Comparing Meseguer’s rewriting logic with the logic CRWL, in: Proc. WFLP 2001, Internat. Workshop on Functional and (Constraint) Logic Programming, Kiel, Germany, September 13-15, 2001. · Zbl 1268.68103
[304] M.P. Tarjuelo, Relating Meseguer’s rewriting logic with the constructor-based rewriting logic, Master’s Thesis, Facultad de Matemáticas, Universidad Complutense de Madrid, Spain, May, 2001, .
[305] A. Toval, J.L, Fernández. Formally modeling UML and its evolution: a holistic approach, in: S.F. Smith, C.L. Talcott (Eds.), Proc. IFIP Conf. on Formal Methods for Open Object-Based Distributed Systems IV, FMOODS 2000, September 6-8, 2000, Stanford, CA, USA, Kluwer Academic Publishers, Dordrecht, 2000, pp. 183-206. · Zbl 0968.68013
[306] A. Toval, J.L. Fernández, Improving system reliability via rigorous software modeling: the UML case, in: Proc. IEEE Aerospace Conf. Vol. 6, Big Sky, MT, USA, March 10-17, 2001, IEEE Press, New York, pp. 6-17.
[307] M.G.J. van den Brand, P. Klint, C. Verhoef, Term rewriting for sale, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 139-162, . · Zbl 0917.68112
[308] M.G.J. van den Brand, C. Ringeissen, ASF+SDF parsing tools applied to ELAN, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 135-154, .
[309] A. Verdejo, N. Martı́-Oliet, Executing E-LOTOS processes in Maude, in: H. Ehrig, M. Grosse-Rhode, F. Orejas (Eds.), INT 2000, Integration of Specification Techniques with Applications in Engineering, Extended Abstracts, Technical report 2000/04, Technische Universitat Berlin, March, 2000, pp. 49-53.
[310] A. Verdejo, N. Martı́-Oliet, Executing and verifying CCS in Maude, Technical Report 99-00, Departamento de Sistemas Informáticos y Programación, Universidad Complutense de Madrid, February 2000, . · Zbl 1086.68552
[311] Verdejo, A.; Martı́-Oliet, N., Implementing CCS in maude, (), 351-366
[312] A. Verdejo, I. Pita, N. Martı́-Oliet, The leader election protocol of IEEE 1394 in Maude, in: K. Futatsugi (Ed.), Proc. 3rd Internat. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 385-406, . · Zbl 0962.68107
[313] P. Viry, La réécriture concurrente, Ph.D. Thesis, Université de Nancy I, 1992.
[314] Viry, P., Rewritingan effective model of concurrency, (), 648-660
[315] P. Viry, Rewriting modulo a rewrite system, Technical Report TR-95-20, Dipartimento di Informatica, Università di Pisa, December, 1995, .
[316] P. Viry, Input/output for ELAN, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3-6, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 51-64, .
[317] P. Viry, Adventures in sequent calculus modulo equations, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 367-378, . · Zbl 0917.68100
[318] P. Viry, Equational rules for rewriting logic, Theoret. Comput. Sci. (2002), submitted for publication. · Zbl 1001.68058
[319] E. Visser, Z. el A. Benaissa, A core language for rewriting, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA’98, Pont-à-Mousson, France, September 1-4, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 25-44, . · Zbl 0917.68098
[320] M. Vittek, ELAN: Un Cadre Logique pour le Prototypage de Langages de Programmation avec Contraintes, Ph.D. Thesis, Université Henri Poincaré — Nancy I, November, 1994.
[321] Vittek, M., A compiler for nondeterministic term rewriting systems, (), 154-168
[322] B.-Y. Wang, J. Meseguer, C.A. Gunter, Specification and formal analysis of a PLAN algorithm in Maude, in: P.-A. Hsiung (Ed.), Proc. Internat. Workshop on Distributed System Validation and Verification, Taipei, Taiwan, April, 2000, pp. 49-56.
[323] T. Watanabe, Towards a foundation of computational reflection based on abstract rewriting (preliminary result), in: Proc. IMSA’95, Information-Technology Promotion Agency, Japan, 1995, pp. 143-145.
[324] T. Watanabe, H. Ishikawa, K. Futatsugi, Towards declarative description of computational reflection, in: Proc. IMSA’96, Information-Technology Promotion Agency, Japan, 1996, pp. 113-128.
[325] Winkler, T., Programming in OBJ and maude, (), 229-277
[326] M. Wirsing, A. Knapp, A formal approach to object-oriented software engineering, in: J. Meseguer (Ed.), Proc. 1st Internat. Workshop on Rewriting Logic and its Applications, WRLA’96, Asilomar, CA, September 3-6, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996, pp. 321-359, . · Zbl 1001.68024
[327] M. Wirsing, A. Knapp, A formal approach to object-oriented software engineering, Theoret. Comput. Sci. (2002), submitted for publication. · Zbl 1001.68024
[328] Wirsing, M.; Nickl, F.; Lechner, U., Concurrent object-oriented specification in SPECTRUM, (), 39-70
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.