Sciweavers

1076 search results - page 19 / 216
» Operations on proofs and labels
Sort
View
CPP
2011
99views more  CPP 2011»
12 years 7 months ago
Proof-Carrying Code in a Session-Typed Process Calculus
Abstract. Dependent session types allow us to describe not only properties of the I/O behavior of processes but also of the exchanged data. In this paper we show how to exploit dep...
Frank Pfenning, Luís Caires, Bernardo Tonin...
ORL
2006
85views more  ORL 2006»
13 years 7 months ago
A simple proof of diffusion approximations for LBFS re-entrant lines
For a re-entrant line operating under the last-buffer
Jiankui Yang, J. G. Dai, Jian-Gong You, Hanqin Zha...
FOSSACS
2005
Springer
14 years 1 months ago
Composition and Decomposition in True-Concurrency
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
Sibylle B. Fröschle
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
14 years 2 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
BIOCOMP
2008
13 years 8 months ago
Improved Segmentation Based on Probabilistic Labeling
⎯This paper presents an improved multi-object segmentation algorithm based on probabilistic labeling. First, a critical look is focused on utilizing vector calculus operator and ...
Kai-Chieh Yang, Ming-Chi Jhuang, Chun-Shun Tseng, ...