Sciweavers

34 search results - page 2 / 7
» Symbolic Reachability Analysis Based on SAT-Solvers
Sort
View
CONCUR
2005
Springer
14 years 1 months ago
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems
We introduce two abstract models for multithreaded programs based on dynamic networks of pushdown systems. We address the problem of symbolic reachability analysis for these models...
Ahmed Bouajjani, Markus Müller-Olm, Tayssir T...
GLVLSI
2003
IEEE
153views VLSI» more  GLVLSI 2003»
14 years 22 days ago
FORCE: a fast and easy-to-implement variable-ordering heuristic
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
SACMAT
2009
ACM
14 years 1 months ago
Symbolic reachability analysis for parameterized administrative role based access control
Role based access control (RBAC) is a widely used access control paradigm. In large organizations, the RBAC policy is managed by multiple administrators. An administrative role ba...
Scott D. Stoller, Ping Yang, Mikhail I. Gofman, C....
CHARME
2005
Springer
143views Hardware» more  CHARME 2005»
14 years 1 months ago
Saturation-Based Symbolic Reachability Analysis Using Conjunctive and Disjunctive Partitioning
Abstract. We propose a new saturation-based symbolic state-space generation algorithm for finite discrete-state systems. Based on the structure of the high-level model specificat...
Gianfranco Ciardo, Andy Jinqing Yu
TACAS
2000
Springer
87views Algorithms» more  TACAS 2000»
13 years 11 months ago
Symbolic Reachability Analysis Based on SAT-Solvers
Parosh Aziz Abdulla, Per Bjesse, Niklas Eén