783 search results - page 72 / 157 » Compositional Reasoning in Model Checking |
109
Voted
LICS
2002
IEEE
15 years 7 months ago
2002
IEEE
We investigate NLTL, a linear-time temporal logic with forgettable past. NLTL can be exponentially more succinct than LTL + Past (which in turn can be more succinct than LTL). We ...
123
click to vote
QEST
2007
IEEE
15 years 8 months ago
2007
IEEE
Stochastic game logic (SGL) is a new temporal logic that combines features of alternating temporal logic (to formalize the individual views and cooperation and reaction facilities...
111
click to vote
HASE
2008
IEEE
15 years 8 months ago
2008
IEEE
Model-based program debugging exploits discrepancies between the program behavior anticipated by a programmer and the program’s actual behavior when executed on a set of inputs....
104
click to vote
LPAR
2000
Springer
15 years 6 months ago
2000
Springer
In this paper, we determine the complexity of propositional theory curbing. Theory Curbing is a nonmonotonic technique of common sense reasoning that is based on model minimality b...
113
click to vote
DATE
2008
IEEE
15 years 8 months ago
2008
IEEE
With the advance of SAT solvers, transforming a software program to a propositional formula has generated much interest for bounded model checking of software in recent years. How...