4211 search results - page 413 / 843 » Types as Abstract Interpretations |
202
click to vote
ESOP
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
162
click to vote
ICALP
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. We consider a finitary procedural programming language (finite data-types, no recursion) extended with parallel composition and binary semaphores. Having first shown t...
152
Voted
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper addresses the issue of fault-tolerance in applications that make use of network storage. A network abstraction called the Network Storage Stack is presented, along with...
152
click to vote
GI
2009
Springer
15 years 11 months ago
2009
Springer
: In this paper we present the concurrent constraint functional programming CCFL and an abstract machine for the evaluation of CCFL programs in a multicore environment. The source ...
214
Voted
CSFW
2007
IEEE
15 years 10 months ago
2007
IEEE
Noninterference is typically used as a baseline security policy to formalize confidentiality of secret information manipulated by a program. In contrast to static checking of noni...