Conditional rewriting logic as a unified model of concurrency, Theoretical Computer Science, vol.96, issue.1, pp.73-155, 1992. ,
DOI : 10.1016/0304-3975(92)90182-F
All about Maude ? a high-performance logical framework: how to specify, program and verify systems in Rewriting Logic, 2007. ,
Checking reachability using matching logic, OOPSLA, pp.555-574 ,
Towards a unified theory of operational and axiomatic semantics, Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP'12), pp.351-363, 2012. ,
Onepath reachability logic, Proceedings of the 28th Symposium on Logic in Computer Science (LICS'13), pp.358-367, 2013. ,
All-Path Reachability Logic, Proceedings of the Joint 25th International Conference on Rewriting Techniques and Applications and 12th International Conference on Typed Lambda Calculi and Applications (RTA-TLCA'14), pp.425-440, 2014. ,
DOI : 10.1007/978-3-319-08918-8_29
The rewriting logic semantics project, Theoretical Computer Science, vol.373, issue.3, pp.213-237, 2007. ,
DOI : 10.1016/j.tcs.2006.12.018
An executable formal semantics of C with applications, Proceedings of the 39th Symposium on Principles of Programming Languages (POPL'12), pp.533-544, 2012. ,
A Complete Semantics of Java, Proceedings of the 42nd Symposium on Principles of Programming Languages (POPL'15), pp.445-456, 2015. ,
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
Twenty years of rewriting logic, The Journal of Logic and Algebraic Programming, vol.81, issue.7-8, pp.721-781, 2012. ,
DOI : 10.1016/j.jlap.2012.06.003
The Maude LTL Model Checker, Electronic Notes in Theoretical Computer Science, vol.71, pp.162-187, 2004. ,
DOI : 10.1016/S1571-0661(05)82534-4
Model checking linear temporal logic of rewriting formulas under localized fairness, Science of Computer Programming, vol.99, pp.193-234, 2015. ,
DOI : 10.1016/j.scico.2014.02.006
Abstract logical model checking of infinite-state systems using narrowing, 24th International Conference on Rewriting Techniques and Applications, RTA 2013, pp.81-96, 2013. ,
Proving Safety Properties of Rewrite Theories, Algebra and Coalgebra in Computer Science, pp.314-328, 2011. ,
DOI : 10.1007/978-3-642-22944-2_22
Combining Theorem Proving and Narrowing for Rewriting-Logic Specifications, Tests and Proofs, pp.135-150, 2010. ,
DOI : 10.1007/978-3-642-13977-2_12
URL : https://hal.archives-ouvertes.fr/inria-00527864
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
Equational abstractions, Theoretical Computer Science, vol.403, issue.2-3, pp.239-264, 2008. ,
DOI : 10.1016/j.tcs.2008.04.040
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.183.9812
Algebraic simulations, The Journal of Logic and Algebraic Programming, vol.79, issue.2, 2009. ,
DOI : 10.1016/j.jlap.2009.07.003
A Generic Framework for Symbolic Execution, 6th International Conference on Software Language Engineering, pp.281-301, 2013. ,
DOI : 10.1007/978-3-319-02654-1_16
URL : https://hal.archives-ouvertes.fr/hal-00853588
Rewriting Modulo SMT and Open System Analysis, Lecture Notes in Computer Science, vol.8663, pp.247-262, 2014. ,
DOI : 10.1007/978-3-319-12904-4_14
Language Definitions as Rewrite Theories, WRLA, pp.97-113, 2014. ,
DOI : 10.1007/978-3-319-12904-4_5
URL : https://hal.archives-ouvertes.fr/hal-00950775
Decision Procedures for Equationally Based Reasoning, 2008. ,