442 search results - page 50 / 89 » Proof Abstraction for Imperative Languages |
153
click to vote
PPDP
2009
Springer
15 years 12 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
160
click to vote
ICFP
2000
ACM
15 years 9 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
138
click to vote
ECOOP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. A properly encapsulated data representation can be revised for refactoring or other purposes without affecting the correctness of client programs and extensions of a clas...
181
click to vote
FMCO
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. A temporal logic is proposed as a tool for specifying properties of Klaim programs. Klaim is an experimental programming language that supports a programming paradigm whe...
151
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We prove a new congruence result for the π-calculus: bisimilarity is a congruence in the sub-calculus that does not include restriction nor sum, and features top-level r...