Sciweavers

362 search results - page 49 / 73
» Formal Theories for Linear Algebra
Sort
View
ENTCS
2007
98views more  ENTCS 2007»
13 years 9 months ago
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
Jesper Bengtson, Joachim Parrow
ICTAC
2010
Springer
13 years 8 months ago
A Modality for Safe Resource Sharing and Code Reentrancy
Abstract. The potential of linear logic in facilitating reasoning on resource usage has long been recognized. However, convincing uses of linear types in practical programming are ...
Rui Shi, Dengping Zhu, Hongwei Xi
CORR
2004
Springer
111views Education» more  CORR 2004»
13 years 9 months ago
Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard
Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear cod...
Venkatesan Guruswami, Alexander Vardy
COMCOM
1998
95views more  COMCOM 1998»
13 years 9 months ago
Correlation properties of the token leaky bucket departure process
In this paper we focus on the behavior of the token leaky bucket mechanism with respect to second-order statistics of the departure process under various correlated cell arrival a...
Kenneth Mitchell, Appie van de Liefvoort, Jerry Pl...
TC
1998
13 years 9 months ago
An Efficient Solution to the Cache Thrashing Problem Caused by True Data Sharing
—When parallel programs are executed on multiprocessors with private caches, a set of data may be repeatedly used and modified by different threads. Such data sharing can often r...
Guohua Jin, Zhiyuan Li, Fujie Chen