作者: arbiter 時間: 2025-3-21 23:11
Mitarbeitermotivation ist lernbar transformation, we use it to verify different kinds of properties of an industrial transformation. Experiments on this transformation using our prover show a speed-up in verification run-time by two orders of magnitude over another verification tool that we evaluated in previous research.作者: Cocker 時間: 2025-3-22 01:50
Springer Fachmedien Wiesbaden GmbH onos rendering it weak adhesive HLR. To illustrate results and concepts, we use simple graphs, i.e. the category of binary endorelations and relation preserving functions, as it is a paradigmatic example of a category with stable pushouts; moreover, using regular monos to give semantics to NACs, we can shift NACs over arbitrary rule spans.作者: Working-Memory 時間: 2025-3-22 06:03
Generating Inductive Predicates for Symbolic Execution of Pointer-Manipulating Programs of grammar abstraction are decidable and automatable. Using a property-preserving translation we argue that it is exactly the logic counterparts of those properties that ensure the direct applicability of predicate definitions for symbolic execution.作者: 神圣在玷污 時間: 2025-3-22 11:49
Specification and Verification of Graph-Based Model Transformation Properties transformation, we use it to verify different kinds of properties of an industrial transformation. Experiments on this transformation using our prover show a speed-up in verification run-time by two orders of magnitude over another verification tool that we evaluated in previous research.作者: heterodox 時間: 2025-3-22 14:47
Reversible Sesqui-Pushout Rewritingonos rendering it weak adhesive HLR. To illustrate results and concepts, we use simple graphs, i.e. the category of binary endorelations and relation preserving functions, as it is a paradigmatic example of a category with stable pushouts; moreover, using regular monos to give semantics to NACs, we can shift NACs over arbitrary rule spans.作者: heterodox 時間: 2025-3-22 19:29
https://doi.org/10.1007/978-3-8349-8645-0s to establish a first formal relation between meta-modeling and the theory of graph transformation including constraints to come up with an integrated approach for defining modeling languages in an optimal way in the future.作者: excrete 時間: 2025-3-22 23:20
https://doi.org/10.1007/978-3-658-31665-5eralises that in Kappa, and allows a rule to be partitioned into a set of rules which are collectively equivalent to the original. We illustrate our approach with an example of a social network with dynamic topology.作者: 討厭 時間: 2025-3-23 02:31
Springer Fachmedien Wiesbaden GmbHdable whether every graph in . contains some graph from a finite set . of graphs as an induced subgraph, thereby solving the .-free ? .-free problem. Moreover, our algorithm is both simple and efficient enough to be practical.作者: 前奏曲 時間: 2025-3-23 09:10
Mitarbeiterverhalten im Beratungsproze?rticular graph transformation rules so they can be graphically edited as simple and concise rules. Moreover, Jerboa’s modeler editor is equipped with many static verification mechanisms that ensure that the generated modelers only handle consistent geometric objects.作者: Gnrh670 時間: 2025-3-23 13:27
From Core OCL Invariants to Nested Graph Constraintss to establish a first formal relation between meta-modeling and the theory of graph transformation including constraints to come up with an integrated approach for defining modeling languages in an optimal way in the future.作者: 隱士 時間: 2025-3-23 17:43
Transformation and Refinement of Rigid Structureseralises that in Kappa, and allows a rule to be partitioned into a set of rules which are collectively equivalent to the original. We illustrate our approach with an example of a social network with dynamic topology.作者: MUT 時間: 2025-3-23 20:42 作者: 形容詞 時間: 2025-3-24 00:01 作者: 字形刻痕 時間: 2025-3-24 06:22
https://doi.org/10.1007/978-3-658-02363-8ala, routing protocols like link reversal, and distributed consensus protocols like Paxos. Verification algorithms for restricted classes of models exploit finite-state abstractions, symbolic representations based on graph orderings, the theory of well-structured transition systems, and reachability algorithms based on labeling procedures.作者: 易怒 時間: 2025-3-24 07:46 作者: Dri727 時間: 2025-3-24 13:02 作者: 煩躁的女人 時間: 2025-3-24 16:55
Attribute Handling for Generating Preconditions from Graph Constraintsor attribute handling. Additionally, fully declarative rule preconditions are derived from symbolic graphs, which enable automated attribute resolution as an integral part of the overall pattern matching process, which carries out the checking of rule preconditions at runtime in unidirectional model transformations.作者: hangdog 時間: 2025-3-24 20:24 作者: 雪崩 時間: 2025-3-24 23:59 作者: Mortar 時間: 2025-3-25 04:01 作者: 愛好 時間: 2025-3-25 09:10
https://doi.org/10.1007/978-3-8349-6206-5r is not assumed to be either complete or error-free and the given model is expected to generalize the observed behaviour and be robust to erroneous input. The paper presents some basic algorithms that obtain .s from observed transition sequences and gives a method to compare the resulting .s.作者: Myelin 時間: 2025-3-25 13:18
Verifying Monadic Second-Order Properties of Graph Programsons of Habel, Pennemann, and Rensink to make them equivalently expressive to monadic second-order logic on graphs. We present a weakest liberal precondition construction for these assertions, and demonstrate its use in verifying non-local correctness specifications of graph programs in the sense of Habel et al.作者: CRATE 時間: 2025-3-25 17:07 作者: Graduated 時間: 2025-3-25 23:52
Canonical Derivations with Negative Application Conditions the shift operation anticipating independent steps. These concepts are lifted to graph transformation systems with NACs and it is shown that canonical derivations exist for so-called incremental NACs.作者: obsession 時間: 2025-3-26 03:51 作者: LUDE 時間: 2025-3-26 05:51
https://doi.org/10.1007/978-3-658-02363-8pproaches are based on graph rewriting and graph transformation systems. Case-studies include distributed mutual exclusion protocols like Ricart-Agrawala, routing protocols like link reversal, and distributed consensus protocols like Paxos. Verification algorithms for restricted classes of models ex作者: 不要嚴酷 時間: 2025-3-26 12:30
Mitarbeitergespr?che in Steuerkanzleienoperties. A simple way is based on defining an appropriate encoding of graphs in terms of classical logic. This approach has been followed by Courcelle. The alternative is the definition of a specialized logic, as done by Habel and Pennemann, who defined a logic of nested graph conditions, where gra作者: wreathe 時間: 2025-3-26 15:00 作者: TRAWL 時間: 2025-3-26 18:29
https://doi.org/10.1007/978-3-322-81075-5 for dealing with complex program behaviour and unbounded state spaces that arise from both dynamic data structures and recursive procedures. In previous work it was shown that hyperedge replacement grammars provide an intuitive and versatile concept for defining and implementing such abstractions..作者: callous 時間: 2025-3-26 22:06 作者: Bother 時間: 2025-3-27 01:38
https://doi.org/10.1007/978-3-658-19482-6orresponding correctness proof are based on symbolic graphs, which extend the traditional graph-based structural descriptions by logic formulas used for attribute handling. Additionally, fully declarative rule preconditions are derived from symbolic graphs, which enable automated attribute resolutio作者: Oversee 時間: 2025-3-27 06:07 作者: musicologist 時間: 2025-3-27 10:15 作者: 運動的我 時間: 2025-3-27 13:58 作者: maintenance 時間: 2025-3-27 20:17 作者: 使入迷 時間: 2025-3-27 22:18 作者: Leisureliness 時間: 2025-3-28 02:13
https://doi.org/10.1007/978-3-658-34314-9egory of total maps . has cocones of spans; the latter is the case in all slice categories of ? and thus the condition is necessary locally. The main theorem is that, given an admissible class of monos . in a category ? that has cocones of spans, the category of partial maps . has pushouts if and on作者: GNAW 時間: 2025-3-28 09:42
Springer Fachmedien Wiesbaden GmbHed subgraphs are (among other purposes) very useful for determining whether .-free is a subclass of .-free, by determining whether every graph in . has some graph in . as an induced subgraph. This requires solving the Subgraph Isomorphism Problem, which is NP-complete in general, but for which effec作者: 排他 時間: 2025-3-28 13:03 作者: CAGE 時間: 2025-3-28 17:11 作者: intuition 時間: 2025-3-28 19:13 作者: 變形詞 時間: 2025-3-29 01:25 作者: 纖細 時間: 2025-3-29 05:42
Mitarbeiterverhalten im Beratungsproze?esign, computer simulations... All these softwares are usually implemented with ad-hoc geometric modelers. In the paper, we present a library, called Jerboa, that allows to generate new modelers dedicated to any application domains. Jerboa is a topological-based modeler: geometric objects are define作者: Small-Intestine 時間: 2025-3-29 09:41 作者: 金盤是高原 時間: 2025-3-29 14:16 作者: 革新 時間: 2025-3-29 17:47
Verifying Monadic Second-Order Properties of Graph Programsct to a rule and a postcondition. Previous work addressing this has focused on assertion languages for first-order properties, which are unable to express important global properties of graphs such as acyclicity, connectedness, or existence of paths. In this paper, we extend the nested graph conditi作者: 發(fā)起 時間: 2025-3-29 19:46 作者: conservative 時間: 2025-3-30 02:15 作者: CLAP 時間: 2025-3-30 05:38
Attribute Handling for Generating Preconditions from Graph Constraintsorresponding correctness proof are based on symbolic graphs, which extend the traditional graph-based structural descriptions by logic formulas used for attribute handling. Additionally, fully declarative rule preconditions are derived from symbolic graphs, which enable automated attribute resolutio作者: CON 時間: 2025-3-30 09:42 作者: Antecedent 時間: 2025-3-30 16:04
Specification and Verification of Graph-Based Model Transformation Propertiesthe set of . (i.e., symbolic transformation executions), and verified atomic contracts (constraints on input-output model relations) on these path conditions. The prover evaluated atomic contracts to yield either . or . for the transformation when run on any input model. In this paper we extend the 作者: 螢火蟲 時間: 2025-3-30 17:09
A Static Analysis of Non-confluent Triple Graph Grammars for Efficient Model Transformationntee efficiency (polynomial runtime), without compromising formal properties. Most tools demand . of the TGG, meaning that a choice between applicable rules can be freely made without affecting the final result of a transformation. This is, however, a strong restriction for transformations with inhe作者: 喃喃訴苦 時間: 2025-3-30 22:20 作者: Ptsd429 時間: 2025-3-31 04:40
Reversible Sesqui-Pushout Rewritingtrary rule spans; this is a considerable generalisation compared with existing results for NACs, which only hold for linear rules (w.r.t. a suitable class of monos). Besides this main contribution, namely an adapted shifting construction for NACs, the paper presents a uniform commutativity result fo作者: 細節(jié) 時間: 2025-3-31 06:39 作者: 主動 時間: 2025-3-31 09:19 作者: 面包屑 時間: 2025-3-31 16:25 作者: cutlery 時間: 2025-3-31 21:19 作者: GOAT 時間: 2025-3-31 22:48 作者: 吼叫 時間: 2025-4-1 04:17 作者: 宣稱 時間: 2025-4-1 09:51
Jerboa: A Graph Transformation Library for Topology-Based Geometric Modelingesign, computer simulations... All these softwares are usually implemented with ad-hoc geometric modelers. In the paper, we present a library, called Jerboa, that allows to generate new modelers dedicated to any application domains. Jerboa is a topological-based modeler: geometric objects are define作者: 種族被根除 時間: 2025-4-1 13:09 作者: 不易燃 時間: 2025-4-1 18:08 作者: 租約 時間: 2025-4-1 20:42 作者: Palliation 時間: 2025-4-1 23:30
