Sciweavers

1291 search results - page 11 / 259
» Arithmetic program paths
Sort
View
APAL
2005
107views more  APAL 2005»
13 years 7 months ago
Uniform Heyting arithmetic
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
Ulrich Berger
SAS
2007
Springer
112views Formal Methods» more  SAS 2007»
14 years 1 months ago
Taming the Wrapping of Integer Arithmetic
Variables in programs are usually confined to a fixed number of bits and results that require more bits are truncated. Due to the use of 32-bit and 64-bit variables, inadvertent ...
Axel Simon, Andy King
CORR
2006
Springer
110views Education» more  CORR 2006»
13 years 7 months ago
An Analysis of Arithmetic Constraints on Integer Intervals
Arithmetic constraints on integer intervals are supported in many constraint programming systems. We study here a number of approaches to implement constraint propagation for thes...
Krzysztof R. Apt, Peter Zoeteweij
CORR
2008
Springer
128views Education» more  CORR 2008»
13 years 7 months ago
A Quantifier Elimination Algorithm for Linear Real Arithmetic
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutines satisfiability modulo this theory and polyhedral pro...
David Monniaux
PLDI
1999
ACM
13 years 11 months ago
Whole Program Paths
Whole program paths (WPP) are a new approach to capturing and representing a program’s dynamic—actually executed—control flow. Unlike other path profiling techniques, which ...
James R. Larus