Sciweavers

5255 search results - page 392 / 1051
» Formal Methods for Privacy
Sort
View
KBSE
1998
IEEE
15 years 9 months ago
From Z to BON/Eiffel
It is shown how to make a transition from the Z formal notation [3] to the Business Object Notation (BON) [4]. It is demonstrated that BON has the expressive power of Z, with the ...
Richard F. Paige, Jonathan S. Ostroff
ZUM
1998
Springer
105views Formal Methods» more  ZUM 1998»
15 years 9 months ago
Comparing Extended Z with a Heterogeneous Notation for Reasoning about Time and Space
We contrast using a notation extension with using a combination of notations. Specifically, we compare the use of an extended dialect of Z [10] with a combination of Z and predicat...
Richard F. Paige
COMPOS
1997
Springer
15 years 9 months ago
Compositional Reasoning in Model Checking
The main problem in model checking that prevents it from being used for veri cation of large systems is the state explosion problem. This problem often arises from combining parall...
Sergey Berezin, Sérgio Vale Aguiar Campos, ...
COMPOS
1997
Springer
15 years 9 months ago
Compositional Refinement of Interactive Systems Modelled by Relations
We introduce a mathematical model of components that can be used for the description of both hardware and software units forming distributed interactive systems. As part of a distr...
Manfred Broy
152
Voted
IFL
1997
Springer
158views Formal Methods» more  IFL 1997»
15 years 9 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