713 search results - page 105 / 143 » Model Checking and Transitive-Closure Logic |
177
Voted
CADE
2011
Springer
13 years 10 months ago
2011
Springer
We describe asasp, a symbolic reachability procedure for the analysis of administrative access control policies. The tool represents access policies and their administrative action...
122
Voted
POPL
2011
ACM
14 years 1 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
191
click to vote
POPL
2004
ACM
15 years 11 months ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
SEKE
2005
Springer
15 years 4 months ago
2005
Springer
Checking for properties of Web ontologies is important for the development of reliable Semantic Web systems. Software specification and verification tools can be used to complem...
STACS
2001
Springer
15 years 3 months ago
2001
Springer
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...