Institutions for navigational logics for graphical structures

Orejas, Fernando; Pino, Elvira; Navarro, Marisa; Lambers, Leen

doi:10.1016/j.tcs.2018.02.031

Cited by 4 publications

(1 citation statement)

References 10 publications

(13 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our proof relies on some semantically (or extensionally) defined assertions, WPOST [P, c], that characterise exactly the weakest postcondition of an arbitrary program P relative to an E-constraint c. It is important to remark that it is unknown whether E-constraints are expressive enough to specify precisely the assertion WPOST [P, c] in general; in fact, there is evidence to suggest they may not be [31]. This is, however, a limitation of the logic and not the incorrectness proof rules, and expressiveness may not be a problem faced by stronger assertion languages for graphs, such as those supporting non-local properties [19,22,27].…”

Section: Transformations Soundness and Completenessmentioning

confidence: 99%

Incorrectness Logic for Graph Programs

Poskitt

2021

Preprint

View full text Add to dashboard Cite

Program logics typically reason about an over-approximation of program behaviour to prove the absence of bugs. Recently, program logics have been proposed that instead prove the presence of bugs by means of under-approximate reasoning, which has the promise of better scalability. In this paper, we present an under-approximate program logic for a nondeterministic graph programming language, and show how it can be used to reason deductively about program incorrectness, whether defined by the presence of forbidden graph structure or by finitely failing executions. We prove this 'incorrectness logic' to be sound and complete, and speculate on some possible future applications of it.

show abstract

Section: Transformations Soundness and Completenessmentioning

confidence: 99%

Incorrectness Logic for Graph Programs

Poskitt

2021

Preprint

View full text Add to dashboard Cite

show abstract

Incorrectness Logic for Graph Programs

Poskitt

2021

Graph Transformation

View full text Add to dashboard Cite

A logic-based incremental approach to graph repair featuring delta preservation

Schneider

Lambers

Orejas

2021

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

We introduce a logic-based incremental approach to graph repair, generating a sound and complete (upon termination) overview of least-changing graph repairs from which a user may select a graph repair based on non-formalized further requirements. This incremental approach features delta preservation as it allows to restrict the generation of graph repairs to delta-preserving graph repairs, which do not revert the additions and deletions of the most recent consistency-violating graph update. We specify consistency of graphs using the logic of nested graph conditions, which is equivalent to first-order logic on graphs. Technically, the incremental approach encodes if and how the graph under repair satisfies a graph condition using the novel data structure of satisfaction trees, which are adapted incrementally according to the graph updates applied. In addition to the incremental approach, we also present two state-based graph repair algorithms, which restore consistency of a graph independent of the most recent graph update and which generate additional graph repairs using a global perspective on the graph under repair. We evaluate the developed algorithms using our prototypical implementation in the tool AutoGraph and illustrate our incremental approach using a case study from the graph database domain.

show abstract

Institutions for navigational logics for graphical structures

Cited by 4 publications

References 10 publications

Incorrectness Logic for Graph Programs

Incorrectness Logic for Graph Programs

Incorrectness Logic for Graph Programs

A logic-based incremental approach to graph repair featuring delta preservation

Contact Info

Product

Resources

About