Skip to search formSkip to main contentSkip to account menu

Value range analysis

In computing, in particular compiler construction, value range analysis is a type of data flow analysis that tracks the range (interval) of values… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Buffer overflowCompilerGNU Compiler CollectionIntel C++ Compiler

Broader (1)

Static program analysis

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
XENPWN : BREAKING PARAVIRTUALIZED DEVICES BLACK HAT USA 2016
2015
2015
Static Value Range Analysis for Matlab/Simulink-Models
In this paper we present a static value range analysis of signals within function block diagrams developed with Matlab/Simulink… 
2012
2012
Guided Control Flow Unfolding for Workflow Graphs Using Value Range Information
In our previous work, we have introduced a technique to unfold the control flow in workflow graphs based upon static information… 
2011
2011
Generalizing the Template Polyhedral Domain
Template polyhedra generalize weakly relational domains by specifying arbitrary fixed linear expressions on the left-hand sides… 
2008
2008
Value-Range Analysis of C Programs: Towards Proving the Absence of Buffer Overflow Vulnerabilities
Value-Range Analysis of C Programs describes a static analysis for detecting buffer overflows. A buffer overflow in a C program… 
2008
2008
XARK: An extensible framework for automatic recognition of computational kernels
The recognition of program constructs that are frequently used by software developers is a powerful mechanism for optimizing and… 
2004
2004
Value Range Analysis of Conditionally Updated Variables and Pointers
Pointer-based array traversals are often used by C programmers to optimize sequential memory access. However, the use of pointer… 
Highly Cited
2003
Highly Cited
2003
Efficient sequential atpg for functional rtl circuits
We present an efficient register-transfer level automatic test pattern generation (ATPG) algorithm. First, our ATPG generates a… 
Highly Cited
2001
Highly Cited
2001
Efficient Symbolic Analysis for Optimizing Compilers
  • R. A. Engelen
  • International Conference on Compiler Construction
  • 2001
  • Corpus ID: 6993152
Because most of the execution time of a program is typically spend in loops, loop optimization is the main target of optimizing… 
Highly Cited
2000
Highly Cited
2000
Supporting Timing Analysis by Automatic Bounding of Loop Iterations
Static timing analyzers, which are used to analyze real-time systems, need to know the minimum and maximum number of iterations… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)