Back to Results
First PageMeta Content
Propositional calculus / Boolean algebra / Electronic design automation / Logic in computer science / NP-complete problems / Boolean satisfiability problem / Satisfiability Modulo Theories / Well-formed formula / Unsatisfiable core / Logic / Theoretical computer science / Mathematical logic


Synthesizing Safe Bit-Precise Invariants? Arie Gurfinkel, Anton Belov and Joao Marques-Silva Abstract. Bit-precise software verification is an important and difficult problem. While there has been an amazing progress in
Add to Reading List

Document Date: 2014-01-27 10:25:19

Open Document

File Size: 483,18 KB

Share Result on Facebook

Company

CNF / CEX / G0 / Gi / /

Currency

pence / /

Event

Product Recall / Product Issues / /

Facility

Carnegie Mellon University / Software Engineering Institute / /

IndustryTerm

pre-processing step / clauses calledS groups / pre-processing steps / naive bit-blastingbased solution / industrial applications / Bit-precise software verification / pre-processor / verification tools / pre-processing techniques / computation algorithm / pre-processing / naive solution / propositional algorithms / software verification / pre-processing phase / /

Organization

Software Engineering Institute / Carnegie Mellon University / Department of Defense / /

Person

Silva Abstract / Anton Belov / Joao Marques-Silva / /

Position

group-MUS extractor / /

Product

Definition / /

ProgrammingLanguage

FP / C / /

ProvinceOrState

Alabama / Louisiana / /

Technology

The MIS computation algorithm / /

SocialTag