149 search results - page 19 / 30 » SAT-based Unbounded Model Checking of Timed Automata |
CONCUR
2011
Springer
12 years 7 months ago
2011
Springer
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of model checking message-passing systems with real-time requirements. As behavioural specifications, we use message sequence charts (MSCs) annotated with ...
HYBRID
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...
ICFEM
2009
Springer
14 years 2 months ago
2009
Springer
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which pr...