Sciweavers

20 search results - page 2 / 4
» Static Analysis of CLP Programs over Numeric Domains
Sort
View
ESOP
2007
Springer
13 years 11 months ago
Static Analysis by Policy Iteration on Relational Domains
We give a new practical algorithm to compute, in finite time, a fixpoint (and often the least fixpoint) of a system of equations in the abstract numerical domains of zones and t...
Stephane Gaubert, Eric Goubault, Ankur Taly, Sarah...
AMAST
1998
Springer
13 years 9 months ago
Type Analysis for CHIP
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...
Wlodzimierz Drabent, Pawel Pietrzak
SAS
2007
Springer
106views Formal Methods» more  SAS 2007»
13 years 11 months ago
Guided Static Analysis
In static analysis, the semantics of the program is expressed as a set ions. The equations are solved iteratively over some abstract domain. If ract domain is distributive and sati...
Denis Gopan, Thomas W. Reps
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 5 months ago
Automatic Modular Abstractions for Template Numerical Constraints
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
David Monniaux
ISSTA
2006
ACM
13 years 10 months ago
DSD-Crasher: a hybrid analysis tool for bug finding
DSD-Crasher is a bug finding tool that follows a three-step approach to program analysis: D. Capture the program’s intended execution behavior with dynamic invariant detection....
Christoph Csallner, Yannis Smaragdakis