317 search results - page 44 / 64 » Bounded Model Checking with QBF |
CSL
2009
Springer
13 years 11 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
PPOPP
2010
ACM
14 years 4 months ago
2010
ACM
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...
ATVA
2009
Springer
14 years 2 months ago
2009
Springer
Weakly relational numeric domains express restricted classes of linear inequalities that strike a balance between what can be described and what can be efficiently computed. Popula...
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer
We examine a bidirectional Propositional Dynamic Logic (PDL) for message sequence charts (MSCs) extending LTL and TLC− . Every formula is translated into an equivalent communicat...
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...