295 search results - page 53 / 59 » SAT, SMT and Applications |
157
click to vote
STOC
2012
ACM
13 years 4 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
122
click to vote
ISSTA
2009
ACM
15 years 8 months ago
2009
ACM
Dynamic test generation consists of executing a program while gathering symbolic constraints on inputs from predicates encountered in branch statements, and of using a constraint ...
190
click to vote
POPL
2012
ACM
13 years 9 months ago
2012
ACM
It is becoming increasingly important for applications to protect sensitive data. With current techniques, the programmer bears the burden of ensuring that the application’s beh...
112
Voted
VLSID
2007
IEEE
16 years 2 months ago
2007
IEEE
Boolean Satisfiability is seeing increasing use as a decision procedure in Electronic Design Automation (EDA) and other domains. Most applications encode their domain specific cons...
112
Voted
ATAL
2005
Springer
15 years 7 months ago
2005
Springer
We present an approach to the verification of temporal epistemic properties in synchronous multi-agent systems (MAS) via bounded model checking (BMC). Based on the semantics of s...