Language definitions as rewrite theories
暂无分享,去创建一个
Grigore Rosu | Dorel Lucanu | Traian-Florin Serbanuta | Andrei Arusoaie | Vlad Rusu | Andrei Stefanescu
[1] Grigore Rosu,et al. Checking reachability using matching logic , 2012, OOPSLA '12.
[2] José Meseguer,et al. Equational abstractions , 2008, Theor. Comput. Sci..
[3] Francisco Durán,et al. On the Church-Rosser and Coherence Properties of Conditional Order-Sorted Rewrite Theories 1 , 2010 .
[4] Grigore Rosu,et al. An overview of the K semantic framework , 2010, J. Log. Algebraic Methods Program..
[5] Patrick Viry,et al. Equational rules for rewriting logic , 2002, Theor. Comput. Sci..
[6] Grigore Rosu,et al. One-Path Reachability Logic , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.
[7] Grigore Rosu,et al. K-Maude: A Rewriting Based Tool for Semantics of Programming Languages , 2010, WRLA.
[8] Grigore Rosu. Matching Logic - Extended Abstract (Invited Talk) , 2015, RTA.
[9] José Meseguer,et al. Rewriting modulo SMT and open system analysis , 2014, J. Log. Algebraic Methods Program..
[10] Nikolaj Bjørner,et al. Z3: An Efficient SMT Solver , 2008, TACAS.
[11] Grigore Rosu,et al. Language Definitions as Rewrite Theories , 2014, WRLA.
[12] José Meseguer,et al. State Space Reduction of Rewrite Theories Using Invisible Transitions , 2006, AMAST.
[13] Dorel Lucanu,et al. A Generic Framework for Symbolic Execution , 2013, SLE.