188
click to vote
CAV
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
181
click to vote
CAV
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. We develop compositional analysis algorithms for detecting nontermination in multithreaded programs. Our analysis explores fair and ultimatelyperiodic executions—i.e., ...
184
click to vote
CAV
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. We propose a trace-based concurrent program analysis to soundly remove redundant synchronizations such as locks while preserving the behaviors of the concurrent computati...
184
click to vote
CAV
2012
Springer
13 years 9 months ago
2012
Springer
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
183
click to vote
CAV
2012
Springer
13 years 9 months ago
2012
Springer
An algorithmic-learning-based termination analysis technique is presented. The new technique combines transition predicate abstraction, algorithmic learning, and decision procedure...