797 search results - page 90 / 160 » Eliminating Proofs from Programs |
74
Voted
MICS
2008
15 years 19 days ago
2008
The intensional transformation is a technique that can be used in order to eliminate higher-order functions from a functional program by introducing appropriate context manipulatio...
109
click to vote
JFP
2000
15 years 14 days ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
111
Voted
SIGSOFT
2006
ACM
16 years 1 months ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
112
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
113
Voted
ESOP
2010
Springer
15 years 10 months ago
2010
Springer
The specification of the Java Memory Model (JMM) is phrased in terms of acceptors of execution sequences rather than the standard generative view of operational semantics. This cre...