Sciweavers

4340 search results - page 357 / 868
» Formal Methods and Cryptography
Sort
View
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
SAS
1999
Springer
117views Formal Methods» more  SAS 1999»
15 years 11 months ago
Abstracting Cryptographic Protocols with Tree Automata
ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...
David Monniaux
FTRTFT
1998
Springer
15 years 11 months ago
Predictability in Critical Systems
Predictability is crucial in critical applications and systems. Therefore, we examine sources of uncertainty for each of the four phases that span a project lifecycle, from initial...
Gérard Le Lann
IFL
1998
Springer
113views Formal Methods» more  IFL 1998»
15 years 11 months ago
Shared Memory Multiprocessor Support for SAC
Abstract. Sac (Single Assignment C) is a strict, purely functional programming language primarily designed with numerical applications in mind. Particular emphasis is on efficient ...
Clemens Grelck
FM
1997
Springer
174views Formal Methods» more  FM 1997»
15 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