Nested Constraints and Application Conditions for High-Level Structures

Habel, Annegret; Pennemann, Karl-Heinz

doi:10.1007/978-3-540-31847-7_17

Cited by 41 publications

(53 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…SPO is capable of removing nodes and their incident edges from the graph, including dangling edges [20]. Algebraic approaches can be extended by additional application conditions, such as existence and non-existence of certain nodes and edges [21], as well as conditions that are repeated frequently in the original graph and known as nested conditions [22]. PROV-GTS is an algebraic graph transformation system that consists of a set of rules based on the single-pushout approach.…”

Section: Prov Graph Transformation System (Prov-gts)mentioning

confidence: 99%

Obscuring Provenance Confidential Information via Graph Transformation

Hussein

Moreau

Sassone

2015

Trust Management IX

View full text Add to dashboard Cite

Abstract. Provenance is a record that describes the people, institutions, entities, and activities involved in producing, influencing, or delivering a piece of data or a thing. In particular, the provenance of information is crucial in deciding whether information is to be trusted. PROV is a recent W3C specification for sharing provenance over the Web. However, provenance records may expose confidential information, such as identity of agents or specific attributes of entities or activities. It is therefore essential for confidential information to be obscured before sharing provenance. This paper describes PROV-GTS, a provenance graph transformation system, whose principled definition is based on PROV properties, and which seeks to avoid false independencies and false dependencies. PROV-GTS is shown to preserve graph integrity, to be terminating and to be confluent.

show abstract

Section: Prov Graph Transformation System (Prov-gts)mentioning

confidence: 99%

Obscuring Provenance Confidential Information via Graph Transformation

Hussein

Moreau

Sassone

2015

Trust Management IX

View full text Add to dashboard Cite

show abstract

“…On the other hand, the railroad control case study, originally considered in [Pen04,HP05], and the external car platooning case study [Bau06,HESV91] are both fully verified. Also, the verification of the access control system, to which the 3 unverified program specifications belong, can be seen as successful, as we were able to show the invariance of the conjunction ACConstraint with respect to AccessControl.…”

Section: Summary and Discussionmentioning

confidence: 94%

“…On the other hand, we present a calculus for proving conditions and show its soundness. We evaluate our approach and the implementations of the aforementioned transformations and algorithms by modeling and verifying three different case studies: a railroad control [Pen04,HP05], an access control for computer systems [HPR06], and, as an external example, a car platoon maneuver protocol [Bau06,HESV91]. We show that our implementation is able to decide 327 of 330 considered test specifications.…”

Section: Contributionsmentioning

confidence: 99%

“…Shortly thereafter, conditions for graphs of the form ∀(I ֒→ P, ∃(P → C)) were introduced as graph consistency constraints in [HW95]. The concepts of graph constraints and application conditions of [HW95] were lifted to weak adhesive HLR categories in [EEHP06,EEHP04], and, unified and generalized to nested conditions in [Ren04a] for edge-labeled graphs (without parallel edges) and in [Pen04,HP05] for weak adhesive HLR categories.…”

Section: ∃( )mentioning

confidence: 99%

“…We model and verify selected aspects of three real-world systems: a railroad control [Pen04,HP05], a platoon maneuver protocol [Bau06,HESV91], and an access control for computer systems [HPR06]. For a start, we describe our general set-up and the content of our tests.…”

Section: Case Studiesmentioning

confidence: 99%

See 2 more Smart Citations

Development of Correct Graph Transformation Systems

Pennemann

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Graph transformation has many application areas in computer science, such as software engineering or the design of concurrent and distributed systems. Being a visual modeling technique, graph transformation has the potential to play a decisive role in the development of increasingly larger and complex systems. However, the use of visual modeling techniques alone does not guarantee the correctness of a design. In context of rising standards for trustworthy systems, there is a growing need for the verification of graph transformation systems and programs. The research of appropriate methods for this purpose is the topic of this thesis.The primary goal is to obtain the capability to decide graphical program specifications. These specifications consists of a graphical precondition, a graph program, and a graphical postcondition. As usual, such a specification is said to be correct, if all those system states satisfy the postcondition that are reachable by applying the program on a start state satisfying the precondition. In the considered programs, the selection, deletion, addition and deselection of a graph's nodes and edges are the elementary constructs that can be composed to more complex programs by non-deterministic choice, sequential composition and iteration. The resulting programming language is computationally complete and is able to model transactions that deal with an unbounded number of nodes and edges. As language for the specification of state properties, graph conditions are investigated and used. We show that graph conditions provide an intuitive formalism for first-order structural properties and are suited to infer knowledge about the behavior of graph transformation systems and programs.According to Dijkstra, the correctness of program specifications can be shown by constructing a weakest precondition of the program relative to the postcondition and checking whether the specified precondition implies the weakest precondition. Hence the correctness problem of program specifications is reduced to an implication problem of conditions. In this thesis, it is shown how to construct weakest preconditions for graph programs and graph conditions. Following a dual approach, a sound and complete satisfiability iv Development of Correct Graph Transformation Systems algorithm for graph conditions is investigated and a fragment of conditions is identified, for which the algorithm decides. On the other hand, a resolutionbased calculus for graph conditions is presented and its soundness is proven. Implementations of the aforementioned deciders for conditions are compared with existing theorem provers and satisfiability solvers for first-order logic by verifying three case studies: a railroad control, an access control for computer systems, and, as an external example, a car platoon maneuver protocol.The research is done within the framework of the so-called weak adhesive high-level replacement categories. Therefore, the results will be applicable to different kinds of graph replacement systems and Petri n...

show abstract

Nested Quantification in Graph Transformation Rules

Rensink

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper we describe a way to integrate Taentzer's rule amalgamation with the recently proposed notions of nested graph conditions. The resulting so-called quantified graph transformation rules include (universally and existentially) quantified sub-structures in a flexible way. This can be used for instance to specify a larger-step operational semantics, thus improving the scalability of graph transformation as a technique for software verification.The work reported in this paper was carried out in the context of the Dutch NWO project GROOVE (project number 612.000.314). 1 To be more precise, the number of parameters is fixed and known for each individual method, but not from the more global perspective of our semantics, in which calls to all methods are to be treated as instances of the same mechanism.

show abstract

Nested Constraints and Application Conditions for High-Level Structures

Cited by 41 publications

References 12 publications

Obscuring Provenance Confidential Information via Graph Transformation

Obscuring Provenance Confidential Information via Graph Transformation

Development of Correct Graph Transformation Systems

Nested Quantification in Graph Transformation Rules

Contact Info

Product

Resources

About