標題: Titlebook: Algebraic Methodology and Software Technology; 6th International Co Michael Johnson Conference proceedings 1997 Springer-Verlag Berlin Heid [打印本頁] 作者: Asphyxia 時間: 2025-3-21 16:21
書目名稱Algebraic Methodology and Software Technology影響因子(影響力)
書目名稱Algebraic Methodology and Software Technology影響因子(影響力)學科排名
書目名稱Algebraic Methodology and Software Technology網(wǎng)絡(luò)公開度
書目名稱Algebraic Methodology and Software Technology網(wǎng)絡(luò)公開度學科排名
書目名稱Algebraic Methodology and Software Technology被引頻次
書目名稱Algebraic Methodology and Software Technology被引頻次學科排名
書目名稱Algebraic Methodology and Software Technology年度引用
書目名稱Algebraic Methodology and Software Technology年度引用學科排名
書目名稱Algebraic Methodology and Software Technology讀者反饋
書目名稱Algebraic Methodology and Software Technology讀者反饋學科排名
作者: MEN 時間: 2025-3-22 00:03
Mingxia Liu,Chunfeng Lian,Dinggang Shenticular, we must develop version spaces and approximable mappings that allow modifications to previously released code but that do not make more complex access to the code through the highest-level variant spaces.作者: Thyroxine 時間: 2025-3-22 02:16 作者: Decrepit 時間: 2025-3-22 06:58
Software configuration with information systems,ticular, we must develop version spaces and approximable mappings that allow modifications to previously released code but that do not make more complex access to the code through the highest-level variant spaces.作者: 耕種 時間: 2025-3-22 08:48 作者: 邊緣 時間: 2025-3-22 13:52 作者: 暫時別動 時間: 2025-3-22 19:41 作者: GRAVE 時間: 2025-3-22 23:51
A linear temporal logic approach to objects with transactions,. We explain how . is semantically defined in terms of life cycles and illustrate by example the translation of object specifications to .. Using . for system specification results in sets of formulae which are independent from the level of granularity.作者: LATE 時間: 2025-3-23 01:50 作者: Pander 時間: 2025-3-23 06:03
Deadlock analysis for a fault-tolerant system,DR. The task is split into manageable subtasks by applying an abstraction technique for restricting the specifications to the essential communication behaviour, modularization according to the process structure, and a set of generic theories developed for the application.作者: 澄清 時間: 2025-3-23 12:50 作者: Systemic 時間: 2025-3-23 14:15
Floating point verification in HOL light: The exponential function,inary floating point arithmetic. We confirm (indeed strengthen) the main result of a previously published error analysis, though we uncover a minor error in the hand proof and are forced to confront several subtle issues that might easily be overlooked informally.作者: 聯(lián)想記憶 時間: 2025-3-23 20:04 作者: 進入 時間: 2025-3-23 22:50 作者: 分貝 時間: 2025-3-24 06:05
Keisuke Doman,Takaaki Konishi,Yoshito MekadaDR. The task is split into manageable subtasks by applying an abstraction technique for restricting the specifications to the essential communication behaviour, modularization according to the process structure, and a set of generic theories developed for the application.作者: 自作多情 時間: 2025-3-24 08:56 作者: interrupt 時間: 2025-3-24 12:19 作者: 灰心喪氣 時間: 2025-3-24 18:48
0302-9743 97, held in Sydney, Australia, in December 1997. The volume presents 48 revised full papers selected from an unusually high number of submissions. One of the outstanding features of AMAST is its mix of serious mathematical development of formal methods in software engineering with practical concerns作者: Rejuvenate 時間: 2025-3-24 20:14 作者: 咽下 時間: 2025-3-24 23:36
Lecture Notes in Computer Sciencee representations. Furthermore, there are no restrictions like monotonicity, regularity or local filtration on signatures at all. Instead, the use of overloaded functions and predicates in formulae is required to be sufficiently disambiguated, such that all parses have the same semantics. An overload resolution algorithm is sketched.作者: ENACT 時間: 2025-3-25 05:50 作者: 毛細血管 時間: 2025-3-25 10:41
Deep Learning in Knowledge Graph, protocol, dealing with a dynamically changing network of processors and reasoning in terms of local clocks. Further we show some basic theories for the verification of the underlying synchronous atomic broadcast service.作者: 使厭惡 時間: 2025-3-25 15:38 作者: 帶來的感覺 時間: 2025-3-25 15:56 作者: fulmination 時間: 2025-3-25 23:09
Rigorous object-oriented modeling: Integrating formal and informal notations,re precise and amenable to rigorous analysis is to integrate them with suitable formal modeling techniques. In this paper we describe a technique for integrating an OOM, the Fusion method, and a formal specification notation, Z.作者: 手榴彈 時間: 2025-3-26 02:35 作者: Aerate 時間: 2025-3-26 06:51 作者: 開頭 時間: 2025-3-26 10:06 作者: 知識 時間: 2025-3-26 15:33 作者: Obvious 時間: 2025-3-26 20:11 作者: 有花 時間: 2025-3-26 23:18
Deep Learning in Medical Image Analysisl-purpose process operators. Besides providing for natural models, special-purpose operators allow systems with large state spaces to be verified using systems with small state spaces. To support this verification technique we show that a kind of simulation relation on processes preserves all proces作者: ostrish 時間: 2025-3-27 03:34
Keisuke Doman,Takaaki Konishi,Yoshito Mekadads. It is illustrated by examples and results obtained during an industrial verification project performed for a fault-tolerant system designed and implemented by Daimler-Benz Aerospace for the International Space Station ISS. The approach is based on CSP specifications and the model-checking tool F作者: 現(xiàn)代 時間: 2025-3-27 07:24
https://doi.org/10.1007/978-3-030-33128-3synchronization of threads. First we introduce a simple operational description of the sequential part of the language, where the memory is treated as an algebra with suitably axiomatized operations. Then, the interaction between threads via a shared memory is described in terms of structures, calle作者: installment 時間: 2025-3-27 11:34
Lecture Notes in Computer Scienceubsorting is not modeled by set inclusions, but by injective embeddings allowing for more general models in which subtypes can have different data type representations. Furthermore, there are no restrictions like monotonicity, regularity or local filtration on signatures at all. Instead, the use of 作者: Offstage 時間: 2025-3-27 17:16
Zhenlin Xu,Zhengyang Shen,Marc Niethammeravailable within Circal, a process algebra that permits a natural representation of time without any . extension. The methodology is illustrated through several examples in the area of communication protocols and asynchronous hardware.作者: 讓步 時間: 2025-3-27 18:02 作者: exclamation 時間: 2025-3-28 00:43
Abhay Shah,Michael D. Abramoff,Xiaodong Wufined in terms of refinement developments. Hierarchical models are shown to be equivalent to modular refinement developments. Modular refinement developments are a subset of refinement developments and refinement diagrams. A function is defined to extract the corresponding model from any refinement 作者: myalgia 時間: 2025-3-28 05:47
Akka Zemmari,Jenny Benois-Pineaud approach to specification. The notion of transaction incorporates various application domains, for instance transactions as abstractions from processes as known from refinement theory, transactions as abstractions from business processes as known in business process modelling or database transacti作者: 晚來的提名 時間: 2025-3-28 09:23 作者: 護航艦 時間: 2025-3-28 10:38 作者: Ebct207 時間: 2025-3-28 17:34 作者: Dorsal-Kyphosis 時間: 2025-3-28 20:11
Deep Learning in Machine Translation,point arithmetic seem good targets for formal verification using a mechanical theorem prover. We discuss some of the general issues that arise in verifications of this class, and then present a machine-checked verification of an algorithm for computing the exponential function in IEEE-754 standard b作者: interpose 時間: 2025-3-29 00:53
Deep Learning in Knowledge Graph, PVS is used. General PVS theories are developed to deal with timing and failures. As a characteristic example, we verify a processor-group membership protocol, dealing with a dynamically changing network of processors and reasoning in terms of local clocks. Further we show some basic theories for t作者: grieve 時間: 2025-3-29 04:52 作者: Projection 時間: 2025-3-29 07:42
Siqi Bao,Pei Wang,Albert C. S. ChungWe define a hierarchy of compositional formal semantics of algebraic polynomial systems over .-algebras by abstract interpretation. This generalizes classical formal language theoretical results and contextfree grammar flow-analysis algorithms in the same uniform framework of universal algebra and abstract interpretation.作者: avenge 時間: 2025-3-29 13:32 作者: Debate 時間: 2025-3-29 17:00 作者: incision 時間: 2025-3-29 19:55
Abstract interpretation of algebraic polynomial systems (Extended abstract),We define a hierarchy of compositional formal semantics of algebraic polynomial systems over .-algebras by abstract interpretation. This generalizes classical formal language theoretical results and contextfree grammar flow-analysis algorithms in the same uniform framework of universal algebra and abstract interpretation.作者: PAD416 時間: 2025-3-30 00:20 作者: Flat-Feet 時間: 2025-3-30 06:58 作者: spinal-stenosis 時間: 2025-3-30 09:22 作者: cliche 時間: 2025-3-30 15:50
Zhenlin Xu,Zhengyang Shen,Marc Niethammeravailable within Circal, a process algebra that permits a natural representation of time without any . extension. The methodology is illustrated through several examples in the area of communication protocols and asynchronous hardware.作者: Precursor 時間: 2025-3-30 19:15
Siqi Bao,Pei Wang,Albert C. S. Chungon of ACTL. The algorithm for model checking formulae in this logic over finite state timed transition systems is provided. We consider processes that have infinite models due to the increase of the value of the clock and show how to reduce the verification problem over the infinite models to the one over their compact finite representations.作者: 嚴厲批評 時間: 2025-3-30 23:24 作者: Definitive 時間: 2025-3-31 01:17 作者: 籠子 時間: 2025-3-31 06:54 作者: expository 時間: 2025-3-31 12:06
Specification of timing constraints within the circal process algebra,available within Circal, a process algebra that permits a natural representation of time without any . extension. The methodology is illustrated through several examples in the area of communication protocols and asynchronous hardware.作者: defeatist 時間: 2025-3-31 14:59
On the specification and verification of performance properties for a timed process algebra,on of ACTL. The algorithm for model checking formulae in this logic over finite state timed transition systems is provided. We consider processes that have infinite models due to the increase of the value of the clock and show how to reduce the verification problem over the infinite models to the one over their compact finite representations.作者: nuclear-tests 時間: 2025-3-31 18:21 作者: 厭食癥 時間: 2025-3-31 23:44 作者: 包裹 時間: 2025-4-1 03:04
Head-tactics simplification,tic expression and provides a justification for these simplifications, based on a precise description of the way tactics operate. In particular, this paper introduces a class of . tactics that are especially suited for simplification. Most of these simplifications have been developed in an simplifie作者: 多嘴 時間: 2025-4-1 08:22 作者: goodwill 時間: 2025-4-1 10:28
