Sciweavers

7430 search results - page 661 / 1486
» Programming Applications in CIFF
Sort
View
192
Voted
CADE
2008
Springer
16 years 7 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
ICSE
2003
IEEE-ACM
16 years 7 months ago
Scaling Step-Wise Refinement
Step-wise refinement is a powerful paradigm for developing a complex program from a simple program by adding features incrementally. We present the AHEAD (Algebraic Hierarchical Eq...
Don S. Batory, Jacob Neal Sarvela, Axel Rauschmaye...
ICFP
2004
ACM
16 years 7 months ago
Making a fast curry: push/enter vs. eval/apply for higher-order languages
Higher-order languages that encourage currying are implemented using one of two basic evaluation models: push/enter or eval/apply. Implementors use their intuition and qualitative...
Simon Marlow, Simon L. Peyton Jones
PERCOM
2005
ACM
16 years 6 months ago
Experiences with MundoCore
Pervasive Computing environments require new communication and programming paradigms. In this paper we present our experiences from the implementation of MundoCore, a pervasive co...
Erwin Aitenbichler, Jussi Kangasharju, Max Mü...
189
Voted
SOFSEM
2009
Springer
16 years 4 months ago
From Outermost Termination to Innermost Termination
Abstract. Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important techn...
René Thiemann