Sciweavers

38 search results - page 8 / 8
» Refining the SAT decision ordering for bounded model checkin...
Sort
View
CADE
2009
Springer
14 years 4 days ago
Interpolant Generation for UTVPI
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
Alessandro Cimatti, Alberto Griggio, Roberto Sebas...
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 5 months ago
Algorithmic Verification of Single-Pass List Processing Programs
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
Rajeev Alur, Pavol Cerný
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
13 years 10 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki