標題: Titlebook: Engineering Theories of Software Intensive Systems; Proceedings of the N Manfred Broy,Johannes Grünbauer,Tony Hoare Conference proceedings [打印本頁] 作者: Spring 時間: 2025-3-21 17:30
書目名稱Engineering Theories of Software Intensive Systems影響因子(影響力)
書目名稱Engineering Theories of Software Intensive Systems影響因子(影響力)學(xué)科排名
書目名稱Engineering Theories of Software Intensive Systems網(wǎng)絡(luò)公開度
書目名稱Engineering Theories of Software Intensive Systems網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Engineering Theories of Software Intensive Systems被引頻次
書目名稱Engineering Theories of Software Intensive Systems被引頻次學(xué)科排名
書目名稱Engineering Theories of Software Intensive Systems年度引用
書目名稱Engineering Theories of Software Intensive Systems年度引用學(xué)科排名
書目名稱Engineering Theories of Software Intensive Systems讀者反饋
書目名稱Engineering Theories of Software Intensive Systems讀者反饋學(xué)科排名
作者: 宣稱 時間: 2025-3-21 23:49
https://doi.org/10.1007/978-94-007-7180-2 of services and of layered architectures. In FOCUS a component is a . behavior. In contrast, a service is a . behavior. A layer in a layered architecture is a component or a service with two service interfaces, an import and an export interface. A layered architecture is a stack of several layers. 作者: 漫步 時間: 2025-3-22 03:14
Primitives, Models, and Sprites, interfaces specify the protocol aspects of component interaction. Their formalization, called ., permits a compiler to check the compatibility of component interaction protocols. Interface automata support incremental design and independent implementability. Incremental design means that the compat作者: 銀版照相 時間: 2025-3-22 06:27
Tables: How Nature (and the W3C) Intended,nships: a supplier (.) called from within the execution of a routine, where the invariant is not required to hold, may call back into the originating object, which it then catches in an inconsistent state. This is one of the problems arising from the application of assertion-based semantics to a mod作者: 南極 時間: 2025-3-22 10:00 作者: 有毛就脫毛 時間: 2025-3-22 13:21
Using Spry Data Sets to Refresh Content,al signal processing chip. The abstract algorithm uses an unlimited number of systolic comparator modules to sort a stream of data. In addition to proving that the algorithm produces an ordered permutation of its input, we prove two theorems that are important to verifying the microcode implementati作者: 有毛就脫毛 時間: 2025-3-22 17:23 作者: Mutter 時間: 2025-3-23 00:22 作者: 玉米棒子 時間: 2025-3-23 05:10 作者: 窒息 時間: 2025-3-23 06:56
https://doi.org/10.1007/978-1-4302-2615-4rns. Our goal is to study composition operators which apply across a broad spectrum of computing elements, from sequential programs to distributed transactions over computer networks. Our theory makes very few assumptions about the nature of the basic elements; in particular, we do not assume that a作者: COMMA 時間: 2025-3-23 13:36 作者: Allergic 時間: 2025-3-23 16:44
Formatting and Cascading Style Sheets, their security requirements and use tools to automatically generate system architectures from the models including complete, configured security infrastructures. Rather than fixing one particular modeling language for this process, we propose a general schema for constructing such languages that co作者: giggle 時間: 2025-3-23 21:21
https://doi.org/10.1007/978-1-4842-8722-4em development, but are relevant to it. It was not a Marktoberdorf “course” in the usual sense of the word, and hence detailed definitions and mathematical statements were not given. Rather, the topics were introduced and motivated, the main results described and illustrated, and ideas for further w作者: 巨碩 時間: 2025-3-24 00:21 作者: 放肆的我 時間: 2025-3-24 04:26 作者: 射手座 時間: 2025-3-24 07:51
https://doi.org/10.1007/1-4020-3532-2Algorithms; algorithm; design; formal method; formal verification; model checking; semantics; software arch作者: 主動 時間: 2025-3-24 13:18 作者: Semblance 時間: 2025-3-24 17:25 作者: 可商量 時間: 2025-3-24 21:23
Incremental Software Construction with Refinement Diagramsitecture level, but still with mathematical precision so that we can reason about the correctness of the changes. The framework introduces . as a visual way of presenting the architecture of large software systems. Refinement diagrams are based on lattice theory and allow reasoning about lattice ele作者: stressors 時間: 2025-3-25 00:38 作者: 有抱負者 時間: 2025-3-25 03:28
Interface-Based Design interfaces specify the protocol aspects of component interaction. Their formalization, called ., permits a compiler to check the compatibility of component interaction protocols. Interface automata support incremental design and independent implementability. Incremental design means that the compat作者: glisten 時間: 2025-3-25 10:02
The Dependent Delegate Dilemmanships: a supplier (.) called from within the execution of a routine, where the invariant is not required to hold, may call back into the originating object, which it then catches in an inconsistent state. This is one of the problems arising from the application of assertion-based semantics to a mod作者: 盲信者 時間: 2025-3-25 12:51
Formalizing Counterexample-Driven Refinement with Weakest Preconditionsf the safety property holds of the abstraction then it also holds of the original program..However, if the property does not hold of the abstraction along some trace . (a counterexample), it may or may not hold of the original program on trace .. If it can be proved that the property does not hold i作者: 止痛藥 時間: 2025-3-25 19:00
A Mechanically Checked Proof of a Comparator Sort Algorithmal signal processing chip. The abstract algorithm uses an unlimited number of systolic comparator modules to sort a stream of data. In addition to proving that the algorithm produces an ordered permutation of its input, we prove two theorems that are important to verifying the microcode implementati作者: obtuse 時間: 2025-3-25 22:09
Keys in Formal Verificatione application of abstraction methods for their verification..After introducing the computational model of . (.) and the specification language of (linear) . (.), we describe a standard approach to verification by Finitary abstraction. This is a method by which an infinite-state system is abstracted 作者: CRUC 時間: 2025-3-26 02:56 作者: 逢迎春日 時間: 2025-3-26 06:40
Process Algebra: A Unifying Approachir states, and whose edges are labelled with the names of events by which they interact with their environment. A trace of the behaviour of a process is recorded as a sequence of observable events in which the process engages. Refinement is defined as the inclusion of all traces of a more refined pr作者: aggrieve 時間: 2025-3-26 08:58 作者: 調(diào)味品 時間: 2025-3-26 14:04
A Tree Semantics of an Orchestration Languagepresentation of programming language semantics. The more operational styles give more concrete guidance to the implementer on how a program should be executed. The more abstract styles are more helpful in proving the correctness of particular programs. The style adopted in this paper is neutral betw作者: 費解 時間: 2025-3-26 19:03
Model Driven Security their security requirements and use tools to automatically generate system architectures from the models including complete, configured security infrastructures. Rather than fixing one particular modeling language for this process, we propose a general schema for constructing such languages that co作者: gustation 時間: 2025-3-26 21:47
Some Challenges for System Development: Reactive Animation, Smart Play-Out and Olfactionem development, but are relevant to it. It was not a Marktoberdorf “course” in the usual sense of the word, and hence detailed definitions and mathematical statements were not given. Rather, the topics were introduced and motivated, the main results described and illustrated, and ideas for further w作者: 創(chuàng)造性 時間: 2025-3-27 01:18 作者: 欲望小妹 時間: 2025-3-27 06:32 作者: Ophthalmologist 時間: 2025-3-27 11:45 作者: abnegate 時間: 2025-3-27 14:28 作者: Ccu106 時間: 2025-3-27 19:41 作者: brother 時間: 2025-3-28 01:56
https://doi.org/10.1007/978-1-4302-2615-4om integration of sequential programs to coordination of distributed tasks. The primary application of interest for us is orchestration of web services over the internet, which we describe in detail in this paper.作者: 的是兄弟 時間: 2025-3-28 05:45 作者: Criteria 時間: 2025-3-28 09:43
A Mechanically Checked Proof of a Comparator Sort Algorithmng generalizations are necessary in order to prove these theorems inductively. The mechanical proofs were carried out with the ACL2 theorem prover. We find these proofs both mathematically interesting and illustrative of the kind of mathematics that must be done to verify software.作者: 踉蹌 時間: 2025-3-28 13:53 作者: 連詞 時間: 2025-3-28 18:24
1568-2609 rent fields, ranging from telecommunications to embedded systems in car and aircraft industry as well as in production engineering and computer networks. Foundations in software technology lie in models allowing to capture application domains, detailed requirements, but also to understand the struct作者: Incorruptible 時間: 2025-3-28 19:33 作者: Intellectual 時間: 2025-3-28 23:50
https://doi.org/10.1007/978-1-4842-8722-4tical statements were not given. Rather, the topics were introduced and motivated, the main results described and illustrated, and ideas for further work sketched. This short report contains brief summaries of these topics, followed by some pointers to published papers.作者: Pepsin 時間: 2025-3-29 06:16 作者: 強有力 時間: 2025-3-29 09:06
Model Driven Securitye combined languages, we automatically generate security architectures for distributed applications, built from declarative and programmatic access control mechanisms. We have implemented this approach and report on a case-study with the resulting tool.作者: Range-Of-Motion 時間: 2025-3-29 11:27 作者: NOCT 時間: 2025-3-29 16:08
Some Challenges for System Development: Reactive Animation, Smart Play-Out and Olfactiontical statements were not given. Rather, the topics were introduced and motivated, the main results described and illustrated, and ideas for further work sketched. This short report contains brief summaries of these topics, followed by some pointers to published papers.作者: Iatrogenic 時間: 2025-3-29 21:18
Primitives, Models, and Sprites,ibility checking of interfaces can proceed for partial system descriptions, without knowing the interfaces of all components. Independent implementability means that compatible interfaces can be refined separately, while still maintaining compatibility.作者: PRO 時間: 2025-3-29 23:58 作者: 我沒有強迫 時間: 2025-3-30 06:06 作者: crockery 時間: 2025-3-30 10:32 作者: FECT 時間: 2025-3-30 12:29
Formalizing Counterexample-Driven Refinement with Weakest Preconditionsis representation of SLAM simplifies and distills the concepts of counterexample-driven refinement in a form that should be suitable for teaching the process in a few lectures of a graduate-level course.作者: 等待 時間: 2025-3-30 17:01
Keys in Formal Verificationprogress monitor prior to its abstraction. It is claimed that this extended method is complete for proving by abstraction any temporal property of an infinite-state systems..We show that augmented abstraction is a practical approach to proofs of liveness properties, and is simpler to apply than corr作者: CLOUT 時間: 2025-3-31 00:39
On the Utility of Canonical Abstractionmost precise, but requires the use of a theorem prover. The third method achieves precision close to the second method with tolerable costs, but requires some additional information from the designers of the abstraction..We discuss the canonical-abstraction domain, and show the properties of program
