4573 search results - page 462 / 915 » Automated Reasoning |
178
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis...
288
Voted
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for expensive quantifier elimination. In this paper, we foc...
162
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Disunification is an extension of unification to first-order formulae over syntactic equality atoms. Instead of considering only syntactic equality, I extend a disunifica...
171
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
We investigate the complexity of preorder checking when the specification is a flat finite-state system whereas the implementation is either a non-flat finite-state system or a st...
177
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...