4716 search results - page 112 / 944 » Iterative-free program analysis |
CADE
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
COMPSAC
2007
IEEE
15 years 4 months ago
2007
IEEE
Various program analysis techniques are efficient at discovering failures and properties. However, it is often difficult to evaluate results, such as program traces. ls for abst...
EUROPAR
1997
Springer
15 years 2 months ago
1997
Springer
Abstract. A practical methodology for compilation of trustworthy realtime programs is introduced. It combines new program development and timing analysis techniques with traditiona...
ALP
1994
Springer
15 years 2 months ago
1994
Springer
This paper introduces a logic for a class of properties - in particular variable aliasing - used in static analysis of logic programs. The logic is shown to be sound, complete and ...
ICFP
2005
ACM
15 years 10 months ago
2005
ACM
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...