scholarly journals Unfolding for CHR programs

2013 ◽  
Vol 15 (3) ◽  
pp. 264-311 ◽  
Author(s):  
MAURIZIO GABBRIELLI ◽  
MARIA CHIARA MEO ◽  
PAOLO TACCHELLA ◽  
HERBERT WIKLICKY
Keyword(s):  
Program Transformation ◽  
Large Body ◽  
Constraint Handling ◽  
Sequential Programs ◽  
Time Efficiency ◽  
Semantic Equivalence ◽  
Procedure Call ◽  
Run Time ◽  
Transformation Systems

AbstractProgram transformation is an appealing technique which allows to improve run-time efficiency, space-consumption, and more generally to optimize a given program. Essentially, it consists of a sequence of syntactic program manipulations which preserves some kind of semantic equivalence. Unfolding is one of the basic operations used by most program transformation systems and consists of the replacement of a procedure call by its definition. While there is a large body of literature on the transformation and unfolding of sequential programs, very few papers have addressed this issue for concurrent languages. This paper defines an unfolding system for Constraint Handling Rules programs. We define an unfolding rule, show its correctness and discuss some conditions that can be used to delete an unfolded rule while preserving the program meaning. We also prove that, under some suitable conditions, confluence and termination are preserved by the above transformation.

How does Migrating to Kotlin Impact the Run-time Efficiency of Android Apps?

2021 ◽  
Author(s):  
Michael Peters ◽  
Gian Luca Scoccia ◽  
Ivano Malavolta
Keyword(s):  
Time Efficiency ◽  
Android Apps ◽  
Run Time

ROLES IN AGENT-ORIENTED MODELING

2001 ◽  
Vol 11 (03) ◽  
pp. 281-302 ◽  
Author(s):  
RALPH DEPKE ◽  
REIKO HECKEL ◽  
JOCHEN MALTE KÜSTER
Keyword(s):  
Graph Transformation ◽  
Systematic Analysis ◽  
General Role ◽  
Modeling Approach ◽  
Agent Design ◽  
Time Semantics ◽  
Role Concept ◽  
Run Time ◽  
Transformation Systems ◽  
Graph Transformation Systems

For the generic specification of protocols, goals, or workflows, many approaches to agent-oriented modeling provide a concept of role. Roles abstract from the concrete agents involved in an interaction. They provide means for the evolution of agents and serve as components of agent design. Despite the widespread usage of roles in agent-oriented modeling, a systematic analysis of the different aspects and properties of this concept is still missing. In this paper, we perform such an analysis and identify requirements for a general role concept. We develop such a role concept for a modeling approach based on the UML and graph transformation systems and exemplify its use for the specification (and application) of protocols. Finally, we provide a run-time semantics for roles based on concepts from the theory of graph transformation.

Program Transformation Systems

1983 ◽  
Vol 15 (3) ◽  
pp. 199-236 ◽  
Author(s):  
H. Partsch ◽  
R. Steinbrüggen
Keyword(s):  
Program Transformation ◽  
Transformation Systems

Analysing graph transformation systems through constraint handling rules

2010 ◽  
Vol 11 (1) ◽  
pp. 65-109 ◽  
Author(s):  
FRANK RAISER ◽  
THOM FRÜHWIRTH
Keyword(s):  
State Transition ◽  
Graph Transformation ◽  
Constraint Handling ◽  
Transition Systems ◽  
Rule Based ◽  
Program Equivalence ◽  
Transformation Systems ◽  
Graph Transformation Systems ◽  
State Transition Systems

AbstractGraph transformation systems (GTS) and constraint handling rules (CHR) are non-deterministic rule-based state transition systems. CHR is well known for its powerful confluence and program equivalence analyses, for which we provide the basis in this work to apply them to GTS. We give a sound and complete embedding of GTS in CHR, investigate confluence of an embedded GTS and provide a program equivalence analysis for GTS via the embedding. The results confirm the suitability of CHR-based program analyses for other formalisms embedded in CHR.

Sign in / Sign up

Export Citation Format

Share Document