標(biāo)題: Titlebook: Verification of Sequential and Concurrent Programs; Krzysztof R. Apt,Ernst-Rüdiger Olderog Book 19911st edition Springer Science+Business [打印本頁] 作者: 照相機(jī) 時(shí)間: 2025-3-21 18:18
書目名稱Verification of Sequential and Concurrent Programs影響因子(影響力)
書目名稱Verification of Sequential and Concurrent Programs影響因子(影響力)學(xué)科排名
書目名稱Verification of Sequential and Concurrent Programs網(wǎng)絡(luò)公開度
書目名稱Verification of Sequential and Concurrent Programs網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Verification of Sequential and Concurrent Programs被引頻次
書目名稱Verification of Sequential and Concurrent Programs被引頻次學(xué)科排名
書目名稱Verification of Sequential and Concurrent Programs年度引用
書目名稱Verification of Sequential and Concurrent Programs年度引用學(xué)科排名
書目名稱Verification of Sequential and Concurrent Programs讀者反饋
書目名稱Verification of Sequential and Concurrent Programs讀者反饋學(xué)科排名
作者: 金盤是高原 時(shí)間: 2025-3-21 21:07
Verification of Sequential and Concurrent Programs978-1-4757-4376-0Series ISSN 0172-603X Series E-ISSN 2512-5486 作者: 阻塞 時(shí)間: 2025-3-22 00:44
IntroductionThis book is about program verification, with a special emphasis on verification of concurrent programs. Concurrent programs are usually difficult to design, and errors are more a rule than an exception. Consider, for example, the following simple problem.作者: 鎮(zhèn)壓 時(shí)間: 2025-3-22 06:55 作者: 招致 時(shí)間: 2025-3-22 09:28
Nondeterministic ProgramsActivating a deterministic program in a certain state will generate exactly one computation sequence. Often this level of detail is unnecessary, for example when two different computation sequences yield the same final state. The phenomenon that a program may generate more than one computation sequence from a given state is called ..作者: 卡死偷電 時(shí)間: 2025-3-22 13:04
Monographs in Computer Sciencehttp://image.papertrans.cn/v/image/981712.jpg作者: 樹膠 時(shí)間: 2025-3-22 17:26
https://doi.org/10.1007/978-1-4757-4376-0Area; Division; Variable; form; program transformation; program verification; proof; semantics; sound; transf作者: antenna 時(shí)間: 2025-3-22 23:40 作者: ALLAY 時(shí)間: 2025-3-23 03:17
Parallel Programs with Synchronizatione other components changes the shared variables into a more favourable state. We therefore extend now (in Section 7.1) the program syntax by a synchronization construct, the .-statement introduced in Owicki and Gries [OG76a].作者: byline 時(shí)間: 2025-3-23 05:38 作者: licence 時(shí)間: 2025-3-23 10:59
ombination of monadic predicates in the theory. Recently, Veanes et al. showed the usefulness of monadic decomposability in the context of SMT (i.e. the input formula is quantifier-free), and found various interesting applications including string analysis. However, checking monadic decomposability 作者: 商議 時(shí)間: 2025-3-23 16:54
Krzysztof R. Apt,Ernst-Rüdiger Olderogis, pattern recognition, biology, artificial intelligence, and automated reasoning. The first essay provides a sketch of his life, emphasizing his scientific contributions. The diversity of the fields to which Bledsoe has contributed is reflected in the range of the other essays, which are original 作者: monogamy 時(shí)間: 2025-3-23 19:54 作者: MINT 時(shí)間: 2025-3-23 23:09 作者: 提煉 時(shí)間: 2025-3-24 02:20 作者: Aggressive 時(shí)間: 2025-3-24 09:45
Krzysztof R. Apt,Ernst-Rüdiger Olderogt the exchange of sensitive data, to the definition of structured interaction patterns to convey application-specific guarantees. Current security infrastructures provide very limited support for the specification of such guarantees. As a consequence, the high-level security properties of a protocol作者: Perigee 時(shí)間: 2025-3-24 12:02 作者: 碎石頭 時(shí)間: 2025-3-24 15:59
Krzysztof R. Apt,Ernst-Rüdiger Olderogedge bases representing product features—these deductive tools are suitable. However, there remain many domains for which these tools seem overly strong. If, ., an artificial conversational agent maintains a knowledge base cataloging . an interlocutor’s . or ., it is unlikely that the model’s conten作者: 完整 時(shí)間: 2025-3-24 21:12 作者: 反感 時(shí)間: 2025-3-25 03:15 作者: Scintillations 時(shí)間: 2025-3-25 04:53 作者: STING 時(shí)間: 2025-3-25 09:51
Krzysztof R. Apt,Ernst-Rüdiger Olderogs language in which proofs are represented as finite, locally sound derivation trees with a “repeat function” identifying cyclic proof sections. Soundness is guaranteed by a well-foundedness condition formulated globally in terms of . over the proof tree, following an idea due to Sprenger and Dam. H作者: 結(jié)果 時(shí)間: 2025-3-25 13:30 作者: 手術(shù)刀 時(shí)間: 2025-3-25 16:55 作者: venous-leak 時(shí)間: 2025-3-25 23:28 作者: 無效 時(shí)間: 2025-3-26 01:57
Krzysztof R. Apt,Ernst-Rüdiger Olderogc...Chapter ‘A Fast Verified Liveness Analysis in SSA Form’ is available open access under a Creative Commons Attribution 4.0 International License via link.spr978-3-030-51053-4978-3-030-51054-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 教育學(xué) 時(shí)間: 2025-3-26 05:51
Book 19911st editionle cornucopia of pro- gramming constructs from which an appropriate selection has to be made. Having studied some of these constructs separately does not yet imply that we understand their combined effect.作者: prosthesis 時(shí)間: 2025-3-26 09:24 作者: amygdala 時(shí)間: 2025-3-26 14:18
abilities guaranteeing that the above mentioned class of automata is closed under the application of the remaining attacker rules. The class of protocols respecting these restrictions is large enough to cover several existing protocols, such as the GDH family, GKE, and others.作者: Lyme-disease 時(shí)間: 2025-3-26 18:08
orst case. We provide a new application of our results to string constraint solving with length constraints. We then extend our results to variadic decomposability, where predicates could admit multiple free variables (in contrast to monadic decomposability). Finally, we give an application to quant作者: 表示問 時(shí)間: 2025-3-26 22:46 作者: Flatus 時(shí)間: 2025-3-27 01:25
the alphabet of labels. Thus, beyond reachability, a player may restrict attention to paths that satisfy certain properties, referring, for example, to the providers of the traversed edges, the actions associated with them, their quality of service, or security. Our results show that the transition作者: Guaff豪情痛飲 時(shí)間: 2025-3-27 08:45
Krzysztof R. Apt,Ernst-Rüdiger Olderog shield the design from the details of the underlying cryptographic infrastructure. We discuss an implementation of the abstractions based on a translation from the . notation to the AnB language supported by the OFMC [1,2] verification tool. We show the practical effectiveness of our approach by re作者: 內(nèi)向者 時(shí)間: 2025-3-27 12:15
examine the extended use of context lemmas during proof search by allowing the use of context lemmas for subsumption of new tableau clauses. We also show limitations to this method. Both techniques described in this paper are being implemented as part of the DCTP disconnection tableau prover.作者: escalate 時(shí)間: 2025-3-27 14:59 作者: 情愛 時(shí)間: 2025-3-27 20:58
Krzysztof R. Apt,Ernst-Rüdiger Olderoges directly at any node in a nested sequent. This calculus corresponds to Kashima’s .2., but with all structural rules absorbed into logical rules. We show that . and . are equivalent, that is, any cut-free proof of . can be transformed into a cut-free proof of ., and vice versa. We consider two ext作者: 女歌星 時(shí)間: 2025-3-28 00:00
Krzysztof R. Apt,Ernst-Rüdiger Olderogfor multiplicities in matrix systems..We obtain two kinds of upper bounds: in function of the size of the formula to be proved and in function of the number of the atomic paths through the unindexed formula-tree. Such bounds may be non-optimal. However, the method used to establish them may be usefu作者: 粗俗人 時(shí)間: 2025-3-28 04:41
s result, combined with a ‘one-step version’ of the classical correspondence theory, turns out to be quite powerful in applications. For simple logics such as ., ., ., ., etc, establishing basic metatheoretical properties becomes a completely automatic task (the related proof obligations can be inst作者: anthesis 時(shí)間: 2025-3-28 09:56 作者: grovel 時(shí)間: 2025-3-28 12:04
us for the Horn-clause fragment of hybrid-dynamic first-order logic. We investigate soundness and compactness properties for the syntactic entailment system that corresponds to this proof calculus, and prove a Birkhoff-completeness result for hybrid-dynamic first-order logic.作者: DAUNT 時(shí)間: 2025-3-28 16:45 作者: Customary 時(shí)間: 2025-3-28 20:24
Parallel Programs with Shared Variablesof a large data base. Sharing is also useful to establish communication between different components, as in the case of a data bus. This form of concurrency can be modeled by means of parallel programs with ., variables that can be changed and read by several components.作者: 歹徒 時(shí)間: 2025-3-28 23:02
Distributed Programserminals in many different travel agencies and a central data base for keeping the current status of all flights. Here the data base and the terminals are the components of the system, and communication is possible between each terminal and the data base.作者: frivolous 時(shí)間: 2025-3-29 05:14
