Sciweavers

577 search results - page 5 / 116
» Model Checking Based on Simultaneous Reachability Analysis
Sort
View
STTT
2010
115views more  STTT 2010»
13 years 5 months ago
Scalable shared memory LTL model checking
Recent development in computer hardware has brought more wide-spread emergence of shared memory, multi-core systems. These architectures offer opportunities to speed up various ta...
Jiri Barnat, Lubos Brim, Petr Rockai
QEST
2006
IEEE
14 years 1 months ago
Compositional Performability Evaluation for STATEMATE
Abstract— This paper reports on our efforts to link an industrial state-of-the-art modelling tool to academic state-of-the-art analysis algorithms. In a nutshell, we enable timed...
Eckard Böde, Marc Herbstritt, Holger Hermanns...
ICCAD
2010
IEEE
186views Hardware» more  ICCAD 2010»
13 years 5 months ago
Efficient state space exploration: Interleaving stateless and state-based model checking
State-based model checking methods comprise computing and storing reachable states, while stateless model checking methods directly reason about reachable paths using decision proc...
Malay K. Ganai, Chao Wang, Weihong Li
TABLEAUX
2009
Springer
14 years 1 months ago
Goal-Directed Invariant Synthesis for Model Checking Modulo Theories
We are interested in automatically proving safety properties of infinite state systems. We present a technique for invariant synthesis which can be incorporated in backward reacha...
Silvio Ghilardi, Silvio Ranise
CADE
2011
Springer
12 years 7 months ago
ASASP: Automated Symbolic Analysis of Security Policies
We describe asasp, a symbolic reachability procedure for the analysis of administrative access control policies. The tool represents access policies and their administrative action...
Francesco Alberti, Alessandro Armando, Silvio Rani...