4036 search results - page 281 / 808 » Formal Methods |
185
click to vote
SAS
1999
Springer
15 years 11 months ago
1999
Springer
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...
153
click to vote
SAS
1999
Springer
15 years 11 months ago
1999
Springer
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...
162
click to vote
SAS
1999
Springer
15 years 11 months ago
1999
Springer
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...
155
click to vote
FTRTFT
1998
Springer
15 years 11 months ago
1998
Springer
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...
181
click to vote
IFL
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. Sac (Single Assignment C) is a strict, purely functional programming language primarily designed with numerical applications in mind. Particular emphasis is on efficient ...