Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

6 relations
Buffer overflowCompilerGNU Compiler CollectionIntel C++ Compiler
Expand

Broader (1)

Static program analysis

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Abstract Interpretation for Block Diagrams - Two Case Studies
Interpretation for Block Diagrams Two Case Studies 
  • table I
  • figure 1
  • table II
  • figure 2
  • figure 3
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… Expand
2013
2013
Control Flow Unfolding of Workflow Graphs Using Predicate Analysis and SMT Solving
We present an extension of our previously introduced technique for unfolding conditional control flow in extended workflow graphs… Expand
  • figure 1
  • figure 2
  • figure 3
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… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
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… Expand
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
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… Expand
Highly Cited
2004
Highly Cited
2004
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
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… Expand
  • figure 1
  • figure 2
  • figure 3
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… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 4
  • figure 3
Highly Cited
2001
Highly Cited
2001
Efficient Symbolic Analysis for Optimizing Compilers
Because most of the execution time of a program is typically spend in loops, loop optimization is the main target of optimizing… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE