72 search results - page 4 / 15 » Semantic foundations for typed assembly languages |
201
click to vote
FMOODS
2008
15 years 9 months ago
2008
This paper proposes a semantics-based automatic null pointer analysis for inferring non-null annotations of fields in objectoriented programs. The analysis is formulated for a mini...
215
click to vote
PLDI
2003
ACM
16 years 1 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...
263
click to vote
ICFP
1997
ACM
16 years 9 days ago
1997
ACM
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
232
click to vote
COORDINATION
2006
Springer
15 years 12 months ago
2006
Springer
We tackle the problem of providing rigorous formal foundations to current software engineering technologies for web services. We focus on two of the most used XML-based languages f...
315
click to vote
POPL
2006
ACM
16 years 8 months ago
2006
ACM
In the spirit of Landin, we present a calculus of dependent types to serve as the semantic foundation for a family of languages called data description languages. Such languages, ...