First Page | Document Content | |
---|---|---|
Date: 2012-12-16 04:54:55Logic in computer science Boolean algebra Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem True quantified Boolean formula Maximum satisfiability problem Model checking Conjunctive normal form Satisfiability Tseytin transformation | Abstraction-Based Algorithm for 2QBF Mikol´asˇ Janota2 and Joao Marques-Silva1,2 1 University College Dublin, Ireland 2Add to Reading ListSource URL: www.mancoosi.orgDownload Document from Source WebsiteFile Size: 639,17 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 |