Rewriting logic: roadmap and bibliography, Theoretical Computer Science, vol.285, issue.2, pp.121-154, 2002. ,
DOI : 10.1016/S0304-3975(01)00357-7
The rewriting logic semantics project, Theoretical Computer Science, vol.373, issue.3, pp.213-237, 2007. ,
DOI : 10.1016/j.tcs.2006.12.018
Symbolic reachability analysis using narrowing and its application to the verification of cryptographic protocols, Higher-Order and Symbolic Computation, pp.123-160, 2007. ,
PATHWAY LOGIC: SYMBOLIC ANALYSIS OF BIOLOGICAL SIGNALING, Biocomputing 2002, pp.400-412, 2002. ,
DOI : 10.1142/9789812799623_0038
All About Maude -A High-Performance Logical Framework, LNCS, vol.4350, 2007. ,
An overview of ELAN, Electr. Notes Theor. Comput. Sci, vol.15, 1998. ,
Logical foundations of CafeOBJ, Theoretical Computer Science, vol.285, issue.2, pp.289-318, 2002. ,
DOI : 10.1016/S0304-3975(01)00361-9
Membership algebra as a logical framework for equational specification, WADT 1997, pp.18-61, 1998. ,
DOI : 10.1007/3-540-64299-4_26
The Maude LTL Model Checker, Electronic Notes in Theoretical Computer Science, vol.71, p.71, 2002. ,
DOI : 10.1016/S1571-0661(05)82534-4
The Temporal Logic of Rewriting: A Gentle Introduction, Concurrency, Graphs and Models, pp.354-382, 2008. ,
DOI : 10.1007/978-3-540-68679-8_22
Unification and Narrowing in Maude 2.4, RTA 2009, pp.380-390, 2009. ,
DOI : 10.1007/3-540-45446-2_27
Symbolic Model Checking of Infinite-State Systems Using Narrowing, RTA 2007, pp.153-168, 2007. ,
DOI : 10.1007/978-3-540-73449-9_13
Equational abstractions, CADE 2003, pp.2-16, 2003. ,
DOI : 10.1007/978-3-540-45085-6_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.183.9812
Introducing the itp tool: a tutorial, J. Universal Computer Science, vol.12, issue.11, pp.1618-1650, 2006. ,
Variant Narrowing and Equational Unification, Electronic Notes in Theoretical Computer Science, vol.238, issue.3, pp.103-119, 2009. ,
DOI : 10.1016/j.entcs.2009.05.015
URL : http://doi.org/10.1016/j.entcs.2009.05.015
Semantic foundations for generalized rewrite theories, Theoretical Computer Science, vol.360, issue.1-3, pp.386-414, 2006. ,
DOI : 10.1016/j.tcs.2006.04.012
URL : http://doi.org/10.1016/j.tcs.2006.04.012
A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties, Theoretical Computer Science, vol.367, issue.1-2, pp.162-202, 2006. ,
DOI : 10.1016/j.tcs.2006.08.035
Vérification d'invariants pour des systèmes spécifiés en logique de réécriture, Studia Informatica Universalis, vol.7, issue.2, pp.317-350, 2009. ,
Verifying Specifications with Proof Scores in CafeOBJ, 21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06), pp.3-10, 2006. ,
DOI : 10.1109/ASE.2006.73
State Machines as Inductive Types, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol.90, issue.12, pp.2985-2988, 2007. ,
DOI : 10.1093/ietfec/e90-a.12.2985
A lightweight integration of theorem proving and model checking for system verification, 12th Asia-Pacific Software Engineering Conference (APSEC'05), pp.59-66, 2005. ,
DOI : 10.1109/APSEC.2005.9
Chocolat/SMV: A Translator from CafeOBJ into SMV, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), pp.416-420, 2005. ,
DOI : 10.1109/PDCAT.2005.98