1631 search results - page 14 / 327 » Extreme Programming - Back to Basics |
ICALP
1997
Springer
15 years 6 months ago
1997
Springer
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...
138
Voted
CCS
2005
ACM
15 years 8 months ago
2005
ACM
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...
101
click to vote
ICALP
1991
Springer
15 years 6 months ago
1991
Springer
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...
109
Voted
FLOPS
2004
Springer
15 years 7 months ago
2004
Springer
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...
120
click to vote
ISCAS
1999
IEEE
15 years 6 months ago
1999
IEEE
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...