Date: 2014-05-07 12:02:15Electronic 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 usAdd to Reading ListSource URL: research.microsoft.comDownload Document from Source Website File Size: 431,95 KBShare Document on Facebook
|