Abed, Sa’ed, Mokhtari, Yassine, Ait-Mohamed, Otmane and Tahar, Sofiène (2011) NuMDG: A New Tool for Multiway Decision Graphs Construction. Journal of Computer Science and Technology, 26 (1). pp. 139-152. ISSN 1000-9000
Preview |
Text (application/pdf)
220kBJCST-2011.pdf - Accepted Version |
Official URL: http://dx.doi.org/10.1007/s11390-011-9421-x
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 uninterpreted 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.
| Divisions: | Concordia University > Gina Cody School of Engineering and Computer Science > Electrical and Computer Engineering |
|---|---|
| Item Type: | Article |
| Refereed: | Yes |
| Authors: | Abed, Sa’ed and Mokhtari, Yassine and Ait-Mohamed, Otmane and Tahar, Sofiène |
| Journal or Publication: | Journal of Computer Science and Technology |
| Date: | 2011 |
| Digital Object Identifier (DOI): | 10.1007/s11390-011-9421-x |
| Keywords: | infinite state model checking multiway decision graphs uninterpreted functions |
| ID Code: | 977361 |
| Deposited By: | Danielle Dennie |
| Deposited On: | 14 Jun 2013 13:35 |
| Last Modified: | 18 Jan 2018 17:44 |
References:
Bryant R E. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, Aug. 1986, 35(8): 677–691.Corella F, Zhou Z, Song X, Langevin M, Cerny E. Multiway decision graphs for automated hardware verification. Formal Methods in System Design, Feb. 1997, 10(1): 7–46.
Tahar S, Song X, Cerny E, Zhou Z, Langevin M, Ait Mohamed O. Modelling and automatic verification of the fairisle ATM switch fabric using MDGs. IEEE Transactions on CAD of Integrated Circuits and Systems, Jul. 1999, 18(17): 955–972.
Xu Y, Song X, Cerny E, Ait Mohamed O. Model checking for a first-order temporal logic using multiway decision graphs (MDGs). The Computer Journal, 2004, 47(1): 71–84.
Zhou Z. Multiway decision graphs and their applications in automatic formal verification of RTL designs [Ph.D. Dissertation]. Universite de Montreal, Canada, 1997.
Mokhtari Y, Abed S, Ait Mohamed O, Tahar S, Song X. A new approach for the construction of multiway decision graphs. In Proc. the 5th International Colloquium on Theoretical Aspects of Computing, Istanbul, Turkey, Sept. 1-3, 2008, pp. 228–242.
Fontaine P, Gribomont E P. Using BDDs with combinations of theories. In Proc. the 9th International Conference on Logic for Programming and Automated Reasoning (LPAR), Tbilisi, Geogia, Oct. 14-18, 2002, pp. 190–201.
Goel A, Sajid K, Zhou H, Aziz A, Singhal V. BDD based procedures for a theory of equality with uninterpreted functions. Form. Methods Syst. Des., 2003, 22(3): 205–224.
Burch J R, Dill D L. Automatic verification of pipelined microprocessor control. In Proc. Int. Conf. Computer-Aided Verification, Stanford, USA, Jan. 21-23, 1994, pp. 68–80.
Damm W, Pnueli A, Ruah S. Herbrand automata for hardware verification. In Proc. the 9th International Conference on Concurrency Theory (CONCUR1998), Nice, France, Sept. 8-11, 1998, pp. 67–83.
Berezin S, Biere A, Clarke E, Zhu Y. Combining symbolic model checking with uninterpreted functions for out-of-order processor verification. In Proc. the Second International Conference on Formal Methods in Computer-Aided Design (FMCAD1998), Palo Alto, USA, Nov. 4-6, 1998, pp. 369–386.
Hojati R, Dill D L, Brayton R K. Verifying linear temporal properties of data insensitive controllers using finite instantiations. In Proc. the IFIP TC10 WG10.5 International Conference on Hardware Description Languages and Their Applications : Specification, Modelling, Verification and Synthesis of Microelectronic Systems (CHDL1997), London, UK, 1997, pp. 60–73.
Bryant R, German S, Velev M. Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic. ACM Trans. Comput. Logic, 2001, 2(1): 93–134.
Velev M N, Bryant R E. Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. J. Symb. Comput., 2003, 35(2): pp. 73–106.
Velev M. Using automatic case splits and efficient CNF translation to guide a SAT-solver when formally verifying out-of-order processors. In Proc. Artificial Intelligence and Mathematics (AI&MATH), Fort Lauderdale, USA, Jan. 4-6, 2004, pp. 242–254.
Ackermann W. Solvable Cases of the Decision Problem. North-Holland Pub. Co., 1954.
Pnueli A, Rodeh Y, Shtrichman O, Siegel M. Deciding equality formulas by small domains instantiations. In Proc. the 11th International Conference on Computer Aided Verification (CAV1999), Trento, Italy, Jul. 6-10, 1999, pp. 455–469.
Rodeh Y, Shtrichman O. Finite instantiations in equivalence logic with uninterpreted functions. In Proc. the 13th International Conference on Computer Aided Verification (CAV2001), Paris, France, Jul. 18-22, 2001, pp. 144–154.
Bryant R E, German S M, Velev M N. Exploiting positive equality in a logic of equality with uninterpreted functions. In Proc. the 11th International Conference on Computer Aided Verification (CAV 1999), Trento, Italy, Jul. 6-10, 1999, pp. 470–482.
Lahiri S K, Bryant R E, Bryant A E, Goel A, Talupur M. Revisiting positive equality. In Proc. Tools and Algorithms for the Construction and Analysis of Systems, Barcelona, Spain, Mar. 29-Apr. 2, 2004, pp. 1–15.
Peled D. Combining partial order reductions with on-the-fly model-checking. In Proc. the 6th International Conference on Computer Aided Veri¯cation (CAV1994), Stanford, USA, Jun. 1-23, 1994, pp. 377–390.
Kurshan R P, Levin V, Minea M, Peled D, Yenigün, H. Static partial order reduction. In Proc. the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS 1998), Lisbon, Portugal, Mar. 28-Apr. 4, 1998, pp. 345–357.
Velev M. Using rewriting rules and positive equality to formally verify wide-issue out-of-order microprocessors with a reorder buffer. In Proc. The Conference on Design, Automation and Test in Europe (DATE2002), Paris, France, Mar. 4-8, 2002, p. 28.
Clocksin W, Mellish C. Programming in Prolog. Springer Verlag, 1987,
Bahar R, Frohm E, Gaona C, Hachtel G, Macii E, Pardo A, Somenzi F. Algebraic decision diagrams and their applications. In Proc. IEEE/ACM International Conference on Computer Aided Design, Santa Clara, California, Nov. 7-11, 1993, pp. 188–191.
Cimatti A, Clarke E M, Giunchiglia E, Giunchiglia F, Pistore M, Roveri M, Sebastiani R, Tacchella A. NuSMV 2: An opensource tool for symbolic model checking. In Proc. the 14th International Conference on Computer Aided Verification (CAV2002), Copenhagen, Denmark, Jul. 27-31, 2002, pp. 359–364.
Ait-Mohamed O, Song X, Cerny E. On the non-termination of MDG-based abstract state enumeration. Theoretical Computer Science, 2003, 300(1-3): 161–179.
Zhou Z, Song X, Tahar S, Cerny E, Corella F, Langevin M. Formal verification of the island tunnel controller using multiway decision graphs. In Proc. the First International Conference on Formal Methods in Computer-Aided Design (FMCAD1996), Palo Alto, USA, Nov. 6-8, 1996, pp. 233–247.
Ait-Mohamed O, Cerny E, Song X. MDG-based verification by retiming and combinational transformations. In Proc. the 8th Great Lakes Symposium on VLSI, Lafayette, USA, Feb. 1998, pp. 356–361.
Chen H, Hsiang J. Recurrence domains: Their unification and application to logic programming. Inform. and Comput., 1995, 122(1): 45–69.
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.
Repository Staff Only: item control page
Download Statistics
Download Statistics