First Page | Document Content | |
---|---|---|
Date: 2010-07-15 03:14:22Theoretical computer science Constraint programming Computational complexity theory Software engineering Logic in computer science Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem DPLL algorithm Constraint satisfaction Solver | SAT Encodings Sugar Examples Demo Summary . .Add to Reading ListSource URL: bach.istc.kobe-u.ac.jpDownload Document from Source WebsiteFile Size: 552,42 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 |