Complete symbolic reachability analysis using back-and-forth narrowing

[1]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[2]  José Meseguer,et al.  A rewriting-based inference system for the NRL protocol analyzer: grammar generation , 2005, FMSE '05.

[3]  Toshinori Takai,et al.  ACTAS : A System Design for Associative and Commutative Tree Automata Theory , 2005, Electron. Notes Theor. Comput. Sci..

[4]  José Meseguer,et al.  Natural Narrowing for General Term Rewriting Systems , 2004, RTA.

[5]  Alexander Bockmayr,et al.  Conditional narrowing modulo a set of equations , 1993, Applicable Algebra in Engineering, Communication and Computing.

[6]  José Meseguer,et al.  Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols , 2007, High. Order Symb. Comput..

[7]  Toshinori Takai,et al.  A Verification Technique Using Term Rewriting Systems and Abstract Interpretation , 2004, RTA.

[8]  Santiago Escobar.  Implementing Natural Rewriting and Narrowing Efficiently , 2004, FLOPS.

[9]  Santiago Escobar.  Refining weakly outermost-needed rewriting and narrowing , 2003, PPDP '03.

[10]  David Monniaux,et al.  Abstracting cryptographic protocols with tree automata , 1999, Sci. Comput. Program..

[11]  Sebastian Mödersheim,et al.  Constraint differentiation: A new reduction technique for constraint-based analysis of security protocols , 2003 .

[12]  Tayssir Touili,et al.  Extrapolating Tree Transformations , 2002, CAV.

[13]  J. Meseguer,et al.  Semantic Models for Distributed Object Reflection , 2002, ECOOP.

[14]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

[15]  Amir Pnueli,et al.  Symbolic model checking with rich assertional languages , 2001, Theor. Comput. Sci..

[16]  Faron Moller,et al.  Verification on Infinite Structures , 2001, Handbook of Process Algebra.

[17]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[18]  Michaël Rusinowitch,et al.  Compiling and Verifying Security Protocols , 2000, LPAR.

[19]  Hiroyuki Seki,et al.  Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability , 2000, RTA.

[20]  Thomas Genet,et al.  Rewriting for Cryptographic Protocol Verification , 2000, CADE.

[21]  Amir Pnueli,et al.  Control and data abstraction: the cornerstones of practical formal verification , 2000, International Journal on Software Tools for Technology Transfer.

[22]  David A. McAllester,et al.  Automated Deduction - CADE-17 , 2000, Lecture Notes in Computer Science.

[23]  Ahmed Bouajjani,et al.  Model Checking Lossy Vector Addition Systems , 1999, STACS.

[24]  Pierre Wolper,et al.  Verifying Systems with Infinite but Regular State Spaces , 1998, CAV.

[25]  Kedar S. Namjoshi,et al.  On model checking for non-deterministic infinite-state systems , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[26]  Hassen Saïdi,et al.  Construction of Abstract State Graphs with PVS , 1997, CAV.

[27]  Rachid Echahed,et al.  Parallel Evaluation Strategies for Functional Logic Languages , 1997, ICLP.

[28]  Tetsuo Ida,et al.  Lazy Narrowing: Strong Completeness and Eager Variable Elimination , 1996, Theor. Comput. Sci..

[29]  Catherine A. Meadows,et al.  The NRL Protocol Analyzer: An Overview , 1996, J. Log. Program..

[30]  Tetsuo Ida,et al.  Lazy Narrowing: Strong Completeness and Eager Variable Elimination , 1995, Theor. Comput. Sci..

[31]  Edmund M. Clarke,et al.  Model checking and abstraction , 1994, TOPL.

[32]  Lawrence Charles Paulson,et al.  Isabelle: A Generic Theorem Prover , 1994 .

[33]  Michael Hanus,et al.  The Integration of Functions into Logic Programming: From Theory to Practice , 1994, J. Log. Program..

[34]  Rachid Echahed,et al.  A needed narrowing strategy , 2000, JACM.

[35]  Aart Middeldorp,et al.  Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract) , 1992, ALP.

[36]  Sergio Antoy.  Definitional Trees , 1992, ALP.

[37]  Aart Middeldorp,et al.  Counterexamples to completeness results for basic narrowing , 1991 .

[38]  I. V. Ramakrishnan,et al.  Programming in equational logic: beyond strong sequentiality , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[39]  Pierre Lescanne,et al.  Algebraic and Logic Programming , 1988, Lecture Notes in Computer Science.

[40]  Claude Kirchner,et al.  Incremental Construction of Unification Algorithms in Equational Theories , 1983, ICALP.

[41]  Leon Sterling,et al.  Meta-Level Inference and Program Verification , 1982, CADE.

[42]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[43]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[44]  Jean-Marie Hullot,et al.  Canonical Forms and Unification , 1980, CADE.

[45]  Mike Paterson,et al.  Linear unification , 1976, STOC '76.