Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Trace theory for automatic hierarchical verification of speed-independent circuits
Trace theory for automatic hierarchical verification of speed-independent circuits
Proceedings of the Fourth Annual Symposium on Logic in computer science
Shared binary decision diagram with attributed edges for efficient Boolean function manipulation
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Algebraic decision diagrams and their applications
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Representation and symbolic manipulation of linearly inductive Boolean functions
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Sizing and verification of communication buffers for communicating processes
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Term rewriting and all that
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Reachability Analysis of Term Rewriting Systems with Timbuk
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
BDD-Nodes Can Be More Expressive
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Efficient Reachability Set Generation and Storage Using Decision Diagrams
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Data Decision Diagrams for Petri Net Analysis
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Rewriting for Cryptographic Protocol Verification
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
An incremental unique representation for regular trees
Nordic Journal of Computing
Reachability Analysis over Term Rewriting Systems
Journal of Automated Reasoning
The saturation algorithm for symbolic state-space exploration
International Journal on Software Tools for Technology Transfer (STTT) - Special section on Tools and Algorithms for the Construction and Analysis of Systems
Hierarchical Set Decision Diagrams and Regular Models
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Building Efficient Model Checkers using Hierarchical Set Decision Diagrams and Automatic Saturation
Fundamenta Informaticae - Petri Nets 2008
Efficient symbolic state-space construction for asynchronous systems
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Rewriting approximations for fast prototyping of static analyzers
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Hierarchical decision diagrams to exploit model structure
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
Equivalence checking of combinational circuits using Boolean expression diagrams
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
This paper proposes the theoretical foundations of a new formal tool for symbolic verification of finite systems. Some approaches reduce the problem of system verification to the reachability problem in term rewriting systems (TRSs). In our approach, states are encoded by terms in a BDD-like manner and the transition relation is represented by a new rewriting relation so called functional term rewriting systems (FTRSs). First, we show that FTRSs are as expressive as TRSs. Second, we present the implementation of our FTRS-based tool as well as optimisations based on local fixpoint computations. Our experiments show that for well-known protocols (e.g., tree arbiter, percolate, leader election protocol,...) our tool is more efficient than other rewriting tools such as Timbuk, Maude or Tom. Moreover, it can also be applied to check invariant properties which are a particular subclass of linear temporal logic (LTL) formula.