Sciweavers

62 search results - page 10 / 13
» Boolean Abstraction for Temporal Logic Satisfiability
Sort
View
TCS
2008
14 years 9 months ago
Verification of qualitative Z constraints
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
Stéphane Demri, Régis Gascon
CONCUR
2009
Springer
15 years 1 months ago
Time-Bounded Verification
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Joël Ouaknine, Alexander Rabinovich, James Wo...
DEON
2004
Springer
15 years 3 months ago
On Obligations and Abilities
Abstract. In this paper, we combine deontic logic with Alternatingtime Temporal Logic (ATL) into a framework that makes it possible to model and reason about obligations and abilit...
Wojciech Jamroga, Wiebe van der Hoek, Michael Wool...
73
Voted
IJFCS
2006
119views more  IJFCS 2006»
14 years 9 months ago
Enforcing Concurrent Temporal Behaviors
The outcome of verifying software is often a `counterexample', i.e., a listing of the actions and states of a behavior not satisfying the specification. In order to understan...
Doron Peled, Hongyang Qu
JCS
2006
118views more  JCS 2006»
14 years 9 months ago
Language based policy analysis in a SPKI Trust Management System
Abstract-- SPKI/SDSI is a standard for issuing authorization and name certificates. SPKI/SDSI can be used to implement a Trust Management System, where the policy for resource acce...
Arun K. Eamani, A. Prasad Sistla