3228 search results - page 169 / 646 » Computationally Sound Proofs |
206
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
170
click to vote
PLDI
2012
ACM
13 years 9 months ago
2012
ACM
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
152
click to vote
GC
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We present the computational counterpart of the KGP (Knowledge, Goals, Plan) declarative model of agency for Global Computing. In this context, a computational entity is ...
185
click to vote
TPHOL
2005
IEEE
16 years 2 days ago
2005
IEEE
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
196
click to vote
PLDI
2003
ACM
15 years 11 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...