Sciweavers

388 search results - page 11 / 78
» Program Analysis Using Symbolic Ranges
Sort
View
FOSSACS
2007
Springer
15 years 3 months ago
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
Matthew Hague, C.-H. Luke Ong
ENTCS
2006
112views more  ENTCS 2006»
14 years 9 months ago
Model Checking Linear Programs with Arrays
In previous work we proposed Linear Programs as a fine grained model for imperative programs, and showed how the model checking procedure used in SLAM can be generalised to a mode...
Alessandro Armando, Massimo Benerecetti, Jacopo Ma...
92
Voted
SAS
2004
Springer
109views Formal Methods» more  SAS 2004»
15 years 3 months ago
Pointer-Range Analysis
Array-Range Analysis computes at compile time the range of possible index values for each array-index expression in a program. This information can be used to detect potential out-...
Suan Hsi Yong, Susan Horwitz
91
Voted
DISCO
1992
161views Hardware» more  DISCO 1992»
15 years 1 months ago
Combinatory Models and Symbolic Computation
We introduce an algebraic model of computation which is especially useful for the description of computations in analysis. On one level the model allows the representation of alge...
Karl Aberer
POPL
2004
ACM
15 years 10 months ago
Symbolic transfer function-based approaches to certified compilation
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
Xavier Rival