2688 search results - page 293 / 538 » A formal semantics for P3P |
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...
182
click to vote
TYPES
1998
Springer
15 years 11 months ago
1998
Springer
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We t...
172
click to vote
FTRTFT
1994
Springer
15 years 10 months ago
1994
Springer
We specify the black box behavior of dataflow components by characterizing the relation between their input and their output histories. We distinguish between three main classes of...
244
click to vote
AGTIVE
2007
Springer
15 years 10 months ago
2007
Springer
On the basis of a case-study, we demonstrate the usefulness of topology invariants for model-driven systems development. Considering a graph grammar semantics for a relevant fragme...
193
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Existing approaches to knowledge representation and reasoning in the context of open systems either deal with "objective" knowledge or with beliefs. In contrast, there ha...