Sciweavers

1076 search results - page 7 / 216
» Operations on proofs and labels
Sort
View
FSEN
2009
Springer
14 years 2 months ago
A Timed Calculus for Wireless Systems
We propose a timed process calculus for wireless systems exposed to communication collisions. The operational semantics of our calculus is given in terms of a labelled transition ...
Massimo Merro, Eleonora Sibilio
ICALP
2005
Springer
14 years 1 months ago
Basic Observables for a Calculus for Global Computing
We introduce a foundational language for modelling applications over global computers whose interconnection structure can be explicitly manipulated. Together with process distribut...
Rocco De Nicola, Daniele Gorla, Rosario Pugliese
APLAS
2007
ACM
13 years 11 months ago
Complete Lattices and Up-To Techniques
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
Damien Pous
TON
2008
160views more  TON 2008»
13 years 7 months ago
Label space reduction in MPLS networks: how much can a single stacked label do?
Most network operators have considered reducing LSR label spaces (number of labels used) as a way of simplifying management of underlaying Virtual Private Networks (VPNs) and there...
Fernando Solano, Thomas Stidsen, Ramón Fabr...
ENTCS
2006
143views more  ENTCS 2006»
13 years 7 months ago
Hiproofs: A Hierarchical Notion of Proof Tree
Motivated by the concerns of theorem-proving, we generalise the notion of proof tree to that of hierarchical proof tree. Hierarchical trees extend ordinary trees by adding partial...
Ewen Denney, John Power, Konstantinos Tourlas