Twenty years of rewriting logic

The first three papers on rewriting logic were published in 1990 [4,3,2]; they were then expanded in [5,6]. Since that time, many researchers around the world have made important contributions to its foundations, tools, and applications. Since 1996, the WRLA workshop has met biennially, with the 2010 Paphos meeting being its eighth edition, and many hundreds of papers have been published on the subject (for a bibliography up to 2002 see [1]).

[1]  Gul Agha,et al.  Formal modeling actors, open systems, biological systems ; essays dedicated to Carolyn Talcott on the occasion of her 70th birthday , 2011 .

[2]  Carolyn L. Talcott,et al.  Formal Executable Models of Cell Signaling Primitives , 2006, Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (isola 2006).

[3]  Carolyn L. Talcott,et al.  Symbolic Modeling of Signal Transduction in Pathway Logic , 2006, Proceedings of the 2006 Winter Simulation Conference.

[4]  Carolyn L. Talcott,et al.  Ðð Blockinøöóòò Aeóøø× Ò Ìììóööøø Blockin Blockinð Óñôùøøö Ë Blockin Blockin Blockinò ½ ´¾¼¼¾µ Íêää Øøôô»»ûûûººð××úúúöºòð»ðó Blockin Blockinøø»òø Blockin×»úóðùññ½ºøñð ½½ Ôôôô× Executable Models of Biological Networks , 2022 .

[5]  Claude Kirchner,et al.  Rewrite strategies in the rewriting calculus , 2003, WRS.

[6]  Peter W. Glynn,et al.  On the role of generalized semi-Markov processes in simulation output analysis , 1983, WSC '83.

[7]  Narciso Martí-Oliet,et al.  Action and Change in Rewriting Logic , 1999 .

[8]  Daniel Le Métayer,et al.  The GAMMA Model and Its Discipline of Programming , 1990, Sci. Comput. Program..

[9]  María Alpuente,et al.  Abstract Certification of Global Non-Interference in Rewriting Logic , 2009, FMCO.

[10]  Francisco Durán,et al.  Methods for Proving Termination of Rewriting-based Programming Languages by Transformation , 2009, PROLE.

[11]  Claude Kirchner,et al.  Verification of Timed Automata Using Rewrite Rules and Strategies , 2001, ArXiv.

[12]  Martin Wirsing,et al.  Timed Rewriting Logic with an Application to Object-Based Specification , 1997, Sci. Comput. Program..

[13]  Peter Csaba Ölveczky,et al.  Formal Real-Time Model Transformations in MOMENT2 , 2010, FASE.

[14]  Carolyn L. Talcott,et al.  Pathway logic modeling of protein functional domains in signal transduction , 2003, Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003.

[15]  Hélène Kirchner,et al.  Computing constructor forms with non terminating rewrite programs , 2006, PPDP '06.

[16]  Adrián Riesco,et al.  Declarative debugging of rewriting logic specifications , 2012, J. Log. Algebraic Methods Program..

[17]  Salvador Lucas,et al.  Context-sensitive Computations in Functional and Functional Logic Programs , 1998, J. Funct. Log. Program..

[18]  Francisco Durán,et al.  Termination Modulo Combinations of Equational Theories , 2009, FroCoS.

[19]  Martin Wirsing,et al.  Which Soft Constraints do you Prefer? , 2009, WRLA.

[20]  Cesare Tinelli,et al.  Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T) , 2006, JACM.

[21]  Furio Honsell,et al.  A framework for defining logics , 1993, JACM.

[22]  José Meseguer Rewriting as a unified model of concurrency , 1991, OOPS Messenger.

[23]  José Meseguer,et al.  Localized Fairness: A Rewriting Semantics , 2005, RTA.

[24]  José Meseguer,et al.  General logics and logical frameworks , 1994 .

[25]  Grigore Rosu,et al.  An Executable Rewriting Logic Semantics of K-Scheme , 2007 .

[26]  Einar Broch Johnsen,et al.  Lightweight Time Modeling in Timed Creol , 2010, RTRTS.

[27]  Claude Kirchner,et al.  HOL-λσ: an intentional first-order expression of higher-order logic , 2001, Mathematical Structures in Computer Science.

[28]  Artur Boronat,et al.  MOMENT2: EMF Model Transformations in Maude , 2009, JISBD.

[29]  Joseph A. Goguen,et al.  OBJ as a Theorem Prover with Applications to Hardware Verification , 1989 .

[30]  José Meseguer,et al.  Operational termination of conditional term rewriting systems , 2005, Inf. Process. Lett..

[31]  José Meseguer,et al.  Certifying and Synthesizing Membership Equational Proofs , 2003, FME.

[32]  Jürgen Giesl Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings , 2005, RTA.

[33]  Francisco Durán,et al.  Maude's module algebra , 2007, Sci. Comput. Program..

[34]  J. Meseguer,et al.  Semantic Models for Distributed Object Reflection , 2002, ECOOP.

[35]  Robert Nieuwenhuis Rewriting techniques and applications : 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003 : proceedings , 2003 .

[36]  E BihariThomas,et al.  Object-Oriented Real-Time Systems , 1992 .

[37]  Peter Csaba Ölveczky Specification and Analysis of Real-Time and Hybrid Systems in Rewriting Logic , 2007 .

[38]  Francisco Durán,et al.  An extensible module algebra for Maude , 1998, WRLA.

[39]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[40]  Marcello M. Bonsangue,et al.  Formal Methods for Open Object-Based Distributed Systems, 9th IFIP WG 6.1 International Conference, FMOODS 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings , 2007, FMOODS.

[41]  Claude Kirchner,et al.  Combining Higher-Order and First-Order Computation Using Rho Calculus: Towards a Semantics of ELAN , 1998 .

[42]  José Meseguer,et al.  A Dependency Pair Framework for A OR C-Termination , 2010, WRLA.

[43]  José Meseguer,et al.  Reflection and strategies in rewriting logic , 1996, WRLA.

[44]  Luigi Liquori,et al.  The Polymorphic Rewriting-calculus: [Type Checking vs. Type Inference] , 2004, WRLA.

[45]  Adnan Aziz,et al.  It Usually Works: The Temporal Logic of Stochastic Systems , 1995, CAV.

[46]  Narciso Martí-Oliet,et al.  Rewriting Logic as a Logical and Semantic Framework , 1996 .

[47]  Robert L. Constable,et al.  Metalogical frameworks , 1993 .

[48]  Antonio Vallecillo,et al.  Formalizing ODP enterprise specifications in Maude , 2003, Comput. Stand. Interfaces.

[49]  José Meseguer,et al.  Decision Procedures for Equationally Based Reasoning , 2008 .

[50]  José Meseguer,et al.  Reduction Semantics and Formal Analysis of Orc Programs , 2008, Electron. Notes Theor. Comput. Sci..

[51]  José Meseguer,et al.  Java+ITP: A Verification Tool Based on Hoare Logic and Algebraic Semantics , 2006, WRLA.

[52]  Fabricio Chalub,et al.  Maude MSOS Tool , 2007, WRLA.

[53]  Peter Csaba Ölveczky,et al.  Formal modeling and analysis of real-time resource-sharing protocols in Real-Time Maude , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[54]  Hélène Kirchner,et al.  A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms , 2003, RTA.

[55]  Mahesh Viswanathan,et al.  VESTA: A statistical model-checker and analyzer for probabilistic systems , 2005, Second International Conference on the Quantitative Evaluation of Systems (QEST'05).

[56]  M. Clavel,et al.  Principles of Maude , 1996, WRLA.

[57]  Hélène Kirchner,et al.  Prototyping Completion with Constraints Using Computational Systems , 1995, RTA.

[58]  Francisco Durán,et al.  Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6 , 2011, RTA.

[59]  Marina Egea,et al.  Formal executable semantics for conformance in the MDE framework , 2010, Innovations in Systems and Software Engineering.

[60]  Carolyn L. Talcott,et al.  Multiple Representations of Biological Processes , 2006, Trans. Comp. Sys. Biology.

[61]  José Meseguer,et al.  A Categorical Approach to Simulations , 2005, CALCO.

[62]  Peter Csaba Ölveczky,et al.  Verifying Ptolemy II Discrete-Event Models Using Real-Time Maude , 2009, ICFEM.

[63]  Leon Moonen,et al.  Proceedings of the Sixth IEEE International Workshop on Source Code Analysis and Manipulation , 2006 .

[64]  Joseph A. Goguen,et al.  Institutions: abstract model theory for specification and programming , 1992, JACM.

[65]  Francisco Durán,et al.  On the Church-Rosser and Coherence Properties of Conditional Order-Sorted Rewrite Theories 1 , 2010 .

[66]  José Meseguer,et al.  Equational Cryptographic Reasoning in the Maude-NRL Protocol Analyzer , 2007, Electron. Notes Theor. Comput. Sci..

[67]  Nikil D. Dutt,et al.  Combining Formal Verification with Observed System Execution Behavior to Tune System Parameters , 2007, FORMATS.

[68]  Edward A. Lee,et al.  Taming heterogeneity - the Ptolemy approach , 2003, Proc. IEEE.

[69]  José Meseguer,et al.  Partial Order Reduction for Rewriting Semantics of Programming Languages , 2007, WRLA.

[70]  Ravishankar K. Iyer,et al.  Formalizing System Behavior for Evaluating a System Hang Detector , 2008, 2008 Symposium on Reliable Distributed Systems.

[71]  G Denker,et al.  Capsl Intermediate Language , 1999 .

[72]  Jose Meseguer,et al.  Formal Specification and Verification of Java Refactorings , 2006, 2006 Sixth IEEE International Workshop on Source Code Analysis and Manipulation.

[73]  Hélène Kirchner,et al.  A Port Graph Calculus for Autonomic Computing and Invariant Verification , 2009, TERMGRAPH@ETAPS.

[74]  Antonio Vallecillo,et al.  From Maude Specifications to SOAP Distributed Implementations: A Smooth Transition , 2001, JISBD.

[75]  Manuel Clavel,et al.  Vérification d'invariants pour des systèmes spécifiés en logique de réécriture , 2009, Stud. Inform. Univ..

[76]  Isabelle Gnaedig,et al.  Induction for positive almost sure termination , 2007, PPDP '07.

[77]  Peter Csaba Ölveczky,et al.  A Guide to Extending Full Maude Illustrated with the Implementation of Real-Time Maude , 2008, WRLA.

[78]  Anderson Santana de Oliveira Rewriting-Based Access Control Policies , 2006, SecReT@ICALP.

[79]  Jiacun Wang,et al.  Timed Petri Nets , 1998, The Kluwer International Series on Discrete Event Dynamic Systems.

[80]  Proceedings DARPA Information Survivability Conference and Exposition , 2003, Proceedings DARPA Information Survivability Conference and Exposition.

[81]  Peter Schneider-Kamp,et al.  Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming , 2011 .

[82]  M. G. Sriram Modelling protein functional domains in signal transduction using Maude , 2003, Briefings Bioinform..

[83]  Enno Ohlebusch,et al.  Advanced Topics in Term Rewriting , 2002, Springer New York.

[84]  Ronald V. Book,et al.  Rewriting Techniques and Applications , 1991, Lecture Notes in Computer Science.

[85]  José Meseguer,et al.  Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories , 2010, LPAR.

[86]  D. Dill,et al.  The Pathway Logic Assistant , 2005 .

[87]  MeseguerJosé Conditional rewriting logic as a unified model of concurrency , 1992 .

[88]  Alwyn Goodloe,et al.  Design and Analysis of Sectrace : A Protocol to Set up Security Associations and Policies in IPSec Networks ∗ , .

[89]  Francisco Durán,et al.  A formalization of the SMEPP model in Maude , 2008, MobiQuitous.

[90]  Gul Agha,et al.  Probabilistic Rewrite Theories: Unifying Models, Logics and Tools , 2003 .

[91]  Grigore Rosu,et al.  An overview of the K semantic framework , 2010, J. Log. Algebraic Methods Program..

[92]  Claude Kirchner,et al.  Probabilistic Rewrite Strategies. Applications to ELAN , 2002, RTA.

[93]  Dilia E. Rodriguez Case Studies in the Specification and Analysis of Protocols in Maude , 2000, WRLA.

[94]  Peter Csaba Ölveczky,et al.  Formal Simulation and Analysis of the CASH Scheduling Algorithm in Real-Time Maude , 2006, FASE.

[95]  Peter Csaba Ölveczky,et al.  An Object-Oriented Algebraic Steam-Boiler Control Specification , 1995, Formal Methods for Industrial Applications.

[96]  M. Clavel Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications , 2000 .

[97]  Jayadev Misra,et al.  Computation Orchestration , 2007, Software & Systems Modeling.

[98]  José Meseguer,et al.  Membership algebra as a logical framework for equational specification , 1997, WADT.

[99]  Jane Hillston,et al.  Formal Methods for Computational Systems Biology , 2008 .

[100]  Peter Csaba Olveczky Rewriting Logic and Its Applications - 8th International Workshop, WRLA 2010, Held as a Satellite Event of ETAPS 2010, Paphos, Cyprus, March 20-21, 2010, Revised Selected Papers , 2010 .

[101]  Michael Johnson,et al.  Algebraic Methodology and Software Technology, 11th International Conference, AMAST 2006, Kuressaare, Estonia, July 5-8, 2006, Proceedings , 2006, AMAST.

[102]  Carolyn L. Talcott,et al.  Actor theories in rewriting logic , 2002, Theor. Comput. Sci..

[103]  Samuel T. King,et al.  Secure Web Browsing with the OP Web Browser , 2008, 2008 IEEE Symposium on Security and Privacy (sp 2008).

[104]  Alberto Verdejo,et al.  Rewriting Logic Using Strategies for Neural Networks: An Implementation in Maude , 2008, DCAI.

[105]  José Meseguer,et al.  Concurrent Rewriting Semantics and Analysis of Asynchronous Digital Circuits , 2010, WRLA.

[106]  김삼묘,et al.  “Bioinformatics” 특집을 내면서 , 2000 .

[107]  José Meseguer,et al.  Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols , 2007, High. Order Symb. Comput..

[108]  Dorel Lucanu,et al.  Strategy-Based Proof Calculus for Membrane Systems , 2009, WRLA.

[109]  Adrián Riesco,et al.  Implementing and analyzing in Maude the Enhanced Interior Gateway Routing Protocol , 2008, WRLA.

[110]  Hélène Kirchner,et al.  Simplification and termination of strategies in rule-based languages , 2003, PPDP '03.

[111]  Claude Kirchner,et al.  Higher-order unification via explicit substitutions , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[112]  S. Eker,et al.  Metalevel computation in Maude , 1998, WRLA.

[113]  John D. Day,et al.  Resource Sharing Protocols , 1979, Computer.

[114]  Thomas A. Henzinger,et al.  Timed Transition Systems , 1991, REX Workshop.

[115]  Jim Woodcock,et al.  FM'99 - Formal Methods, World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999, Proceedings, Volume II , 1999, World Congress on Formal Methods.

[116]  Peter Csaba Ölveczky,et al.  Formal Semantics and Analysis of Behavioral AADL Models in Real-Time Maude , 2010, FMOODS/FORTE.

[117]  María Alpuente,et al.  Specification and Verification of Web Applications in Rewriting Logic , 2009, FM.

[118]  Kazuhiro Ogata,et al.  Proof Scores in the OTS/CafeOBJ Method , 2003, FMOODS.

[119]  Shuo Tang,et al.  Towards secure web browsing , 2011 .

[120]  R. Smullyan Theory of formal systems , 1962 .

[121]  José Meseguer,et al.  Algebraic simulations , 2010, J. Log. Algebraic Methods Program..

[122]  Patrick Viry,et al.  Equational rules for rewriting logic , 2002, Theor. Comput. Sci..

[123]  José Meseguer,et al.  A rewriting logic approach to operational semantics , 2009, Inf. Comput..

[124]  Claude Kirchner,et al.  The rewriting calculus - Part II , 2001, Log. J. IGPL.

[125]  Patrick Viry Rewriting: An Effective Model of Concurrency , 1994, PARLE.

[126]  Gul Agha,et al.  Formal Modeling and Analysis of DoS Using Probabilistic Rewrite Theories , 2005 .

[127]  José Meseguer,et al.  Functorial Semantics of Rewrite Theories , 2005, Formal Methods in Software and Systems Modeling.

[128]  José Meseguer,et al.  Directed-Logical Testing for Functional Verification of Microprocessors , 2008, 2008 6th ACM/IEEE International Conference on Formal Methods and Models for Co-Design.

[129]  J. Meseguer Rewriting as a unified model of concurrency , 1990, OOPSLA/ECOOP '90.

[130]  Claude Kirchner,et al.  Rewriting with Strategies in ELAN: A Functional Semantics , 2001, Int. J. Found. Comput. Sci..

[131]  Carolyn L. Talcott,et al.  A Rewriting Logic Framework for Soft Constraints , 2006, WRLA.

[132]  José Meseguer,et al.  Axiomatizing the algebra of net computations and processes , 1996, Acta Informatica.

[133]  José Meseguer,et al.  Probabilistic Modeling and Analysis of DoS Protection for the ASV Protocol , 2009, Electron. Notes Theor. Comput. Sci..

[134]  Claude Kirchner,et al.  External Rewriting for Skeptical Proof Assistants , 2003, Journal of Automated Reasoning.

[135]  José Meseguer,et al.  On the Completeness of Context-Sensitive Order-Sorted Specifications , 2007, RTA.

[136]  Mourad Badri,et al.  Verifying UML Diagrams with Model Checking: A Rewriting Logic Based Approach , 2007, Seventh International Conference on Quality Software (QSIC 2007).

[137]  Gabriel Ciobanu,et al.  Rewriting Logic Specification of Membrane Systems with Promoters and Inhibitors , 2008, WRLA.

[138]  Lui Sha,et al.  Automated Veri.cation of the Dependability of Object-Oriented Real-Time Systems , 2003, 2003 The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems.

[139]  Ravishankar K. Iyer,et al.  SymPLFIED: Symbolic program-level fault injection and error detection framework , 2008, 2008 IEEE International Conference on Dependable Systems and Networks With FTCS and DCC (DSN).

[140]  Edward A. Lee Modeling concurrent real-time processes using discrete events , 1999, Ann. Softw. Eng..

[141]  Hélène Kirchner,et al.  Non-intrusive Formal Methods and Strategic Rewriting for a Chemical Application , 2006, Essays Dedicated to Joseph A. Goguen.

[142]  Peter Csaba Ölveczky,et al.  Extending the Real-Time Maude Semantics of Ptolemy to Hierarchical DE Models , 2010, RTRTS.

[143]  Alan F. Blackwell,et al.  Programming , 1973, CSC '73.

[144]  Ravishankar K. Iyer,et al.  Discovering Application-Level Insider Attacks Using Symbolic Execution , 2009, SEC.

[145]  Salvador Lucas,et al.  Context-Sensitive Rewriting Strategies , 2002, Inf. Comput..

[146]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[147]  Amy P. Felty,et al.  Encoding a Dependent-Type Lambda-Calculus in a Logic Programming Language , 1990, CADE.

[148]  José Meseguer,et al.  Reflective metalogical frameworks , 2004, TOCL.

[149]  Peter Csaba Ölveczky,et al.  Rewriting Logic as a Unifying Framework for Petri Nets , 2001, Unifying Petri Nets.

[150]  José Meseguer,et al.  Redesign of the LMST Wireless Sensor Protocol through Formal Modeling and Statistical Model Checking , 2008, FMOODS.

[151]  Kazuhiro Ogata,et al.  Specification Translation of State Machines from Equational Theories into Rewrite Theories , 2010, ICFEM.

[152]  Claude Kirchner,et al.  Theorem Proving Modulo , 2003, Journal of Automated Reasoning.

[153]  José Meseguer,et al.  Rewriting Semantics of Meta-Objects and Composable Distributed Services , 2000, WRLA.

[154]  José Meseguer,et al.  Rewriting semantics of production rule sets , 2012, J. Log. Algebraic Methods Program..

[155]  Adrián Riesco,et al.  Introducing the ITP Tool: a Tutorial , 2006, J. Univers. Comput. Sci..

[156]  Hélène Kirchner,et al.  Completion of a Set of Rules Modulo a Set of Equations , 1986, SIAM J. Comput..

[157]  Law Fw FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963 .

[158]  Patrick Viry La réécriture concurrente , 1992 .

[159]  Marsha Chechik,et al.  Fundamental approaches to software engineering : 12th International Conference, Fase 2009, held As part of the joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009 : proceedings , 2009, FASE 2009.

[160]  Francisco Durán,et al.  Tool Interoperability in the Maude Formal Environment , 2011, CALCO.

[161]  Ian A. Mason,et al.  Using typed lambda calculus to implement formal systems on a machine , 1992, Journal of Automated Reasoning.

[162]  José Alberto Verdejo López Maude como marco semántico ejecutable , 2011 .

[163]  José Meseguer,et al.  Folding variant narrowing and optimal variant termination , 2010, J. Log. Algebraic Methods Program..

[164]  Peter Csaba Ölveczky,et al.  Formal Modeling and Analysis of the OGDC Wireless Sensor Network Algorithm in Real-Time Maude , 2007, FMOODS.

[165]  Nikil D. Dutt,et al.  A Probabilistic Formal Analysis Approach to Cross Layer Optimization in Distributed Embedded Systems , 2007, FMOODS.

[166]  Kokichi Futatsugi Fostering Proof Scores in CafeOBJ , 2010, ICFEM.

[167]  Gunter Saake,et al.  Integrating and Rapid-Prototyping UML Structural and Behavioural Diagrams Using Rewriting Logic , 2002, CAiSE.

[168]  Nissim Francez,et al.  Full-Commutation and Fair-Termination in Equational (and Combined) Term-Rewriting Systems , 1986, CADE.

[169]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[170]  Antonio Vallecillo,et al.  Using UML and Maude for writing and reasoning about ODP policies , 2003, Proceedings POLICY 2003. IEEE 4th International Workshop on Policies for Distributed Systems and Networks.

[171]  Antonio Vallecillo,et al.  On the Behavioral Semantics of Real-Time Domain Specific Visual Languages , 2010, WRLA.

[172]  G. Denker,et al.  CAPSL integrated protocol environment , 2000, Proceedings DARPA Information Survivability Conference and Exposition. DISCEX'00.

[173]  Joseph A. Goguen,et al.  FUNNEL and 2OBJ: Towards an Integrated Hardware Design Environment , 1992, TPCD.

[174]  Ron Koymans,et al.  Specifying real-time properties with metric temporal logic , 1990, Real-Time Systems.

[175]  José Meseguer,et al.  State Space Reduction of Rewrite Theories Using Invisible Transitions , 2006, AMAST.

[176]  José Meseguer,et al.  Conditional Rewriting Logic: Deduction, Models and Concurrency , 1990, CTRS.

[177]  Håkan L. S. Younes,et al.  Statistical probabilistic model checking with a focus on time-bounded properties , 2006, Inf. Comput..

[178]  José Meseguer,et al.  The Rewriting Logic Semantics Project , 2006, SOS@ICALP.

[179]  Razvan Diaconescu,et al.  Cafeobj Report - The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification , 1998, AMAST Series in Computing.

[180]  Alan Smaill,et al.  Experience with FS 10 0 as a framework theory , 1993 .

[181]  J.C.M. Baeten,et al.  CONCUR '90 Theories of Concurrency: Unification and Extension , 1990, Lecture Notes in Computer Science.

[182]  Deepak Kapur,et al.  Mechanical Verification of Adder Circuits using Rewrite Rule Laboratory , 1998, Formal Methods Syst. Des..

[183]  José Meseguer,et al.  A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms , 2006, IJCAR.

[184]  T. Anastasio,et al.  Data-driven modeling of Alzheimer disease pathogenesis. , 2011, Journal of theoretical biology.

[185]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[186]  Annalisa Bossi Logic-Based Program Synthesis and Transformation , 1999, Lecture Notes in Computer Science.

[187]  Francisco Durán,et al.  Towards a Maude Formal Environment , 2011, Formal Modeling: Actors, Open Systems, Biological Systems.

[188]  Artur Boronat,et al.  What Is a Multi-modeling Language? , 2008, WADT.

[189]  Peng Ning,et al.  Computer Security - ESORICS 2009, 14th European Symposium on Research in Computer Security, Saint-Malo, France, September 21-23, 2009. Proceedings , 2009, ESORICS.

[190]  Hélène Kirchner,et al.  Graph Rewriting and Strategies for Modeling Biochemical Networks , 2007, Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007).

[192]  Roberto Bruni,et al.  Tiling Transactions in Rewriting Logic , 2002, Electron. Notes Theor. Comput. Sci..

[193]  José Meseguer,et al.  The HOL/NuPRL Proof Translator (A Practical Approach to Formal Interoperability) , 2001, TPHOLs.

[194]  Martin Wirsing,et al.  Timed Rewriting Logic for the Specification of Time-Sensitive Systems , 1997 .

[195]  Claude Kirchner,et al.  The Rho Cube , 2001, FoSSaCS.

[196]  Ashish Tiwari,et al.  Quantitative and Probabilistic Modeling in Pathway Logic , 2007, 2007 IEEE 7th International Symposium on BioInformatics and BioEngineering.

[197]  Alberto Verdejo,et al.  Two Case Studies of Semantics Execution in Maude: CCS and LOTOS , 2005, Formal Methods Syst. Des..

[198]  José Meseguer,et al.  Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report , 1996, CONCUR.

[199]  José Meseguer,et al.  Narrowing and Rewriting Logic: from Foundations to Applications , 2007, WFLP.

[200]  Camilo Rocha,et al.  A Graphical Environment for the Semantic Validation of a Plan Execution Language , 2009, 2009 Third IEEE International Conference on Space Mission Challenges for Information Technology.

[201]  José Meseguer,et al.  Sufficient Completeness Checking with Propositional Tree Automata , 2005 .

[202]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[203]  José Meseguer,et al.  Model-Checking DoS Amplification for VoIP Session Initiation , 2009, ESORICS.

[204]  Manuel Clavel,et al.  Reflection in conditional rewriting logic , 2002, Theor. Comput. Sci..

[205]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[206]  José Meseguer,et al.  Effectively Checking the Finite Variant Property , 2008, RTA.

[207]  Antonio Vallecillo,et al.  Writing and executing ODP computational viewpoint specifications using Maude , 2007, Comput. Stand. Interfaces.

[208]  Claude Kirchner,et al.  Analysis of Rewrite-Based Access Control Policies , 2009, Electron. Notes Theor. Comput. Sci..

[209]  Carolyn L. Talcott,et al.  Formal specification and analysis of active networks and communication protocols: the Maude experience , 2000, Proceedings DARPA Information Survivability Conference and Exposition. DISCEX'00.

[210]  J. Misra Computation Orchestration : A Basis for Wide-Area Computing , 2005 .

[211]  Corina Cîrstea,et al.  Algebra and Coalgebra in Computer Science - 4th International Conference, CALCO 2011, Winchester, UK, August 30 - September 2, 2011. Proceedings , 2011, CALCO.

[212]  José Meseguer,et al.  Sequential Protocol Composition in Maude-NPA , 2010, ESORICS.

[213]  Ralf Sasse,et al.  Automatic Validation of Transformation Rules for Java Verification Against a Rewriting Semantics , 2005, LPAR.

[214]  Claude Kirchner,et al.  Rewriting Calculus with(out) Types , 2004, Workshop on Rewriting Logic and Its Applications.

[215]  Grigore Rosu,et al.  Matching logic: a new program verification approach. , 2011, ICSE 2011.

[216]  Mark-Oliver Stehr,et al.  Formal prototyping in early stages of protocol design , 2005, WITS '05.

[217]  N. S. Barnett,et al.  Private communication , 1969 .

[218]  José Meseguer,et al.  Coverset Induction with Partiality and Subsorts: A Powerlist Case Study , 2010, ITP.

[219]  Reiko Heckel,et al.  Rewriting Logic Semantics and Verification of Model Transformations , 2009, FASE.

[220]  José Meseguer,et al.  Formal Analysis of Java Programs in JavaFAN , 2004, CAV.

[221]  Charles McEwen Ellison,et al.  A formal semantics of C with applications , 2012 .

[222]  Kokichi Futatsugi Verifying Specifications with Proof Scores in CafeOBJ , 2006, 21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06).

[223]  Nalini Venkatasubramanian,et al.  Exploring adaptability of secure group communication using formal prototyping techniques , 2004, Adaptive and Reflective Middleware.

[224]  José Meseguer,et al.  Formal JVM Code Analysis in JavaFAN , 2004, AMAST.

[225]  José Meseguer,et al.  Dist-Orc: A Rewriting-based Distributed Implementation of Orc with Formal Analysis , 2010, RTRTS.

[226]  Peter Csaba Ölveczky,et al.  Model Checking Classes of Metric LTL Properties of Object-Oriented Real-Time Maude Specifications , 2010, RTRTS.

[227]  Antonio Vallecillo,et al.  Specifying the ODP Information Viewpoint using Maude , 2001 .

[228]  Patrick Viry Input/Output for ELAN , 1996, WRLA.

[229]  Manuel Clavel,et al.  ITP/OCL: A Rewriting-Based Validation Tool for UML+OCL Static Class Diagrams , 2006, AMAST.

[230]  Gilles Dowek,et al.  Rewriting Logic Semantics of a Plan Execution Language , 2009, SOS.

[231]  Franz Baader Term Rewriting and Applications, 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings , 2007, RTA.

[232]  José Meseguer,et al.  Theorem Proving Modulo Based on Boolean Equational Procedures , 2008, RelMiCS.

[233]  José Meseguer,et al.  Real-time rewriting semantics of orc , 2007, PPDP '07.

[234]  José Meseguer,et al.  A Rewriting Based Model for Probabilistic Distributed Object Systems , 2003, FMOODS.

[235]  Alexander Knapp,et al.  A formal approach to object-oriented software engineering , 2001, Softwaretechnik-Trends.

[236]  Mahesh Viswanathan,et al.  Modular Preservation of Safety Properties by Cookie-Based DoS-Protection Wrappers , 2008, FMOODS.

[237]  Eelco Visser,et al.  Program Transformation with Stratego/XT: Rules, Strategies, Tools, and Systems in Stratego/XT 0.9 , 2003, Domain-Specific Program Generation.

[238]  Pierre-Etienne Moreau,et al.  Tom: Piggybacking Rewriting on Java , 2007, RTA.

[239]  Lui Sha,et al.  A Formal Pattern Architecture for Safe Medical Systems , 2010, WRLA.

[240]  Hélène Kirchner,et al.  Under Consideration for Publication in J. Functional Programming Promoting Rewriting to a Programming Language: a Compiler for Non-deterministic Rewrite Programs in Associative-commutative Theories , 2022 .

[241]  José Meseguer,et al.  Using the PALS Architecture to Verify a Distributed Topology Control Protocol for Wireless Multi-Hop Networks in the Presence of Node Failures , 2010, RTRTS.

[242]  Vlad Rusu Combining Theorem Proving and Narrowing for Rewriting-Logic Specifications , 2010, TAP@TOOLS.

[243]  Hélène Kirchner,et al.  From Chemical Rules to Term Rewriting , 2005, RULE@RDP.

[244]  José Meseguer,et al.  Order-sorted Equational Unification Revisited , 2012, Electron. Notes Theor. Comput. Sci..

[245]  Steven Eker,et al.  Associative-Commutative Rewriting on Large Terms , 2003, RTA.

[246]  José Meseguer,et al.  Proving Safety Properties of Rewrite Theories , 2011, CALCO.

[247]  Nikil D. Dutt,et al.  Constraint Refinement for Online Verifiable Cross-Layer System Adaptation , 2008, 2008 Design, Automation and Test in Europe.

[248]  Narciso Martí-Oliet,et al.  Formalizing and Proving Semantic Relations between Specifications by Reflection , 2004, AMAST.

[249]  Grigore Rosu,et al.  K-Maude: A Rewriting Based Tool for Semantics of Programming Languages , 2010, WRLA.

[250]  Claude Kirchner,et al.  Incremental Construction of Unification Algorithms in Equational Theories , 1983, ICALP.

[251]  Catherine A. Meadows,et al.  The NRL Protocol Analyzer: An Overview , 1996, J. Log. Program..

[252]  Charles Rattray,et al.  Algebraic Methodology and Software Technology: 10th International Conference, AMAST 2004, Stirling, Scotland, UK, July 12-16, 2004, Proceedings , 2004 .

[253]  Bernhard Gramlich,et al.  Characterizing and proving operational termination of deterministic conditional term rewriting systems , 2010, J. Log. Algebraic Methods Program..

[254]  Peter Csaba Ölveczky,et al.  Formalization and Correctness of the PALS Architectural Pattern for Distributed Real-Time Systems , 2010, ICFEM.

[255]  Yongdae Kim,et al.  Secure group communication in asynchronous networks with failures: integration and experiments , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[256]  Olivier Bournez,et al.  Rewriting Logic and Probabilities , 2003, RTA.

[257]  Frank Pfenning,et al.  Elf: a language for logic definition and verified metaprogramming , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[258]  Clara Bertolissi,et al.  Translating Combinatory Reduction Systems into the Rewriting Calculus , 2003, RULE@RDP.

[259]  Maribel Fernández,et al.  Term Rewriting for Access Control , 2006, DBSec.

[260]  Jan A. Bergstra,et al.  A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method , 1980, ICALP.

[261]  Ravishankar K. Iyer,et al.  Formal Reasoning of Various Categories of Widely Exploited Security Vulnerabilities by Pointer Taintedness Semantics , 2004, SEC.

[262]  Grigore Rosu,et al.  Runtime Verification of C Memory Safety , 2009, RV.

[263]  Chucky Ellison,et al.  A Rewriting Logic Approach to Type Inference , 2009, WADT.

[264]  José Meseguer,et al.  A logical theory of concurrent objects , 1990, OOPSLA/ECOOP '90.

[265]  José Meseguer,et al.  Order-Sorted Generalization , 2009, WFLP.

[266]  Wolfgang A. Halang,et al.  Real-time programming languages , 1992 .

[267]  José Meseguer,et al.  Mapping tile logic into rewriting logic , 1997, WADT.

[268]  Peter Csaba Ölveczky,et al.  Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude , 2006, Formal Methods Syst. Des..

[269]  Raúl Gutiérrez,et al.  Proving Termination in the Context-Sensitive Dependency Pair Framework , 2010, WRLA.

[270]  José Meseguer,et al.  Rewriting logic and Maude (invited speaker): a wide-spectrum semantic framework for object-based distributed systems , 2000 .

[271]  José Meseguer,et al.  A logical theory of concurrent objects and its realization in the Maude language , 1993 .

[272]  Einar Broch Johnsen,et al.  A Run-Time Environment for Concurrent Objects With Asynchronous Method Calls , 2005, WRLA.

[273]  Mohammad Reza Mousavi,et al.  Proceedings 10th International Workshop on the Foundations of Coordination Languages and Software Architectures , 2011 .

[274]  Hiroshi Inamura,et al.  Formal Specification and Analysis of Timing Properties in Software Systems , 2009, FASE.

[275]  José Meseguer,et al.  PVeStA: A Parallel Statistical Model Checking and Quantitative Analysis Tool , 2011, CALCO.

[276]  Raymond R. Devillers,et al.  Sequential and Concurrent Behaviour in Petri Net Theory , 1987, Theor. Comput. Sci..

[277]  Grigore Rosu,et al.  A Rewriting Logic Approach to Static Checking of Units of Measurement in C , 2012, RULE.

[278]  Claude Kirchner,et al.  Weaving rewrite-based access control policies , 2007, FMSE '07.

[279]  Stian Thorvaldsen,et al.  Modeling and Analysis of the OGDC Wireless Sensor Network Algorithm in Real-Time Maude Master ’ s thesis , 2022 .

[280]  Artur Boronat,et al.  Algebraic Semantics of OCL-Constrained Metamodel Specifications , 2009, TOOLS.

[281]  W. Kolch Meaningful relationships: the regulation of the Ras/Raf/MEK/ERK pathway by protein interactions. , 2000, The Biochemical journal.

[282]  Fabio Gadducci,et al.  CCS semantics via proved transition systems and rewriting logic , 1998, WRLA.

[283]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[284]  Patrick Viry,et al.  Adventures in sequent calculus modulo equations , 1998, WRLA.

[285]  Peter Csaba Ölveczky,et al.  Specifying real-time systems in rewriting logic , 1996, WRLA.

[286]  Peter Csaba Ölveczky,et al.  Timed CTL Model Checking in Real-Time Maude , 2012, WRLA.

[287]  Mahesh Viswanathan,et al.  On Statistical Model Checking of Stochastic Systems , 2005, CAV.

[288]  Claude Kirchner,et al.  Proof Search and Proof Check for Equational and Inductive Theorems , 2003, CADE.

[289]  Manuel Clavel,et al.  ASIP + ITP : A Veri cation Tool Based on Algebraic Semantics , 2005 .

[290]  Christel Baier,et al.  Approximate Symbolic Model Checking of Continuous-Time Markov Chains , 1999, CONCUR.

[291]  Francisco Durán,et al.  Proving operational termination of membership equational programs , 2008, High. Order Symb. Comput..

[292]  José Meseguer,et al.  Symbolic Model Checking of Infinite-State Systems Using Narrowing , 2007, RTA.

[293]  Carolyn L. Talcott,et al.  Specification and Analysis of a Reliable Broadcasting Protocol in Maude , 1999 .

[294]  Cesare Tinelli A DPLL-Based Calculus for Ground Satisfiability Modulo Theories , 2002, JELIA.

[295]  William D. Clinger,et al.  Foundations of Actor Semantics , 1981 .

[296]  José Meseguer,et al.  Distributed Real-Time Emulation of Formally-Defined Patterns for Safe Medical Device Control , 2010, RTRTS.

[297]  Corrado Priami,et al.  Proved Trees , 1992, ICALP.

[298]  José Meseguer,et al.  Theoroidal Maps as Algebraic Simulations , 2004, WADT.

[299]  Francisco Durán,et al.  MTT: The Maude Termination Tool (System Description) , 2008, IJCAR.

[300]  Peter Csaba Ölveczky,et al.  Semantics and pragmatics of Real-Time Maude , 2007, High. Order Symb. Comput..

[301]  Hélène Kirchner,et al.  Combining Symbolic Constraint Solvers on Algebraic Domains , 1994, J. Symb. Comput..

[302]  José Meseguer,et al.  Protocol Analysis Modulo Combination of Theories: A Case Study in Maude-NPA , 2010, STM.

[303]  Claude Kirchner,et al.  Modular Access Control Via Strategic Rewriting , 2007, ESORICS.

[304]  Xavier Urbain,et al.  Modular and Incremental Automated Termination Proofs , 2004, Journal of Automated Reasoning.

[305]  José Meseguer,et al.  Operational Termination of Membership Equational Programs: the Order-Sorted Way , 2009, WRLA.

[306]  José Meseguer,et al.  The Temporal Logic of Rewriting: A Gentle Introduction , 2008, Concurrency, Graphs and Models.

[307]  José Luis Fernández Alemán,et al.  Can intuition become rigorous? Foundations for UML model verification tools , 2000, Proceedings 11th International Symposium on Software Reliability Engineering. ISSRE 2000.

[308]  Ugo Montanari,et al.  Recent Trends in Algebraic Development Techniques, 19th International Workshop, WADT 2008, Pisa, Italy, June 13-16, 2008, Revised Selected Papers , 2009, WADT.

[309]  José Meseguer,et al.  A formal executable semantics of Verilog , 2010, Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010).

[310]  Arturo Boronat Moll A formal framework for model management , 2011 .

[311]  Mark-Oliver Stehr,et al.  CINNI – A Generic Calculus of Explicit Substitutions and its Application to λ-, ς- and π-Calculi , 2005 .

[312]  HuetGérard Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980 .

[313]  Alberto Verdejo,et al.  Specification and Verification of the Tree Identify Protocol of IEEE 1394 in Rewriting Logic , 2003, Formal Aspects of Computing.

[314]  José Meseguer,et al.  Rewriting logic: roadmap and bibliography , 2002, Theor. Comput. Sci..

[315]  Carolyn L. Talcott,et al.  Simple Network Protocol Simulation within Maude , 2000, WRLA.

[316]  Neal A. Harman,et al.  Verifying a Simple Pipelined Microprocessor Using Maude , 2001, WADT.

[317]  Peter Csaba Ölveczky,et al.  Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude , 2009, Theor. Comput. Sci..

[318]  Mohamed Tahar Kimour,et al.  A Tool for Specifying and Validating Agents' Interaction Protocols: From Agent UML to Maude , 2010, J. Object Technol..

[319]  Carl Hewitt,et al.  Laws for Communicating Parallel Processes , 1977, IFIP Congress.

[320]  Alberto Verdejo,et al.  Executable structural operational semantics in Maude , 2006, J. Log. Algebraic Methods Program..

[321]  José Meseguer,et al.  Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools , 2004, IJCAR.

[322]  Shin Nakajima,et al.  Using Algebraic Specification Techniques in Development of Object-Oriented Frameworks , 1999, World Congress on Formal Methods.

[323]  Mark E. Stickel,et al.  Complete Sets of Reductions for Some Equational Theories , 1981, JACM.

[324]  Peter Csaba Ölveczky,et al.  Abstraction and Completeness for Real-Time Maude , 2006, WRLA.

[325]  Fabio Gadducci,et al.  Relating Two Categorial Models of Term Rewriting , 1995, RTA.

[326]  Claude Kirchner,et al.  The rewriting calculus - Part I , 2001, Log. J. IGPL.

[327]  Helen J. Wang,et al.  A Systematic Approach to Uncover Security Flaws in GUI Logic , 2007, 2007 IEEE Symposium on Security and Privacy (SP '07).

[328]  Antonio Vallecillo,et al.  Maude meets CORBA , 2001 .

[329]  Narciso Martí-Oliet,et al.  All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic , 2007, All About Maude.

[330]  C.A. Gunter,et al.  L3A: a protocol for layer three accounting , 2005, 1st IEEE ICNP Workshop on Secure Network Protocols, 2005. (NPSec)..

[331]  José Meseguer,et al.  Diffie-Hellman Cryptographic Reasoning in the Maude-NRL Protocol Analyzer , 2006 .

[332]  Peter Csaba Ölveczky,et al.  Specification of real-time and hybrid systems in rewriting logic , 2002, Theor. Comput. Sci..

[333]  F. W. Lawvere,et al.  FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963, Proceedings of the National Academy of Sciences of the United States of America.

[334]  Grigore Rosu,et al.  An Executable Semantic Definition of the Beta Language using Rewriting Logic , 2005 .

[335]  Roberto Bruni,et al.  Generalized Rewrite Theories , 2003, ICALP.

[336]  Wayne H. Wolf,et al.  Cyber-physical Systems , 2009, Computer.

[337]  Bengt Jonsson,et al.  A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.

[338]  Fabio Gadducci,et al.  A causal semantics for CCS via rewriting logic , 2002, Theor. Comput. Sci..

[339]  J. Meseguer,et al.  Building Equational Proving Tools by Reflection in Rewriting Logic , 2000 .

[340]  Hiroyuki Miyoshi,et al.  Modelling conditional rewriting logic in structured categories , 1996, WRLA.

[341]  Peter Csaba Ölveczky,et al.  Real-Time Maude 2.1 , 2004, WRLA.

[342]  Mark-Oliver Stehr,et al.  Programming, specification, and interactive theorem proving : towards a unified language based on equational logic, rewriting logic, and type theory , 2002 .

[343]  Grigore Rosu,et al.  A rewriting approach to concurrent programming language design and semantics , 2010 .

[344]  Andrea Omicini,et al.  Prototyping A&A ReSpecT in Maude , 2008, Electron. Notes Theor. Comput. Sci..

[345]  Alberto Verdejo,et al.  Deduction, Strategies, and Rewriting , 2007, STRATEGIES@IJCAR.

[346]  Dale A. Miller,et al.  AN OVERVIEW OF PROLOG , 1988 .

[347]  Stéphanie Delaune,et al.  The Finite Variant Property: How to Get Rid of Some Algebraic Properties , 2005, RTA.

[348]  Raúl Gutiérrez,et al.  Context-sensitive dependency pairs , 2006, Inf. Comput..

[349]  Grigore Rosu,et al.  KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis , 2007, RTA.

[350]  José Meseguer,et al.  Equational abstractions , 2008, Theor. Comput. Sci..

[351]  José Meseguer,et al.  Incremental checking of well-founded recursive specifications modulo axioms , 2011, PPDP.

[352]  Salvador Lucas,et al.  Proving Termination Properties with mu-term , 2010, AMAST.

[353]  Dorel Lucanu,et al.  Strategy-Based Rewrite Semantics for Membrane Systems Preserves Maximal Concurrency of Evolution Rule Actions , 2009, WRS@RTA.

[354]  Panagiotis Manolios A Compositional Theory of Refinement for Branching Time , 2003, CHARME.

[355]  José Meseguer,et al.  A Rewriting Decision Procedure for Dijkstra-Scholten's Syllogistic Logic with Complements , 2007, Rev. Colomb. de Computación.

[356]  José Meseguer,et al.  Unification and Narrowing in Maude 2.4 , 2009, RTA.

[357]  Mark-Oliver Stehr,et al.  The Open Calculus of Constructions (Part II): An Equational Type Theory with Dependent Types for Programming, Specification, and Interactive Theorem Proving , 2005, Fundam. Informaticae.

[358]  Elie Najm,et al.  A Formal Semantics for the ODP Computational Model , 1995, Comput. Networks ISDN Syst..

[359]  Peter Borovanský,et al.  Cooperation of constraint solvers: using the new process control facilities of ELAN , 1998, WRLA.

[360]  Antonio Vallecillo,et al.  A graphical approach for modeling time-dependent behavior of DSLs , 2009, 2009 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC).

[361]  José Meseguer,et al.  vlogsl: A Strategy Language for Simulation-Based Verification of Hardware , 2010, Haifa Verification Conference.

[362]  S. Feferman Finitary inductively presented logics , 1994 .

[363]  Hélène Kirchner,et al.  Termination of rewriting under strategies , 2009, TOCL.

[364]  Claude Kirchner,et al.  ELAN from a rewriting logic point of view , 2002, Theor. Comput. Sci..

[365]  Ashish Tiwari,et al.  Analyzing a Discrete Model of Aplysia Central Pattern Generator , 2008, CMSB.

[366]  J. MeseguerComputer Protocol Speci cation and Analysis in Maude , 1998 .

[367]  Narciso Martí-Oliet,et al.  From Abstract Data Types to Logical Frameworks , 1994, COMPASS/ADT.

[368]  Koushik Sen,et al.  An Executable Specification of Asynchronous Pi-Calculus Semantics and May Testing in Maude 2.0 , 2002, Electron. Notes Theor. Comput. Sci..

[369]  Joseph A. Goguen,et al.  Software Engineering with Obj: Algebraic Specification In Action , 2010 .

[370]  José Meseguer,et al.  Algebraic Semantics of the C Preprocessor and Correctness of its Refactorings , 2006 .

[371]  Mourad Badri,et al.  Generating Maude Specifications From UML Use Case Diagrams , 2009, J. Object Technol..

[372]  Tetsuo Tamai,et al.  CAFE: An Industrial-Strength Algebraic Formal Method , 2000 .

[373]  Roberto Bruni,et al.  Symmetric monoidal and cartesian double categories as a semantic framework for tile logic , 2002, Mathematical Structures in Computer Science.

[374]  Dries Vanoverberghe,et al.  Formal Methods for Open Object-Based Distributed Systems , 2008 .

[375]  José Meseguer,et al.  General Logics , 2006 .

[376]  Peter Csaba Ölveczky,et al.  Formal Modeling and Analysis of an IETF Multicast Protocol , 2009, 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods.

[377]  Mark-Oliver Stehr,et al.  Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types , 2007, High. Order Symb. Comput..

[378]  Harald Ganzinger Rewriting techniques and applications : 7th International Conference, RTA-96, New Brunswick, NJ, USA, July 27-30, 1996 : proceedings , 1996 .

[379]  Jayadev Misra,et al.  A timed semantics of Orc , 2008, Theor. Comput. Sci..

[380]  José Meseguer,et al.  Complete symbolic reachability analysis using back-and-forth narrowing , 2005, Theor. Comput. Sci..

[381]  Elisabeth Lien,et al.  Formal Modelling and Analysis of the NORM Multicast Protocol Using Real-Time Maude , 2004 .

[382]  José Meseguer,et al.  A Rewriting Logic Sampler , 2005, ICTAC.

[383]  J. Meseguer,et al.  Security Policies and Security Models , 1982, 1982 IEEE Symposium on Security and Privacy.

[384]  Roberto Gorrieri,et al.  Formal Methods for Open Object-Based Distributed Systems , 2006, IFIP — The International Federation for Information Processing.

[385]  Elvira Albert,et al.  Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming , 2008, PPDP 2008.

[386]  Jieh Hsiang Rewriting Techniques and Applications: 6th International Conference, RTA-95, Kaiserslautern, Germany, April 5 - 7, 1995. Proceedings , 1995 .

[387]  Gabriel Ciobanu,et al.  A rewriting logic framework for operational semantics of membrane systems , 2007, Theor. Comput. Sci..

[388]  José Meseguer,et al.  A meta-language for functional verification , 2011 .

[389]  Philippa Gardner,et al.  Representing logics in type theory , 1992 .

[390]  Hélène Kirchner,et al.  Constraint Solving by Narrowing in Combined Algebraic Domains , 1994, ICLP.

[391]  Mahesh Viswanathan,et al.  Propositional Tree Automata , 2006, RTA.

[392]  Peter Csaba Ölveczky,et al.  Specification and Verification of Distributed Embedded Systems: A Traffic Intersection Product Family , 2010, RTRTS.

[393]  Peter Csaba Ölveczky,et al.  Synchronous AADL and Its Formal Analysis in Real-Time Maude , 2011, ICFEM.

[394]  P.C. Olveczky Towards Formal Modeling and Analysis of Networks of Embedded Medical Devices in Real-Time Maude , 2008, 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing.

[395]  José Meseguer,et al.  Rewriting Logic and Maude: Concepts and Applications , 2000, RTA.

[396]  Dusko Pavlovic,et al.  Algebraic Methodology and Software Technology - 13th International Conference, AMAST 2010, Lac-Beauport, QC, Canada, June 23-25, 2010. Revised Selected Papers , 2011, AMAST.

[397]  Dov M. Gabbay,et al.  A Sound and Complete Deductive System for CTL* Verification , 2008, Log. J. IGPL.

[398]  Artur Boronat,et al.  Automatic reengineering in MDA using rewriting logic as transformation engine , 2005, Ninth European Conference on Software Maintenance and Reengineering.

[399]  Carolyn L. Talcott,et al.  Pathway Logic , 2008, SFM.

[400]  Cosimo Laneve,et al.  Axiomatizing permutation equivalence , 1996, Mathematical Structures in Computer Science.

[401]  Thierry Coquand,et al.  The Calculus of Constructions , 1988, Inf. Comput..

[402]  Narciso Martí-Oliet,et al.  Maude: specification and programming in rewriting logic , 2002, Theor. Comput. Sci..

[403]  Alexander Knapp Generating Rewrite Theories from UML Collaborations , 2000 .

[404]  Chucky Ellison,et al.  Matching Logic: An Alternative to Hoare/Floyd Logic , 2010, AMAST.

[405]  José Meseguer,et al.  Order-sorted dependency pairs , 2008, PPDP.

[406]  José Meseguer,et al.  State/Event-Based LTL Model Checking under Parametric Generalized Fairness , 2011, CAV.

[407]  Claude Marché,et al.  Modular and incremental proofs of AC-termination , 2004, J. Symb. Comput..

[408]  Antonio Vallecillo,et al.  Using Maude to write and execute ODP information viewpoint specifications , 2005, Comput. Stand. Interfaces.

[409]  Grigore Rosu,et al.  A K Definition of Scheme , 2007 .

[410]  Stephan Merz,et al.  Model Checking , 2000 .

[411]  Artur Boronat,et al.  An algebraic semantics for MOF , 2009, Formal Aspects of Computing.

[412]  Alberto Verdejo,et al.  Building Tools for LOTOS Symbolic Semantics in Maude , 2002, FORTE.

[413]  Dilia E. Rodriguez A Secret-Sharing Protocol Modelled in Maude , 2002, Electron. Notes Theor. Comput. Sci..

[414]  Francisco Durán,et al.  Checking Protocol Compatibility using Maude , 2009, Electron. Notes Theor. Comput. Sci..

[415]  Nissim Francez,et al.  Fairness in term rewriting systems , 1994, Methods Log. Comput. Sci..

[416]  José Meseguer,et al.  A Rewriting Semantics for Maude Strategies , 2009, WRLA.

[417]  José Meseguer,et al.  Modular Rewriting Semantics in Practice , 2004, WRLA.

[418]  José Meseguer,et al.  Specification and Analysis of Distributed Object-Based Stochastic Hybrid Systems , 2006, HSCC.

[419]  Ashish Tiwari,et al.  Analyzing Pathways Using SAT-Based Approaches , 2007, AB.

[420]  R. Bruni Tile Logic for Synchronized Rewriting of Concurrent Systems , 1999 .

[421]  Arie van Deursen,et al.  Language Prototyping: An Algebraic Specification Approach , 1996, AMAST Series in Computing.

[422]  Jürgen Giesl,et al.  Automated Termination Proofs with AProVE , 2004, RTA.

[423]  Grigore Rosu,et al.  Rule-Based Analysis of Dimensional Safety , 2003, RTA.

[424]  Francesco Parisi Presicce Recent trends in algebraic development techniques : 12th International Workshop, WADT '97, Tarquinia, Italy, June 3-7, 1997 : selected papers , 1998 .

[425]  N. A. Harman Correctness and Verification of Hardware Systems Using Maude , 2000 .

[426]  José Meseguer,et al.  Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties , 2009, FOSAD.

[427]  Roberto Bruni,et al.  Internal strategies in a rewriting implementation of tile systems , 1998, WRLA.

[428]  Mark-Oliver Stehr,et al.  An Executable Formalization of the HOL/Nuprl Connection in the Metalogical Framework Twelf , 2006, LPAR.

[429]  José Meseguer,et al.  The Linear Temporal Logic of Rewriting Maude Model Checker , 2010, WRLA.

[430]  Francisco Durán,et al.  Polytypic Programming in Maude , 2000, WRLA.

[431]  Roberto Bruni,et al.  Semantic foundations for generalized rewrite theories , 2006, Theor. Comput. Sci..

[432]  José Meseguer,et al.  A Modular Equational Generalization Algorithm , 2009, LOPSTR.

[433]  José Meseguer,et al.  Reflection in Membership Equational Logic, Many-Sorted Equational Logic, Horn Logic with Equality, and Rewriting Logic , 2004, WRLA.

[434]  José Meseguer,et al.  Termination of just/fair computations in term rewriting , 2008, Inf. Comput..

[435]  Musab AlTurki,et al.  Rewriting-based formal modeling, analysis and implementation of real-time distributed services , 2011 .

[436]  José Meseguer,et al.  Protocol analysis in Maude-NPA using unification modulo homomorphic encryption , 2011, PPDP.

[437]  José Meseguer,et al.  Specification and proof in membership equational logic , 2000, Theor. Comput. Sci..

[438]  José Meseguer,et al.  PMaude: Rewrite-based Specification Language for Probabilistic Object Systems , 2006, QAPL.

[439]  Mirko Viroli,et al.  Simulating Emergent Properties of Coordination in Maude: the Collective Sort Case , 2007, Electron. Notes Theor. Comput. Sci..

[440]  José Meseguer,et al.  A Partial Order Event Model for Concurrent Objects , 1999, CONCUR.

[441]  José Meseguer,et al.  Pathway Logic: Symbolic Analysis of Biological Signaling , 2001, Pacific Symposium on Biocomputing.

[442]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[443]  Santiago Escobar,et al.  Approximating Non-interference and Erasure in Rewriting Logic , 2010, 2010 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

[444]  Carolyn L. Talcott,et al.  Policy-based Coordination in PAGODA: A Case Study , 2007, CoOrg/MTCoord@COORDINATION.

[445]  José Meseguer,et al.  A Sufficient Completeness Reasoning Tool for Partial Specifications , 2005, RTA.

[446]  José Meseguer,et al.  A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties , 2006, Theor. Comput. Sci..

[447]  Carl A. Gunter,et al.  Cumulative Attestation Kernels for Embedded Systems , 2009, IEEE Transactions on Smart Grid.

[448]  Clara Bertolissi,et al.  A rewriting calculus for cyclic higher-order term graphs , 2004, Mathematical Structures in Computer Science.

[449]  José Meseguer,et al.  Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework , 2004, Essays in Memory of Ole-Johan Dahl.

[450]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[451]  Shin Nakajima,et al.  An Object-Oriented Modeling Method for Algebraic Specifications in CafeOBJ , 1997, Proceedings of the (19th) International Conference on Software Engineering.

[452]  Francisco Durán,et al.  Maude as a Formal Meta-tool , 1999, World Congress on Formal Methods.

[453]  José Meseguer,et al.  A Rewriting Semantics for ABEL with Applications to Hardware/Software Co-Design and Analysis , 2006, WRLA.

[454]  Frank S. de Boer,et al.  Formal Methods for Open Object-Based Distributed Systems, 10th IFIP WG 6.1 International Conference, FMOODS 2008, Oslo, Norway, June 4-6, 2008, Proceedings , 2008, FMOODS.

[455]  Francisco Durán The Extensibility of Maude's Module Algebra , 2000, AMAST.

[456]  Steven Eker Fast matching in combinations of regular equational theories , 1996, WRLA.

[457]  José Meseguer Rewriting Logic and Maude: a Wide-Spectrum Semantic Framework for Object-Based Distributed Systems , 2000, FMOODS.

[458]  Hélène Kirchner,et al.  System Presentation -- CARIBOO: An induction based proof tool for termination with strategies , 2002, PPDP '02.

[459]  Lui Sha,et al.  Implementing logical synchrony in integrated modular avionics , 2009, 2009 IEEE/AIAA 28th Digital Avionics Systems Conference.

[460]  Carolyn L. Talcott,et al.  Coordination Models Based on a Formal Model of Distributed Object Reflection , 2006, MTCoord@COORDINATION.

[461]  Piotr Kosiuczenko,et al.  A timed rewriting logic semantics for SDL: A case study of alternating bit protocol , 1998, WRLA.