ACTAS : A System Design for Associative and Commutative Tree Automata Theory

ACTAS is an integrated system for manipulating associative and commutative tree automata (AC-tree automata for short), that has various functions such as for Boolean operations of AC-tree automata, computing rewrite descendants, and solv- ing emptiness and membership problems. In order to deal with high-complexity problems in reasonable time, over- and under-approximation algorithms are also equipped. Such functionality enables us automated verification of safety property in infinite state models, that is helpful in the domain of, e.g. network security, in particular, for security problems of cryptographic protocols allowing an equational property. In runtime of model construction, a tool support for analysis of state space expansion is provided. The intermediate status of the computation is dis- played in numerical data table, and also the line graphs are generated. Besides, a graphical user interface of the system provides us a user-friendly environment for handy use.

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

[2]  Yiannis N. Moschovakis,et al.  Notes On Set Theory , 1994 .

[3]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[4]  Bernard P. Zajac.  Applied cryptography: Protocols, algorithms, and source code in C , 1994 .

[5]  Tadao Kasami,et al.  Solving a Unification Problem under Constrained Substitutions Using Tree Automata , 1994, FSTTCS.

[6]  Hiroyuki Seki,et al.  Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism , 2003, RTA.

[7]  Hiroyuki Seki,et al.  Layered Transducing Term Rewriting System and Its Recognizability Preserving Property , 2002, RTA.

[8]  Hitoshi Ohsaki,et al.  Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories , 2001, CSL.

[9]  Yannick Chevalier,et al.  Automated Unbounded Verification of Security Protocols , 2002, CAV.

[10]  Sebastian Mödersheim,et al.  The AVISS Security Protocol Analysis Tool , 2002, CAV.

[11]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[12]  Valérie Viet Triem Tong,et al.  Reachability Analysis of Term Rewriting Systems with Timbuk , 2001, LPAR.

[13]  Benjamin C. Pierce,et al.  Regular expression types for XML , 2000, TOPL.

[14]  Toshinori Takai,et al.  Decidability and Closure Properties of Equational Tree Languages , 2002, RTA.

[15]  Toshinori Takai,et al.  A Tree Automata Theory for Unification Modulo Equational Rewriting , 2002 .

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