Order-Sorted Generalization, Electronic Notes in Theoretical Computer Science, vol.246, pp.27-38, 2009. ,
DOI : 10.1016/j.entcs.2009.07.013
URL : http://doi.org/10.1016/j.entcs.2009.07.013
All About Maude, A High-Performance Logical Framework, Lecture Notes in Computer Science, vol.4350, 2007. ,
A Language-Independent Proof System for Mutual Program Equivalence, 2014. ,
Reducing Partial Equivalence to Partial Correctness, Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2014 16th International Symposium on, pp.164-171, 2014. ,
A Language-Independent Proof System for Mutual Program Equivalence, ICFEM 2014 Proceedings, pp.75-90, 2014. ,
All-Path Reachability Logic, RTA-TLCA 2014, VSL 2014. Proceedings, pp.425-440, 2014. ,
Institution-independent Model Theory, 2008. ,
DOI : 10.1007/11780274_5
Pushouts of order-sorted algebraic specifications, AMAST, pp.132-147, 1996. ,
DOI : 10.1007/BFb0014312
Matching Logic: A Logic for Structural Reasoning, 2014. ,
Matching Logic (invited talk), 26th International Conference on Rewriting Techniques and Applications, 2015. ,
One-Path Reachability Logic, 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, pp.358-367, 2013. ,
Matching Logic: An Alternative to Hoare/Floyd Logic, AMAST, pp.142-162, 2010. ,
An overview of the K semantic framework, The Journal of Logic and Algebraic Programming, vol.79, issue.6, pp.397-434, 2010. ,
DOI : 10.1016/j.jlap.2010.03.012
Foundations of Algebraic Specification and Formal Software Development. Monographs in Theoretical Computer Science. An EATCS Series, 2012. ,
Amalgamation in the semantics of CASL, Theoretical Computer Science, vol.331, issue.1, pp.215-247, 2005. ,
DOI : 10.1016/j.tcs.2004.09.037
A rewriting logic approach to operational semantics, Inf. Comput, vol.207, issue.2, pp.305-340, 2009. ,
Categories in Concurrency, Semantics and Logics of Computation, Publications of the Newton Institute, pp.299-354, 1997. ,
DOI : 10.1017/CBO9780511526619.008