Approximation-based tree regular model-checking

Authors:
Y. Boichut;P.-C. Héam;O. Kouchnarenko
Affiliations:
LIFO, Université d'Orléans, Orleans Cedex 2, France;LSV, INRIA-CNRS, ENS de Cachan, Cachan, France;LIFC, INRIA-CASSIS, Besançon, France
Venue:
Nordic Journal of Computing
Year:
2008

Citing 46
Cited 5

Deterministic tree pushdown automata and monadic tree rewriting systems

Journal of Computer and System Sciences
A generic approach to the static analysis of concurrent programs with procedures

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Security Analysis of a Probabilistic Non-repudiation Protocol

PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols

FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Representing and Approximating Transfer Functions in Abstract Interpretation of Hetereogeneous Datatypes

SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Regular Sets of Descendants by Some Rewrite Strategies

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Decidable Approximations of Term Rewriting Systems

RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Verifying Systems with Infinite but Regular State Spaces

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Liveness and Acceleration in Parameterized Verification

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Extrapolating Tree Transformations

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Symbolic Verification of Communication Protocols with Infinite State Spaces Using QDDs (Extended Abstract)

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Rewriting for Cryptographic Protocol Verification

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Bottom-Up Tree Pushdown Automata and Rewrite Systems

RTA '91 Proceedings of the 4th International Conference on Rewriting Techniques and Applications
Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Athena: a New Efficient Automatic Checker for Security Protocol Analysis

CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules

CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Protocol Insecurity with Finite Number of Sessions is NP-Complete

CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Automated analysis of cryptographic protocols using Mur/spl phi/

SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Multiset rewriting and the complexity of bounded security protocols

Journal of Computer Security
Reachability Analysis over Term Rewriting Systems

Journal of Automated Reasoning
Tree automata with one memory set constraints and cryptographic protocols

Theoretical Computer Science - Automata, languages and programming
An NP decision procedure for protocol insecurity with XOR

Theoretical Computer Science
Computer-assisted verification of a protocol for certified email

Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Decision Procedures for the Security of Protocols with Probabilistic Encryption against Offline Dictionary Attacks

Journal of Automated Reasoning
Permutation rewriting and algorithmic verification

Information and Computation
A framework for security analysis of mobile wireless networks

Theoretical Computer Science - Automated reasoning for security protocol analysis
Intruder deduction for the equational theory of Abelian groups with distributive encryption

Information and Computation
A survey of algebraic properties used in cryptographic protocols

Journal of Computer Security
Equational Cryptographic Reasoning in the Maude-NRL Protocol Analyzer

Electronic Notes in Theoretical Computer Science (ENTCS)
Reachability Analysis of Synchronized PA Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Static Validation of a Voting Protocol

Electronic Notes in Theoretical Computer Science (ENTCS)
An Optimized Intruder Model for SAT-based Model-Checking of Security Protocols

Electronic Notes in Theoretical Computer Science (ENTCS)
Abstract Regular Tree Model Checking

Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of programs with half-duplex communication

Information and Computation
Easy intruder deduction problems with homomorphisms

Information Processing Letters
Security properties: two agents are sufficient

ESOP'03 Proceedings of the 12th European conference on Programming
Rewriting approximations for fast prototyping of static analyzers

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Handling exp, χ (and timestamps) in protocol analysis

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Combining intruder theories

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Handling algebraic properties in automatic analysis of security protocols

ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Analysis of an electronic voting protocol in the applied pi calculus

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
The AVISPA tool for the automated validation of internet security protocols and applications

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Regular protocols and attacks with regular knowledge

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Feasible trace reconstruction for rewriting approximations

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Regular Tree Languages And Rewrite Systems

Fundamenta Informaticae

TAGED Approximations for Temporal Properties Model-Checking

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Characterizing conclusive approximations by logical formulae

RP'11 Proceedings of the 5th international conference on Reachability problems
Rewriting approximations for properties verification over CCS specifications

FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
From linear temporal logic properties to rewrite propositions

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
A completion algorithm for lattice tree automata

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the following general problem of tree regular model-checking: decide whether R*(L) ∩ Lp = θ where R* is the reflexive and transitive closure of a successor relation induced by a term rewriting system R, and L and Lp are both regular tree languages. We develop an automatic approximation-based technique to handle this - undecidable in general - problem in most practical cases, extending a recent work by Feuillade, Genet and Viet Triem Tong. We also make this approach fully automatic for practical validation of security protocols.