Titlebook: CONCUR 2004 -- Concurrency Theory; 15th International C Philippa Gardner,Nobuko Yoshida Conference proceedings 2004 Springer-Verlag Berlin

無(wú)辜

,Fehlerabsch?tzungen zum Galerkin-Verfahren,onal critical regions. We introduce a resource-sensitive logic for partial correctness, adapting separation logic to the concurrent setting, as proposed by O’Hearn. The logic allows program proofs in which “ownership” of a piece of state is deemed to transfer dynamically between processes and resour

翻動(dòng)

Coma704

https://doi.org/10.1007/978-3-0348-6988-1d with a . model of interaction based on cooperative threads whose execution proceeds in synchronous rounds called instants. Our contribution is a system of compositional static analyses to guarantee that each instant terminates and to bound the size of the values computed by the system as a functio

不理會(huì)

整頓

心胸狹窄

Asymptotisch Optimale Quadraturverfahren,racterisations, one of them being a labelled asynchronous bisimilarity. These results are adapted to an asynchronous .-calculus with timers, locations and message failure. In addition we investigate the problem of how to distribute value-passing processes in a semantics-preserving way.

一大塊

向外才掩飾

BOON

Anwendung programmierbarer Taschenrechner can be formulated as equations between spi calculus terms, where equality is interpreted as a contextual equivalence..One problem with verifying contextual equivalences for messagepassing process calculi is the infinite branching on process input. In this paper, we propose a general symbolic semant

取之不竭

,Dualit?t und Optimale Steuerungen,PA and BPP processes we obtain polynomial-time algorithms. Further, we show that probabilistic bisimilarity between probabilistic pushdown automata and finite-state systems is decidable in exponential time. If the number of control states in PDA is bounded by a fixed constant, then the algorithm nee