Sciweavers

MODELAGE
1997
Springer
13 years 11 months ago
Contextual Deontic Logic
Leendert W. N. van der Torre, Yao-Hua Tan
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
13 years 11 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
IFL
1997
Springer
13 years 11 months ago
WITH-Loop-Folding in SAC - Condensing Consecutive Array Operations
This paper introduces a new compiler optimization called with-loop-folding. It is based on a special loop construct, the withloop, which in the functional language Sac (for Single ...
Sven-Bodo Scholz
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
13 years 11 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
IFL
1997
Springer
158views Formal Methods» more  IFL 1997»
13 years 11 months ago
A Compacting Garbage Collector for Unidirectional Heaps
A unidirectional heap is a heap where all pointers go in one direction, e.g. from newer to older objects. For a strict functional language, such as Erlang, the heap may be arranged...
Kent Boortz, Dan Sahlin
FM
1997
Springer
325views Formal Methods» more  FM 1997»
13 years 11 months ago
A Meta-Method for Formal Method Integration
We describe a meta-method for formal method integration Pai97 . The approach is applied to combining formal methods with other formal and semiformal methods. We discuss the theory ...
Richard F. Paige
FM
1997
Springer
258views Formal Methods» more  FM 1997»
13 years 11 months ago
Consistent Graphical Specification of Distributed Systems
: The widely accepted possible benefits of formal methods on the one hand and their minor use compared to informal or graphical description techniques on the other hand have repeat...
Franz Huber, Bernhard Schätz, Geralf Einert
FM
1997
Springer
159views Formal Methods» more  FM 1997»
13 years 11 months ago
Term Rewrite Systems to Derive Set Boolean Operations on 2D Objects
Abstract Set boolean operations between 2-dlmensional geometric objects are crucial in computational geometry and deserve rigorous treatments. We build up a simple and convergent s...
David Cazier, Jean-François Dufourd
FM
1997
Springer
174views Formal Methods» more  FM 1997»
13 years 11 months ago
A Proof Obligation Generator for VDM-SL
In this paper an extension of the IFAD VDM-SL Toolbox with a proof obligation generator is described. Static type checking in VDM is undecidable in general and therefore the type c...
Bernhard K. Aichernig, Peter Gorm Larsen
FM
1997
Springer
126views Formal Methods» more  FM 1997»
13 years 11 months ago
Reconciling Real-Time with Asynchronous Message Passing
At rst sight, real-time and asynchronous message passing like in SDL and ROOM seem to be incompatible. Indeed these languages fail to model real-time constraints accurately. In thi...
Manfred Broy, Radu Grosu, Cornel Klein