Sciweavers

1631 search results - page 14 / 327
» Extreme Programming - Back to Basics
Sort
View
ICALP
1997
Springer
14 years 2 months ago
Basic Observables for Processes
We propose a general approach for defining behavioural preorders over process terms as the maximal pre–congruences induced by basic observables. We will consider three of these...
Michele Boreale, Rocco De Nicola, Rosario Pugliese
CCS
2005
ACM
14 years 3 months ago
Formal security analysis of basic network-attached storage
We study formal security properties of network-attached storage (NAS) in an applied pi calculus. We model NAS as an implementation of a specification based on traditional central...
Avik Chaudhuri, Martín Abadi
ICALP
1991
Springer
14 years 1 months ago
The Expected Extremes in a Delaunay Triangulation
We give an expected-case analysis of Delaunay triangulations. To avoid edge effects we consider a unit-intensity Poisson process in Euclidean d-space, and then limit attention to...
Marshall W. Bern, David Eppstein, F. Frances Yao
FLOPS
2004
Springer
14 years 3 months ago
Basic Pattern Matching Calculi: a Fresh View on Matching Failure
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...
Wolfram Kahl
ISCAS
1999
IEEE
66views Hardware» more  ISCAS 1999»
14 years 2 months ago
Low energy register allocation beyond basic blocks
An approach of doing register allocation beyond basic blocks for low energy is presented in this paper. With careful analysis of boundary conditions between consecutive blocks, ou...
Yumin Zhang, Xiaobo Hu, Danny Z. Chen