Sciweavers

62 search results - page 9 / 13
» Boolean Abstraction for Temporal Logic Satisfiability
Sort
View
CORR
2004
Springer
100views Education» more  CORR 2004»
14 years 9 months ago
On Spatial Conjunction as Second-Order Logic
Abstract. Spatial conjunction is a powerful construct for reasoning about dynamically allocated data structures, as well as concurrent, distributed and mobile computation. While re...
Viktor Kuncak, Martin C. Rinard
DLOG
2006
14 years 11 months ago
Model checking the basic modalities of CTL with Description Logic
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...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...
88
Voted
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
14 years 4 months ago
Formal analysis of piecewise affine systems through formula-guided refinement
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...
Boyan Yordanov, Jana Tumova, Calin Belta, Ivana Ce...
FAABS
2004
Springer
15 years 3 months ago
Towards Timed Automata and Multi-agent Systems
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...
Guillaume Hutzler, Hanna Klaudel, D. Yue Wang
81
Voted
PTS
2008
109views Hardware» more  PTS 2008»
14 years 11 months ago
Runtime Verification of C Programs
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...
Klaus Havelund