Sciweavers

61 search results - page 3 / 13
» Partial Order Reduction for Rewriting Semantics of Programmi...
Sort
View
PPDP
2007
Springer
14 years 2 months ago
Computing with subspaces
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...
Sergio Antoy, Bernd Braßel
FLOPS
2008
Springer
13 years 10 months ago
Rewriting and Call-Time Choice: The HO Case
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...
Francisco Javier López-Fraguas, Juan Rodr&i...
ENTCS
2007
91views more  ENTCS 2007»
13 years 8 months ago
Rule-Based Operational Semantics for an Imperative Language
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...
Florent Kirchner, François-Régis Sin...
ECOOP
1998
Springer
14 years 23 days ago
An Imperative, First-Order Calculus with Object Extension
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...
Viviana Bono, Kathleen Fisher
TACAS
2009
Springer
212views Algorithms» more  TACAS 2009»
14 years 3 months ago
Semantic Reduction of Thread Interleavings in Concurrent Programs
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...
Vineet Kahlon, Sriram Sankaranarayanan, Aarti Gupt...