標題: Titlebook: Algebraic Methodology and Software Technology; 12th International C José Meseguer,Grigore Ro?u Conference proceedings 2008 Springer-Verlag [打印本頁] 作者: Fruition 時間: 2025-3-21 19:58
書目名稱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被引頻次學科排名
書目名稱Algebraic Methodology and Software Technology年度引用
書目名稱Algebraic Methodology and Software Technology年度引用學科排名
書目名稱Algebraic Methodology and Software Technology讀者反饋
書目名稱Algebraic Methodology and Software Technology讀者反饋學科排名
作者: lymphoma 時間: 2025-3-21 23:53
Simulation Using Orchestration, concurrency and account for the passage of time. We propose ., a structured concurrent calculus, as a framework for writing simulations. Orc provides constructs to orchestrate the concurrent invocation of services while managing time-outs, priorities, and failures of services or communication. Orc’作者: 凹室 時間: 2025-3-22 01:31 作者: Latency 時間: 2025-3-22 05:09
An Algebra for Features and Feature Composition,s of research, different notions of a feature have been developed. Although these notions have similar goals, no common basis for evaluation, comparison, and integration exists. We present a feature algebra that captures the key ideas of feature orientation and provides a common ground for current a作者: Temporal-Lobe 時間: 2025-3-22 12:35
Petri Nets Are Dioids, an elegant characterisation of the deterministic computations of a net, accounting for their sequential and parallel composition. Here we show that, along the same lines, by adding an (idempotent) operation and thus taking dioids (commutative semirings) rather than monoids, one can faithfully chara作者: clarify 時間: 2025-3-22 14:34 作者: Amenable 時間: 2025-3-22 17:21
Calculating Invariants as Coreflexive Bisimulations,o a particular case of the second and show how both together pave the way to a theory of coalgebras which regards invariant predicates as types. An outcome of such a theory is a calculus of invariants’ proof obligation discharge, a fragment of which is presented in the paper..The approach has two ma作者: 虛假 時間: 2025-3-22 21:32
Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines, of the same service, and to group together logical units of work. Recently, the Service Centered Calculus (SCC) has been proposed as a process calculus designed around the concept of a dyadic session between a service side and an invoker side, where interaction protocols and service orchestration c作者: 考得 時間: 2025-3-23 04:36
A Declarative Debugger for Maude,ions, embodied in the Maude language, is presented. Starting from an incorrect computation (a reduction, a type inference, or a rewrite), the debugger builds a tree representing this computation and guides the user through it to find a wrong statement. We present the debugger’s main features, such a作者: Androgen 時間: 2025-3-23 06:00 作者: 長矛 時間: 2025-3-23 12:22
Towards Validating a Platoon of Cristal Vehicles Using CSP||B,stems, multi-agent systems and critical systems. We thus propose to use the combination named CSP||B of two well-known formal methods to assess and verify properties of this complex system. To that end we make use of previous theoretical results on CSP||B. We also illustrate how this methodology spa作者: antidote 時間: 2025-3-23 16:12
Explaining Verification Conditions,d understand the VCs themselves. We describe a systematic extension of the Hoare rules by labels so that the calculus itself can be used to build up . of the VCs. The labels are maintained through the different processing steps and rendered as natural language explanations. The generated explanation作者: 神圣不可 時間: 2025-3-23 21:56
Towards Formal Verification of , Scripts, originally designed to enable formal verification, but this option has so far not been explored in any detail. We present a method for analyzing a . by translating it to the process algebraic language mCRL2, and then applying model checking to verify behavioral properties.作者: 分貝 時間: 2025-3-24 01:41
A Formal Analysis of Complex Type Flaw Attacks on Security Protocols,ccessfully prevented by “tagging” types of each field of a message. Complex type confusions occur instead when tags can be confused with data and when fields or sub-segments of fields may be confused with concatenations of fields of other types. Capturing these kinds of confusions is not easy in a p作者: 松馳 時間: 2025-3-24 03:45 作者: 侵略者 時間: 2025-3-24 07:50 作者: 藕床生厭倦 時間: 2025-3-24 10:56
An Algebraic Semantics for Contract-Based Software Components,ent-oriented development, like provided and required interface specifications and strong encapsulation. Semantically, we adopt classical concepts of mathematical logic using models, in our framework given by labelled transition systems with “states as algebras”, sentences, and a satisfaction relatio作者: Bumptious 時間: 2025-3-24 15:07
Implementing a Categorical Information System,the Sketch Data Model (SkDM) and mathematically describes databases, views and their updates, and other database concepts. The system described here is a freely available graphical Java environment with a module that compiles a design incorporating algebraically specified constraints into database s作者: 分開 時間: 2025-3-24 19:54 作者: Host142 時間: 2025-3-25 00:26
Algebraic Methodology and Software Technology978-3-540-79980-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: ROOF 時間: 2025-3-25 06:29
Deep Learning in Data Analytics originally designed to enable formal verification, but this option has so far not been explored in any detail. We present a method for analyzing a . by translating it to the process algebraic language mCRL2, and then applying model checking to verify behavioral properties.作者: 拋射物 時間: 2025-3-25 10:27
Aneesh G. Nath,Sanjay Kumar Singhsuch dual linear-hierarchical structure include annotated linguistic data, executions of structured programs, and HTML/XML documents. Nested words generalize both words and ordered trees, and allow both word and tree operations. We define .—finite-state acceptors for nested words, and show that the 作者: Mediocre 時間: 2025-3-25 11:39
Signals and Communication Technology concurrency and account for the passage of time. We propose ., a structured concurrent calculus, as a framework for writing simulations. Orc provides constructs to orchestrate the concurrent invocation of services while managing time-outs, priorities, and failures of services or communication. Orc’作者: interlude 時間: 2025-3-25 16:06
Prasannavenkatesan Theerthagirihe next question: . The answer to this question is: (1) develop software tools that support domain algorithm execution in the problem domain environment (no programming as usual) and (2) allow problem-domain experts to express their problem-solving algorithms using the natural language of their prob作者: Harridan 時間: 2025-3-25 23:20
Zakir Hussain,Malaya Dutta Borahs of research, different notions of a feature have been developed. Although these notions have similar goals, no common basis for evaluation, comparison, and integration exists. We present a feature algebra that captures the key ideas of feature orientation and provides a common ground for current a作者: Cupping 時間: 2025-3-26 01:19 作者: indigenous 時間: 2025-3-26 05:27
https://doi.org/10.1007/978-3-031-10869-3.e. proving or disproving that a given term is reachable from a set of input terms, provides an efficient verification technique. Using a tree automata completion technique, it has been shown that the non reachability of a term . can be verified by computing an over-approximation of the set of reach作者: Endometrium 時間: 2025-3-26 09:35 作者: incisive 時間: 2025-3-26 15:24 作者: 敲竹杠 時間: 2025-3-26 16:58 作者: subacute 時間: 2025-3-26 23:48 作者: 滲入 時間: 2025-3-27 01:15
Studies in Computational Intelligencestems, multi-agent systems and critical systems. We thus propose to use the combination named CSP||B of two well-known formal methods to assess and verify properties of this complex system. To that end we make use of previous theoretical results on CSP||B. We also illustrate how this methodology spa作者: 淺灘 時間: 2025-3-27 05:46
Shanmuganathan Harinee,Anand Mahendrand understand the VCs themselves. We describe a systematic extension of the Hoare rules by labels so that the calculus itself can be used to build up . of the VCs. The labels are maintained through the different processing steps and rendered as natural language explanations. The generated explanation作者: 蜿蜒而流 時間: 2025-3-27 12:32 作者: 虛弱 時間: 2025-3-27 17:36 作者: 自負的人 時間: 2025-3-27 20:30
Ezz El-Din Hemdan,D. H. Manjaiaht is not uncommon for such analyses to integrate supporting analyses computing, for instance, nil-pointer or alias information. Such integration is problematic for a number of reasons: 1) it obscures the original intention of the type system especially if multiple additional analyses are added, 2) i作者: 用不完 時間: 2025-3-27 21:58 作者: 玩忽職守 時間: 2025-3-28 04:15 作者: 代替 時間: 2025-3-28 09:35 作者: Trabeculoplasty 時間: 2025-3-28 13:35
Intelligent Systems Reference Libraryarticular by the authors’ Sketch Data Model (SkDM). The SkDM led to a new treatment of view updating using universal properties already studied in category theory. We call the new treatment succinctly ”universal updating”. This paper outlines the theory of universal updating and studies the relation作者: laparoscopy 時間: 2025-3-28 17:14
Towards Formal Verification of , Scripts, originally designed to enable formal verification, but this option has so far not been explored in any detail. We present a method for analyzing a . by translating it to the process algebraic language mCRL2, and then applying model checking to verify behavioral properties.作者: GLUT 時間: 2025-3-28 19:00 作者: 我正派 時間: 2025-3-29 02:01
https://doi.org/10.1007/978-3-540-79980-1Constraint; evolution; formal method; formal specification; functional programming; logic; object; programm作者: 臆斷 時間: 2025-3-29 04:01 作者: HARD 時間: 2025-3-29 07:51 作者: AWL 時間: 2025-3-29 11:43
https://doi.org/10.1007/978-3-031-10869-3a state by a tree automaton is fully handled by rewriting. This approach has been prototyped in ., a language extension which adds rewriting primitives to .. The first experiments are very promising relative to the state-of-the-art tool ..作者: PHON 時間: 2025-3-29 16:08 作者: Chauvinistic 時間: 2025-3-29 21:28
Ezz El-Din Hemdan,D. H. Manjaiahnformation transferal and use of the information provided by the abstract analyses. The key gain from this method is a clear separation between the correctness of the analyses and the type system, both in the implementation and correctness proof, which leads to a comparatively easy way of changing t作者: 去掉 時間: 2025-3-30 02:34 作者: 他日關稅重重 時間: 2025-3-30 04:31 作者: armistice 時間: 2025-3-30 12:15 作者: frozen-shoulder 時間: 2025-3-30 15:36 作者: dowagers-hump 時間: 2025-3-30 20:02
A Formal Analysis of Complex Type Flaw Attacks on Security Protocols,sion of the calculus. The analysis over-approximates all the possible behaviour of a protocol, including those effected by these type confusions. As an example, we considered the amended Needham-Schroeder symmetric protocol, where we succeed in detecting the type confusion that lead to a complex typ作者: 繞著哥哥問 時間: 2025-3-31 00:06
Abstract Interpretation Plugins for Type Systems,nformation transferal and use of the information provided by the abstract analyses. The key gain from this method is a clear separation between the correctness of the analyses and the type system, both in the implementation and correctness proof, which leads to a comparatively easy way of changing t作者: Leaven 時間: 2025-3-31 01:31
An Algebraic Semantics for Contract-Based Software Components,model-theoretic semantics of interfaces and component bodies suggests two semantic views on a component, its external and its internal semantics which must be properly related to ensure the correctness of a component. We also study a refinement relation between required and provided interface specif作者: Harpoon 時間: 2025-3-31 08:11
Constant Complements, Reversibility and Universal View Updates,l updates which are reversible even for views which have no complement. In short, the universal updates provide an attractive option including reversibility, even when constant complements are not available. The paper is predominantly theoretical studying different algebraic approaches to informatio作者: 用樹皮 時間: 2025-3-31 12:42
0302-9743 nguages and systems, coinduction, theorem proving and logical frameworks for reasoning, logics of programs, as well as algebra and coalgebra.978-3-540-79979-5978-3-540-79980-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: condemn 時間: 2025-3-31 17:18 作者: 拱形大橋 時間: 2025-3-31 18:24
Calculating Invariants as Coreflexive Bisimulations,ds to an elegant proof of the equivalence between two different definitions of bisimulation found in coalgebra literature (due to B. Jacobs and Aczel & Mendler, respectively) and to their instantiation to the classical Park-Milner definition popular in process algebra.作者: FLASK 時間: 2025-3-31 21:54 作者: 拘留 時間: 2025-4-1 04:49
Zhaowei Ma,Jia Hu,Yifeng Niu,Hongbo Yucesses that are guaranteed to be deadlock free, in the sense that they either diverge by invoking new service instances or reach a normal form. The type system is based on previous research on traditional mobile calculi, here conveniently extended and simplified thanks to the neat discipline imposed by the linguistic primitives of SCC.作者: FLACK 時間: 2025-4-1 07:29
Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines,cesses that are guaranteed to be deadlock free, in the sense that they either diverge by invoking new service instances or reach a normal form. The type system is based on previous research on traditional mobile calculi, here conveniently extended and simplified thanks to the neat discipline imposed by the linguistic primitives of SCC.作者: characteristic 時間: 2025-4-1 12:35 作者: 平靜生活 時間: 2025-4-1 16:45
Prasannavenkatesan Theerthagirilem domains. We achieve this computer-based problem solving methodology by computational emancipation of the application domain, which consists of: .With this methodology computers execute algorithms whose expressions are conceptual, similar to the way human brain would execute them.
