632 search results - page 31 / 127 » Proving Invariants of Functional Programs |
112
click to vote
TOPLAS
1998
15 years 5 days ago
1998
Abstract: We introduce a unified framework to describe, relate, compare and classify functional language implementations. The compilation process is expressed as a succession of p...
198
click to vote
ASIAN
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. We presents a compositional Hoare logic for proving semantic security of modes of operation for symmetric key block ciphers. We propose a simple programming language to s...
95
Voted
TOPLAS
2008
15 years 13 days ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
140
click to vote
ALP
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
93
Voted
PPDP
2010
Springer
14 years 11 months ago
2010
Springer
This paper connects the definitional interpreter for the λ-calculus extended with delimited continuation constructs, shift and reset, with a compiler and a low-level virtual mac...