<--- Back to Details
First PageDocument Content
Diagrams / Formal methods / Boolean algebra / Binary decision diagram / Model checking / Model checkers / NuSMV / Satisfiability Modulo Theories / Abstraction / Mathematics / Theoretical computer science / Applied mathematics
Date: 2015-02-12 10:11:50
Diagrams
Formal methods
Boolean algebra
Binary decision diagram
Model checking
Model checkers
NuSMV
Satisfiability Modulo Theories
Abstraction
Mathematics
Theoretical computer science
Applied mathematics

Int J Softw Tools Technol Transfer[removed]:507–518 DOI[removed]s10009[removed]RERS BDD-based software verification

Add to Reading List

Source URL: www.sosy-lab.org

Download Document from Source Website

File Size: 628,13 KB

Share Document on Facebook

Similar Documents

Theoretical computer science / Computing / Logic in computer science / Electronic design automation / Formal methods / NP-complete problems / Constraint programming / Satisfiability modulo theories / Benchmark / Solver / Standard Performance Evaluation Corporation / Computer performance

Satisfiability Modulo Theories Competition (SMT-COMP) 2014: Rules and Procedures David R. Cok GrammaTech, Inc. Ithaca, NY (USA)

DocID: 1xVTO - View Document

Theoretical computer science / Computing / Logic in computer science / Electronic design automation / Formal methods / NP-complete problems / Constraint programming / Satisfiability modulo theories / Benchmark / Solver / Lis / Standard Performance Evaluation Corporation

10th International Satisfiability Modulo Theories Competition (SMT-COMP 2015): Rules and Procedures Sylvain Conchon Paris-Sud University France

DocID: 1xVRN - View Document

Theoretical computer science / NP-complete problems / Logic in computer science / Constraint programming / Electronic design automation / Formal methods / Satisfiability modulo theories / Solver / Benchmark / Unsatisfiable core / Lis

13th International Satisfiability Modulo Theories Competition (SMT-COMP 2018): Rules and Procedures Matthias Heizmann University of Freiburg Germany

DocID: 1xVxR - View Document

Theoretical computer science / Mathematical logic / Mathematics / Formal methods / Logic in computer science / Automated theorem proving / Constraint programming / Electronic design automation / Conflict-driven clause learning / Satisfiability modulo theories / Boolean satisfiability problem / Unit propagation

Challenges in Satisfiability Modulo Theories Robert Nieuwenhuis, Albert Oliveras, Enric Rodr´ıguez-Carbonell, and Albert Rubio? Abstract. Here we give a short overview of the DPLL(T ) approach to Satisfiability Modulo

DocID: 1xVwT - View Document

Theoretical computer science / Logic in computer science / NP-complete problems / Electronic design automation / Formal methods / Constraint programming / Satisfiability modulo theories / Solver / Benchmark / Unsatisfiable core / Lis

11th International Satisfiability Modulo Theories Competition (SMT-COMP 2016): Rules and Procedures Sylvain Conchon Paris-Sud University France

DocID: 1xVsn - View Document