400 search results - page 70 / 80 » Reasoning About Hidden Mechanisms |
103
click to vote
SIGSOFT
2007
ACM
15 years 10 months ago
2007
ACM
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...
SIGSOFT
2007
ACM
15 years 10 months ago
2007
ACM
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
174
click to vote
POPL
2008
ACM
15 years 10 months ago
2008
ACM
In language-based security, confidentiality and integrity policies conveniently specify the permitted flows of information between different parts of a program with diverse levels...
171
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
166
Voted
POPL
2005
ACM
15 years 10 months ago
2005
ACM
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission be...