First Page | Document Content | |
---|---|---|
Date: 2006-04-28 13:17:24Theoretical computer science Mathematics Mathematical logic Logic in computer science Automated theorem proving Electronic design automation Formal methods NP-complete problems Satisfiability modulo theories Boolean satisfiability problem Maximum satisfiability problem Unit propagation | On SAT Modulo Theories and Optimization Problems Robert Nieuwenhuis and Albert Oliveras? Abstract. Solvers for SAT Modulo Theories (SMT) can nowadays handle large industrial (e.g., formal hardware and software verificatiAdd to Reading ListSource URL: www.lsi.upc.eduDownload Document from Source WebsiteFile Size: 162,01 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 |