778 search results - page 108 / 156 » Expressiveness and complexity of graph logic |
SPIN
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We present an approach for the veri cation of spatial properties with Spin. We rst extend one of Spin's main property speci cation mechanisms, i.e., the linear-time...
TACAS
2007
Springer
14 years 5 months ago
2007
Springer
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
FSTTCS
2008
Springer
14 years 2 days ago
2008
Springer
ABSTRACT. We introduce a novel approach to the runtime monitoring of complex system properties. In particular, we present an online algorithm for a safety fragment of metric first...
CLEIEJ
2006
13 years 11 months ago
2006
Concurrent process calculi are powerful formalisms for modelling concurrent systems. The mathematical style underlying process calculi allow to both model and verify properties of...
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...