<--- Back to Details
First PageDocument Content
Formal methods / Logic in computer science / NP-complete problems / Constraint programming / Satisfiability Modulo Theories / Vehicle Identification Number / FO / Theoretical computer science / Applied mathematics / Electronic design automation
Date: 2014-05-21 11:37:06
Formal methods
Logic in computer science
NP-complete problems
Constraint programming
Satisfiability Modulo Theories
Vehicle Identification Number
FO
Theoretical computer science
Applied mathematics
Electronic design automation

Resourceful Reachability as HORN-LA Josh Berdine, Nikolaj Bjørner, Samin Ishtiaq, Jael E. Kriener, and Christoph M. Wintersteiger Microsoft Research; University of Kent Abstract. The program verification tool SLAyer us

Add to Reading List

Source URL: www.winterstiger.at

Download Document from Source Website

File Size: 446,14 KB

Share Document on Facebook

Similar Documents