309 search results - page 32 / 62 » Termination proofs for systems code |
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
We introduce Erasure Pure Type Systems, an extension to Pure Type Systems with an erasure semantics centered around a type constructor indicating parametric polymorphism. The eras...
ENTCS
2007
13 years 7 months ago
2007
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
CCL
1994
Springer
13 years 11 months ago
1994
Springer
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
SAC
2004
ACM
14 years 1 months ago
2004
ACM
Since fingerprint data are no secrets but of public nature, the verification data transmitted to a smartcard for oncardmatching need protection by appropriate means in order to ...