María Alpuente, Santiago Escobar, Javier Espert & José Meseguer (2014):
A Modular Order-sorted Equational Generalization Algorithm.
Inf. Comput. 235,
pp. 98–136,
doi:10.1016/j.ic.2014.01.006.
Denis Bogdănaş & Grigore Roşu (2015):
K-Java: A Complete Semantics of Java.
In: Proceedings of the 42nd Symposium on Principles of Programming Languages (POPL'15).
ACM,
pp. 445–456,
doi:10.1145/2676726.2676982.
Manuel Clavel, Steven Eker, Patrick Lincoln & José Meseguer (1996):
Principles of Maude.
In: J. Meseguer: Electronic Notes in Theoretical Computer Science 4.
Elsevier Science Publishers,
doi:10.1016/S1571-0661(04)00034-9.
Hubert Comon (1990):
Equational formulas in order-sorted algebras,
pp. 674–688.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
doi:10.1007/BFb0032066.
Pierre Corbineau (2008):
A Declarative Language for the Coq Proof Assistant,
pp. 69–84.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
doi:10.1007/978-3-540-68103-8_5.
Steven Eker, Merrill Knapp, Keith Laderoute, Patrick Lincoln & Carolyn Talcott (2002):
Pathway Logic: Executable Models of Biological Networks.
In: Fourth International Workshop on Rewriting Logic and Its Applications (WRLA 2002), Pisa, Italy, September 19 — 21, 2002,
Electronic Notes in Theoretical Computer Science 71.
Elsevier,
doi:10.1016/S1571-0661(05)82533-2.
Steven Eker, José Meseguer & Ambarish Sridharanarayanan (2003):
The Maude LTL Model Checker and Its Implementation.
In: Proceedings of the 10th International Conference on Model Checking Software,
SPIN'03.
Springer-Verlag,
Berlin, Heidelberg,
pp. 230–234,
doi:10.1007/3-540-44829-2_16.
Chucky Ellison & Grigore Rosu (2012):
An Executable Formal Semantics of C with Applications.
In: Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'12).
ACM,
pp. 533–544,
doi:10.1145/2103656.2103719.
Daniele Filaretti & Sergio Maffeis (2014):
An Executable Formal Semantics of PHP,
pp. 567–592.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
doi:10.1007/978-3-662-44202-9_23.
Joseph A. Goguen, Jean-Pierre Jouannaud & José Meseguer (1985):
Operational Semantics for Order-Sorted Algebra.
In: Proceedings of the 12th Colloquium on Automata, Languages and Programming.
Springer-Verlag,
London, UK, UK,
pp. 221–231,
doi:10.1007/BFb0015747.
Joseph A. Goguen & José Meseguer (1992):
Order-sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations.
Theor. Comput. Sci. 105(2),
pp. 217–273,
doi:10.1016/0304-3975(92)90302-V.
Chris Hathhorn, Chucky Ellison & Grigore Roşu (2015):
Defining the Undefinedness of C.
In: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'15).
ACM,
pp. 336–345,
doi:10.1145/2813885.2737979.
Claude Kirchner, Hélène Kirchner & José Meseguer (1988):
Operational semantics of OBJ-3,
pp. 287–301.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
doi:10.1007/3-540-19488-6_123.
Narciso Martí-Oliet & José Meseguer (2002):
Rewriting Logic as a Logical and Semantic Framework,
pp. 1–87.
Springer Netherlands,
Dordrecht,
doi:10.1007/978-94-017-0464-9_1.
José Meseguer (1999):
Research Directions in Rewriting Logic.
In: Ulrich Berger & Helmut Schwichtenberg: Computational Logic.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
pp. 347–398,
doi:10.1007/978-3-642-58622-4_10.
José Meseguer (2003):
Software specification and verification in rewriting logic.
NATO SCIENCE SERIES SUB SERIES III COMPUTER AND SYSTEMS SCIENCES 191,
pp. 133–194.
José Meseguer, Joseph A. Goguen & Gert Smolka (1989):
Order-sorted Unification.
J. Symb. Comput. 8(4),
pp. 383–413,
doi:10.1016/S0747-7171(89)80036-7.
José Meseguer & Stephen Skeirik (2017):
Equational formulas and pattern operations in initial order-sorted algebras.
Formal Aspects of Computing 29(3),
pp. 423–452,
doi:10.1007/s00165-017-0415-5.
Robin Milner, Mads Tofte & David Macqueen (1997):
The Definition of Standard ML.
MIT Press,
Cambridge, MA, USA.
Daejun Park, Andrei Ştefănescu & Grigore Roşu (2015):
KJS: A Complete Formal Semantics of JavaScript.
In: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'15).
ACM,
pp. 346–356,
doi:10.1145/2737924.2737991.
Lawrence C. Paulson (1990):
Isabelle: The Next 700 Theorem Provers.
In: P. Odifreddi: Logic and Computer Science.
Academic Press,
pp. 361–386.
Grigore Roşu & Traian Florin Şerbănuţă (2010):
An Overview of the K Semantic Framework.
Journal of Logic and Algebraic Programming 79(6),
pp. 397–434,
doi:10.1016/j.jlap.2010.03.012.
John G. Stell (2002):
A Framework for Order-Sorted Algebra.
In: Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology,
AMAST '02.
Springer-Verlag,
London, UK, UK,
pp. 396–410,
doi:10.1007/3-540-45719-4_27.
Alexandre Boulgakov A.W. Roscoe Thomas Gibson-Robinson, Philip Armstrong (2014):
FDR3 — A Modern Refinement Checker for CSP.
In: Erika Ábrahám & Klaus Havelund: Tools and Algorithms for the Construction and Analysis of Systems,
Lecture Notes in Computer Science 8413,
pp. 187–201,
doi:10.1007/978-3-642-54862-8_13.
Hao Wang (1952):
Logic of many-sorted theories.
Journal of Symbolic Logic 17(2),
pp. 105–116,
doi:10.2307/2266241.