Sciweavers

150 search results - page 24 / 30
» Symbolic Model Checking for Simply-Timed Systems
Sort
View
LICS
2009
IEEE
14 years 2 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
LPNMR
1997
Springer
13 years 11 months ago
Computing Non-Ground Representations of Stable Models
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
Thomas Eiter, James J. Lu, V. S. Subrahmanian
SP
2006
IEEE
177views Security Privacy» more  SP 2006»
14 years 1 months ago
FIREMAN: A Toolkit for FIREwall Modeling and ANalysis
Security concerns are becoming increasingly critical in networked systems. Firewalls provide important defense for network security. However, misconfigurations in firewalls are ...
Lihua Yuan, Jianning Mai, Zhendong Su, Hao Chen, C...
STACS
1999
Springer
13 years 11 months ago
The Weakness of Self-Complementation
Model checking is a method for the verification of systems with respect to their specifications. Symbolic model-checking, which enables the verification of large systems, procee...
Orna Kupferman, Moshe Y. Vardi
ATVA
2005
Springer
131views Hardware» more  ATVA 2005»
14 years 28 days ago
An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata
Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for...
Fuzhi Wang, Marta Z. Kwiatkowska