Back to Results
First PageMeta Content
Electronic design automation / Formal methods / Logic in computer science / NP-complete problems / Vehicle Identification Number / Satisfiability Modulo Theories / FO / Kripke semantics / Theoretical computer science / Mathematical logic / Logic


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

Document Date: 2014-05-07 12:02:15

Open Document

File Size: 431,95 KB

Share Result on Facebook

Company

Microsoft / /

Event

Product Issues / /

Facility

University of Kent Abstract / /

IndustryTerm

pre-processing simplifications / pre-processing transformations / model checking tool / program verification tool / abstract transition systems / pre-processing / constraint logic programming systems / /

MarketIndex

LIB / /

Person

Horn Clause Solvers / Matthew Parkinson / Nikolaj Bjørner / Jael E. Kriener / Josh Berdine / Samin Ishtiaq / Nathan Chong / Christoph M. Wintersteiger / /

Position

representative / Princess / /

Product

routine / /

ProgrammingLanguage

C / T / /

URL

http /

SocialTag