Old Web
English
Sign In
Acemap
>
Paper
>
A single-instance incremental SAT formulation of proof- and counterexample-based abstraction
A single-instance incremental SAT formulation of proof- and counterexample-based abstraction
2010
Een
Mishchenko
Amla
Keywords:
Boolean function
Interpolation
Abstraction (linguistics)
Counterexample
Boolean satisfiability problem
Computer science
Theoretical computer science
Computability
Data structure
Formal verification
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
4
Citations
NaN
KQI
[]