4211 search results - page 109 / 843 » Types as Abstract Interpretations |
153
click to vote
VMCAI
2004
Springer
15 years 9 months ago
2004
Springer
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
125
Voted
CSFW
2003
IEEE
15 years 9 months ago
2003
IEEE
A type confusion attack is one in which a principal accepts data of one type as data of another. Although it has been shown by Heather et al. that there are simple formatting conv...
118
Voted
FUIN
2006
15 years 3 months ago
2006
The notion of program transformation is ubiquitous in programming language studies on interpreters, compilers, partial evaluators, etc. In order to implement a program transformat...
131
Voted
TLCA
2007
Springer
15 years 9 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
243
Voted
POPL
2007
ACM
16 years 3 months ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...