MASTER'S THESIS Integrating a BDD prover and a DPLL SAT solver for Abstract Data Types

[1]  Robin Wilson,et al.  Graphs an Introductory Approach , 1990, The Mathematical Gazette.

[2]  Michael J. Maher,et al.  Unification Revisited , 1988, Foundations of Deductive Databases and Logic Programming..

[3]  Jos C. M. Baeten,et al.  Process Algebra , 2007, Handbook of Dynamic System Modeling.

[4]  Hans-Dieter Ehrich,et al.  Specification of abstract data types , 1996 .

[5]  Wan Fokkink,et al.  Introduction to Process Algebra , 1999, Texts in Theoretical Computer Science. An EATCS Series.

[6]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[7]  Frank Harary,et al.  Graph Theory , 2016 .

[8]  Wilhelm Ackermann,et al.  Solvable Cases Of The Decision Problem , 1954 .

[9]  Jaco van de Pol,et al.  A BDD-Representation for the Logic of Equality and Uninterpreted Functions , 2005, MFCS.

[10]  Jan Friso Groote,et al.  Checking Verifications of Protocols and Distributed Systems by Computer , 1998, CONCUR.

[11]  Jan Friso Groote,et al.  µCRL: A Toolset for Analysing Algebraic Specifications , 2001, CAV.

[12]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[13]  P. Klint,et al.  Efficient annotated terms , 2000 .

[14]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[15]  Christoph Meinel,et al.  Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications , 2012 .

[16]  Bahareh Badban,et al.  An Algorithm to Verify Formulas by means of (O,S,=)-BDDs , 2004 .

[17]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[18]  C. Y. Lee.  Representation of switching circuits by binary-decision programs , 1959 .

[19]  Jaco van de Pol,et al.  Zero, successor and equality in BDDs , 2005, Ann. Pure Appl. Log..

[20]  Jan F Groote.  The syntax and semantics of timed $\mu CRL$ , 1997 .