62 search results - page 9 / 13 » Boolean Abstraction for Temporal Logic Satisfiability |
150
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Spatial conjunction is a powerful construct for reasoning about dynamically allocated data structures, as well as concurrent, distributed and mobile computation. While re...
144
click to vote
DLOG
2006
15 years 5 months ago
2006
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
139
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract-- We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Log...
195
click to vote
FAABS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. The design of reactive systems must comply with logical correctness (the system does what it is supposed to do) and timeliness (the system has to satisfy a set of tempora...
134
click to vote
PTS
2008
15 years 5 months ago
2008
We present in this paper a framework, RMOR, for monitoring the execution of C programs against state machines, expressed in a textual (nongraphical) format in files separate from t...