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

@article{citeulike:2946475, abstract = {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 solving 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 displayed 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.}, author = {Ohsaki, Hitoshi and Takai, Toshinori}, booktitle = {Proceedings of the 5th International Workshop on Rule-Based Programming (RULE 2004)}, citeulike-article-id = {2946475}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.entcs.2004.07.017}, citeulike-linkout-1 = {http://www.sciencedirect.com/science/article/B75H1-4FJT8PX-7/1/ec0ca2c693d971775094be791dad3b89}, day = {2}, doi = {10.1016/j.entcs.2004.07.017}, journal = {Electronic Notes in Theoretical Computer Science}, keywords = {automata, tree-automata}, month = {March}, number = {1}, pages = {97--111}, posted-at = {2008-07-01 03:47:12}, priority = {2}, title = {ACTAS : A System Design for Associative and Commutative Tree Automata Theory}, url = {http://dx.doi.org/10.1016/j.entcs.2004.07.017}, volume = {124}, year = {2005} }

TY - JOUR ID - citeulike:2946475 L3 - citeulike-article-id:2946475 N2 - 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 solving 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 displayed 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. IS - 1 JF - Electronic Notes in Theoretical Computer Science EP - 111 TI - ACTAS : A System Design for Associative and Commutative Tree Automata Theory VL - 124 T2 - Proceedings of the 5th International Workshop on Rule-Based Programming (RULE 2004) SP - 97 KW - automata KW - tree-automata AU - Ohsaki, Hitoshi AU - Takai, Toshinori PY - 2005/03/02/ UR - http://dx.doi.org/10.1016/j.entcs.2004.07.017 ER -