NuMDG: a new tool for multiway decision graphs construction

Authors:
Sa'ed Abed;Yassine Mokhtari;Otmane Ait-Mohamed;Sofiène Tahar
Affiliations:
Department of Computer Engineering, Hashemite University, Zarqa, Jordan;Department of Electrical and Computer Engineering, Concordia University, Montreal, Canada;Department of Electrical and Computer Engineering, Concordia University, Montreal, Canada;Department of Electrical and Computer Engineering, Concordia University, Montreal, Canada
Venue:
Journal of Computer Science and Technology - Special issue on natural language processing
Year:
2011

Citing 26
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Programming in Prolog

Programming in Prolog
Recurrence domains: their unification and application to logic programming

Information and Computation
Algebraic decision diagrams and their applications

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Verifying linear temporal properties of data insensitive controllers using finite instantiations

CHDL'97 Proceedings of the IFIP TC10 WG10.5 international conference on Hardware description languages and their applications : specification, modelling, verification and synthesis of microelectronic systems: specification, modelling, verification and synthesis of microelectronic systems
Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic

ACM Transactions on Computational Logic (TOCL)
Multiway Decision Graphs for Automated Hardware Verification

Formal Methods in System Design
BDD Based Procedures for a Theory of Equality with Uninterpreted Functions

Formal Methods in System Design
Using BDDs with Combinations of Theories

LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
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
Combining Symbolic Model Checking with Uninterpreted Functions for Out-of-Order Processor Verification

FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
Static Partial Order Reduction

TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Herbrand Automata for Hardware Verification

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Deciding Equality Formulas by Small Domains Instantiations

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
NuSMV 2: An OpenSource Tool for Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Combining Partial Order Reductions with On-the-fly Model-Checking

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Automatic verification of Pipelined Microprocessor Control

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Exploiting Positive Equality in a Logic of Equality with Uninterpreted Functions

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Finite Instantiations in Equivalence Logic with Uninterpreted Functions

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors

Journal of Symbolic Computation
On the non-termination of MDG-based abstract state enumeration

Theoretical Computer Science
MDG-based Verification by Retiming and Combinational Transformations

GLS '98 Proceedings of the Great Lakes Symposium on VLSI '98
Using Rewriting Rules and Positive Equality to Formally Verify Wide-Issue Out-of-Order Microprocessors with a Reorder Buffer

Proceedings of the conference on Design, automation and test in Europe
Multiway decision graphs and their applications in automatic formal verification of rtl designs

Multiway decision graphs and their applications in automatic formal verification of rtl designs
A New Approach for the Construction of Multiway Decision Graphs

Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Modeling and formal verification of the Fairisle ATM switch fabric using MDGs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multiway Decision Graphs (MDGs) are a canonical representation of a subset of many-sorted first-order logic. This subset generalizes the logic of equality with abstract types and uninterpreted function symbols. The distinction between abstract and concrete sorts mirrors the hardware distinction between data path and control. Here we consider ways to improve MDGs construction. Efficiency is achieved through the use of the Generalized-If-Then-Else (GITE) commonly operator in Binary Decision Diagram packages. Consequently, we review the main algorithms used for MDGs verification techniques. In particular, Relational Product and Pruning by Subsumption are algorithms defined uniformly through this single GITE operator which will lead to a more efficient implementation. Moreover, we provide their correctness proof. This work can be viewed as a way to accommodate the ROBBD algorithms to the realm of abstract sorts and un interpreted functions. The new tool, called NuMDG, accepts an extended SMV language, supporting abstract data sorts. Finally, we present experimental results demonstrating the efficiency of the NuMDG tool and evaluating its performance using a set of benchmarks from the SMV package.