Sciweavers

713 search results - page 88 / 143
» Model Checking and Transitive-Closure Logic
Sort
View
SIGSOFT
2007
ACM
15 years 11 months ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip
ATAL
2008
Springer
15 years 1 months ago
Modelling coalitions: ATL + argumentation
In the last few years, argumentation frameworks have been successfully applied to multi agent systems. Recently, argumentation has been used to provide a framework for reasoning a...
Nils Bulling, Jürgen Dix, Carlos Iván ...
ENTCS
2007
144views more  ENTCS 2007»
14 years 11 months ago
Partial Order Reduction for Rewriting Semantics of Programming Languages
Software model checkers are typically language-specific, require substantial development efforts, and are hard to reuse for other languages. Adding partial order reduction (POR)...
Azadeh Farzan, José Meseguer
SP
1997
IEEE
134views Security Privacy» more  SP 1997»
15 years 3 months ago
A Logical Language for Expressing Authorizations
A major drawback of existing access control systems is that they have all been developed with a specific access control policy in mind. This means that all protection requirement...
Sushil Jajodia, Pierangela Samarati, V. S. Subrahm...
ICLP
1995
Springer
15 years 2 months ago
Operational Semantics of Constraint Logic Programs with Coroutining
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
Andreas Podelski, Gert Smolka