Evolving graphs by graph programming
Rule-based graph programming is a deep and rich topic. We present an approach to
exploiting the power of graph programming as a representation and as an execution …
exploiting the power of graph programming as a representation and as an execution …
GP 2: efficient implementation of a graph programming language
C Bak - 2015 - etheses.whiterose.ac.uk
The graph programming language GP (Graph Programs) 2 and its implementation is the
subject of this thesis. The language allows programmers to write visual graph programs at a …
subject of this thesis. The language allows programmers to write visual graph programs at a …
Monadic second-order incorrectness logic for GP 2
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 …
the absence of bugs. Recently, program logics have been proposed that instead prove the …
Strategic port graph rewriting: an interactive modelling framework
We present strategic port graph rewriting as a basis for the implementation of visual
modelling tools. The goal is to facilitate the specification and programming tasks associated …
modelling tools. The goal is to facilitate the specification and programming tasks associated …
Verifying monadic second-order properties of graph programs
The core challenge in a Hoare-or Dijkstra-style proof system for graph programs is in
defining a weakest liberal precondition construction with respect to a rule and a …
defining a weakest liberal precondition construction with respect to a rule and a …
[HTML][HTML] Fast rule-based graph programs
Implementing graph algorithms efficiently in a rule-based language is challenging because
graph pattern matching is expensive. In this paper, we present a number of linear-time …
graph pattern matching is expensive. In this paper, we present a number of linear-time …
-Adhesive Transformation Systems
A Habel, D Plump - International Conference on Graph Transformation, 2012 - Springer
The categorical framework of \mathcalM-adhesive transformation systems does not cover
graph transformation with relabelling. Rules that relabel nodes are natural for computing …
graph transformation with relabelling. Rules that relabel nodes are natural for computing …
Dynamic Tracing: a graphical language for rewriting protocols
The category Set_* of sets and partial functions is well-known to be traced monoidal,
meaning that a partial function S+ U-/-> T+ U can be coherently transformed into a partial …
meaning that a partial function S+ U-/-> T+ U can be coherently transformed into a partial …
[PDF][PDF] Development of spiritual orientation scale: The study of validity and reliability
F Kasapoğlu - Journal of the Faculty of Education, 2015 - pdfs.semanticscholar.org
The objective of the study is to develop a Spiritual Orientation Scale, which is to be utilized to
evaluate spiritual orientation of individuals. 872 university students (492 females and 380 …
evaluate spiritual orientation of individuals. 872 university students (492 females and 380 …
Manevi Yönelim Ölçeği'nin geliştirilmesi: Geçerlik ve güvenirlik
F Kasapoğlu - İnönü Üniversitesi Eğitim Fakültesi Dergisi, 2015 - dergipark.org.tr
Bu çalışmada, bireylerin manevi yönelimlerini değerlendirmeye ilişkin Manevi Yönelim
Ölçeği geliştirmek amaçlanmıştır. Ölçeğin geliştirilmesi çalışmasına 872 üniversite öğrencisi …
Ölçeği geliştirmek amaçlanmıştır. Ölçeğin geliştirilmesi çalışmasına 872 üniversite öğrencisi …