2 search results - page 1 / 1 » Certifying a Tree Automata Completion Checker |
CADE
2008
Springer
14 years 4 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
CADE
2006
Springer
13 years 8 months ago
2006
Springer
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...