Sciweavers

2035 search results - page 173 / 407
» On the complexity of stratified logics
Sort
View
DATE
2009
IEEE
93views Hardware» more  DATE 2009»
16 years 1 months ago
Scalable liveness checking via property-preserving transformations
The ability of logic transformations to enhance safety property checking has been well-established, and many industrial-strength verification solutions accordingly rely ariety of...
Jason Baumgartner, Hari Mony
HASE
2005
IEEE
16 years 2 days ago
Automatic Generation of Executable Assertions for Runtime Checking Temporal Requirements
Checking various temporal requirements is a key dependability concern in safety-critical systems. As modelchecking approaches do not scale well to systems of high complexity the r...
Gergely Pintér, István Majzik
CONCUR
2004
Springer
15 years 12 months ago
Model Checking Restricted Sets of Timed Paths
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of rest...
Nicolas Markey, Jean-François Raskin
FORMATS
2003
Springer
15 years 11 months ago
Discrete-Time Rewards Model-Checked
Abstract. This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with re...
Suzana Andova, Holger Hermanns, Joost-Pieter Katoe...
ASYNC
2002
IEEE
114views Hardware» more  ASYNC 2002»
15 years 11 months ago
Checking Delay-Insensitivity: 104 Gates and Beyond
Wire and gate delays are accounted to have equal, or nearly equal, effect on circuit behavior in modern design techniques. This paper introduces a new approach to verify circuits ...
Alex Kondratyev, Oriol Roig, Lawrence Neukom, Karl...