Sciweavers

855 search results - page 111 / 171
» Using First-Order Logic to Reason about Policies
Sort
View
POPL
2008
ACM
14 years 9 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
ATAL
2006
Springer
14 years 20 days ago
Temporal qualitative coalitional games
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
SIGSOFT
2010
ACM
13 years 6 months ago
Representation dependence testing using program inversion
The definition of a data structure may permit many different concrete representations of the same logical content. A (client) program that accepts such a data structure as input i...
Aditya Kanade, Rajeev Alur, Sriram K. Rajamani, Ga...
GIS
2010
ACM
13 years 7 months ago
Geolocation privacy and application platforms
Security and privacy issues for Location-Based Services (LBS) and geolocation-capable applications often revolve around designing a User Interface (UI) such that users are informe...
Nick Doty, Erik Wilde
JCST
2010
189views more  JCST 2010»
13 years 3 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar