Sciweavers

333 search results - page 17 / 67
» On the complexity of partial order trace model checking
Sort
View
COMPSEC
2010
146views more  COMPSEC 2010»
13 years 7 months ago
An intruder model with message inspection for model checking security protocols
Model checking security protocols is based on an intruder model that represents the eavesdropping or interception of the exchanged messages, while at the same time performs attack...
Stylianos Basagiannis, Panagiotis Katsaros, Andrew...
IJCAI
1989
13 years 8 months ago
A Sequential View of AND-Parallelism Through Partial AND-Processes
Most implementations of AND-parallelism tackle the shared variable problem by running literals in parallel only if they have no variables in common and thus are independent from e...
Bernd Schend
SPIN
2000
Springer
13 years 11 months ago
Model Checking Based on Simultaneous Reachability Analysis
Abstract. Simultaneous reachability analysis SRA is a recently proposed approach to alleviating the state space explosion problem in reachability analysis of concurrent systems. Th...
Bengi Karaçali, Kuo-Chung Tai
CONCUR
2007
Springer
14 years 1 months ago
Pushdown Module Checking with Imperfect Information
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...
Benjamin Aminof, Aniello Murano, Moshe Y. Vardi
OOPSLA
2007
Springer
14 years 1 months ago
Scalable omniscient debugging
Omniscient debuggers make it possible to navigate backwards in time within a program execution trace, drastically improving the task of debugging complex applications. Still, they...
Guillaume Pothier, Éric Tanter, José...