Constraint-based verification

Constraint-Based Verification

Volumn , Issue , 2006, Pages 1-253

  Yuan, Jun ^a   Pixley, Carl ^b   Aziz, Adnan ^c  

^a Atrenta Inc   (United States)

^b SYNOPSYS INC   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84895248451     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/0-387-30784-2     Document Type: Book

References (209)

1. A. Aggoun, F. Bueno, M. Carro, P.Deransart, M. Fabris, W.Drabent, G. Ferrand, M. Hermenegildo, C. Lai, J. Lloyd, J. Maluszynski, G. Puebla, and A. Tessier. CP Debugging Needs and Tools. In International Workshop on Automated Debugging, pages 103-122, 1997.
2. G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowicz, and R. Sebastiani. A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions. In In Proceedings of the 18th International Conference on Automated Deduction (CADE-18), part of Federated Logic Conference (FLoC'02). Springer-Verlag, 2002.
3. A. Aharon, A. Bar-David, B. Dorfman, E. Gofman, M. Leibowitz, and V. Schwartzburd. RTPG-A Dynamic Biased Pseudo-Random Test Program Generator for Processor Verification. In IBM Technical Report 88.290, July 1990.
4. A. Aharon, A. Bar-David, B. Dorfman, E. Gofman, M. Leibowitz, and V. Schwartzburd. Verification of the IBMRISC System/6000 by aDynamic Biased Pseudo-random Test Program Generator. In IBMSystems Journal, volume 30(4), pages 527-538, July 1991.
5. Y. Abarbanel, I. Beer, L. Gluhovsky, S. Keidar, and Y. Wolfsthal. FoCs: Automatic Generation of Simulation Checkers from Formal Specifications. In Proceedings of the Computer Aided Verification Conference (CAV), volume 1855, pages 538-542, 2000.
6. Accellera. Open Verification Library Assertion Monitor Reference Manual. June 2003.
7. Accellera. SystemVerilog 3.1 Language Reference Manual. 2003.
8. Accellera. PSL 1.1 LRM. June 2004.
9. G. Audemard, A. Cimatti, A. Kornilowicz, and R. Sebastiani. Bounded Model Checking for Timed Systems. In In Proceedings of the 22nd Joint International Conference on Formal Techniques for Networked and Distributed Systems (FORTE 2002). Springer-Verlag, November 2002.
10. S. B. Akers. Binary Decision Diagrams. In IEEE Transactions on Computers, volume C-37, pages 509-516, June 1978.
11. F.A. Aloul, A. Ramani, I.L. Markov, and K.A. Sakallah. Generic ILP versus Specialized 0-1 ILP: An Update. In Proceedings of the Design Automation Conference (DAC), pages 450-457, June 2002.
12. F.A. Aloul and K.A. Sakallah. An Experimental Evaluation of Conflict Diagnosis and Recursive Learning in Boolean Satisfiability . In Proceedings of International Workshop on Logic Synthesis, 2000.
13. A. Aziz, V. Singhal, G. M. Swamy, and R. K. Brayton. Minimizing Interacting Finite State Machines: A Compositional Approach to the Language Containment Problem. In Proceedings of International Conference on Computer Design (ICCD), pages 255-261, October 1994.
14. A. Aziz, S. Tasiran, and R. K. Brayton. BDD Variable Ordering for Interacting Finite State Machines. In Proceedings of the Design Automation Conference (DAC), June 1994.
15. P. Barth. A Davis-Putnam based Enumeration Algorithm for Linear Pseudo-Boolean Optimization. In Technical Report MPI-I-95-2-003, Max-Planck-Institut Fur Informatik, 1995.
16. P. Barth. Logic-Based 0-1 Constraint Solving in Constraint Logic Programming. Kluwer, 1995.
17. P. Barth and A. Bockmayr. Finite domain and cutting plane techniques in CLP(PB). In L. Sterling, editor, Proceedings of ICLP'95, pages 133-147. MIT Press, 1995.
18. C. Barrett and S. Berezin. CVC Lite: A New Implementation of the Cooperating Validity Checker. In Proceedings of the Computer Aided Verification Conference (CAV), 2004.
19. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P.V. Rossum, S. Schulz, and R. Sebastiani. Mathsat: Tight Integration of SAT and Mathematical Decision Procedures. In Journal of Automated Reasoning, Special Issue on SAT. Springer-Verlag, 2005.
20. R.E. Bryant and Y.-A. Chen. Verification of Arithmetic Circuits with Binary Moment Diagrams. In Proceedings of the Design Automation Conference (DAC), pages 534-541, June 1995.
21. J. R. Burch, E. M. Clarke, K. L. McMillan, and D. L. Dill. Symbolic Model Checking: States and Beyond. In Information and Computation, volume 98(2), pages 142-170, 1992.
22. M. Blum, A. Chandra, and M. Wegman. Equivalence of Free Boolean Graphs Can Be Decided Probabilistically in Polynomial Time. In Information Processing Letters, pages 10:80-82, 1980.
23. V. Bertacco and M. Damiani. The Disjunctive Decomposition of Logic Functions. In Proceedings of International Conference on Computer-Aided Design (ICCAD), pages 78-82, 1997.
24. R. Brinkmann and R. Drechsler. RTL-Datapath Verification using Integer Linear Programming. In ASP-DAC '02: Proceedings of the 2002 conference on Asia South Pacific design automation/VLSI Design, 2002.
25. D. Bochmann, F. Dresig, and B. Steinbach. A New Decomposition Method forMultilevel Circuit Design. In Proceedings of European Design Automation Conference (EURO-DAC), pages 374-377, 1991.
26. S. Bose and A. Fisher. Verifying Pipelined Hardware using Symbolic Logic Simulation. In Proceedings of International Conference on Computer Design (ICCD), pages 217-221, 1989.
27. R. I. Bahar, E. A. Frohm, C. M. Gaona, G. D. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Algebraic Decision Diagrams and their Applications . In Proceedings of International Conference on Computer-Aided Design (ICCAD), pages 188-192, 1993.
28. R.I. Bahar, E.A. Frohm, C.M. Gaona, G.D. Hachtel, E. Marcii, A. Pardo, and F. Somenzi. Algebraic Decision Diagrams and their Applications. In Proceedings of International Conference on Computer-Aided Design (ICCAD), pages 188-191, November 1993.
29. D.Bustan, D. Fisman, and J. Havlicek. AutomataConstruction for PSL. Technical report, TheWeizmann Institute of Science, 2005. Technical ReportMCS05-04.
30. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On theDesirability of Acyclic Database Schemes. In J. ACM, volume 30(3), pages 479-513, 1983.
31. A. Biere, A. Gimatti, E. Clarke, and Y. Zhu. Symbolic Model Checking without BDDs. In Proceedings of Tools for Algorithms for Construction and Analysis of Systems (TACAS), pages 193-207. Springer-Verlag, March 1999.
32. R. K. Brayton, G. D. Hachtel, A. Sangiovanni-Vincentelli, F. Somenzi, A. Aziz, S.-T. Cheng, S. Edwards, S. Khatri, Y. Kukimoto, A. Pardo, S. Qadeer, R. K. Ranjan, S. Sarwary, T. R. Shiple, G. Swamy, and T. Villa. VIS: A system for Verification and Synthesis. In Proceedings of the Computer Aided Verification Conference (CAV), July 1996.
33. A. Blake. Canonical Expressions in Boolean Algebra. PhD thesis, University of Chicago, 1938.
34. Bluespec. 2005. http://www.bluespec.com.
35. B. Bollig, M.Lobbing, and I.Wegener. Simulated annealing to improve variable orderings for OBDDs. In Proceedings of International Workshop on Logic Synthesis, pages 5b:5.1-5.10, 1995.
36. R. S. Boyer and J. S. Moore. A Computational Logic Handbook. Academic Press, New York, 1988.
37. T. Bengtsson, A. Martinelli, and E. Dubrova. A Fast Heuristic Algorithm for DisjointDecomposition of Boolean Functions. In Proceedings of International Workshop on Logic Synthesis, pages 51-55, 2002.
38. L. Baptista and J.P. Marques-Silva. Using Randomization and Learning to Solve Hard Real-world Instances of Satisfiability. In Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming (CP 00), September 2000.
39. A. Borning, K. Marriott, P. Stuckey, and Y. Xiao. Solving Linear Arithmetic Constraints for User Interface Applications. In Proceedings of UIST 97, pages 87-96, 1997.
40. K. M. Butler, D. E. Ross, R. Kapur, and M. R. Mercer. Heuristics to Compute Variable Ordering for the Efficient Manipulation of Binary Decision Diagrams. In Proceedings of the Design Automation Conference (DAC), pages 417-420, June 1991.
41. R. Bryant. Graph-based Algorithms for Boolean Function Manipulation. In IEEE Transactions on Computers, volume C-35, pages 677-691, August 1986.
42. R. E. Bryant. Formal Verification of Memory Circuits by Switch Level Simulation. In IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, volume 10, No. 1, pages 94-102, January 1991.
43. R.E. Bryant. On the Complexity of VLSI Implementations and Graph Representation of Boolean Functions with Applications to Integer Multiplication. In IEEE Transactions on Computers, volume 40(2), pages 205-213, February 1991.
44. M. Butts. 10 , 100 and 1000 speed-ups in computers:What constraints change in CAD? In Proceedings of International Conference on Computer-Aided Design (ICCAD), 1989. Presented at the Panel Session 2.
45. J.R. Buchi. On a Decision Method in Restricted Second Order Arithmetic In International Congress on Logic, Methodology, and Philosophy of Science, pages 1-11, 1960.
46. CADENCE. Verilog-XL User Reference.
47. O. Coudert, C. Berthet, and J. C. Madre. Verification of Sequential Machines Using Functional Boolean Vectors. In Proceedings of the IFIP International Workshop, Applied Formal Methods for Correct VLSI Design, November 1989.
48. E. M. Clarke and E. A. Emerson. Design and Synthesis of Synchronization Skeletons Using Branching Time Logic. In Proceedings of Workshop on Logic of Programs, volume 131 of Lecture Notes in Computer Science, pages 52-71. Springer-Verlag, 1981.
49. E.M. Clarke, M. Fijita, and X. Zhao. Hybrid Decision Diagrams -Overcoming the Limitations of MTBDDs and BMDs. In Proceedings of International Conference on Computer-Aided Design (ICCAD), pages 159-163, 1995.
50. B. Cherkassky and A. Goldberg. Negative-Cycle Detection Algorithms. In Mathematical Programming, pages 277-311, 1999.
51. E.M.Clarke, S.M. German, and X.Zhao. Verifying the SRTDivisionAlgorithm Using Theorem Proving Techniques. In Proceedings of the Computer Aided Verification Conference (CAV), pages 111-122. Springer-Verlag, 1996.
52. K.-C. Chen. Boolean Matching Based on Boolean Unification. In Proceedings of European Conference on Design Automation (EDAC), pages 346-351, 1993.
53. A. K. Chandra and V. S. Iyengar. Constraint Solving for Test Case Generation -A Technique for High Level Design Verification. In Proceedings of International Conference on Computer Design (ICCD), pages 245-248, 1992.
54. H. Crowder, E.L. Johnson, and M. Padberg. Solving Large-scale Zero-one Liner Programming Problems. In Operations Research, volume 31(5), pages 803-834, 1983.
55. D. Chai and A. Kuehlmann. A fast pseudo-boolean constraint solver. In Proceedings of the Design Automation Conference (DAC), pages 830-835, 2003.
56. O. Coudert and J.C. Madre. AUnified Framework for the FormalVerification of Sequential Circuits. In Proceedings of International Conference on Computer-Aided Design (ICCAD), pages 126-129, November 1990.
57. O. Coudert and J.C. Madre. Implicit and Incremental Computation of Primes and Essential Primes of Boolean Functions. In Proceedings of the Design Automation Conference (DAC), pages 36-39, 1992.
58. K. Claessen and J. Martensson. An Operational Semantics for Weak PSL. In Proceedings of the Formal Methods in CAD Conference (FMCAD), pages 337-351. Wiley, 2004.
59. O. Coudert, J.C. Madre, H. Fraisse, and H. Touati. Implicit Prime Cover Computation: An Overview. In Proceedings of Synthesis and Simulation Meeting and International Interchange (SASIMI), 1993.
60. E.M. Clarke, K. McMillan, X. Zhao, M. Fujita, and J. Yang. Spectral Transforms for Large Boolean Functions with Applications to Technology Mapping. InProceedings of theDesignAutomationConference (DAC), pages 54-60, June 1993.
61. S.A. Cook. The Complexity of Theorem Proving Procedures. In Third Annual ACM SIGACT Symposium on the Theory of Computing, pages 151-158, 1971.
62. W. Cook C.R. Coullard and G. Turan. On the complexity of cutting plane proofs. In Discrete Applied Mathematics, volume 18, pages 25-38, 1987.
63. R. Davis. Diagnostic reasoning based on structure and behavior. In Artificial Intelligence, volume 24, pages 347-410, 1984.
64. R. Drechsler, B. Becker, and G'ockel. Agenetic algorithmfor variable ordering ofOBDDs. InProceedings of InternationalWorkshop on Logic Synthesis, pages 5c:5.55-5.64, 1995.
65. R. Drechsler, B. Beker, and S. Ruppertz. K*BMDs: A New Data Structure for Verification. In The European Design and Test Conference, spring 1996.
66. S. Dudani, C. Eisner, D. Fisman, H. Foster, J. Havlicek, J. Lu, E. Marschner, J. Martensson, A. Sarkar, and B. Tabbara. Accellera FVTC Alignment Sub-Committee Final Report. In Accellera, February 2004.
67. M. Daniele, F. Giunchiglia, and M.Y. Vardi. Improved Automata Generation for Linear Temporal Logic. In N. Halbwachs and D. Peled, editors, Proceedings of the Computer Aided Verification Conference (CAV), volume 1633 of Lecture Notes in Computer Science, pages 249-260. Springer-Verlag, December 1999.
68. M. Davis, G. Logemann, and D. Loveland. A Machine Program for Theorem-Proving. In Communucations of ACM, volume 5(7), pages 394-397, 1962.
69. L. de Moura, H. Rue, and M. Sorea. Lazy Theorem Proving for Bounded Model Checking over Infinite Domains. In Proceedings of CADE, 2002.
70. E. V. Dubrova, J. C. Muzio, and B. von Stengel. Finding Composition Trees for Multiple-valued Functions. In Proceedings of the 27th International Symposium on Multiple-Valued Logic (ISMVL '97), pages 19-26, 1997.
71. M. Davis and H. Putnam. A Computing Procedure for Quantification Theory. In Journal of ACM, volume 7, pages 201-214, 1960.
72. N. Een and A. Biere. Effective Preprocessing in SAT Through Variable and Clause Elimination. In SAT, 2005.
73. E. A. Emerson and E. M. Clarke. Characterizing Correctness Properties of Parallel Programs as Fixpoints. In Proceedings of the 7th International Colloquium on Automata, Languages, and Programming, number 85 in Proceedings of IEEE Symposium on Logic in Computer Science. Springer-Verlag, 1981.
74. E. A. Emerson and C. L. Lei. Modalities forModel Checking: Branching Time Strikes Back. In Proceedings of ACM Symposium on Principles of Programming Languages, pages 84-96, 1985.
75. E. A. Emerson and C. L. Lei. Efficient Model Checking in Fragments of the Propositional Mu-Calculus(Extended Abstract). In Proceedings of IEEE Symposium on Logic in Computer Science, pages 267-278, 1986.
76. E. A. Emerson. Temporal and Modal Logic. In J. van Leeuwen, editor, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pages 996-1072. Elsevier Science, 1990.
77. Karem A. Sakallah, Fadi A. Aloul, Igor L. Markov. MINCE: A static global variable-ordering for SAT and BDD. In Proceedings of InternationalWorkshop on Logic Synthesis, June 2001.
78. F. Fallah, S. Devadas, and K. Keutzer. Functional Vector Generation for HDL Models Using Linear Programming and 3-Satifiability. In Proceedings of the Design Automation Conference (DAC), 1998.
79. J. Freeman, R. Duerden, C. Taylor, and M. Miller. The 68060 microprocessor functional design and verification methodology. In On-Chip Systems Design Conference, pages 10.1-10.14, 1995.
80. H.D. Foster, A.C. Krolnik, and D.J. Lacey. Assertion-Based Design. Kluwer Academic Publishers, 1997.
81. H. Fujii, G. Ootomo, and C. Hori. Interleaving Based Variable OrderingMethods for Ordered Binary Decision Diagrams. In Proceedings of International Conference on Computer-Aided Design (ICCAD), pages 38-41, November 1993.
82. J.-C. Filliatre, S. Owre, H. Rue, and N. Shankar. ICS: Integrated Canonizer and Solver. In Proceedings of the Computer Aided Verification Conference (CAV), 2001.
83. H. Fujiwara and T. Shimono. On the Acceleration of Test Generation Algorithms. In IEEE Transactions on Computers, volume C-32(12), December 1983.
84. Steven J. Friedman and Kenneth J. Supowit. Finding the optimal variable ordering for binary decision diagrams. In IEEE Transactions on Computers, volume 39(5), pages 710-713, May 1990.
85. M. Fujita, Y. Tamiya, Y. Kukimoto, and K.-C. Chen. Application of Boolean Unification to Combinational Logic Synthesis. In Proceedings of International Conference on Computer-Aided Design (ICCAD), pages 510-513, 1991.
86. E. Felt, G. York, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. Dynamic variable reordering for BDD minimization. In Proceedings of European Conference on Design Automation (EDAC), pages 130-135, 1993.
87. M.K. Ganai, P. Ashar, A. Gupta, L. Zhang, and S. Malik. Combining Strengths of Circuit-based and CNF-based Algorithms for a High-performance SAT Solver. In Proceedings of the Design Automation Conference (DAC), pages 747-750, 2002.
88. J. Gaschnig. Performance Measurement and Analysis of Certain Search Algorithms. PhD thesis, Carnegie Mellon University, Department of Computer Science, May 1979.
89. E. Gizdarski and H. Fujiwara. SPIRIT: A Highly Robust Combinational Test Generation Algorithm. In Proceedings of IEEE VLSI Test Symposium (VTS), pages 346-351, April 2001.
90. S.V. Gheorghita and R. Grigore. Constructing Checkers from PSL Properties. In Proceedings of the 15th International Conference on Control Systems and Computer Science, 2005.
91. M.K. Ganai, A. Gupta, and P. Ashar. Efficient SAT-based Unbounded Symbolic Model Checking Using Circuit Cofactoring. In Proceedings of International Conference on Computer-Aided Design (ICCAD), pages 510-517, November 2004.
92. A. Gupta, M. Ganai, Z. Yang, and P. Ashar. Iterative Abstraction using SATbased BMC with Proof Analysis. In Proceedings of International Conference on Computer-Aided Design (ICCAD), pages 416-423, November 2003.
93. M. Gordon, J. Hurd, and K. Slind. Executing the Formal Semantics of the Accellera Property Specification Language by Mechanised Theorem Proving. In Proceedings of the 12th Conference on Correct Hardware Design and Verification Methods, volume 2860 of Lecture Notes in Computer Science, pages 200-215. Springer-Verlag, 2003.
94. M. R. Garey and D. S. Johnson. Computers and Intractability. W. H. Freeman and Co., 1979.
95. M. Gyssens, P. Jeavons, and D. Cohen. Decomposing Constraint Satisfaction Problems Using Database Techniques. In Artificial Intelligence, pages 57-89, 1994.
96. D. Giannakopoulou and F. Lerda. From States to Transitions: Improving Translation of LTL Formula to B uchi Automata. In D. Peled andM.Y.Vardi, editors, International Conference on Formal Techniques for Networked and Distributed Systems (FORTE'02), volume 2529 of Lecture Notes in Computer Science, pages 308-326. Springer-Verlag, 2002.
97. G. Gottlob, N. Leone, and F. Scarcello. A Comparison of Structural CSP Decomposition Methods. In IJCAI, 1999.
98. E. Goldberg and Y. Novikov. BerkMin: a fast and robust SAT-solver. In Proceedings of Design Automation and Test in Europe (DATE), pages 142-149, 2002.
99. P. Gastin and D. Oddoux. Fast LTL to Buchi Automata Translation. In G. Berry, H. Comon, and A. Finkel, editors, Proceedings of the Computer Aided Verification Conference (CAV), volume 2012 of Lecture Notes in Computer Science, pages 53-65. Springer-Verlag, 2001.
100. P. Goel. An Implicit Algorithm to Generate Tests for Combinational Logic Circuits. In IEEE Transactions on Computers, volume C-30(3), March 1981.
101. R. Goering. Next-generation Verilog rises to higher abstraction levels. In EE Times, March 2002.
102. M. Gordon. HOL: A Proof Generating System for Higher-order Logic. In G. Birwistle and P. A. Subrahmanyam, editors, VLSI Specification, Verification and Synthesis, pages 73-127. Academic Press, Boston, 1988.
103. C.P. Gomes, B. Selman, and H. Kautz. BoostingCombinatorial Search Through Randomization. In Proceedings of the National Conference on Artificial Intelligence, 1998.
104. J. Havlicek. Notes on blake canonical form based factorization. Technical report, Motorola, Inc., 2001. Unpublished report.
105. C.-Y. Huang and K.-T. Cheng. Assertion Checking by Combined Word-level ATPGand Modular Arithmetic Constraint-solving Techniques. In Proceedings of the Design Automation Conference (DAC), pages 118-123, 2000.
106. J. Havlicek, D. Fisman, C. Eisner, and E. Marschner. Mapping SVA to PSL. In Accellera, October 2003. Available at the URL: http://www.eda.org/vfv/docs/ mapping.pdf.
107. R. Hojati, S. C. Krishnan, and R. K. Brayton. Early Quantification and Partitioned Transition Relations. In Proceedings of International Conference on Computer Design (ICCD), pages 12-19, October 1996.
108. G. D. Hachtel, E. Machii, A. Pardo, and F. Somenzi. Symbolic Algorithms to Calculate Steady-State Probabilities of a Finite StateMachine. In The European Design and Test Conference, pages 214-218, 1994.
109. J.N. Hooker. Logic-based Methods for Optimization. In ORSA CSTS Newsletter, volume 15(2), pages 4-11, 1994.
110. M. Heule and H. van Maare. Aligning CNF-and Equivalence-reasoning. In SAT, 2004.
111. J. Havlicek and Y. Wolfsthal. PSLand SVA:Two Standard AssertionLanguages Addressing Complementary Engineering Needs. In DVCon2005, 2005.
112. M.K. Iyer, G. Parthasarathy, and K.-T.Cheng. EfficientConflictBasedLearning in a Constraint Solver for RTL Circuits. In Proceedings of Design Automation and Test in Europe (DATE), pages 666-671, 2005.
113. M.A. Iyer. RACE: A Word-level ATPG-based Constraints Solver System for Smart Random Simulation. In Proceedings of International Test Conference (ITC), pages 299-308, 2003.
114. P. Johannsen and R. Drechsler. Formal Verification on the RT Level Computing One-to-one Design Abstractions by SignalWidth Reduction. In In Proceedings of IFIP International Conference on Very Large Scale Integration(IFIP VLSISOC 2001), 2001.
115. J. Jaffar and M.J. Maher. Constraint Logic Programming: A Survey. In Journal of Logic Programming, volume 19/20, pages 503-581, 1994.
116. R. Bayardo Jr. and R. Schrag. Using CSP Look-Back Techniques to Solve Real-World SAT Instances. In Proceedings of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence, pages 203-208. AAAI press, July 1997.
117. R. Krieger, B. Becker, and R. Sinkovic. A BDD-based Algorithm for Computation of Exact Fault Detection Probabilities. In International Symposium on Fault-Tolerant Computing, pages 186-195, 1993.
118. D. Koller and N. Megiddo. Constructing small sample spaces satisfying given constraints. In SIAM Journal on Discrete Mathematics, pages 260-274, 1994.
119. M. Kaufmann and J. S. Moore. ACL2:An Industrial StrengthVersion of Nqthm. In Proceedings of the 11th Annual Conference on Computer Assurance, IEEE Computer Society press, pages 23-34, June 1996.
120. W. Kunz and D. Pradhan. Recursive learning: A precise implication procedure and its application to test verification and optimization. In IEEETransactions on Computer-Aided Design of Integrated Circuits and Systems, September 1994.
121. J.H. Kukula and T.R. Shiple. Building Circuits From Relations. In Proceedings of the Computer Aided Verification Conference (CAV), 2000.
122. R. P.Kurshan. Reducibility in Analysis of Coordination. In Discrete Event Systems: Models and Applications, volume 103 of LNCS, pages 19-39. Springer-Verlag, 1987.
123. R. P. Kurshan. Automata-Theoretic Verification of Coordinating Processes. Princeton University Press, 1993.
124. R. P. Kurshan. Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. In Princeton University Press, 1994.
125. O. Kupferman and M.Y. Vardi. Model Checking of Safety Properties. In Proceedings of the Computer Aided Verification Conference (CAV), volume 1633 of Lecture Notes in Computer Science, pages 172-183. Springer-Verlag, 1999.
126. O. Kupferman and M.Y. Vardi. On Clopen Specifications. In Proceedings of the 8th International Conference on Logic forProgramming, Artificial Intelligence, and Reasoning, Lecture Notes in Computer Science. Springer-Verlag, 2001.
127. C. Y. Lee. Representation of Switching Circuits by Binary-decision Programs. In Bell System Technical Journal, volume 38, No. 4, pages 985-999, July 1959.
128. C. Liu and A. Kuehlmann. CAMA: A Multi-Valued Satisfiability Solver. In Proceedings of International Conference on Computer-Aided Design (ICCAD), pages 326-333, November 2003.
129. H.T. Lau and C.-S. Lim. On the OBDD Representation of General Boolean Functions. In IEEE Transactions on Computers, volume 41(6), pages 661-663, 1992.
130. L. Lowenheim. Uber das Auflosungsproblem im logischen Klassenkalkul. In Sitzungsber. Berl. Math. Gessel. 7, pages 89-94, 1908.
131. R.J. Lipton and R. Sedgewick. Lower Bounds for VLSI. In Proceedings of ACM Symposium on the Theory of Computing, pages 300-307, May 1981.
132. K.L. McMillan and N. Amla. Automatic Abstraction without Counterexamples. In Proceedings of Tools for Algorithms for Construction and Analysis of Systems (TACAS), 2003.
133. D. MacMillen, M. Butts, R. Camposano, D. Hill, and T.W. Williams. An Industrial View of Electronic Design Automation. In IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, volume 19(12), pages 1428-1448, December 2000.
134. Kenneth L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
135. K. L. McMillan. A Conjunctively Decomposed Boolean Representation for Symbolic Model Checking. In Proceedings of the Computer Aided Verification Conference (CAV), pages 13-25, 1996.
136. K. McMillan. Applying SATmethods in unbounded symbolic model checking. In Proceedings of the Computer Aided Verification Conference (CAV), pages 250-264, 2002.
137. K. L.McMillan. Interpolation andSAT-basedModelChecking. InProceedings of the Computer Aided Verification Conference (CAV), July 2003.
138. R. McNaughton. Testing and Generating Infinite Sequences by a Finite Automaton. In Information and Control, volume 9, pages 521-530, 1966.
139. C.-J. H. Segar, M. D. Aagaard, R. B. Jones. Formal Verification Using Parametric Representations of Boolean Constraints. In Proceedings of the Design Automation Conference (DAC), 1996.
140. Y.S. Mahajan, Z. Fu, and S. Malik. Zchaff 2004: An efficient SAT solver. In SAT, Lecture Notes in Computer Science. Springer-Verlag, 2004.
141. D.M Miller. Multiple-valued Logic Design Tools. In Proceedings of the 23rd International Symposium on Multiple-Valued Logic, pages 2-11, 1993.
142. J.S. Moore, T. Lynch, and M. Kaufmann. AMechanically Checked Proof of the Correctness of theKernel of the AMD5K86 Floating Point Division Algorithm. In IEEE Transactions on Computers, volume 47, pages 913-926, 1998.
143. M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In Proceedings of the Design Automation Conference (DAC), July 2001.
144. U. Martin and T. Nipkow. Boolean Unification -the Story So Far. In Journal of Symbolic Computation, volume 7, pages 275-293, 1989.
145. J.P. Marques-Silva. The Impact of Branching Heuristics in Propositional Satisfiability Algorithms. In Proceedings of the 9th Portuguese Conference on Artificial Intelligence, September 1999.
146. A. Mishchenko, B. Steinbach, and M. Perkowski. An Algorithm for Bi-Decomposition of Logic Functions. In Proceedings of the Design Automation Conference (DAC), pages 103-108, 2001.
147. J. P. Marques-Silva and K. Sakallah. GRASP-A New Search Algorithm For Satisfiability. In Proceedings of International Conference on Computer-Aided Design (ICCAD), Santa Clara, CA, November 1996.
148. R. McNaughton and H. Yamada. Regular Expression and State Graphs for Automata. In IRA Transaction on Electronic Computers, volume EC-9(1), pages 39-47, 1960.
149. G. Nelson and D. Oppen. Simplification by Cooperating Decision Procedures. In ACM Transactions on Programming Languages and Systems, volume 1(2), pages 245-257, 1979.
150. S. Owre, J. Rushby, N. Shankar, and F. von Henke. Formal Verification for Fault-tolerant Architectures: Prolegomena to the Design of PVS. In IEEE Transaction on Software Engineering, volume 21(2), pages 107-125, February 1995.
151. D. Park. Fixpoint Induction and Proof of Program Semantics. In B. Meltzer and D. Michie, editors, Machine Intelligence, volume 5, pages 59-78, Edinburgh, 1970. Edinburgh University Press.
152. G. Parthasarathy, M.K. Iyer, K.-T. Cheng, and F. Brewer. Structural Search for RTL with Predicate Learning. In Proceedings of the Design Automation Conference (DAC), pages 451-456, 2005.
153. G. Parthasarathy, M.K. Iyer, K.-T. Cheng, and L.-C.Wang. An Efficient Finite Domain Constraint Solver for Circuits. In Proceedings of the Design Automation Conference (DAC), pages 212-217, 2004.
154. C. Pixley. A Theory and Implementation of Sequential Hardware Equivalence. In IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, volume 11, pages 1469-1494, December 1992.
155. C. Pixley. Integrating Model Checking Into the Semiconductor Design Flow. In Journal of Electronic Systems, pages 67-73, March 1999.
156. S. Panda and F. Somenzi. Symmetry Detection and Dynamic Variable Ordering of Decision Diagrams. In Proceedings of International Conference on Computer-Aided Design (ICCAD), 1994.
157. W. Pugh. TheOmega Test: a Fast and Practical Integer Programming Algorithm for Dependence Analysis. In Communication of the ACM, August 1992.
158. R. K. Ranjan, A. Aziz, B. Plessier, C. Pixley, and R. K. Brayton. Efficient BDD Algorithms for FSMSynthesis andVerification. InProceedings of International Workshop on Logic Synthesis, May 1995.
159. J.P. Roth, W.G. Bouricius, and P.R. Schneider. Programmed Algorithms to Compute Tests to Detect and Distinguish Between Failures. In IEEE Transaction on Electronic Computers, volume EC-16(10), October 1967.
160. J.P. Roth. Diagnosis of Automata Failures: A Calculus and Method. In IBM Journal of Research and Development, volume 10(4), July 1966.
161. N. Robertson and P. D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. In Journal of Algorithms, pages 7:309-322, 1986.
162. S. Rudeanu. Boolean Functions and Equations. North-Holland, 1974.
163. R. Rudell. Dynamic Variable Ordering for Binary Decision Diagrams. In Proceedings of International Conference on Computer-Aided Design (ICCAD), pages 42-47, November 1993.
164. S. Safra. On Complexity of -automata. In Proceedings of 29th IEEE Symposium on Foundations of Computer Science, pages 319-327, 1988.
165. F. Somenzi and R. Bloem. Efficient Buchi Automata from LTL Formulae. In E.A. Emerson and A.P. Sistla, editors, Proceedings of the Computer Aided Verification Conference (CAV), volume 1633 of Lecture Notes in Computer Science, pages 257-263. Springer-Verlag, December 2000.
166. A. Schrijver. Theory of Linear and Integer Programming. Wiley, 1986.
167. F. Somenzi and et al. CUDD:CU Decision Diagram Package. Technical report, University of Colorado. ftp://vlsi.colorado.edu/pub/.
168. Khurram Sajid, Anuj Goel, Hai Zhou, Adnan Aziz, Suzanne Barber, and Vigyan Singhal. Symbolic Procedures for a Theory of Equality with Uninterpreted Functions. Submitted to CAV 1998, 1998.
169. R. Shostak. Deciding Combinations of Theories. In Journal of the ACM, volume 31(1), pages 1-12, 1984.
170. T. R. Shiple, R. Hojati, A. L. Sangiovanni-Vincentelli, and R. K. Brayton. Heuristic Minimization of BDDs Using Don't Cares. In Proceedings of the Design Automation Conference (DAC), pages 225-231, San Diego, CA, June 1994.
171. CA. Synopsys Inc., MountainView. Multimillion-gateASIC verification. 1998.
172. J. H. Siekmann. Universal Unification. In 7th International Conference on Automated Deduction, Lecture Notes in Computer Science, pages 1-42, 1984.
173. A. Srinivasan, T. Kam, S. Malik, and R.E. Brayton. Algorithms for Discrete Function Manipulation. In Proceedings of International Conference on Computer-Aided Design (ICCAD), pages 92-95, 1990.
174. S. Seshia, S. Lahiri, and R. Bryant. A Hybrid SAT-Based Decision Procedure for Separation Logic with Uninterpreted Functions. In Proceedings of the Design Automation Conference (DAC), pages 425-430, 2003.
175. S. Subbarayan and D.K. Pradhan. NiVER: Non Increasing Variable Elimination Resolution for Preprocessing SAT Instances. In SAT, 2004.
176. R.M. Stallman and G.J. Sussman. Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis. In Artificial Intelligence, volume 9, pages 135-196, 1977.
177. H.M. Sheini and K.A. Sakallah. Pueblo: A Modern Pseudo-Boolean SAT Solver. In Proceedings of Design Automation and Test in Europe (DATE), pages 684-685, 2005
178. G. Stalmarck. A System for Determining Propositional Logic Theorems by Applying Values and Rules to Triplets That Are Generated From Boolean Formula. 1992. Swedish Patent No. 467, 076 (approved 1992), U.S. Patent No. 5, 276, 897 (approved 1994), European Patent No. 0403 454 (approved 1995).
179. H. Touati, R. K. Brayton, and R. P. Kurshan. Checking Language Containment using BDDs. In Proceedings of International Workshop on Formal Methods in VLSI Design, Miami, FL, January 1990.
180. P. Tafertshofer, A. Ganz, and M. Hentfling. A SAT-Based Implication Engine for Efficient ATPG, Equivalence Checking, Optimization of Netlists. In Proceedings of International Conference on Computer-Aided Design (ICCAD), pages 648-655, November 1997.
181. X. Thirious. Simple and Efficient Translation from LTL Formulas to Buchi Automata. In Workshop in Formal Methods for Industrial Critical Systems (FMICS'02), volume 66(2) of ENTCS, pages 308-326. Springer-Verlag, July 2002.
182. K. Thompson. Regular Expression Search Algorithms. In Communication of ACM, volume 11(6), pages 419-422, 1968.
183. R. E. Tarjan and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs. In SIAM J. Comput., volume 13(3), pages 566-579, 1984.
184. M.N. Velev. Using Automatic Case Splits and Efficient CNF Translation to Guide a SAT-solver When Formally Verifying Out-of-order Processors. In 8th International Symposium on Artificial Intelligence and Mathematics, 2004.
185. W. Buttner and H. Simonis. Embedding Boolean Expressions into Logic Programming. In Journal of Symbolic Computation, volume 4, pages 191-205, 1987.
186. W. Buttner. Unification in Finite Algebras Is Unitary. In Proceedings of CADE-9, volume 310 of Lecture Notes in Computer Science, pages 368-377, 1988.
187. H.P. Williams. Fourier-MotzkinEliminationExtension to Integer Programming Problems. In Journal of Combinatorial Theory, volume 21, 1976.
188. P. Wolper. Temporal logic can be more expressive. In Information and Computation (formerly Information and Control), volume 56, 1983.
189. P. Wolper, M.Y. Vardi, and A.P. Sistla. Reasoning about Infinite Computation Paths. In Proceedings of 24th IEEE Symposium on Foundations of Computer Science, pages 185-194, 1983.
190. J. Yuan and A. Aziz. Random Vector Generation Using Event Probabilities. In Technical report, 2000.
191. J. Yuan, A. Aziz, and K. Albin. Enhancing Simulation Coverage Through Guided Vector Generation. In Technical report, 2002.
192. J. Yuan, K. Albin, A. Aziz, and C. Pixley. Constraint Synthesis for Environment Modeling in Functional Verification. In Proceedings of the Design Automation Conference (DAC), June 2003.
193. J. Yuan, K. Albin, A. Aziz, and C. Pixley. Simplifying Boolean Constraint Solving By Extracting Hold-Constraints. In IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, March 2004.
194. P. Yalagandula, A. Aziz, and V. Singhal. Automatic Lighthouse Generation for Directed State Space Search. In Proceedings of Design Automation and Test in Europe (DATE), March 2000.
195. C. H. Yang and D. L. Dill. Validation with Guided Search of the State Space. In Proceedings of the Design Automation Conference (DAC), pages 599-604, 1998.
196. J. Yuan and J. Havlicek. Prime cover based constraint factorization in simgen. Technical report, Motorola, Inc., 2001. Unpublished report.
197. J. Yuan, A. Aziz K. Albin, and C. Pixley. Simplifying Boolean Constraint Solving For Random Simulation-Vector Generation. In Proceedings of International Conference on Computer-Aided Design (ICCAD), pages 123-127, 2002.
198. J. Yuan, C. Pixley, A. Aziz, and K. Albin. A Framework for Constrained Functional Verification. In Proceedings of International Conference on Computer-Aided Design (ICCAD), pages 142-145, November 2003.
199. J. Yuan, J. Shen, J. A. Abraham, and A. Aziz. On Combining Formal and Informal Verification. In Proceedings of the Computer Aided Verification Conference (CAV), Lecture Notes in Computer Science, pages 376-387. Springer-Verlag, June 1997.
200. B.Yang, R. Simmons, R.R.Bryant, and D.R. O'Hallaron. Optimizing Symbolic Model Checking for Constraint-rich Models. In Proceedings of the Computer Aided Verification Conference (CAV), pages 328-340, 1999.
201. J. Yuan, K. Shultz, C. Pixley, H. Miller, and A. Aziz. Modeling Design Constraints and Biasing in SimulationUsing BDDs. InProceedings of International Conference on Computer-Aided Design (ICCAD), pages 584-589, 1999.
202. J. Yuan, K. Shultz, C. Pixley, and H. Miller. Method and Apparatus for Integrated Circuit Design Verification. granted in November, 2001. US Patent No. 6321186.
203. Y. Yu. Automated Correctness Proofs of Machine Code Programs for a Commercial Microprocessor. In Automated Deduction -CADE-11, Lecture Notes in Computer Science, pages 416-430. Springer-Verlag, 1992.
204. Z. Zeng, M. Ciesielski, and B. Rouzeyre. Functional Test Generation Using Constraint Logic Programming. In In Proceedings of IFIP International Conference on Very Large Scale Integration (IFIP VLSI-SOC 2001), 2001.
205. H. Zhang. SATO: An efficient propositional prover. In Proceedings of the International Conference on Automated Deduction, pages 272-275, July 1997.
206. Z. Zeng, P. Kalla, and M. Ciesielski. LPSAT: A Unified Approach to RTL Satisfiability. In Proceedings of Design Automation and Test in Europe (DATE), 2001.
207. L.Zhang and S. Malik. Extracting Small UnsatisfiableCores fromUnsatisfiable Boolean Formula. In SAT, 2003.
208. L. Zhang and S. Malik. Validating SAT Solvers Using an Independent Resolution Based-Checker: Practical Implementations and Other Applications. In Proceedings of Design Automation and Test in Europe (DATE), 2003.
209. L. Zhang, C.F. Madigan, M. W. Moskewicz, and S. Malik. Efficient Conflict Driven Learning in a Boolean Satisfiability Solver. In Proceedings of International Conference on Computer-Aided Design (ICCAD), November 2001.