1689 search results - page 173 / 338 » Refining abstract interpretations |
140
click to vote
SAS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We specify an information flow analysis for a simple imperative language, using a Hoare-like logic. The logic facilitates static checking of a larger class of programs t...
125
click to vote
CAV
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...
137
Voted
AMAST
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
132
click to vote
POPL
1996
ACM
15 years 8 months ago
1996
ACM
operators. The analysis is abstract interpretation-based and is parameterized over two polyvariance operators and a projection operator. These operators are used to regulate the sp...
141
click to vote
LICS
1994
IEEE
15 years 8 months ago
1994
IEEE
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...