First Page | Document Content | |
---|---|---|
Date: 2010-05-19 04:29:26Theoretical computer science Automated planning and scheduling Logic in computer science Mathematics Computational complexity theory Boolean algebra Electronic design automation Formal methods Boolean satisfiability problem Maximum satisfiability problem Planning Domain Definition Language Satz | An experimental evaluation of Max-SAT and PB solvers on over-subscription planning problems Marco Maratea DIST, University of Genova, Viale F. Causa 15, Genova, Italy. AbstractAdd to Reading ListSource URL: ceur-ws.orgDownload Document from Source WebsiteFile Size: 87,56 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 |