Sciweavers

5084 search results - page 115 / 1017
» Proving Possibility Properties
Sort
View
CORR
2007
Springer
148views Education» more  CORR 2007»
15 years 5 months ago
Linear time algorithms for Clobber
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
Vincent D. Blondel, Julien M. Hendrickx, Raphael M...
ISW
2001
Springer
15 years 10 months ago
Suitability of a Classical Analysis Method for E-commerce Protocols
We present the adaptation of our model for the validation of key distribution and authentication protocols to address specific needs of protocols for electronic commerce. The two ...
Sigrid Gürgens, Javier Lopez
FLOPS
2006
Springer
15 years 9 months ago
Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant
Abstract. We present a practical tool for defining and proving properties of recursive functions in the Coq proof assistant. The tool generates from pseudo-code the graph of the in...
Gilles Barthe, Julien Forest, David Pichardie, Vla...
FM
2006
Springer
111views Formal Methods» more  FM 2006»
15 years 9 months ago
A Formal Template Language Enabling Metaproof
Design patterns are usually described in terms of instances. Templates describe sentences of some language with a particular form, generate sentences upon instantiation, and can be...
Nuno Amálio, Susan Stepney, Fiona Polack
ENTCS
2002
90views more  ENTCS 2002»
15 years 5 months ago
Simple Easy Terms
We illustrate the use of intersection types as a semantic tool for proving easiness result on -terms. We single out the notion of simple easiness for -terms as a useful semantic p...
Fabio Alessi, Stefania Lusin