• Aucun résultat trouvé

Haut PDF Structures for abstract rewriting

Structures for abstract rewriting

Structures for abstract rewriting

... In abstract rewriting, also called abstract reduction systems, a considerable amount of theory has been developed covering these basic topics (Church- Rosser’s result, Newman’s lemma, ...in ...

82

Enhanced Graph Rewriting Systems for Complex Software Domains (SoSyM Abstract)

Enhanced Graph Rewriting Systems for Complex Software Domains (SoSyM Abstract)

... Italy Abstract—Methodologies for correct by construction reconfigu- rations can efficiently solve consistency issues in dynamic software ...appropriate for designing such architectures and ...graph ...

2

The KGRAM Abstract Machine for Knowledge Graph Querying

The KGRAM Abstract Machine for Knowledge Graph Querying

... an abstract API that hides the graph’s structure and ...of abstract structures and functions and it ignores the internal structure of the nodes and edges manipulated in its function of evaluation of ...

5

Finer is better: Abstraction Refinement for Rewriting Approximations

Finer is better: Abstraction Refinement for Rewriting Approximations

... In [?], an abstraction refinement method is used on transition systems for verifying invariants with a technique combining model checking, abstraction and deductive verification. Contrary to the three previous ...

15

Fuzzy Labeling for Abstract Argumentation: An Empirical Evaluation

Fuzzy Labeling for Abstract Argumentation: An Empirical Evaluation

... rithm for computing the (fuzzy) set of acceptable arguments, when the sources of the arguments in the argumentation framework are only par- tially ...graph structures as those present in our ...

15

A Rewriting Approach to the Combination of Data Structures with  Bridging Theories

A Rewriting Approach to the Combination of Data Structures with Bridging Theories

... theories for which this combination method is sound and ...a rewriting ap- proach where the bridging function is defined as a term rewrite system, and the data structure theory is given by a basic ...

17

On Probabilistic Term Rewriting

On Probabilistic Term Rewriting

... framework for discrete proba- bilistic reduction systems, which properly generalizes standard abstract reduc- tion systems ...account for both the probabilistic behaviour of each rule and the ...

17

Labelled Graph Strategic Rewriting for Social Networks

Labelled Graph Strategic Rewriting for Social Networks

... France Abstract We develop an algebraic approach, based on labelled-graph strategic rewrit- ing, for the study of social networks, specifically network generation and prop- agation ...suitable for ...

61

An Abstract Separation Logic for Interlinked Extensible Records

An Abstract Separation Logic for Interlinked Extensible Records

... an abstract interpretation ...adequate for describing the inter-connected heaps of ...additional structures, such as lists or trees. For JavaScript, such structures can be difficult to ...

23

Complex correspondences for query patterns rewriting

Complex correspondences for query patterns rewriting

... asking for events and their performers, where musical works have been performed (or conversely), with the corresponding artist(s) and release ...(DFS) for traversing and searching graph data ...

14

Query Rewriting for Existential Rules with Compiled Preorder

Query Rewriting for Existential Rules with Compiled Preorder

... in rewriting queries into unions of conjunctive queries ...a rewriting technique, which consists in compil- ing these rules into a preorder on atoms and em- bedding this preorder into the rewriting ...

8

Decidable Type Inference for the Polymorphic Rewriting Calculus

Decidable Type Inference for the Polymorphic Rewriting Calculus

... an abstract interpretation of the program, that can be used as a correctness ...well-known for the λ-calculus [Wel99], the type assignment problem for Rho|F| is ...

18

Abstract Machines for Open Call-by-Value

Abstract Machines for Open Call-by-Value

... • Examples and insights: we provide more examples of machine executions together with refined explanations and insights. In particular, we stress the commutation between evaluation and the substitution of inert terms as ...

34

A rewriting calculus for cyclic higher-order term graphs

A rewriting calculus for cyclic higher-order term graphs

... 1993) for a survey on term graph ...an abstract model generalising the λ-calculus and adding cycles and sharing features has been proposed in (Ariola and Klop, ...and rewriting is described as a ...

37

On a Dynamic Logic for Graph Rewriting

On a Dynamic Logic for Graph Rewriting

... data structures that are usually syntactically rep- resented as simple ...tool for more than just a graphic representation: using graph rewriting, research could be done on term rewriting with ...

17

Termination of Priority Rewriting

Termination of Priority Rewriting

... Isabelle.Gnaedig@loria.fr ABSTRACT Introducing priorities on rules in rewriting increases their expressive power and helps to limit ...Priority rewriting is used in rule-based programming as well as ...

14

Rewriting Constraint Models with Metamodels

Rewriting Constraint Models with Metamodels

... as rewriting opera- tions over pivot models. For sake of clarity, we will present a few operations us- ing an imperative pseudo-code style, while specific trans- formation languages are used in ...models. ...

10

Cubical categories for homotopy and rewriting

Cubical categories for homotopy and rewriting

... 1.2 Higher-dimensional rewriting 1.2.1 Squier’s theory and coherence theorems Squier’s homotopical theorem deals with the rewriting of monoids. Since then, it has been extended to other kinds of ...

186

A certifying frontend for (sub)polyhedral abstract domains

A certifying frontend for (sub)polyhedral abstract domains

... The efficient generation of proof hints, which we call certificates, is described elsewhere [ 8 ], along with an experimental evaluation of the overall abstract do- main. The main contribution of the work ...

17

PORGY: A Visual Graph Rewriting Environment for Complex Systems

PORGY: A Visual Graph Rewriting Environment for Complex Systems

... a rewriting strategy (G2). A strategy is described by a for- mal grammar and specifies a set of admissible rules and how they combine into ...control structures and specific operators ...specify ...

11

Show all 10000 documents...