Sciweavers

328 search results - page 13 / 66
» Proving Termination of Communicating Programs
Sort
View
APLAS
2007
ACM
13 years 11 months ago
Timed, Distributed, Probabilistic, Typed Processes
This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...
Martin Berger, Nobuko Yoshida
TCS
2010
13 years 6 months ago
On the computational power of BlenX
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...
Alessandro Romanel, Corrado Priami
CAV
2012
Springer
198views Hardware» more  CAV 2012»
11 years 10 months ago
Termination Analysis with Algorithmic Learning
An algorithmic-learning-based termination analysis technique is presented. The new technique combines transition predicate abstraction, algorithmic learning, and decision procedure...
Wonchan Lee, Bow-Yaw Wang, Kwangkeun Yi
TIT
2010
150views Education» more  TIT 2010»
13 years 2 months ago
Information-theoretic key agreement of multiple terminals: part I
This is the first part of a two-part paper on information-theoretically secure secret key agreement. In this part, we study the secrecy problem under the widely studied source mod...
Amin Aminzadeh Gohari, Venkat Anantharam
IFIP
2004
Springer
14 years 1 months ago
Multicode Multirate Compact Assignment of OVSF Codes for QoS Differentiated Terminals
—Orthogonal variable spreading factor (OVSF) codes are used in both universal terrestrial radio access–frequency division duplex (UTRA-FDD) and time division duplex (UTRA-TDD) ...
Yang Yang, Tak-Shing Peter Yum