148 search results - page 12 / 30 » Programming with angelic nondeterminism |
SPIN
2007
Springer
14 years 3 months ago
2007
Springer
Verifying concurrent programs is challenging since the number of thread interleavings that need to be explored can be huge even for moderate programs. We present a cartesian semant...
EMSOFT
2006
Springer
14 years 1 months ago
2006
Springer
Concurrent programming languages should be a good fit for embedded systems because they match the intrinsic parallelism of their architectures and environments. Unfortunately, typ...
PADL
2000
Springer
14 years 1 months ago
2000
Springer
In this paper, we demonstrate how Functional Reactive Programming (FRP), a framework for the description of interactive systems, can be extended to encompass parallel systems. FRP ...
COCO
2004
Springer
14 years 3 months ago
2004
Springer
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
PLPV
2010
ACM
14 years 6 months ago
2010
ACM
Type-based reasoning is popular in functional programming. In particular, parametric polymorphism constrains functions in such a way that statements about their behavior can be de...