Sciweavers

5255 search results - page 473 / 1051
» Formal Methods for Privacy
Sort
View
FM
1999
Springer
104views Formal Methods» more  FM 1999»
15 years 11 months ago
On Excusable and Inexcusable Failures
Abstract. The classical concepts of partial and total correctness identify all types of runtime errors and divergence. We argue that the associated notions of translation correctne...
Markus Müller-Olm, Andreas Wolf
IFL
1999
Springer
117views Formal Methods» more  IFL 1999»
15 years 11 months ago
On Code Generation for Multi-generator WITH-Loops in SAC
Abstract. Most array operations in Sac are specified in terms of so-called withloops, a Sac-specific form of array comprehension. Due to the map-like semantics of with-loops its ...
Clemens Grelck, Dietmar Kreye, Sven-Bodo Scholz
179
Voted
SAS
1999
Springer
15 years 11 months ago
Polyhedral Analysis for Synchronous Languages
We define an operational semantics for the Signal language and design an analysis which allows to verify properties pertaining to the relation between values of the numeric and bo...
Frédéric Besson, Thomas P. Jensen, J...
SAS
1999
Springer
124views Formal Methods» more  SAS 1999»
15 years 11 months ago
State Space Reduction Based on Live Variables Analysis
The intrinsic complexity of most protocol speci cations in particular, and of asynchronous systems in general, lead us to study combinations of static analysis with classical model...
Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu
SAS
1999
Springer
15 years 11 months ago
Binary Decision Graphs
Abstract. Binary Decision Graphs are an extension of Binary Decision Diagrams that can represent some infinite boolean functions. Three refinements of BDGs corresponding to class...
Laurent Mauborgne