標(biāo)題: Titlebook: Concurrency, Compositionality, and Correctness; Essays in Honor of W Dennis Dams,Ulrich Hannemann,Martin Steffen Book 2010 The Editor(s) (i [打印本頁(yè)] 作者: Jurisdiction 時(shí)間: 2025-3-21 16:29
書(shū)目名稱(chēng)Concurrency, Compositionality, and Correctness影響因子(影響力)
書(shū)目名稱(chēng)Concurrency, Compositionality, and Correctness影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Concurrency, Compositionality, and Correctness網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Concurrency, Compositionality, and Correctness網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Concurrency, Compositionality, and Correctness被引頻次
書(shū)目名稱(chēng)Concurrency, Compositionality, and Correctness被引頻次學(xué)科排名
書(shū)目名稱(chēng)Concurrency, Compositionality, and Correctness年度引用
書(shū)目名稱(chēng)Concurrency, Compositionality, and Correctness年度引用學(xué)科排名
書(shū)目名稱(chēng)Concurrency, Compositionality, and Correctness讀者反饋
書(shū)目名稱(chēng)Concurrency, Compositionality, and Correctness讀者反饋學(xué)科排名
作者: Reservation 時(shí)間: 2025-3-21 23:50
Compositionality: Ontology and Mereology of Domains,(i)–(iv), together define a concept of entities. We view entities as “things” characterised by properties. We shall review some such properties. Mereology, the study of part-whole relations is then applied to a study of composite entities. We then speculate on compositionality of simple entities, op作者: alliance 時(shí)間: 2025-3-22 00:44
Computer Science and State Machines,re:.Computer scientists collectively suffer from what I call the Whorfian syndrome the confusion of language with reality. Since these devices are described in different languages, they must all be different. In fact, they are all naturally described as state machines.作者: 教義 時(shí)間: 2025-3-22 06:26 作者: Salivary-Gland 時(shí)間: 2025-3-22 12:24
On Trojan Horses of Thompson-Goerigk-Type, Their Generation, Intrusion, Detection and Prevention,cessfully passed Wirth’s strong compiler bootstrapping test and there have been done rigorous verification both of compiling specification and of high level compiler implementation. Thompson demonstrated these errors in 1984. This essay describes Goerigk’s contributions on how to generate, intrude, 作者: Integrate 時(shí)間: 2025-3-22 14:46 作者: Integrate 時(shí)間: 2025-3-22 19:59 作者: EVICT 時(shí)間: 2025-3-22 21:52 作者: 不遵守 時(shí)間: 2025-3-23 04:19 作者: 斗爭(zhēng) 時(shí)間: 2025-3-23 06:34 作者: Heresy 時(shí)間: 2025-3-23 12:29
On the Power of Play-Out for Scenario-Based Programs,cs of live sequence charts (LSC). We compare some of the play-out strategies and mechanisms suggested in the literature, and discuss their strengths and limitations. Specifically, we define a simple infinite hierarchy of LSC programs, and use it to show that smart play-out, the lookahead version of 作者: Spina-Bifida 時(shí)間: 2025-3-23 16:33 作者: 過(guò)分自信 時(shí)間: 2025-3-23 21:09
Meanings of Model Checking,stantive impact on program verification. For the first time industrial strength systems are being verified on a routine basis. As time has progressed, the term model checking has acquired slightly different shades of meaning. In this paper we these consider variant aspects of model checking, elucida作者: 笨拙的你 時(shí)間: 2025-3-23 22:51
,Smaller Abstractions for ?CTL* without Next,constructing abstractions when checking . universal CTL* properties. It is known that functional abstractions are safe and that . universal CTL* is insensitive to finite stuttering. We exploit these results by introducing a safe . that is typically smaller than the usual functional one while at the 作者: PLE 時(shí)間: 2025-3-24 03:58
Timing Verification of GasP Asynchronous Circuits: Predicted Delay Variations Observed by Experimen Effort model used in the spreadsheet estimates the delays of each logic gate in the GasP control. The calculations show how these delays vary in response to differing environmental conditions. The important environmental variable is the physical distance from one GasP module to adjacent modules bec作者: 不吉祥的女人 時(shí)間: 2025-3-24 09:25
Integrated and Automated Abstract Interpretation, Verification and Testing of C/C++ Modules,cation approach for C/C++ modules combining abstract interpretation, formal verification and conventional testing. It is illustrated how testing and formal verification can benefit from abstract interpretation results and, vice versa, how test automation techniques may help to reduce the well known 作者: 谷物 時(shí)間: 2025-3-24 12:30 作者: circumvent 時(shí)間: 2025-3-24 17:14
Ioannis Kordonis,George P. Papavassilopoulosonable models at least) up to a constant factor, the class can be characterized in many alternative ways, involving parallel computation, logic problems like QBF, interactive computation models but also by means of games..In the literature the connection between PSPACE and games is established as a 作者: Annotate 時(shí)間: 2025-3-24 20:57 作者: 不理會(huì) 時(shí)間: 2025-3-25 01:18 作者: 維持 時(shí)間: 2025-3-25 06:57 作者: Commemorate 時(shí)間: 2025-3-25 11:09 作者: foreign 時(shí)間: 2025-3-25 14:32 作者: 小說(shuō) 時(shí)間: 2025-3-25 18:17
Lecture Notes in Mechanical Engineeringence of state-machines, which represents to a congruence relation for asynchronous computations, is not a congruence relation for the classical operators of parallel composition as found in process algebras with synchronous message passing. In the literature we find two fundamentally different propo作者: Gyrate 時(shí)間: 2025-3-25 22:26
Andreas Bittracher,Christof Schütten and improved timing primitives. In addition, we have defined an interface for the co-simulation of a VDM++ model with a continuous-time model of its environment. This enables multi-disciplinary design space exploration and continuous validation of design decisions throughout the development proces作者: Libido 時(shí)間: 2025-3-26 03:50
Andreas Bittracher,Christof Schütte as distributed shared space, global address space and partitioned global address space (PGAS) etc., are widely prevalent in programming languages designed for high performance computing. In this paper, we shall discuss a preliminary work on a proof system for such a language. The language referred 作者: GUEER 時(shí)間: 2025-3-26 08:18 作者: Initial 時(shí)間: 2025-3-26 08:39
Valentin S. Afraimovich,Alexander B. Neimancs of live sequence charts (LSC). We compare some of the play-out strategies and mechanisms suggested in the literature, and discuss their strengths and limitations. Specifically, we define a simple infinite hierarchy of LSC programs, and use it to show that smart play-out, the lookahead version of 作者: follicle 時(shí)間: 2025-3-26 14:57
https://doi.org/10.1007/978-3-319-53673-6roof rule for response properties that deals directly with compassion (strong fairness). The method can be applied to infinite-state systems. In particular, model checking of response of (predicate- and ranking-) . heap programs is automatically transformed into a deductive proof for the . heap syst作者: 字謎游戲 時(shí)間: 2025-3-26 19:03
Laurence Mangin,Maurice Courbagestantive impact on program verification. For the first time industrial strength systems are being verified on a routine basis. As time has progressed, the term model checking has acquired slightly different shades of meaning. In this paper we these consider variant aspects of model checking, elucida作者: 和音 時(shí)間: 2025-3-26 23:02 作者: watertight, 時(shí)間: 2025-3-27 05:03 作者: Innocence 時(shí)間: 2025-3-27 07:59
Kuo-Ming Chao,Lihong Jiang,Xiang Feication approach for C/C++ modules combining abstract interpretation, formal verification and conventional testing. It is illustrated how testing and formal verification can benefit from abstract interpretation results and, vice versa, how test automation techniques may help to reduce the well known 作者: FEIGN 時(shí)間: 2025-3-27 09:29 作者: needle 時(shí)間: 2025-3-27 14:00
https://doi.org/10.1007/978-3-642-11512-7GasP circuits; algorithms; alternative definitions; automated proofs; bisimulation; co-simulation; complex作者: 仔細(xì)檢查 時(shí)間: 2025-3-27 17:55 作者: 哀求 時(shí)間: 2025-3-28 00:25
https://doi.org/10.1007/978-3-031-07305-2In this paper an assertional proof method is introduced which captures concurrent systems consisting of dynamically created recursive processes which interact via shared-variables. The main contribution is a generalization of the Owicki & Gries proof method and a formal justification by soundness and completeness.作者: nutrition 時(shí)間: 2025-3-28 02:43 作者: 肉體 時(shí)間: 2025-3-28 10:12 作者: Biomarker 時(shí)間: 2025-3-28 14:21
A Small Step for Mankind,at observe intermediate states, such as invariant techniques. In this paper, a construction is proposed that generates automatically a small-step SOS semantics from a big-step semantics. This semantics is based on the . technique pioneered by Willem-Paul de Roever et al.作者: colloquial 時(shí)間: 2025-3-28 18:26 作者: CURT 時(shí)間: 2025-3-28 20:53
Dennis Dams,Ulrich Hannemann,Martin Steffen19 detailed papers by eminent scientists in the field of Concurrency, Compositionality and Correctness.Contains a detailed bibliography of the honoree.Closes with a gallery of photographs作者: Omnipotent 時(shí)間: 2025-3-28 23:17 作者: JAUNT 時(shí)間: 2025-3-29 05:30
Concurrency, Compositionality, and Correctness978-3-642-11512-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: PAEAN 時(shí)間: 2025-3-29 10:50
Alexander O. Ivanov,Alexey A. Tuzhilinre:.Computer scientists collectively suffer from what I call the Whorfian syndrome the confusion of language with reality. Since these devices are described in different languages, they must all be different. In fact, they are all naturally described as state machines.作者: WAG 時(shí)間: 2025-3-29 11:51 作者: Cloudburst 時(shí)間: 2025-3-29 17:07
Lecture Notes in Mechanical Engineeringrocessor’s relative urgency. Every scheduled execution is fair and yet, the scheduler is sufficiently permissive (every fair run can be scheduled). In this paper we investigate whether explicit fair scheduling also works with dynamic control, i.e., when new processes may be created dynamically. We give a positive and a negative answer.作者: progestin 時(shí)間: 2025-3-29 23:37 作者: 加入 時(shí)間: 2025-3-30 03:44 作者: echnic 時(shí)間: 2025-3-30 07:20
Formal Semantics of a VDM Extension for Distributed Embedded Systems, environment. This enables multi-disciplinary design space exploration and continuous validation of design decisions throughout the development process. We present an operational semantics which formalizes the precise meaning of the VDM extensions and the co-simulation concept.作者: 名義上 時(shí)間: 2025-3-30 08:37
On the Power of Play-Out for Scenario-Based Programs,nd limitations. Specifically, we define a simple infinite hierarchy of LSC programs, and use it to show that smart play-out, the lookahead version of play-out guided by model-checking, is strictly weaker than full synthesis from LSC.作者: 陶醉 時(shí)間: 2025-3-30 13:58 作者: 可以任性 時(shí)間: 2025-3-30 16:33
Meanings of Model Checking, the term model checking has acquired slightly different shades of meaning. In this paper we these consider variant aspects of model checking, elucidating some often overlooked and subtle distinctions.作者: 僵硬 時(shí)間: 2025-3-30 23:39
,Smaller Abstractions for ?CTL* without Next,sensitive to finite stuttering. We exploit these results by introducing a safe . that is typically smaller than the usual functional one while at the same time more precise, i.e., it has less spurious counter-examples.作者: cauda-equina 時(shí)間: 2025-3-31 03:31
Oleksiy V. Kapustyan,Iryna V. Romaniukerations, events and behaviours in the light of their mereologies. entities. We end the paper with some speculations on the r?le of Galois connections in the study of compositionality and domain mereology.作者: 單色 時(shí)間: 2025-3-31 08:29 作者: 向宇宙 時(shí)間: 2025-3-31 10:48
Lecture Notes in Mechanical Engineeringence relation, introduced by the denotational semantics, given by Tony Hoare for a process algebra like Communicating Sequential Processes (CSP), based on so-called readiness, refusal and failure concepts. In this little note we analyze the question whether the equivalence relation, introduced by denotational semantics is in fact a bisimulation.作者: Adulate 時(shí)間: 2025-3-31 15:27
Kuo-Ming Chao,Lihong Jiang,Xiang Feinces differ by too much. Experimental support for this view comes from the measured behavior of a test chip called “Infinity” built by Sun Microsystems in 90 nanometer CMOS circuits fabricated at TSMC.作者: bronchodilator 時(shí)間: 2025-3-31 19:02 作者: 法律 時(shí)間: 2025-3-31 22:23
Synchronous Message Passing: On the Relation between Bisimulation and Refusal Equivalence,ence relation, introduced by the denotational semantics, given by Tony Hoare for a process algebra like Communicating Sequential Processes (CSP), based on so-called readiness, refusal and failure concepts. In this little note we analyze the question whether the equivalence relation, introduced by denotational semantics is in fact a bisimulation.作者: Proponent 時(shí)間: 2025-4-1 04:52
Timing Verification of GasP Asynchronous Circuits: Predicted Delay Variations Observed by Experimennces differ by too much. Experimental support for this view comes from the measured behavior of a test chip called “Infinity” built by Sun Microsystems in 90 nanometer CMOS circuits fabricated at TSMC.作者: defeatist 時(shí)間: 2025-4-1 07:01
Integrated and Automated Abstract Interpretation, Verification and Testing of C/C++ Modules,blems of aliasing, type casts and mixed arithmetic and bit operations have to be handled on the level of constraint generation. We cope with this problem by using a symbolic interpretation method operating on an abstracted memory model. We describe the available tool support developed by the author, his research group and industrial partners.作者: RAGE 時(shí)間: 2025-4-1 11:00
Lecture Notes in Mechanical Engineeringnecessary. However, a full inspection usually is not feasible. Main research result described is how to slash down the amount of inspection necessary, while still getting a provably correct compiler. Project Verifix demonstrated this approach on a fully verified, realistic compiler for a realistic high level language.作者: 殺蟲(chóng)劑 時(shí)間: 2025-4-1 15:18
