Sciweavers

4719 search results - page 149 / 944
» Newtonian program analysis
Sort
View
CAV
2006
Springer
143views Hardware» more  CAV 2006»
15 years 7 months ago
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
Josh Berdine, Byron Cook, Dino Distefano, Peter W....
POPL
2002
ACM
16 years 4 months ago
Role analysis
We present a new role system in which the type (or role) of each object depends on its referencing relationships with other objects, with the role changing as these relationships ...
Viktor Kuncak, Patrick Lam, Martin C. Rinard
AMAST
2008
Springer
15 years 6 months ago
Long-Run Cost Analysis by Approximation of Linear Operators over Dioids
Abstract. We present a static analysis technique for modeling and approximating the long-run resource usage of programs. The approach is based on a quantitative semantic framework ...
David Cachera, Thomas P. Jensen, Arnaud Jobin, Pas...
PEPM
2009
ACM
16 years 28 days ago
Linear logical approximations
ract interpretation of programs relates the exact semantics of a programming language to an approximate semantics that can be effectively computed. We show that, by specifying ope...
Robert J. Simmons, Frank Pfenning
ERLANG
2003
ACM
15 years 9 months ago
A soft-typing system for Erlang
This paper presents a soft-typing system for the programming language Erlang. The system is based on two concepts; a (forward) data flow analysis that determines upper approximat...
Sven-Olof Nyström