2137 search results - page 263 / 428 » Proving Abstract Non-interference |
135
click to vote
ICFP
2002
ACM
16 years 3 months ago
2002
ACM
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
130
click to vote
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
142
Voted
VMCAI
2009
Springer
15 years 10 months ago
2009
Springer
This paper describes the methods used in Empire, a tool to detect concurrency-related bugs, namely atomic-set serializability violations in Java programs. The correctness criterion...
135
click to vote
DATE
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Many application domains require adaptive realtime embedded systems that can change their functionality over time. In such systems it is not only necessary to guarantee ...
137
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper we define the Weak Mutual Exclusion (WME) problem. Analogously to classical Distributed Mutual Exclusion (DME), WME serializes the accesses to a shared resource. Di...