228 search results - page 46 / 46 » A Theory of Restrictions for Logics and Automata |
PLDI
2003
ACM
13 years 10 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
CORR
2002
Springer
13 years 5 months ago
2002
Springer
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...
ICFP
2012
ACM
11 years 7 months ago
2012
ACM
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...