Sciweavers

1018 search results - page 111 / 204
» Abstraction and Refinement in Model Checking
Sort
View
EJC
2008
13 years 7 months ago
Locally constrained graph homomorphisms and equitable partitions
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...
Jirí Fiala, Daniël Paulusma, Jan Arne ...
CAV
2010
Springer
194views Hardware» more  CAV 2010»
13 years 11 months ago
LTSmin: Distributed and Symbolic Reachability
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...
Stefan Blom, Jaco van de Pol, Michael Weber
ENTCS
2007
85views more  ENTCS 2007»
13 years 7 months ago
Stochastic Modelling of Communication Protocols from Source Code
A major development in qualitative model checking was the jump to verifying properties of source code directly, rather than requiring a separately specified model. We describe an...
Michael J. A. Smith
FORMATS
2004
Springer
14 years 1 months ago
Lazy Approximation for Dense Real-Time Systems
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...
Maria Sorea
FORTE
2008
13 years 9 months ago
Program Repair Suggestions from Graphical State-Transition Specifications
In software engineering, graphical formalisms, like state-transition tables and automata, are very often indispensable parts of the specifications. Such a formalism usually leads t...
Farn Wang, Chih-Hong Cheng