First Page | Document Content | |
---|---|---|
Date: 2014-06-27 12:47:14Theoretical computer science Mathematics Computational complexity theory Logic in computer science Automated theorem proving NP-complete problems Electronic design automation Formal methods Conflict-driven clause learning Boolean satisfiability problem Clause Unit propagation | A Model-Constructing Satisfiability Calculus Leonardo de Moura1 and Dejan Jovanovi´c2 1 2 Microsoft ResearchAdd to Reading ListSource URL: csl.sri.comDownload Document from Source WebsiteFile Size: 363,26 KBShare Document on Facebook |
Alloy as an Introduction to Formal MethodsDocID: 1xVY1 - View Document | |
Integrated Formal MethodsDocID: 1xVBb - View Document | |
Trust in Formal Methods Toolchains Arie Gurfinkel Software Engineering Institute Carnegie Mellon UniversityDocID: 1xUHE - View Document | |
Formal Methods in System Design manuscript No. (will be inserted by the editor) Inferring Event Stream Abstractions Sean Kauffman · Klaus Havelund · Rajeev Joshi · Sebastian FischmeisterDocID: 1xUCm - View Document | |
Formal Methods in System Design manuscript No. (will be inserted by the editor) Automatic Verification of Competitive Stochastic Systems Taolue Chen · VojtˇDocID: 1xUrV - View Document |