328 search results - page 13 / 66 » Proving Termination of Communicating Programs |
115
click to vote
APLAS
2007
ACM
15 years 7 months ago
2007
ACM
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...
126
click to vote
TCS
2010
15 years 1 months ago
2010
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...
135
Voted
CAV
2012
Springer
13 years 5 months ago
2012
Springer
An algorithmic-learning-based termination analysis technique is presented. The new technique combines transition predicate abstraction, algorithmic learning, and decision procedure...
129
Voted
TIT
2010
14 years 10 months ago
2010
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...
107
click to vote
IFIP
2004
Springer
15 years 8 months ago
2004
Springer
—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) ...