90 search results - page 14 / 18 » Abstracting Pointers for a Verifying Compiler |
DAC
1997
ACM
14 years 22 days ago
1997
ACM
The design process for xed-point implementations either in software or in hardware requires a bit-true speci cation of the algorithm in order to analyze quantization e ects on an...
ENTCS
2002
13 years 8 months ago
2002
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
CAV
2009
Springer
14 years 9 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
ICFP
2002
ACM
14 years 8 months ago
2002
ACM
Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car ...
ENTCS
2007
13 years 8 months ago
2007
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...