Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Programming in Prolog
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Bandera: extracting finite-state models from Java source code
Proceedings of the 22nd international conference on Software engineering
Introduction to Formal Hardware Verification: Methods and Tools for Designing Correct Circuits and Systems
Multiway Decision Graphs for Automated Hardware Verification
Formal Methods in System Design
Formal Verification of the Island Tunnel Controller Using Multiway Decision Graphs
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
On the non-termination of MDG-based abstract state enumeration
Theoretical Computer Science
Reachability analysis using multiway decision graphs in the HOL theorem prover
Proceedings of the 2008 ACM symposium on Applied computing
The Why/Krakatoa/Caduceus platform for deductive program verification
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Hi-index | 0.00 |
The combination of state exploration approach (mainly model checking) and deductive reasoning approach (theorem proving) promises to overcome the limitation and to enhance the capabilities of each. In this paper, we are interested in defining a platform for Multiway Decision Graphs (MDGs) in LCF-style theorem prover. We define a platform to represent the MDG operations: conjunction, disjunction, relational product and prune-by-subsumption as a set of inference rules. Based on this platform, the reachability analysis is implemented as a conversion that uses the MDG theory within the HOL theorem prover. Finally, we present some experimental results to show the performance of the MDG operations of our platform.