26 search results - page 2 / 6 » Stateful Contracts for Affine Types |
POPL
2003
ACM
14 years 6 months ago
2003
ACM
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...
ECOOP
2007
Springer
13 years 10 months ago
2007
Springer
Java(X) is a framework for type refinement. It extends Java's type language with annotations drawn from an algebra X and structural subtyping in terms of the annotations. Each...
CCCG
2007
13 years 7 months ago
2007
Let S be a set system of convex sets in Rd . Helly’s theorem states that if all sets in S have empty intersection, then there is a subset S′ ⊂ S of size d+1 which also has e...
ESOP
2010
Springer
14 years 3 months ago
2010
Springer
Proving software free of security bugs is hard. Languages that ensure that programs correctly enforce their security policies would help, but, to date, no security-typed language h...
SIGPLAN
2008
13 years 6 months ago
2008
Many organizations specify information release policies to describe the terms under which sensitive information may be released to other organizations. This paper presents a new a...