First Page | Document Content | |
---|---|---|
![]() Date: 2018-09-27 16:37:21Theoretical computer science Mathematics Computational complexity theory Logic in computer science Electronic design automation Formal methods NP-complete problems Constraint programming Planning Domain Definition Language Boolean satisfiability problem Satisfiability modulo theories Hybrid system | Add to Reading List |
![]() | 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 |