364 search results - page 61 / 73 » Model checking with Boolean Satisfiability |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
ENTCS
2010
13 years 8 months ago
2010
Program debugging is an extremely time-consuming process, and it takes up a large portion of software development time. In practice, debugging is still very much of an art, with t...
ECEASST
2008
13 years 8 months ago
2008
Abstract: In several rule-based applications using graph transformation as underlying modeling technique the following questions arise: How can one be sure that a specific sequence...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. Metric Temporal Logic (MTL) is a prominent specification formalism for realtime systems. In this paper, we show that the satisfiability problem for MTL over finite tim...
SYNTHESE
2008
13 years 8 months ago
2008
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...