Sciweavers

4850 search results - page 277 / 970
» Proof and Computation in Geometry
Sort
View
LPAR
2004
Springer
16 years 23 hour ago
Knowledge-Based Synthesis of Distributed Systems Using Event Structures
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
Mark Bickford, Robert L. Constable, Joseph Y. Halp...
ACTA
2006
108views more  ACTA 2006»
15 years 6 months ago
Refinement verification of the lazy caching algorithm
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
Wim H. Hesselink
IJISEC
2007
88views more  IJISEC 2007»
15 years 6 months ago
Secure group key establishment revisited
Abstract. We examine the popular proof models for group key establishment of Bresson et al. [BCPQ01,BCP01] and point out missing security properties addressing malicious protocol p...
Jens-Matthias Bohli, Maria Isabel Gonzalez Vasco, ...
APAL
2005
107views more  APAL 2005»
15 years 6 months ago
Uniform Heyting arithmetic
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
Ulrich Berger
ICPR
2008
IEEE
16 years 7 months ago
Robust decomposition of a digital curve into convex and concave parts
We propose a linear in time and easy-to-implement algorithm that robustly decomposes a digital curve into convex and concave parts. This algorithm is based on classical tools in d...
Tristan Roussillon, Isabelle Sivignon, Laure Tougn...