作者: Reclaim 時(shí)間: 2025-3-22 00:01 作者: 云狀 時(shí)間: 2025-3-22 01:39 作者: Macronutrients 時(shí)間: 2025-3-22 07:05 作者: 陳腐的人 時(shí)間: 2025-3-22 12:32 作者: headway 時(shí)間: 2025-3-22 16:09
,Fehlerabsch?tzungen zum Galerkin-Verfahren,ed by O’Hearn. The logic allows program proofs in which “ownership” of a piece of state is deemed to transfer dynamically between processes and resources. We prove soundness of this logic, using a novel “l(fā)ocal” interpretation of traces, and we show that every provable program is race-free.作者: headway 時(shí)間: 2025-3-22 19:46 作者: 能得到 時(shí)間: 2025-3-23 00:04
https://doi.org/10.1007/978-3-0348-5971-4rived in a modular way. Moreover, we show that the logics thus obtained inherit soundness, completeness and expressiveness properties from their building blocks. We apply these techniques to derive sound, complete and expressive logics for a wide variety of probabilistic systems.作者: Perineum 時(shí)間: 2025-3-23 03:51 作者: CURB 時(shí)間: 2025-3-23 06:37
A Semantics for Concurrent Separation Logiced by O’Hearn. The logic allows program proofs in which “ownership” of a piece of state is deemed to transfer dynamically between processes and resources. We prove soundness of this logic, using a novel “l(fā)ocal” interpretation of traces, and we show that every provable program is race-free.作者: ODIUM 時(shí)間: 2025-3-23 10:50 作者: narcotic 時(shí)間: 2025-3-23 17:31
Modular Construction of Modal Logicsrived in a modular way. Moreover, we show that the logics thus obtained inherit soundness, completeness and expressiveness properties from their building blocks. We apply these techniques to derive sound, complete and expressive logics for a wide variety of probabilistic systems.作者: gastritis 時(shí)間: 2025-3-23 21:52
Verification by Network Decompositione network to several calls on small networks. We thus obtain cut-offs for arbitrary classes of networks, adding to previous work by Emerson and Namjoshi on the ring topology. Our results on . ? . are complemented by a negative result which precludes the existence of reductions for . ? . on general networks.作者: FLAX 時(shí)間: 2025-3-24 00:32
https://doi.org/10.1007/978-3-0348-5971-4 on the groups in control of the communication channels. Type preservation provides the basis for a safety theorem stating that in well-typed processes all names flow according to the delivery policies specified by their types, and are received at the intended sites with the intended capabilities.作者: drusen 時(shí)間: 2025-3-24 04:13 作者: flutter 時(shí)間: 2025-3-24 07:30
Type Based Discretionary Access Control on the groups in control of the communication channels. Type preservation provides the basis for a safety theorem stating that in well-typed processes all names flow according to the delivery policies specified by their types, and are received at the intended sites with the intended capabilities.作者: 格言 時(shí)間: 2025-3-24 13:33 作者: Blemish 時(shí)間: 2025-3-24 17:04 作者: venous-leak 時(shí)間: 2025-3-24 22:52 作者: 索賠 時(shí)間: 2025-3-24 23:21
Anwendung programmierbarer Taschenrechnerrete bisimulations approximating barbed equivalence have been defined. We propose a symbolic bisimulation that is sound with respect to barbed equivalence, and brings us closer to automated bisimulation checks.作者: Benzodiazepines 時(shí)間: 2025-3-25 03:50 作者: Mangle 時(shí)間: 2025-3-25 09:27 作者: insincerity 時(shí)間: 2025-3-25 14:22
Symbolic Bisimulation in the Spi Calculusrete bisimulations approximating barbed equivalence have been defined. We propose a symbolic bisimulation that is sound with respect to barbed equivalence, and brings us closer to automated bisimulation checks.作者: Bureaucracy 時(shí)間: 2025-3-25 16:42 作者: conformity 時(shí)間: 2025-3-25 22:11 作者: 控制 時(shí)間: 2025-3-26 04:08
978-3-540-22940-7Springer-Verlag Berlin Heidelberg 2004作者: 現(xiàn)代 時(shí)間: 2025-3-26 08:13 作者: 滑稽 時(shí)間: 2025-3-26 12:09
Basic Theory of Reduction Congruence forTwo Timed Asynchronous ,-Calculiracterisations, 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.作者: 鋸齒狀 時(shí)間: 2025-3-26 14:22 作者: Fissure 時(shí)間: 2025-3-26 17:57 作者: CHASM 時(shí)間: 2025-3-26 22:07 作者: intolerance 時(shí)間: 2025-3-27 01:34 作者: figurine 時(shí)間: 2025-3-27 06:23 作者: 姑姑在炫耀 時(shí)間: 2025-3-27 11:00
0302-9743 Overview: 978-3-540-22940-7978-3-540-28644-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 畢業(yè)典禮 時(shí)間: 2025-3-27 17:28 作者: Allergic 時(shí)間: 2025-3-27 18:21 作者: mortuary 時(shí)間: 2025-3-27 22:30 作者: disrupt 時(shí)間: 2025-3-28 03:37
,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 needs only polynomial time.作者: Muscularis 時(shí)間: 2025-3-28 08:46
Numerische Methoden bei Optimierungsaufgaben seen as a synchronization and incurs no additional cost on the communication structure. It is shown that, given a past, a computation step can be taken back if and only if it leads to a causally equivalent past.作者: hyperuricemia 時(shí)間: 2025-3-28 12:11 作者: 無(wú)辜 時(shí)間: 2025-3-28 14:34
,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) 時(shí)間: 2025-3-28 19:30 作者: Coma704 時(shí)間: 2025-3-29 00:24
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ì) 時(shí)間: 2025-3-29 05:10 作者: 整頓 時(shí)間: 2025-3-29 11:07 作者: 心胸狹窄 時(shí)間: 2025-3-29 15:08
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.作者: 一大塊 時(shí)間: 2025-3-29 17:10 作者: 向外才掩飾 時(shí)間: 2025-3-29 22:05 作者: BOON 時(shí)間: 2025-3-30 01:19
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作者: 取之不竭 時(shí)間: 2025-3-30 04:33
,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作者: growth-factor 時(shí)間: 2025-3-30 11:00
https://doi.org/10.1007/978-3-0348-5971-4al entities on par with objects, functions and horn-clauses. To this end, we introduce .ABC, a name-based calculus, that incorporates aspects as primitive. In contrast to earlier work on aspects in the context of object-oriented and functional programming, the only computational entities in .ABC are作者: 吹牛大王 時(shí)間: 2025-3-30 14:12
https://doi.org/10.1007/978-3-0348-5971-4selected classes of principals. We study a type-based theory of DAC models for concurrent and distributed systems represented as terms of Cardelli, Ghelli and Gordon’s pi calculus with groups [2]. In our theory, groups play the r?le of principals, and the structure of types allows fine-grained mecha作者: CEDE 時(shí)間: 2025-3-30 20:23 作者: glowing 時(shí)間: 2025-3-30 21:57
https://doi.org/10.1007/978-3-0348-5971-4odal logics to specify behavioural properties of systems. We show that the syntax, semantics and proof systems associated to such logics can all be derived in a modular way. Moreover, we show that the logics thus obtained inherit soundness, completeness and expressiveness properties from their build作者: 小口啜飲 時(shí)間: 2025-3-31 04:43
Peter L. Hammer,Ivo G. Rosenberged . ? . property, we show how to decompose the network graph into multiple constant size networks, thereby reducing one model checking call on a large network to several calls on small networks. We thus obtain cut-offs for arbitrary classes of networks, adding to previous work by Emerson and Namjos作者: TEN 時(shí)間: 2025-3-31 06:34
Numerische Methoden bei Optimierungsaufgaben seen as a synchronization and incurs no additional cost on the communication structure. It is shown that, given a past, a computation step can be taken back if and only if it leads to a causally equivalent past.作者: 騷擾 時(shí)間: 2025-3-31 10:57
https://doi.org/10.1007/978-3-0348-6988-1In this paper we show how a resource-oriented logic, separation logic, can be used to reason about the usage of resources in concurrent programs.作者: saturated-fat 時(shí)間: 2025-3-31 15:34
https://doi.org/10.1007/978-3-0348-5971-4We present a symbolic decision procedure for time-sensitive cryptographic protocols with time-stamps. Our decision procedure deals with secrecy, authentication and any property that can be described as an invariance property.作者: Osteoporosis 時(shí)間: 2025-3-31 17:29 作者: BACLE 時(shí)間: 2025-4-1 00:56 作者: Dna262 時(shí)間: 2025-4-1 02:25
Zing: Exploiting Program Structure for Model Checking Concurrent Softwareent programs automatically and check the behaviors of these models systematically. The . project is an effort to build a flexible infrastructure to represent and model check abstractions of large concurrent software..To support automatic extraction of models from programs written in common programmi作者: Eclampsia 時(shí)間: 2025-4-1 07:33
A Semantics for Concurrent Separation Logiconal 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作者: seroma 時(shí)間: 2025-4-1 13:15
A Survey of Regular Model Checkingd as words over a finite alphabet. Examples include parameterized systems consisting of an arbitrary number of homogeneous finite-state processes connected in a linear or ring-formed topology, and systems that operate on queues, stacks, integers, and other linear data structures. The main idea is to作者: 侵略者 時(shí)間: 2025-4-1 16:33
Resource Control for Synchronous Cooperative Threadsd 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作者: 搜集 時(shí)間: 2025-4-1 19:13
