Sciweavers

855 search results - page 56 / 171
» Using First-Order Logic to Reason about Policies
Sort
View
FOSSACS
2005
Springer
14 years 1 months ago
A Simpler Proof Theory for Nominal Logic
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
James Cheney
ATAL
2009
Springer
14 years 2 months ago
Rational play and rational beliefs under uncertainty
Alternating-time temporal logic (atl) is one of the most influential logics for reasoning about agents’ abilities. Constructive Strategic Logic (csl) is a variant of atl for im...
Nils Bulling, Wojciech Jamroga
POPL
2004
ACM
14 years 8 months ago
Global value numbering using random interpretation
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
Sumit Gulwani, George C. Necula
SP
2006
IEEE
110views Security Privacy» more  SP 2006»
14 years 1 months ago
Privacy and Contextual Integrity: Framework and Applications
Contextual integrity is a conceptual framework for understanding privacy expectations and their implications developed in the literature on law, public policy, and political philo...
Adam Barth, Anupam Datta, John C. Mitchell, Helen ...
POPL
2003
ACM
14 years 8 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula