<--- Back to Details
First PageDocument Content
Theoretical computer science / Mathematical logic / Logic / Logic in computer science / Formal methods / Automated theorem proving / Model theory / NP-complete problems / Satisfiability modulo theories / Proof assistant / First-order logic / Solver
Date: 2009-11-14 10:24:00
Theoretical computer science
Mathematical logic
Logic
Logic in computer science
Formal methods
Automated theorem proving
Model theory
NP-complete problems
Satisfiability modulo theories
Proof assistant
First-order logic
Solver

Introduction Translation Caveats Conclusions SMT Solvers: New Oracles for the

Add to Reading List

Source URL: user.it.uu.se

Download Document from Source Website

File Size: 218,47 KB

Share Document on Facebook

Similar Documents

Alloy as an Introduction to Formal Methods

Alloy as an Introduction to Formal Methods

DocID: 1xVY1 - View Document

Integrated Formal Methods

Integrated Formal Methods

DocID: 1xVBb - View Document

Trust in Formal Methods Toolchains Arie Gurfinkel Software Engineering Institute Carnegie Mellon University

Trust in Formal Methods Toolchains Arie Gurfinkel Software Engineering Institute Carnegie Mellon University

DocID: 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 Fischmeister

Formal Methods in System Design manuscript No. (will be inserted by the editor) Inferring Event Stream Abstractions Sean Kauffman · Klaus Havelund · Rajeev Joshi · Sebastian Fischmeister

DocID: 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ˇ

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