61 search results - page 3 / 13 » Partial Order Reduction for Rewriting Semantics of Programmi... |
121
click to vote
PPDP
2007
Springer
15 years 9 months ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
127
Voted
FLOPS
2008
Springer
15 years 4 months ago
2008
Springer
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
106
Voted
ENTCS
2007
15 years 3 months ago
2007
Operational semantics for programming languages usually come in two flavours: big-step and small-step. Both are defined using deduction rules with a congruence rule allowing redu...
128
click to vote
ECOOP
1998
Springer
15 years 7 months ago
1998
Springer
This paper presents an imperative object calculus designed to support class-based programming via a combination of extensible objects and encapsulation. This calculus simplifies th...
158
click to vote
TACAS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We propose a static analysis framework for concurrent programs based on reduction of thread interleavings using sound invariants on the top of partial order techniques. S...