標題: Titlebook: Logics of Programs; Workshop, Yorktown H Dexter Kozen Conference proceedings 1982 Springer-Verlag Berlin Heidelberg 1982 algorithms.concurr [打印本頁] 作者: 贊美 時間: 2025-3-21 19:50
書目名稱Logics of Programs影響因子(影響力)
書目名稱Logics of Programs影響因子(影響力)學(xué)科排名
書目名稱Logics of Programs網(wǎng)絡(luò)公開度
書目名稱Logics of Programs網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Logics of Programs被引頻次
書目名稱Logics of Programs被引頻次學(xué)科排名
書目名稱Logics of Programs年度引用
書目名稱Logics of Programs年度引用學(xué)科排名
書目名稱Logics of Programs讀者反饋
書目名稱Logics of Programs讀者反饋學(xué)科排名
作者: aqueduct 時間: 2025-3-21 20:50 作者: 消息靈通 時間: 2025-3-22 03:50 作者: Concrete 時間: 2025-3-22 07:03
Theo M. V. Janssen,Peter van Emde Boasivistische, voluntaristische spontaneistische oder aktionistische Ans?tze überziehen die Freiheit individuellen Bewu?tseins und Handelns und verkennen die natürliche, vor allem aber die historische Strukturierung der Subjekte, Personen oder Individuen selber. Wir haben schlie?lich behauptet, da? ein作者: 范圍廣 時間: 2025-3-22 12:25
A. J. Kfouryr modernisierungstheoretischen, Struktur-funktionalistischen und der marxistischen Tradition. Diese Traditionen haben daher auch die wichtigsten Theorie- und Forschungsstrategien inspiriert, in welchen systematisch nach sozialstrukturellen Bedingungen und Ursachen kollektiven Handelns gefragt wurde.作者: Circumscribe 時間: 2025-3-22 15:47 作者: 法律 時間: 2025-3-22 20:48
Leslie Lamport,Susan Owickinsf?hig geblieben sind. Quelloffene Lizenzen haben im Verbund mit den koordinationserleichternden Eigenschaften des Internets den soziotechnischen Rahmen für eine auf Dauer gestellte Form kollektiver Invention aufgespannt, die zun?chst in subversiven Nischen Anwendung fand und danach von der Softwar作者: 等級的上升 時間: 2025-3-23 01:13 作者: pulmonary-edema 時間: 2025-3-23 04:22 作者: Magnificent 時間: 2025-3-23 08:00 作者: 悅耳 時間: 2025-3-23 10:41 作者: CHIP 時間: 2025-3-23 16:37 作者: 空洞 時間: 2025-3-23 18:25
Some connections between iterative programs, recursive programs, and first-order logic,作者: arcane 時間: 2025-3-24 00:26
Design and synthesis of synchronization skeletons using branching time temporal logic,ations seem particularly suited to the model checker approach to verification: One example is the problem of verifying the correctness of existing network protocols many of which are coded as finite state machines. We encourage additional work in this area.作者: barium-study 時間: 2025-3-24 05:28 作者: Handedness 時間: 2025-3-24 07:51 作者: ARC 時間: 2025-3-24 10:52
Proof rules dealing with fairness,onsidering a translated version of the original program which uses random assignment x:=? and admits only fair runs. The proof rules use infinite ordinals and deal with the original programs and not their translated versions.作者: Vaginismus 時間: 2025-3-24 17:24 作者: 腫塊 時間: 2025-3-24 20:55 作者: 上釉彩 時間: 2025-3-25 02:53 作者: 我不死扛 時間: 2025-3-25 04:43 作者: mortuary 時間: 2025-3-25 11:00 作者: 褲子 時間: 2025-3-25 12:29
,Hoare’s Logic is incomplete when it does not have to be,If Hoare‘s Logic, HL(.), is complete on a structure ., then the set PC(.) of all asserted programs true over . is recursive in the first order theory of ., Th(.). We show that this implication cannot be reversed.作者: 忙碌 時間: 2025-3-25 16:34
A formalism for reasoning about fair termination,Fair termination can be expressed, hence reasoned about, in Park‘s monotone μ-calculus, and the fair weakest precondition operator for boolean guarded do-loops is expressed.作者: 推崇 時間: 2025-3-25 21:12 作者: AMEND 時間: 2025-3-26 03:04 作者: Arroyo 時間: 2025-3-26 05:32 作者: 不理會 時間: 2025-3-26 10:43 作者: aristocracy 時間: 2025-3-26 16:40 作者: groggy 時間: 2025-3-26 16:48
0302-9743 Overview: 978-3-540-11212-9978-3-540-39047-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: COWER 時間: 2025-3-26 21:19
Verification of concurrent programs: Temporal proof principles,vior. These principles can be viewed as providing the temporal semantics of the program. The basic statements thus derived are then combined into temporal proofs for the establishment of eventuality properties. This method generalizes the . method..The proof principles are amply illustrated by examples.作者: defendant 時間: 2025-3-27 03:51 作者: 休閑 時間: 2025-3-27 06:32
Robert L. Constable,Daniel R. Zlatinld von interdisziplin?rem Interesse..Zentrale Kategorie kult.?Ged?chtnis’ und ?Erinnerung’ sind Leitthemen in der Wissenschaft und im gesellschaftlich-politischen Diskurs. - Dieser Band bündelt die verschiedenen Theorien, Terminologien und Methoden aus der Forschung zum individuellen und kollektiven作者: cardiac-arrest 時間: 2025-3-27 09:27 作者: 演繹 時間: 2025-3-27 17:31 作者: 鳥籠 時間: 2025-3-27 20:32 作者: Ebct207 時間: 2025-3-27 21:55 作者: 夸張 時間: 2025-3-28 04:12 作者: optional 時間: 2025-3-28 07:17
Leslie Lamport,Susan Owickiruktion der Ausdifferenzierung quelloffener Softwareprojekte. Daran anknüpfend werden vier idealtypische Varianten derzeitiger Open-Source-Projekte voneinander abgegrenzt – von korporativ geführten Kollaborationsprojekten und elitezentrierten Gemeinschaften über heterarchisch angelegte Infrastruktur作者: 公豬 時間: 2025-3-28 10:48 作者: gait-cycle 時間: 2025-3-28 17:10 作者: 攝取 時間: 2025-3-28 22:42 作者: 易于出錯 時間: 2025-3-29 01:18
Grazyna Mirkowska zur Programmlaufzeit von 183:1 bei herk?mmlichen Programmierverfahren l??t erkennen, da? der Einsatz bei vielen Anwendungen nur in der Gro?serie wirtschaftlich ist. Deshalb werden graphisch-interaktiv unterstützte Verfahren, welche die Programmierzeiten verkürzen, zunehmend an Bedeutung gewinnen. E作者: 芭蕾舞女演員 時間: 2025-3-29 04:04 作者: chondromalacia 時間: 2025-3-29 07:25
Design and synthesis of synchronization skeletons using branching time temporal logic,. We believe that this approach may in the long run turn out to be quite practical. Since synchronization skeletons are, in general, quite small, the potentially exponential behavior of our algorithm need not be an insurmountable obstacle. Much additional research will be needed, however, to make th作者: 惰性女人 時間: 2025-3-29 15:19
The type theory of PL/CV3,y was designed to be useable, the core theory was selected to be analyzable. This presentation strives to be succinct yet thorough. The last section consists of an extended example, but the approach here is not tutorial.作者: Astigmatism 時間: 2025-3-29 17:12
Correctness of programs with function procedures,ation of (possibly recursive) functions. Its expressions occur in the statements of a simple language with assignment, composition and conditionals. A denotational and an operational semantics for this language are provided, and their equivalence is proved. Next, a proof system for partial correctne作者: 痛恨 時間: 2025-3-29 21:12
On induction vs. *-continuity,) under . only, there is a first-order sentence distinguishing separable dynamic algebras from standard Kripke models; whereas (2) under the stronger axiom ., the class of separable dynamic algebras and the class of standard Kripke models are indistinguishable by any sentence of infinitary first-ord作者: 拱形大橋 時間: 2025-3-30 03:27
Verification of concurrent programs: Temporal proof principles, . (.) properties..The proof principle for establishing invariance properties is based on computational induction, and is a generalization of the . method. For a restricted class of concurrent programs we present an algorithm for the automatic derivation of invariant assertions..In order to establis作者: Infinitesimal 時間: 2025-3-30 05:56
Synthesis of communicating processes from Temporal Logic specifications,To specify a process, we give a PTL formula that describes its sequence of communications. The synthesis is done by constructing a model of the given specifications using a tableau-like satisfiability algorithm for PTL. This model can then be interpreted as a program.作者: 利用 時間: 2025-3-30 11:41
7樓作者: 背信 時間: 2025-3-30 15:27
7樓作者: 刪減 時間: 2025-3-30 17:50
8樓作者: 羊欄 時間: 2025-3-30 23:26
8樓作者: Truculent 時間: 2025-3-31 02:39
8樓作者: Implicit 時間: 2025-3-31 06:34
8樓作者: BALK 時間: 2025-3-31 12:08
9樓作者: 嘲弄 時間: 2025-3-31 16:39
9樓作者: 變白 時間: 2025-3-31 18:49
9樓作者: 胰島素 時間: 2025-4-1 00:02
9樓作者: Vulnerable 時間: 2025-4-1 05:43
10樓作者: 警告 時間: 2025-4-1 06:13
10樓作者: 修改 時間: 2025-4-1 10:36
10樓作者: Lipoprotein 時間: 2025-4-1 15:09
10樓
