Sciweavers

88 search results - page 6 / 18
» Reasoning about the unknown in static analysis
Sort
View
POPL
2004
ACM
14 years 7 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
CGO
2009
IEEE
13 years 11 months ago
Communication-Sensitive Static Dataflow for Parallel Message Passing Applications
Message passing is a very popular style of parallel programming, used in a wide variety of applications and supported by many APIs, such as BSD sockets, MPI and PVM. Its importance...
Greg Bronevetsky
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
SAC
2010
ACM
14 years 2 months ago
Dual analysis for proving safety and finding bugs
Program bugs remain a major challenge for software developers and various tools have been proposed to help with their localization and elimination. Most present-day tools are base...
Corneliu Popeea, Wei-Ngan Chin
OOPSLA
2007
Springer
14 years 1 months ago
Ilea: inter-language analysis across java and c
Java bug finders perform static analysis to find implementation mistakes that can lead to exploits and failures; Java compilers perform static analysis for optimization. If Java...
Gang Tan, Greg Morrisett