Results 1 
5 of
5
ConstraintBased InterProcedural Analysis of Parallel Programs
, 2000
"... We provide a uniform framework for the analysis of programs with procedures and explicit, unbounded, fork/join parallelism covering not only bitvector problems like reaching definitions or live variables but also nonbitvector problems like strong copy constant propagation. Due to their structural s ..."
Abstract

Cited by 24 (6 self)
 Add to MetaCart
We provide a uniform framework for the analysis of programs with procedures and explicit, unbounded, fork/join parallelism covering not only bitvector problems like reaching definitions or live variables but also nonbitvector problems like strong copy constant propagation. Due to their structural similarity to the sequential case, the resulting algorithms are as efficient as their widely accepted sequential counterparts, and they can easily be integrated in existing program analysis environments like e.g. MetaFrame or PAG. We are therefore convinced that our method will soon find its way into industrialscale computer systems.
Newtonian Program Analysis
, 2010
"... This article presents a novel generic technique for solving dataflow equations in interprocedural dataflow analysis. The technique is obtained by generalizing Newton’s method for computing a zero of a differentiable function to ωcontinuous semirings. Complete semilattices, the common program analy ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
(Show Context)
This article presents a novel generic technique for solving dataflow equations in interprocedural dataflow analysis. The technique is obtained by generalizing Newton’s method for computing a zero of a differentiable function to ωcontinuous semirings. Complete semilattices, the common program analysis framework, are a special class of ωcontinuous semirings. We show that our generalized method always converges to the solution, and requires at most as many iterations as current methods based on Kleene’s fixedpoint theorem. We also show that, contrary to Kleene’s method, Newton’s method always terminates for arbitrary idempotent and commutative semirings. More precisely, in the latter setting the number of iterations required to solve a system of n equations is at most n.
Goblint: Pathsensitive data race analysis
 Annales Univ. Sci. Budapest., Sect. Comp
"... Abstract. We present Goblint, a static analyzer for detecting potential data races in the multithreaded C code. The implemented analysis is sound on a “safe ” subset of C and sufficiently efficient to be used for racedetection of multithreaded programs up to about 25 thousand lines of code. It uses ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
(Show Context)
Abstract. We present Goblint, a static analyzer for detecting potential data races in the multithreaded C code. The implemented analysis is sound on a “safe ” subset of C and sufficiently efficient to be used for racedetection of multithreaded programs up to about 25 thousand lines of code. It uses a global invariant approach to avoid the state space explosion problem and is both context and pathsensitive. 1
Global Invariants for Analyzing Multithreaded Applications
 IN PROC. OF ESTONIAN ACADEMY OF SCIENCES: PHYS., MATH
, 2003
"... We exhibit an interprocedural framework for the analysis of multithreaded programs based on partial invariants of a new kind of constraint systems which we call sideeffecting. We ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
We exhibit an interprocedural framework for the analysis of multithreaded programs based on partial invariants of a new kind of constraint systems which we call sideeffecting. We
Global Invariants for Analyzing Multithreaded Applications
 In Proc. of Estonian Academy of Sciences: Phys., Math
, 2003
"... We exhibit an interprocedural framework for the analysis of multithreaded programs based on partial invariants of a new kind of constraint systems which we call sideeffecting. We explore the formal properties of these constraint systems and provide general techniques for computing partial invarian ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
We exhibit an interprocedural framework for the analysis of multithreaded programs based on partial invariants of a new kind of constraint systems which we call sideeffecting. We explore the formal properties of these constraint systems and provide general techniques for computing partial invariants. We demonstrate the practicality of this approach by designing and implementing a reasonably efficient flow and contextsensitive interprocedural datarace analyzer of multithreaded C.