Reachability Analysis of Term Rewriting Systems with Timbuk
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
On Name Generation and Set-Based Analysis in the Dolev-Yao Model
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Decidability and Closure Properties of Equational Tree Languages
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Abstracting cryptographic protocols with tree automata
Science of Computer Programming - Special issue on static analysis (SAS'99)
Strategy for Verifying Security Protocols with Unbounded Message Size
Automated Software Engineering
A decision procedure for the verification of security protocols with explicit destructors
Proceedings of the 11th ACM conference on Computer and communications security
Reachability Analysis over Term Rewriting Systems
Journal of Automated Reasoning
Closure properties and decision problems of dag automata
Information Processing Letters
Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
Information Processing Letters
Deriving the type flaw attacks in the Otway-Rees protocol by rewriting
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Injective synchronisation: an extension of the authentication hierarchy
Theoretical Computer Science - Automated reasoning for security protocol analysis
A rewriting-based inference system for the NRL Protocol analyzer and its meta-logical properties
Theoretical Computer Science - Automated reasoning for security protocol analysis
Complete symbolic reachability analysis using back-and-forth narrowing
Theoretical Computer Science - Algebra and coalgebra in computer science
Higher-Order and Symbolic Computation
Alternating two-way AC-tree automata
Information and Computation
IEEE Transactions on Computers
Transducer-based analysis of cryptographic protocols
Information and Computation
On the relationships between models in protocol verification
Information and Computation
A theoretical limit for safety verification techniques with regular fix-point computations
Information Processing Letters
Visibly Pushdown Languages and Term Rewriting
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Finer Is Better: Abstraction Refinement for Rewriting Approximations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Combining Equational Tree Automata over AC and ACI Theories
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Towards an Efficient Implementation of Tree Automata Completion
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Certifying a Tree Automata Completion Checker
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Handling Left-Quadratic Rules When Completing Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives
Electronic Notes in Theoretical Computer Science (ENTCS)
TAGED Approximations for Temporal Properties Model-Checking
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
How to Tackle Integer Weighted Automata Positivity
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
A Syntactic Criterion for Injectivity of Authentication Protocols
Electronic Notes in Theoretical Computer Science (ENTCS)
Formalizing and Analyzing the Needham-Schroeder Symmetric-Key Protocol by Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated Security Protocol Analysis With the AVISPA Tool
Electronic Notes in Theoretical Computer Science (ENTCS)
Closure properties and decision problems of dag automata
Information Processing Letters
Approximation-based tree regular model-checking
Nordic Journal of Computing
Pattern-based abstraction for verifying secrecy in protocols
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Integrating verification, testing, and learning for cryptographic protocols
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Rewriting approximations for fast prototyping of static analyzers
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Rigid tree automata and applications
Information and Computation
Functional term rewriting systems towards symbolic model-checking
International Journal of Critical Computer-Based Systems
Characterizing conclusive approximations by logical formulae
RP'11 Proceedings of the 5th international conference on Reachability problems
Handling exp, χ (and timestamps) in protocol analysis
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Handling algebraic properties in automatic analysis of security protocols
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Tree automata with equality constraints modulo equational theories
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Regular protocols and attacks with regular knowledge
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Complete symbolic reachability analysis using back-and-forth narrowing
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Feasible trace reconstruction for rewriting approximations
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Rewriting approximations for properties verification over CCS specifications
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Security protocol verification: symbolic and computational models
POST'12 Proceedings of the First international conference on Principles of Security and Trust
From linear temporal logic properties to rewrite propositions
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Equational abstraction refinement for certified tree regular model checking
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
| Hi-index | 0.00 |