item: #1 of 858
          id: eceasst-10
      author: Vidács, László; Gogolla, Martin; Ferenc, Rudolf
       title: From C++ Refactorings to Graph Transformations
        date: 2007-02-20
       words: 6870
      flesch: 66
     summary: Class Class stands for C++ classes. The graph transformation rule schema of ExtractClass(... : (Object—Function)) is shown in Figure 5. ��������� �� ���� ������� � ����������� �� ����������� � �������� �� ��� ������� � ����������� �� ���� ���� ���������� �� ������� � ������� ���� ���� �������� �� ��� ������� � ����������� �� ���� ��� ����������� ��� ������� � ����������� �� ���� ��� � ���������� �� ������� � ������� ���� ���� ���������������� ���� ������� � ������������������ ����������� ���������������� ���� ������� � ������������������ ����������� � ��������� �� ���� ������� � ������������������ ����������� ����������� ��� ������� � ������������������ ���� ���� ������� �� ����������������� ���������!������� ��������� �� ���� ������� � ����������� �� ����������� � ���# ��� � ���# ��� � ���# ��� � ������������� � ���� ���$� � ���# ��� ���# ��� Figure 5: Extract class refactoring as graph transformation On the left hand side there is the old class.
    keywords: c++; class; graph; metamodel; refactorings; transformations; u �; xnyc �; � cy; � lhio
       cache: eceasst-10.pdf
  plain text: eceasst-10.txt

        item: #2 of 858
          id: eceasst-100
      author: Akehurst, David H.; Zschaler, Steffen; Howells, Gareth
       title: OCL: Modularising the Language
        date: 2007-11-23
       words: 7453
      flesch: 57
     summary: 5 Tooling and Future Work To evaluate our approach of modularising OCL, we have built a prototypical implementation of parsing, abstraction, and binding for OCL language modules. This standard gives a monolithic definition of the OCL consisting of its concrete syntax, its abstract syntax, a model of OCL-specific types, a so-called standard library defining standard operations available on instances of OCL-specific types, a semantics, and means of connecting OCL expressions to Unified Modelling Language (UML) models.
    keywords: grammar; language; metamodel; module; ocl; rules; standard; syntax; types
       cache: eceasst-100.pdf
  plain text: eceasst-100.txt

        item: #3 of 858
          id: eceasst-1001
      author: Hoffmann, Berthold
       title: More on Graph Rewriting With Contextual Refinement
        date: 2015-09-06
       words: 9879
      flesch: 68
     summary: R if there is no graph H so that G⇒R H. A set R of graph rewrite rules reduces a graph G to some graph H, written G⇒!R H, if G⇒ ∗ R H Graph rewrite rules R can be used to compute a partial nondeterministic function fR from graphs to sets of their normal forms, i.e., fR(G)
    keywords: e e; graph; meta; nodes; pattern; refinement; replacement; rewrite; rewriting; rules; schema
       cache: eceasst-1001.pdf
  plain text: eceasst-1001.txt

        item: #4 of 858
          id: eceasst-1002
      author: Hristakiev, Ivaylo; Plump, Detlef
       title: A Unification Algorithm for GP 2
        date: 2015-09-06
       words: 6375
      flesch: 70
     summary: ∈ U (〈L = L,σP〉) • Decomp3 θ ∈ U (〈L = M,σP′〉) ⇐⇒ θ ∈ U (〈L = M,σP〉) ⇐⇒ θ ∈ U (〈L = M,σP〉)∧sθ
    keywords: algorithm; list; rule; unification
       cache: eceasst-1002.pdf
  plain text: eceasst-1002.txt

        item: #5 of 858
          id: eceasst-1003
      author: Flick, Nils Erik; Engelmann, Björn
       title: Analysis of Petri Nets with Context-Free Structure Changes
        date: 2015-09-06
       words: 9183
      flesch: 71
     summary: Analysis of Petri Nets with Context-Free Structure Changes Electronic Communications of the EASST Volume 71 (2015) Graph Computation Models Selected Revised Papers from GCM 2014 Analysis of Petri Nets with Context-Free Structure Changes Nils Erik Flick and Björn Engelmann 20 pages Guest Editors: Rachid Echahed, Annegret Habel, Mohamed Mosbah Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Analysis of Petri Nets with Context-Free Structure Changes Nils Erik Flick and Björn Engelmann∗ {flick,engelmann}@informatik.uni-oldenburg.de, https://scare.informatik.uni-oldenburg.de Carl-von-Ossietzky-Universität, D-26111 Oldenburg Abstract: Structure-changing Petri nets are Petri nets with transition replacement rules. Keywords: Petri nets, transition replacement, correctness 1 Introduction Petri nets or place/transition nets [DR98] are system models where resource tokens are moved around on an immutable underlying structure.
    keywords: firing; net; nets; petri; places; reachability; replacement; rule; step; structure; transition; workflow
       cache: eceasst-1003.pdf
  plain text: eceasst-1003.txt

        item: #6 of 858
          id: eceasst-1005
      author: Echahed, Rachid; Habel, Anngret; Mosbah, Mohamed
       title: Preface
        date: 2015-09-06
       words: 305
      flesch: 34
     summary: Graph computation models (GCM) constitute a class of very high level models where graphs are first-class citizens. These mod- els include features for programming languages and systems, paradigms for software develop- ment, concurrent calculi, local computations and distributed algorithms, biological or chemical computations, etc.
    keywords: computation; models
       cache: eceasst-1005.pdf
  plain text: eceasst-1005.txt

        item: #7 of 858
          id: eceasst-1008
      author: Volpato, Michele; Tretmans, Jan
       title: Approximate Active Learning of Nondeterministic Input Output Transition Systems
        date: 2015-11-25
       words: 8412
      flesch: 66
     summary: (S,E,T ) is called observation table because one can depict the elements of (S∪S·L) as rows and the elements of E as columns. The learning approach is based on L⋆, with corresponding observation table.
    keywords: learning; model; observation; output; table
       cache: eceasst-1008.pdf
  plain text: eceasst-1008.txt

        item: #8 of 858
          id: eceasst-1009
      author: Lobo Valbuena, Irene; Johansson, Moa
       title: Conditional Lemma Discovery and Recursion Induction in Hipster
        date: 2015-11-25
       words: 6579
      flesch: 54
     summary: When instantiating recursion induction schemes with variables of the problem, more complete instantiations are considered first. We also present a new automated tactic, which uses recursion induction.
    keywords: exploration; hipster; induction; lemmas; proof; recursion; theory
       cache: eceasst-1009.pdf
  plain text: eceasst-1009.txt

        item: #9 of 858
          id: eceasst-101
      author: Kelsen, Pierre; Pulvermueller, Elke; Glodt, Christian
       title: Specifying Executable Platform-Independent Models using OCL
        date: 2007-11-23
       words: 4136
      flesch: 51
     summary: We remark that there were attempts to align action languages with the OCL by embedding OCL expressions into new syntax constructs for actions [5]. Compared to existing approaches based on action languages it is situated at a higher level of abstraction and, through a clean separation of modifier operations and query operations, simplifies the comprehension of the behavioral aspects of the platform- independent system.
    keywords: action; event; language; model; modeling; ocl; operations; system
       cache: eceasst-101.pdf
  plain text: eceasst-101.txt

        item: #10 of 858
          id: eceasst-1011
      author: Belo Lourenço, Cláudio; Lamraoui, Si-Mohamed; Nakajima, Shin; Sousa Pinto, Jorge
       title: Studying Verification Conditions for Imperative Programs
        date: 2015-11-25
       words: 8495
      flesch: 64
     summary: Indeed, many different methods for generating VCs are used by existing program verification tools [CKL04, AMP08, MFS12, BCD+06, FP13]. The study reinforces the impression, from our use of various program verification tools mentioned above, that the choice of a method is not irrelevant.
    keywords: assert; case; form; generated; program; statements; vcgen; vcs; verification
       cache: eceasst-1011.pdf
  plain text: eceasst-1011.txt

        item: #11 of 858
          id: eceasst-1013
      author: Rahli, Vincent; Guaspari, David; Bickford, Mark; Constable, Robert L.
       title: Formal Specification, Verification, and Implementation of Fault-Tolerant Systems using EventML
        date: 2015-11-25
       words: 11301
      flesch: 73
     summary: i n t e r n a l r e t r y : B a l l o t (∗ ============ Quorum : a s t a t e machine ============ ∗) (∗ −− f d s (∗ ============ Parameters ============ ∗) p a r
    keywords: = =; e n; l e; l o; n o; n t; o t; r e; s e; s t; t e; t r; ∗ =
       cache: eceasst-1013.pdf
  plain text: eceasst-1013.txt

        item: #12 of 858
          id: eceasst-1014
      author: Pani, Thomas; Veith, Helmut; Zuleger, Florian
       title: Loop Patterns in C Programs
        date: 2015-11-25
       words: 6656
      flesch: 67
     summary: = L FOR, the weak- est generalized FOR loop class L FOR(W1W2W3), all loops of the benchmark L , and all loops not in any simple loop class L ¬FOR = L \ L FOR(W1W2W3). The weakest generalized FOR loop class L FOR(W1W2W3) additionally contains 26–27% more loops on all benchmarks except coreutils, comprising about 64% of all loops in cBench and SPEC, and 82% in WCET.
    keywords: analysis; classes; constraint; definition; iteration; loop; p(i; predicate; section; termination
       cache: eceasst-1014.pdf
  plain text: eceasst-1014.txt

        item: #13 of 858
          id: eceasst-1015
      author: Bouyer, Patricia; Fang, Erwin; Markey, Nicolas
       title: Permissive strategies in timed automata and games
        date: 2015-11-25
       words: 7568
      flesch: 74
     summary: Permissive strategies in timed automata and games1 Patricia Bouyer, Erwin Fang2 and Nicolas Markey 15 pages Guest Editors: Gudmund Grov, Andrew Ireland ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 1 Partly supported by FET project Cassting (FP7-601148) and ERC project EQualIS (FP7-308087). In this paper, we propose a novel approach for handling robust reachability, based on permissive strategies.
    keywords: automata; finite; penalty; strategies; strategy
       cache: eceasst-1015.pdf
  plain text: eceasst-1015.txt

        item: #14 of 858
          id: eceasst-1016
      author: Colange, Maximilien; Racordon, Dimitri; Buchs, Didier
       title: Computing Bounds for Counter Automata
        date: 2015-11-25
       words: 7572
      flesch: 66
     summary: Following Proposition 1 (and its illustration in the previous example), the capped configuration automaton does not keep track of counter values beyond Θ = 3 as this value suffices to build runs with arbitrarily high values. The second feature to exploit is the fact that a SCC value (current run value) is computable from a single state, and does not necessitate the whole maximal SCC to be known.
    keywords: algorithms; automata; automaton; configuration; counter; finite; problem; run; scc; value
       cache: eceasst-1016.pdf
  plain text: eceasst-1016.txt

        item: #15 of 858
          id: eceasst-1017
      author: Grov, Gudmund; Ireland, Andrew
       title: Preface
        date: 2015-11-25
       words: 674
      flesch: 42
     summary: Workshop Programme Chairs November 2015 Gudmund Grov Heriot-Watt University Andrew Ireland 1 / 2 Volume 72 (2015) Preface Programme Committee • Ernie Cohen, University of Pennsylvania, USA • Ewen Denney, NASA Ames, USA • Jean-Christophe Filliâtre, CNRS, France • Michael Goldsmith, University of Oxford, UK • Gudmund Grov, Heriot-Watt University, UK (co-chair) • Keijo Heljanko, Aalto University, Finland • Mike Hinchey, University of Limerick, Ireland • Marieke Huisman, University of Twente, Netherlands • Andrew Ireland, Heriot-Watt University, UK (co-chair) • Gerwin Klein, NICTA/UNSW, Australia • Thierry Lecomte, ClearSy, France • Yuhui Lin, Heriot-Watt University, UK • Peter Gorm Larsen, Aarhus University, Denmark • Panagiotis (Pete) Manolios, Northeastern University, USA • Stephan Merz, INRIA Nancy & LORIA, France • Hoang Nga Nguyen, University of Nottingham, UK • Jaco van de Pol, University of Twente, Netherlands • Markus Roggenbach, Swansea University, UK • Marco Roveri, FBK, Italy • Thomas Santen, Microsoft Research, Germany • Bernard Steffen, Technical University Dortmund, Germany • Jan Strejček, Masaryk University, Czech Republic • Jun Sun, Singapore University of Technology and Design, Singapore • Tayssir Touili, CNRS & LIPN, France • Helen Treharne, University of Surrey, UK • Laurent Voisin, Systerel, France • Angela Wallenburg, Altran, UK • John Wickerson, Imperial College London, UK • Peter Ölveczky, University of Oslo, Norway Additional Reviewers • Sylvain Conchon • František Blahoudek • Stefan Hallerstede • Marcio Diaz • Jiři Barnat • Christine Rizkallah Steering Committee • Michael Goldsmith, University of Oxford, U.K. • Stephan Merz, INRIA Nancy & LORIA, France • Markus Roggenbach, Swansea University, U.K. Local Organisers • Gudmund Grov • Andrew Ireland • Yuhui Lin (local arrangement & publicity chair) Proc.
    keywords: avocs; university; workshop
       cache: eceasst-1017.pdf
  plain text: eceasst-1017.txt

        item: #16 of 858
          id: eceasst-1019
      author: Chevrou, Florent; Hurault, Aurélie; Quéinnec, Philippe
       title: Automated Verification of Asynchronous Communicating Systems with TLA+
        date: 2015-11-25
       words: 6517
      flesch: 56
     summary: Thus, peer transitions are only char- acterized by the nature of the communication (send ! or receive ?) and the concerned channel (e.g. c!−→). Peer states are characterized by program counters in TLA+ modules (e.g. figure 2).
    keywords: channels; communication; compatibility; message; model; order; peer; properties; send; state; systems; tla+; transition; verification
       cache: eceasst-1019.pdf
  plain text: eceasst-1019.txt

        item: #17 of 858
          id: eceasst-102
      author: Aydal, Emine G; Paige, Richard F; Woodcock, Jim
       title: Evaluation of OCL for Large-Scale Modelling: A Different View of the Mondex Purse
        date: 2007-11-23
       words: 6405
      flesch: 50
     summary: The following section summarises the lessons learned so far and outlines the suggestions ad- dressing the improvements of OCL tools, particularly USE tool, to cater for the requirements mentioned in this paper. We believe the existence of a invariant consistency check component in OCL tools will greatly improve the process of validation by removing the necessity to create the instances of a model.
    keywords: conditions; invariants; model; modelling; mondex; ocl; operation; post; system; tool; use; variables
       cache: eceasst-102.pdf
  plain text: eceasst-102.txt

        item: #18 of 858
          id: eceasst-1020
      author: Lisitsa, Alexei
       title: First-order logic for safety verification of hedge rewriting systems
        date: 2015-11-25
       words: 6020
      flesch: 63
     summary: 3.2 From hedge rewriting to first-order logic For an unranked alphabet Σ we denote by Σ f o a ranked vocabulary Σr ∪{e,∗}∪{R(2)} where Σ r = { f̃ | f ∈ Σ}, with all f̃ being unary functional symbols, e is a constant (0-ary functional) symbol, ∗ is a binary functional symbol, which we will use in infix notation and R is a binary predicate symbol. In this paper we consider the problem of safety verification for hedge rewriting systems and explore the applicability of the very general method based on disproving the first-order formulae by finding a countermodel.
    keywords: finite; hedge; logic; model; order; rewriting; safety; set; systems; verification
       cache: eceasst-1020.pdf
  plain text: eceasst-1020.txt

        item: #19 of 858
          id: eceasst-1021
      author: Dalvandi, Mohammadsadegh; Butler, Michael; Rezazadeh, Abdolbaghi
       title: Transforming Event-B Models to Dafny Contracts
        date: 2015-11-25
       words: 6926
      flesch: 61
     summary: Each generated Hoare triple then is translated to Dafny method contracts. 4.1 Constructor Statement Machine events are translated to Dafny methods.
    keywords: code; constructor; contracts; dafny; event; guards; invariants; method; model; statement; variables
       cache: eceasst-1021.pdf
  plain text: eceasst-1021.txt

        item: #20 of 858
          id: eceasst-1022
      author: Khamespanah, Ehsan; Sirjani, Marjan; Mousavi, Mohammadreza; Sabahi Kaviani, Zeynab; Razzazi, Mohamadreza
       title: State Distribution Policy for Distributed Model Checking of Actor Models
        date: 2015-11-25
       words: 6934
      flesch: 66
     summary: In the present work, we tackle the state distribution policy problem in the state space gen- eration of actor models [Hew72]. We introduce a new state distribution policy based on the the so-called Call Dependency Graph (CDG) of actor models.
    keywords: actor; cdg; checking; cycles; distribution; message; model; policy; set; space; state
       cache: eceasst-1022.pdf
  plain text: eceasst-1022.txt

        item: #21 of 858
          id: eceasst-1023
      author: Legay, Axel; Sedwards, Sean; Traonouez, Louis-Marie
       title: Estimating Rewards & Rare Events in Nondeterministic Systems
        date: 2015-11-25
       words: 7509
      flesch: 54
     summary: Since rewards properties have not yet been implemented in the sampling context of [LST14, DLST15], we also present an algorithm to find schedulers that approximately maximise or minimise expected rewards. In Section 5 we present our algorithm for rewards properties.
    keywords: estimate; hypothesis; importance; number; probability; property; rewards; sampling; schedulers; set; simulation; traces
       cache: eceasst-1023.pdf
  plain text: eceasst-1023.txt

        item: #22 of 858
          id: eceasst-1024
      author: Jegourel, Cyrille; Legay, Axel; Sedwards, Sean; Traonouez, Louis-Marie
       title: Distributed Verification of Rare Properties using Importance Splitting Observers
        date: 2015-11-25
       words: 7261
      flesch: 60
     summary: We address this with a variance reduction framework based on lightweight importance splitting observers. We first explore the challenges posed by importance splitting and present an algorithm opti- mised for distribution.
    keywords: algorithm; importance; level; model; observers; properties; property; score; simulations; splitting; state
       cache: eceasst-1024.pdf
  plain text: eceasst-1024.txt

        item: #23 of 858
          id: eceasst-1025
      author: Atkey, Robert; Sannella, Donald
       title: ThreadSafe: Static Analysis for Java Concurrency
        date: 2015-11-25
       words: 6326
      flesch: 53
     summary: Keywords: static analysis, concurrency, Java 1 Introduction Use of static analysis to discover and diagnose concurrency defects during software develop- ment is a cost-effective solution to this problem.
    keywords: accesses; analysis; bugs; class; code; concurrency; example; field; java; method; threadsafe; tool
       cache: eceasst-1025.pdf
  plain text: eceasst-1025.txt

        item: #24 of 858
          id: eceasst-1026
      author: Nokovic, Bojan; Sekerinski, Emil
       title: Model-based WCET Analysis with Invariants
        date: 2015-11-25
       words: 6657
      flesch: 62
     summary: The models are expressed as pCharts, a formalism for reactive systems based on hierarchical state machines with invariants, probabilistic transitions, timed transitions, stochastic timing, and costs/rewards The calculation of WCET takes the run-time overhead of scheduling and cancelling timed transitions into account.
    keywords: analysis; calculation; code; cycles; event; execution; invariants; model; state; systems; time; transition; uml; wcet
       cache: eceasst-1026.pdf
  plain text: eceasst-1026.txt

        item: #25 of 858
          id: eceasst-1027
      author: O'Halloran, Colin
       title: Verifying Critical Cyber-Physical Systems After Deployment
        date: 2015-11-27
       words: 4843
      flesch: 49
     summary: A number of projects on systems verification have emerged, most notably, the L4 verified OS Kernel project [6]. They verify special- purpose operating systems and a hypervisor, at the level of source code but without I/O. There have also been systems verifications that focus on safety properties, most notably, Yang and Hawblitzel’s type-safe operating system [8].
    keywords: code; cspm; cyber; figure; level; process; software; system; verification
       cache: eceasst-1027.pdf
  plain text: eceasst-1027.txt

        item: #26 of 858
          id: eceasst-1028
      author: Plump, Detlef
       title: Preface
        date: 2016-04-18
       words: 312
      flesch: 23
     summary: York, United Kingdom Detlef Plump March 2016 Guest Editor 1 / 2 Volume 73 (2016) Preface Programme Committee of GCM 2015 Rachid Echahed Laboratoire d’Informatique de Grenoble, France Maribel Fernandez King’s College London, United Kingdom Annegret Habel Universität Oldenburg, Germany Dirk Janssens Universiteit Antwerpen, Belgium Barbara König Universität Duisburg-Essen, Germany Hans-Jörg Kreowski Universität Bremen, Germany Mohamed Mosbah LaBRI, Université de Bordeaux, France Detlef Plump The University of York, United Kingdom (chair) Additional Reviewers for this Volume Jan Steffen Becker Nils Erik Flick Ivaylo Hristakiev Dennis Nolte Christoph Peuser Christopher M. Poskitt Selected Revised Papers from GCM 2015 2 / 2 The topics of the papers include triple graph grammars, applications of graph transformation to parsing and policy modelling, parallel execution models of graph transforma- tion, the theoretical foundations of graph transformation with attributes, and the verification of graph programs.
    keywords: graph; volume
       cache: eceasst-1028.pdf
  plain text: eceasst-1028.txt

        item: #27 of 858
          id: eceasst-103
      author: Akehurst, David; Howells, Gareth; Scheidgen, Markus; McDonald-Maier, Klaus
       title: C# 3.0 makes OCL redundant!
        date: 2007-11-23
       words: 3164
      flesch: 60
     summary: That is to say, given that people can write nice concise navigation expression using iterators and tuples in the C# programming language, why would anyone want to write them in OCL? In the context of an environment of variables, OCL expressions can be written that navigate, from starting variables, across properties and operations to other objects.
    keywords: language; ocl; programming; table; type
       cache: eceasst-103.pdf
  plain text: eceasst-103.txt

        item: #28 of 858
          id: eceasst-1031
      author: Anjorin, Anthony; Leblebici, Erhan; Schürr, Andy
       title: 20 Years of Triple Graph Grammars: A Roadmap for Future Research
        date: 2016-04-18
       words: 9484
      flesch: 59
     summary: Models are encoded as graphs and model transformations, used to maintain the consistency of related pairs of models in a concurrent engineering scenario by propagating changes in both directions, are derived from a given TGG specification. Propagation of constraints along model transformations using triple graph grammars and borrowed context.
    keywords: class; domain; eds; fig; grammars; graph; model; source; tgg; tggs; transformation; triple
       cache: eceasst-1031.pdf
  plain text: eceasst-1031.txt

        item: #29 of 858
          id: eceasst-1032
      author: Zaytsev, Vadim
       title: Cotransforming Grammars with Shared Packed Parse Forests
        date: 2016-04-18
       words: 9398
      flesch: 59
     summary: 4.3.2 Language-extending operators Above we have considered grammar transformation operators that add disjunctive clauses to the grammar, obviously extending the associated language. The approach to couple instance transformations to grammar transformations and not vice versa, that we decided to pursue, has its counterparts in other technological spaces such as model- ware
    keywords: doi; figure; forests; grammar; graph; language; node; nonterminal; operators; parse; parsing; sppf; transformation
       cache: eceasst-1032.pdf
  plain text: eceasst-1032.txt

        item: #30 of 858
          id: eceasst-1033
      author: Bottoni, Paolo; Navigli, Roberto; Parisi-Presicce, Francesco
       title: Conditions, constraints and contracts: On the use of annotations for policy modeling
        date: 2016-04-18
       words: 9805
      flesch: 61
     summary: Modeling context with graph annotations. This is used in Section 5 to illustrate the model for rewriting under annotation constraints and contracts.
    keywords: annotations; application; constraints; contract; domain; elements; figure; graph; licenses; resources; rule
       cache: eceasst-1033.pdf
  plain text: eceasst-1033.txt

        item: #31 of 858
          id: eceasst-1034
      author: Mackie, Ian; Sato, Shinya
       title: Parallel Evaluation of Interaction Nets: Case Studies and Experiments
        date: 2016-04-18
       words: 6615
      flesch: 61
     summary: Unfortunately, in Figure 2 (b), there is no significant difference in the sequential and the parallel execution, and thus there is no possibility of the improvement by parallel execution. Next we analyse the results of the parallel execution in Inpla by using graphs in Section 3, which show the trends of steps in parallel execution on the assumption of the unbounded re- sources.
    keywords: evaluation; execution; interaction; nets; nil; parallel; sequential
       cache: eceasst-1034.pdf
  plain text: eceasst-1034.txt

        item: #32 of 858
          id: eceasst-1035
      author: Peuser, Christoph; Habel, Annegret
       title: Composition of M,N-adhesive Categories with Application to Attribution of Graphs
        date: 2016-04-18
       words: 9115
      flesch: 69
     summary: The categories of labelled graphs, typed graphs, and typed attributed graphs in [EEPT06], are known to be M -adhesive categories if one chooses M to be the class of injective graph morphisms 2 M ,N -adhesive Categories In this section, we recall the definition of M ,N -adhesive categories, introduced in [HP12], generalizing the one of M -adhesive categories
    keywords: -adhesive; categories; category; composition; graphs; morphisms; pullbacks; pushout
       cache: eceasst-1035.pdf
  plain text: eceasst-1035.txt

        item: #33 of 858
          id: eceasst-1036
      author: Löwe, Michael; Tempelmeier, Marius
       title: On Single-Pushout Rewriting of Partial Algebras
        date: 2016-04-18
       words: 11538
      flesch: 76
     summary: A → B ::= f 7→ f ,0 7→ f , and the closed monomorphism m : M � A ::= f 7→ f . A = /0, B ::= Bs ={0,1,2}, f B = ( { f B}, dBf ( f B) = (0,1), cBf ( f B) = 2 ) , M ::= Ms = /0, f M = /0, the morphism g :
    keywords: algebras; f b; graph; morphisms; pushout; rewriting; sub
       cache: eceasst-1036.pdf
  plain text: eceasst-1036.txt

        item: #34 of 858
          id: eceasst-1037
      author: Flick, Nils Erik
       title: Proving Correctness of Graph Programs Relative to Recursively Nested Conditions
        date: 2016-04-18
       words: 11195
      flesch: 66
     summary: 5 Related Work A summary overview of graph conditions for non-local properties is attempted below (a proof calculus is presented in [PP14] but completeness of a proof calculus has only recently been obtained by Lambers and Orejas [LO14] for nested conditions and remains to be researched for the other approaches). Here, state properties are expressed by nested graph conditions, and a program can be proved correct with respect to a precondition c and a postcondition d.
    keywords: conditions; graph; morphism; precondition; proof; pushout; type; variables; ∃(a
       cache: eceasst-1037.pdf
  plain text: eceasst-1037.txt

        item: #35 of 858
          id: eceasst-104
      author: Jiang, Ke; Zhang, Lei; Miyake, Shigeru
       title: Using OCL in Executable UML
        date: 2007-11-23
       words: 3436
      flesch: 39
     summary: Executable UML also allow directly executing UML models. 3.2 OCL in executable UML OCL can be used to express the constraint for executable UML models as for UML.
    keywords: abstract; executable; fig; language; model; ocl; ocl4x; syntax; uml
       cache: eceasst-104.pdf
  plain text: eceasst-104.txt

        item: #36 of 858
          id: eceasst-1044
      author: Smyth, Steven; Lenga, Stephan; von Hanxleden, Reinhard
       title: Model Extraction of Legacy C Code in SCCharts
        date: 2018-06-05
       words: 7979
      flesch: 59
     summary: Additionally, the models can be used as a source to create new state-of-the-art code for various languages and platforms, such as C code or VHDL, using code generators. Especially in the automotive sector it is common to have for example a mix of Simulink models and C code.
    keywords: approach; c code; code; control; example; figure; function; int; model; sccharts; software; statement
       cache: eceasst-1044.pdf
  plain text: eceasst-1044.txt

        item: #37 of 858
          id: eceasst-1045
      author: Hacid, Kahina; Ait-Ameur, Yamine
       title: Handling Domain Knowledge in Design and Analysis of Engineering Models
        date: 2018-06-05
       words: 7330
      flesch: 49
     summary: 5 Annotating design models with references to ontologies In this section, we describe the work we have done in order to strengthen system design models Finally, notice that although the above defined methodology relies on the definition of an integration point of view (step 1) and system design model (step 2), these two models are defined independently in an asynchronous manner.
    keywords: analysis; annotation; design; design model; domain; figure; model; properties; step; system; system model; view
       cache: eceasst-1045.pdf
  plain text: eceasst-1045.txt

        item: #38 of 858
          id: eceasst-1047
      author: Wirkner, Dominic; Boßelmann, Steve
       title: Towards Reuse on the Meta-Level
        date: 2018-06-05
       words: 4985
      flesch: 50
     summary: 5 Language Improvements via Linking Model In the previous section reoccurring problems were presented in managing model elements and their representations and also a solution to this on source code level was introduced which made use of a general description of the relation between original and representational elements. One is that the description of how something is represented with model elements is hidden on source code level from the domain expert.
    keywords: cinco; code; compound; elements; level; meta; model; modeling; reuse; software
       cache: eceasst-1047.pdf
  plain text: eceasst-1047.txt

        item: #39 of 858
          id: eceasst-105
      author: Robinson, William
       title: Extended OCL for Goal Monitoring
        date: 2007-11-23
       words: 4511
      flesch: 49
     summary: The REQMON system monitors the satisfaction of goal models. Now, goal models can be represented in the extended OCL, from which runtime monitors can be compiled.
    keywords: engineering; event; goal; language; monitoring; object; ocl; property; reqmon; requirements; software; system
       cache: eceasst-105.pdf
  plain text: eceasst-105.txt

        item: #40 of 858
          id: eceasst-1050
      author: Kuehn, Dennis
       title: Model-to-Model Transformation in Meta-Modeled CINCO Domains
        date: 2018-10-17
       words: 4523
      flesch: 49
     summary: Figure 3 depicts two examples of the MGL and MSL definition for a DIME-specific element called GUISIB , which is a type of node inside DIME process models. Figure 4: Architecture outline for meta-model and CINCO product level with focus on Webstory and DIME SOFSEM SRF 2017 6 / 12 ECEASST 3 Webstory-to-DIME Generator The model transformation approach presented in this paper aims to transform models of a source domain into DIME models in order to deploy the resulting DIME project as a web application.
    keywords: application; cinco; dime; domain; meta; model; process; transformation; webstory
       cache: eceasst-1050.pdf
  plain text: eceasst-1050.txt

        item: #41 of 858
          id: eceasst-1053
      author: Peters, Fayola
       title: On Privacy and Utility while Improving Software Quality
        date: 2018-10-17
       words: 6738
      flesch: 55
     summary: Keywords: Data privacy, Software Engineering Data Science, Cross project defect prediction, Effort estimation, Test coverage, Debugging. In this paper we focus on the subset, which studies data privacy.
    keywords: adversary; attribute; conference; data; engineering; information; international; obfuscation; original; privacy; sensitive; software; utility; values
       cache: eceasst-1053.pdf
  plain text: eceasst-1053.txt

        item: #42 of 858
          id: eceasst-1054
      author: Filipovikj, Predrag; Rodriguez-Navas, Guillermo; Seceleanu, Cristina
       title: Model-Checking-based vs. SMT-based Consistency Analysis of Industrial Embedded Systems Requirements: Application and Experience
        date: 2018-10-17
       words: 9652
      flesch: 48
     summary: [BBB12] propose a model-free sanity checking procedure for consistency anal- ysis of system requirements specification in Linear Temporal Logic (LTL) The UPPAAL model checker accepts formal system models specified as timed automata [AD94], and a set of properties that the formal model is checked against, specified in TCTL
    keywords: analysis; checking; consistency; consistency analysis; fld; formulas; location; model; model checking; requirements; set; smt; specification; system; system specification; tctl; time
       cache: eceasst-1054.pdf
  plain text: eceasst-1054.txt

        item: #43 of 858
          id: eceasst-1055
      author: Dantas, Rafael Gomes
       title: Comparing Network Performance of Mobile VoIP Solutions
        date: 2018-10-17
       words: 4364
      flesch: 60
     summary: To improve bandwidth utilisation on mobile networks, [LL16] tested a TCP implementation with four alternatives and found significant improvements. Quality evaluation of mobile networks using VoIP ap- plications: a case study with Skype and LINE based-on stationary tests in Bangkok.
    keywords: analysis; applications; bandwidth; data; mobile; network; packet; payload; performance; protocol; voip
       cache: eceasst-1055.pdf
  plain text: eceasst-1055.txt

        item: #44 of 858
          id: eceasst-1056
      author: Gossen, Frederik; Margaria, Tiziana
       title: Generating Optimal Decision Functions from Rule Specifications
        date: 2018-06-05
       words: 7817
      flesch: 57
     summary: The Irish Software Research Centre, University of Limerick {frederik.gossen, tiziana.margaria}@lero.ie Abstract: In this paper we sketch an approach and a tool for rapid evaluation of large systems of weighted decision rules. This filtered rule ADD Are is obtained with a binary operation on the two ADDs Ar and Be that evaluates to a reserved value ⊥ if the element does not exist and to the accumulated rule weight otherwise.
    keywords: add; approach; code; decision; decision structure; elements; functions; miaamics; predicates; rules; set; structure; system; target; target elements
       cache: eceasst-1056.pdf
  plain text: eceasst-1056.txt

        item: #45 of 858
          id: eceasst-106
      author: Akehurst, David H; Gogolla, Martin; Zschaler, Steffen
       title: Preface
        date: 2007-11-23
       words: 444
      flesch: 41
     summary: It continued the series of OCL workshops held at previous UML/MoDELS con- ferences in York (2000), Toronto (2001), San Francisco (2003), Lisbon (2004), Montego Bay (2005) and Genova (2006). Preface Electronic Communications of the EASST Volume 9 (2008) Proceedings of the Workshop Ocl4All: Modelling Systems with OCL at MoDELS 2007 Preface 2 pages Guest Editors: David H. Akehurst, Martin Gogolla, Steffen Zschaler Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Preface
    keywords: modelling; ocl; workshop
       cache: eceasst-106.pdf
  plain text: eceasst-106.txt

        item: #46 of 858
          id: eceasst-1066
      author: Lamprecht, Anna-Lena
       title: Preface
        date: 2018-06-05
       words: 383
      flesch: 20
     summary: Utrecht, Netherlands June 2018 Anna-Lena Lamprecht Guest Editor ISoLA 2016 Chairs Symposium Chair: Tiziana Margaria, Lero, University of Limerick, Ireland Program Chair: Bernhard Steffen, TU Dortmund University, Germany Doctoral Symposium Chair: Anna-Lena Lamprecht, Lero, University of Limerick, Ireland Volume Reviewers Steve Boßelmann, TU Dortmund University, Germany Yehia Elrakaiby, Lero, University of Limerick, Ireland Frederik Gossen, Lero, University of Limerick, Ireland Kahina Hacid, Informatics Research Insitute of Toulouse, France Sven Jörges, FH Dortmund, Germany Steven Smyth, Kiel University, Germany Jan-Martijn van der Werf, Utrecht University, Netherlands 1 / 1 Volume 74 (2017) Electronic Communications of the EASST Volume 74 (2017) Guest Editors: Anna-Lena Lamprecht ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 7th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation - Doctoral Symposium, 2016 (ISoLA DS 2016) Preface Anna-Lena Lamprecht 1 Page ECEASST Preface Since its initiation in 2004, the International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (ISoLA, see http://isola-conference.org) has been providing a forum for developers, users, and researchers to discuss issues related to the adoption and use of rigorous tools and methods for the specification, analysis, verification, certification, construction, test and maintenance of software systems from the point of view of their different applications domains.
    keywords: symposium; university
       cache: eceasst-1066.pdf
  plain text: eceasst-1066.txt

        item: #47 of 858
          id: eceasst-1068
      author: Mjeda, Anila
       title: Preface
        date: 2018-10-17
       words: 501
      flesch: 37
     summary: Limerick, Ireland October 2018 Anila Mjeda Guest Editor 2 / 3 Volume 75 (2018) Short Article Title Volume Reviewers Götz Botterweck, Lero – The Irish Software Research Centre, University of Limerick, Ireland Jim Buckley, Lero – The Irish Software Research Centre, University of Limerick, Ireland Andrew Butterfield, Lero – The Irish Software Research Centre, University College Dublin, Ireland Kieran Conboy, Lero – The Irish Software Research Centre, NUI Galway, Ireland Sorren Hanvey, Lero – The Irish Software Research Centre, University of Limerick, Ireland Tiziana Margaria, Lero – The Irish Software Research Centre, University of Limerick, Ireland Anila Mjeda, Lero – The Irish Software Research Centre, University of Limerick, Ireland Veelasha Moonsamy, Utrecht University, Netherlands Nikola Nikolov, University of Limerick, Limerick, Ireland Fayola Peters, Lero – The Irish Software Research Centre, University of Limerick, Ireland Bernhard Steffen, TU Dortmund, Germany SOFSEM SRF 2017 3 / 3 SOFSEM 2017 took place in Limerick, Ireland and was hosted by Lero - The Irish Software Research Centre.
    keywords: research; software
       cache: eceasst-1068.pdf
  plain text: eceasst-1068.txt

        item: #48 of 858
          id: eceasst-1069
      author: Moy, Yannick
       title: Climbing the Software Assurance Ladder - Practical Formal Verification for Reliable Software
        date: 2019-05-14
       words: 8215
      flesch: 59
     summary: Hybrid verification is obtained by using proof on SPARK code and test on Ada code. The first case study meant to assess the effort for transitioning from Ada to SPARK code (Stone level) using a mature software application about to be ported onto a new execution plat- form.
    keywords: ada; altran; assurance; case; code; contracts; level; methods; proof; properties; software; spark; study; thales; time; use; verification
       cache: eceasst-1069.pdf
  plain text: eceasst-1069.txt

        item: #49 of 858
          id: eceasst-107
      author: Kuhlmann, Mirco; Gogolla, Martin
       title: Analyzing Semantic Properties of OCL Operations by Uncovering Interoperational Relationships
        date: 2007-11-23
       words: 6852
      flesch: 60
     summary: The motivation for our work is to state and clarify the basic semantic relationships between OCL operations on collections. Thus,we have to query the rela- tionship warehouse using OCL operations, especially navigation expressions.
    keywords: c t; e c; e n; elemtype; l e; ocl; s e; t e
       cache: eceasst-107.pdf
  plain text: eceasst-107.txt

        item: #50 of 858
          id: eceasst-1070
      author: Kamburjan, Eduard
       title: Detecting Deadlocks in Formal System Models with Condition Synchronization
        date: 2019-05-14
       words: 8859
      flesch: 63
     summary: Replacing Condition Synchronization in Presence of Timed Behavior In ABS, it is not possible to replace condition synchronization with other synchronization primitives, even if a suspend statement (with the semantics of await True) is given. As condition synchronization is nearer to the modelers intention when a task will resume, it allows to detect deadlocks caused by errors in the modeled system rather than errors caused by the wrong use of synchronization primitives.
    keywords: abs; analysis; await; condition; configuration; deadlock; dependency; graph; guard; method; object; synchronization; system; task
       cache: eceasst-1070.pdf
  plain text: eceasst-1070.txt

        item: #51 of 858
          id: eceasst-1071
      author: Pichardie, David; Sighireanu, Mihaela
       title: Preface
        date: 2019-05-14
       words: 451
      flesch: 30
     summary: Papers were solicited for AVoCS 2018 under two categories: regular papers describing fully developed work and complete results, and short papers describing research ideas, work in progress or pre- liminary results. For example, the topics of AVoCS 2018 cover all as- pects of automated verification, including model checking, theorem proving, SAT and SMT constraint solving, automated testing and verification, abstract interpretation, security analysis, model-based development, and refinement.
    keywords: avocs; verification
       cache: eceasst-1071.pdf
  plain text: eceasst-1071.txt

        item: #52 of 858
          id: eceasst-1072
      author: Becker, Jan Steffen
       title: Analyzing Consistency of Formal Requirements
        date: 2019-05-14
       words: 10891
      flesch: 67
     summary: Of course, this requires a formal definition of requirement consistency itself. Debugging embedded systems requirements with stimulus: an automotive case-study.
    keywords: action; automata; automaton; consistency; counter; min; requirements; set; state; step; sup; system; time; trigger; variables
       cache: eceasst-1072.pdf
  plain text: eceasst-1072.txt

        item: #53 of 858
          id: eceasst-1073
      author: Serban, Cristina; Iosif, Radu
       title: An Entailment Checker for Separation Logic with Inductive Definitions
        date: 2019-05-14
       words: 10326
      flesch: 69
     summary: LHS RHS R Seq HSeq HLU HSP T CVC4 LHS RHS R Seq HSeq HLU HSP T CVC4 tree+1 tree V 34 7 2 1 0.096s 9 tree tree + 1 I 7 4 1 0 Given inductive predicate definitions, an entailment query, and a proof-search strategy, Inductor uses a compact tree structure to explore all derivations enabled by the strategy.
    keywords: definitions; entailment; inductive; inference; logic; nil; proof; rule; separation; set; tree
       cache: eceasst-1073.pdf
  plain text: eceasst-1073.txt

        item: #54 of 858
          id: eceasst-1074
      author: Petrasch, Jessica; Oepen, Jan-Hendrik; Krings, Sebastian; Gericke, Moritz
       title: Writing a Model Checker in 80 Days: Reusable Libraries and Custom Implementation
        date: 2019-05-14
       words: 8200
      flesch: 68
     summary: We believe that our selection of libraries and their composition can be useful to other devel- opers and help developing model checkers for new languages. DecOneOfTwo 9.3% 90.7% BooleanLaws 13% 87% FaultyCounter 1% 99% (b) Average shares of parser and model checker in the runtime of BMoth’s ESMC Table 2: Comparison and analysis of average runtimes model checking it to find a solution of the puzzle demonstrates how fast the model checkers kick off without actually having much to do.
    keywords: bmoth; checker; checking; e s; e t; l e; model; r e; s t; state
       cache: eceasst-1074.pdf
  plain text: eceasst-1074.txt

        item: #55 of 858
          id: eceasst-1075
      author: Schnepf, Nicolas; Badonnel, Remi; Lahmadi, Abdelkader; Merz, Stephan
       title: Rule-Based Synthesis of Chains of Security Functions for Software-Defined Networks
        date: 2019-05-14
       words: 7839
      flesch: 49
     summary: In particular, they allow network adminis- trators to combine different security functions, such as firewalls, intrusion detection systems, and external services, into security chains designed to prevent or mitigate attacks against end user applications. 6 Correctness properties of the generated chains The construction of security chains based on a high-level representation guarantees certain cor- rectness properties that we now discuss.
    keywords: android; application; chains; flows; functions; network; packets; port; rules; security; security functions; traffic
       cache: eceasst-1075.pdf
  plain text: eceasst-1075.txt

        item: #56 of 858
          id: eceasst-1076
      author: Farkas, Rebeka; Tóth, Tamás; Hajdu, Ákos; Vörös, András
       title: Backward Reachability Analysis for Timed Automata with Data Variables
        date: 2019-05-14
       words: 9061
      flesch: 64
     summary: As for timed automata, the most efficient algorithms rely on the zone abstract domain [YPD94] that is usually used for (forward) state space exploration [Bou05]. This section presents our proposed algorithm for backward state space exploration of timed auto- mata with data variables.
    keywords: algorithm; automata; automaton; backward; data; data variables; exploration; reachability; set; space; state; variables; zone
       cache: eceasst-1076.pdf
  plain text: eceasst-1076.txt

        item: #57 of 858
          id: eceasst-1077
      author: Limbree, Christophe; Pecheur, Charles
       title: A Framework for the Formal Verification of Networks of Railway Interlockings - Application to the Belgian Railway
        date: 2019-05-14
       words: 6872
      flesch: 61
     summary: ((¬A1∨G1)∧(¬A2∨G2))→ (¬A∨G) (2.1) equa 2.1: Components contracts must entail the system contract. This high level contract (i.e., system level) must be refined by component contracts at C1 and C2 level.
    keywords: 10d; algorithm; component; contracts; formal; iii; interfaces; interlocking; model; railway; route; station; system; train; verification
       cache: eceasst-1077.pdf
  plain text: eceasst-1077.txt

        item: #58 of 858
          id: eceasst-1078
      author: Webster, Matt; Breza, Michael; Dixon, Clare; Fisher, Michael; McCann, Julie
       title: Formal Verification of Synchronisation, Gossip and Environmental Effects for Wireless Sensor Networks
        date: 2019-05-14
       words: 8347
      flesch: 60
     summary: The results showed that the probability that syn- chronisation will occur infinitely often is always 1.0. 4.2 Gossip and Synchronisation The properties examined thus far have concerned clock synchronisation. It is possible to calculate the effect of clock drift on the stability of clock synchronisation.
    keywords: checking; clock; figo; formal; model; networks; nodes; prism; probability; sensor; state; synchronisation; systems; tick; time; use; verification
       cache: eceasst-1078.pdf
  plain text: eceasst-1078.txt

        item: #59 of 858
          id: eceasst-108
      author: Heidenreich, Florian; Wende, Christian; Demuth, Birgit
       title: A Framework for Generating Query Language Code from OCL Invariants
        date: 2007-11-23
       words: 3984
      flesch: 52
     summary: [JK05]. 2.2 OCL Transformation Framework Since we also want the semantic constraints to be preserved across the different abstraction levels, we provide the OCL Transformation Framework which transforms OCL invariants to equivalent sentences in declarative query languages. 1 / 10 Volume 9 (2008) mailto:florian.heidenreich@inf.tu-dresden.de mailto:christian.wende@inf.tu-dresden.de mailto:birgit.demuth@inf.tu-dresden.de http://st.inf.tu-dresden.de Generating Query Language Code from OCL Invariants The Query Code Generation Framework addresses this issue by providing a general framework for mapping OCL invariants to declarative query languages and thereby enables Model-Driven Integrity Engineering.
    keywords: code; data; framework; integrity; invariants; language; models; ocl; query; transformation; uml
       cache: eceasst-108.pdf
  plain text: eceasst-108.txt

        item: #60 of 858
          id: eceasst-1080
      author: Jomaa, Narjes; Torrini, Paolo; Nowak, David; Grimaud, Gilles; Hym, Samuel
       title: Proof-Oriented Design of a Separation Kernel with Minimal Trusted Computing Base
        date: 2019-05-14
       words: 9362
      flesch: 57
     summary: AVoCS 2018 6 / 20 ECEASST MAL Hardware automated translation Coq implementation C implementation abstraction HMAL+MMU API (PTM) MMAL MAL IAL IAL API (PTM) HIAL MIAL Figure 2: The design of Pip 3.1 Hardware memory abstraction layer Memory size is determined in our model by two architecture-dependent parameters, the positive integers pageSize for memory page size and nmbPages for the number of pages. User code running in any partition can use the memory management services exposed by Pip to create child partitions, here P1 and P2, lending some of its accessible pages to each of them.
    keywords: access; address; child; design; kernel; level; memory; mmu; model; page; partition; pip; proof; security; separation; state; tree; verification
       cache: eceasst-1080.pdf
  plain text: eceasst-1080.txt

        item: #61 of 858
          id: eceasst-1087
      author: Castellanos Ardila, Julieth Patricia
       title: Facilitating Automated Compliance Checking in the Safety-critical Context
        date: 2019-12-16
       words: 8690
      flesch: 49
     summary: The reason is that process compliance is not only related to the structure of a process, but also what the tasks in a process do and their effects in the general process behavior [HGW12]. The methodology provided in [BCCG07] is also used in [GDBB17], to ensure process compliance during execution time.
    keywords: approach; checking; compliance; compliance checking; context; engineering; logic; model; obligation; process; processes; requirements; research; safety; software; standards; systems
       cache: eceasst-1087.pdf
  plain text: eceasst-1087.txt

        item: #62 of 858
          id: eceasst-1089
      author: Tegeler, Tim; Schürmann, Jonas
       title: Evolve: Language-Driven Engineering in Industrial Practice
        date: 2020-01-07
       words: 6549
      flesch: 61
     summary: We do not try to defend against malicious attacks but handle mistaken inputs by using generated code for common problems. Admittedly, using the number of files and LOC as a metric for source code is vague, especially when analyzing generated code.
    keywords: application; attribute; code; developers; development; dsl; engineering; evolve; json; language; project; type
       cache: eceasst-1089.pdf
  plain text: eceasst-1089.txt

        item: #63 of 858
          id: eceasst-109
      author: Bräuer, Matthias; Demuth, Birgit
       title: Model-Level Integration of the OCL Standard Library Using a Pivot Model with Generics Support
        date: 2007-11-23
       words: 5078
      flesch: 50
     summary: OrderedSetType 1 oclVoid 1 1 oclBoolean 1 1 oclString 1 1 oclInteger 1 1 oclReal 1 1 oclInvalid 1 1 oclType 1 1 oclAny 1 1 1 1 1 1 TupleType 0..* oclSequence oclCollection oclBag oclOrderedSet oclSet oclTuple 1 1 1 1 1 0..* Figure 7: The facade interface for the OCL standard library types 4.2 Binding template types during OCL parsing In the following, we demonstrate the feasibility of our approach with a simple example that involves the binding of generic OCL collection types while parsing an OCL expres- sion. To remove the definition of the standard library from the implementation code and specify it declaratively, a mechanism to model generic types and operations is required.
    keywords: figure; generic; integration; languages; level; library; model; ocl; operations; pivot; standard; type
       cache: eceasst-109.pdf
  plain text: eceasst-109.txt

        item: #64 of 858
          id: eceasst-1092
      author: Kasalica, Vedran; Lamprecht, Anna-Lena
       title: Workflow Discovery with Semantic Constraints: The SAT-Based Implementation of APE
        date: 2020-05-17
       words: 10767
      flesch: 61
     summary: In order to support different levels of abstraction, terms for domain tools and data types are organized in taxonomies, tree- like structures composed of semantic tools and data types, respectively. CT is a set of concrete types that directly correspond to data instances that are used by domain tools.
    keywords: constraints; data; discovery; domain; encoding; example; framework; intent; language; output; program; search; semantic; sltl; specification; state; synthesis; tool; type; use; user; workflow
       cache: eceasst-1092.pdf
  plain text: eceasst-1092.txt

        item: #65 of 858
          id: eceasst-1100
      author: Mues, Malte; Fitzke, Martin; Howar, Falk
       title: Thoughts about using Constraint Solvers in Action
        date: 2020-05-18
       words: 9966
      flesch: 59
     summary: Independent of potential improvements for a single solver, the overall results are a promising indication that a solving service using a mixture of different constraint solvers and the same solver with differ- ent seeds might lead to substantial performance improvements for tools being slowed down by constraint solvers at the moment. Nev- ertheless, a smooth integration of SMT solvers into programs is still a challenge that lead to different approaches for doing it the right way.
    keywords: analysis; constraint; constraint solvers; docker; execution; experiments; international; java; language; lib; platform; problem; running; service; smt; solver; solving; time; way
       cache: eceasst-1100.pdf
  plain text: eceasst-1100.txt

        item: #66 of 858
          id: eceasst-1103
      author: Madelaine, Eric; Qin, Xudong; Zhang, Min; Bliudze, Simon
       title: Using SMT Engine to Generate Symbolic Automata
        date: 2019-05-14
       words: 7574
      flesch: 56
     summary: We foresee that the interplay with the SMT solver that we use here for satisfiability of open transitions will be similar with what we need when proving (symbolic) equivalence between open transitions. Definition 4 (Open transitions)
    keywords: action; algebra; automata; automaton; bip; open; pnet; semantics; set; smt; state; systems; transitions; variables
       cache: eceasst-1103.pdf
  plain text: eceasst-1103.txt

        item: #67 of 858
          id: eceasst-1104
      author: Ferrara, Pietro; Mandal, Amit Kr; Cortesi, Agostino; Spoto, Fausto
       title: Cross-Programming Language Taint Analysis for the IoT Ecosystem
        date: 2019-10-21
       words: 3435
      flesch: 47
     summary: Thus, inter-procedural dataflow analysis provides a general framework for program analysis. Huuck [Huu15] discussed the security threats of IoT devices, and advocated the use of static code analysis to detect some of these issues.
    keywords: analysis; figure; iot; java; language; programming; software; static; taint; value
       cache: eceasst-1104.pdf
  plain text: eceasst-1104.txt

        item: #68 of 858
          id: eceasst-1106
      author: Bernardeschi, Cinzia; Domenici, Andrea; Saponara, Sergio
       title: Formal Verification in the Loop to Enhance Verification of Safety-Critical Cyber-physical Systems
        date: 2019-10-21
       words: 3756
      flesch: 54
     summary: This paper proposes a conceptual framework for the development of complex systems based on (i) higher-order logic specification, (ii) verification by theorem proving, and (iii) tight integration of verification with model-driven development and simulation. The causes of a failed proof must be analyzed, since they may lie in an incorrect translation from the initial model or system requirements to HOL, or in an incorrect representation of the intended design in the ini- tial model, or finally in some flaw in the intended design.
    keywords: control; logic; loop; model; pvs; safety; simulation; system; verification
       cache: eceasst-1106.pdf
  plain text: eceasst-1106.txt

        item: #69 of 858
          id: eceasst-1107
      author: Dragomir, Iulia; Bensalem, Saddek
       title: Rigorous Design of FDIR Systems with BIP
        date: 2019-10-21
       words: 3072
      flesch: 54
     summary: In the context of the ESROCOS and ERGO projects, our contribu- tion is to model and validate FDIR components for system designs in TASTE Yes/No verdict, counterexamples Figure 3: Approach for FDIR components design and analysis with the BIP framework.
    keywords: bip; code; components; design; fdir; model; system; time
       cache: eceasst-1107.pdf
  plain text: eceasst-1107.txt

        item: #70 of 858
          id: eceasst-1108
      author: Maroneze, André; Perrelle, Valentin; Kirchner, Florent
       title: Advances in Usability of Formal Methods for Code Verification with Frama-C
        date: 2019-10-21
       words: 2919
      flesch: 48
     summary: doi:10.1007/978-3-319-32582-8 15 https://doi.org/10.1007/978-3-319-32582-8 15 InterAVT 2019 6 / 6 http://dx.doi.org/10.1007/978-3-319-06200-6_17 https://doi.org/10.1007/978-3-319-06200-6_17 http://www.brendangregg.com/flamegraphs.html https://clang.llvm.org/docs/JSONCompilationDatabase.html https://clang.llvm.org/docs/JSONCompilationDatabase.html http://dx.doi.org/10.1007/s00165-014-0326-7 https://doi.org/10.1007/s00165-014-0326-7 http://dx.doi.org/10.1007/978-3-030-00250-3_3 https://doi.org/10.1007/978-3-030-00250-3_3 https://github.com/Frama-C/open-source-case-studies https://github.com/Frama-C/open-source-case-studies http://dx.doi.org/https://doi.org/10.1016/j.net.2014.12.009 http://www.sciencedirect.com/science/article/pii/S1738573315000091 http://www.easychair.org/publications/paper/t6tV http://dx.doi.org/10.1007/978-3-319-32582-8_15 https://doi.org/10.1007/978-3-319-32582-8_15 Introduction On the anatomy of a formal code analysis Smarter, faster code analysis setups Exploiting code analysis results Threats to validity Conclusion Advances in Usability of Formal Methods for Code Verification with Frama-C Electronic Communications of the EASST Volume 77 (2019) Interactive Workshop on the Industrial Application of Verification and Testing, ETAPS 2019 Workshop (InterAVT 2019) Advances in Usability of Formal Methods for Code Verification with Frama-C André Maroneze, Valentin Perrelle and Florent Kirchner 6 pages Guest Editors: Anila Mjeda, Stylianos Basagiannis, Goetz Botterweck ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Advances in Usability of Formal Methods for Code Verification with Frama-C André Maroneze, Valentin Perrelle and Florent Kirchner∗ firstname.lastname@cea.fr CEA, List, Gif-sur-Yvette, France Abstract: Industrial usage of code analysis tools based on semantic analysis, such as the FRAMA-C platform, poses several challenges, from the setup of analyses to the exploitation of their results.
    keywords: alarms; analysis; code; frama; information; source; tools; user; verification
       cache: eceasst-1108.pdf
  plain text: eceasst-1108.txt

        item: #71 of 858
          id: eceasst-1109
      author: Husák, Robert; Kofroň, Jan; Zavoral, Filip
       title: AskTheCode: Interactive Call Graph Exploration for Error Fixing and Prevention
        date: 2019-10-21
       words: 2251
      flesch: 57
     summary: Utilizing interactive approach, certain limitation of used backward symbolic execution can be alleviated, e.g. by voluntarily omitting certain problematic places or controlling loop unwinding. AskTheCode is based on control flow analysis and backward symbolic execution.
    keywords: askthecode; developers; error; execution; exploration; graph
       cache: eceasst-1109.pdf
  plain text: eceasst-1109.txt

        item: #72 of 858
          id: eceasst-111
      author: Mens, Tom; Mens, Kim; Van Paesschen, Ellen; D'Hondt, Maja
       title: Preface of the Proceedings of the Third International ERCIM Symposium on Software Evolution - EVOL 2007
        date: 2008-02-09
       words: 1436
      flesch: 49
     summary: The presentations covered a wide variety of research topics, ranging from research advances in software refactoring, open source software evolution, reengineering of legacy code and software product lines, to evolution problems and issues in component-based, service-oriented, aspect- 1 / 4 Volume 8 (2008) ERCIM EVOL 2007 - Preface oriented and model-driven software development. Keywords: software evolution, ERCIM 1 Introduction Software evolution refers to the phenomenon that software intensive systems constantly change, and have to change, in order to remain useful and usable.
    keywords: ercim; evolution; mens; research; software; volume
       cache: eceasst-111.pdf
  plain text: eceasst-111.txt

        item: #73 of 858
          id: eceasst-1111
      author: Mjeda, Anila; Botterweck, Goetz
       title: Scalable Software Testing and Verification for Industrial-Scale Systems: The Challenges
        date: 2019-10-21
       words: 2876
      flesch: 48
     summary: Some promising emerging techniques include neuron coverage used as a classic black-box testing tech- nique (testing the unknown)[25], grey-box test generation led by a neuron-coverage metric and oracle generation via metamorphic testing techniques [28], leveraging adversarial techniques to detect erroneous behaviour For example, Bertolino [2] analysed the discordance between the state of practice and state of art in test- ing and argued for the need of more empirical research in industrial software testing.
    keywords: challenges; industrial; industry; model; software; systems; techniques; testing; verification
       cache: eceasst-1111.pdf
  plain text: eceasst-1111.txt

        item: #74 of 858
          id: eceasst-1112
      author: Mjeda, Anila; Basagiannis, Stylianos; Botterweck, Goetz
       title: Preface
        date: 2019-10-21
       words: 572
      flesch: 11
     summary: The Irish Software Research Centre and University of Limerick Anila Mjeda Lero - The Irish Software Research Centre and University of Limerick Program Committee: Mathieu Acher University of Rennes 1, France Alessandra Bagnato Softeam Cinzia Bernardeschi University of Pisa Dirk Beyer LMU Munich Armin Biere Johannes Kepler University Linz Jorg Brauer Verified Systems Jeremy Bryans Coventry University Maxime Cordy SnT, University of Luxembourg Marco Dinatale Scuole Santa Anna Alessandro Fantechi University of Florence Alberto Griggio Fondazione Bruno Kessler Klaus Havelund NASA/ This volume contains the proceedings of the first Interactive Workshop on the Industrial Ap- plication of Verification and Testing (InterAVT 2019) which was co-hosted with ETAPS 2019 and took place in the Faculty of Mathematics and Physics building at Charles University, Prague on the 6th of April 2019.
    keywords: centre; research; university; workshop
       cache: eceasst-1112.pdf
  plain text: eceasst-1112.txt

        item: #75 of 858
          id: eceasst-1115
      author: Andrianov, Pavel Sergeevich; Mutilin, Vadim Sergeevich
       title: Data Race Detection in the Linux Kernel with CPALockator
        date: 2021-05-10
       words: 4082
      flesch: 62
     summary: We extended several CPAs for support of the thread-modular approach with projections and implemented two specific CPAs: ThreadCPA for thread analysis and LockCPA for tracking syn- chronization primitives. A compatibility check uses different kinds of analysis, including analysis of synchronization primitives, predicate analysis, thread analysis, hence the approach is more precise than the default Lockset algorithm.
    keywords: analysis; data; thread
       cache: eceasst-1115.pdf
  plain text: eceasst-1115.txt

        item: #76 of 858
          id: eceasst-1116
      author: Bernardeschi, Cinzia; Domenici, Andrea; Fagiolini, Adriano; Palmieri, Maurizio
       title: Block-Based Models and Theorem Proving in Model-Based Development
        date: 2021-05-10
       words: 3099
      flesch: 60
     summary: This work sup- ports the thesis that computer-assisted verification can be integrated within model-based devel- opment of control systems. Let the initial position and heading be p0 = (x0,y0) and ψ = ψ0, respectively.
    keywords: development; model; proving; system; theorem
       cache: eceasst-1116.pdf
  plain text: eceasst-1116.txt

        item: #77 of 858
          id: eceasst-1117
      author: Giantamidis, Georgios; Papanikolaou, Georgios; Miranda, Marcelo; Salinas-Hernando, Gonzalo; Valverde-Alcala, Juan; Veluru, Suresh; Basagiannis, Stylianos
       title: ReForm: A Tool for Rapid Requirements Formalization
        date: 2021-05-10
       words: 2520
      flesch: 42
     summary: The developed approach is an end-to-end solution, starting with natural language requirements as input and going all the way down to auto-generated monitors in MATLAB / Simulink. Another is- sue is that typically test cases and requirement monitors are constructed manually, which is time consuming and error prone.
    keywords: case; formalization; generation; language; monitor; pattern; requirements; tool
       cache: eceasst-1117.pdf
  plain text: eceasst-1117.txt

        item: #78 of 858
          id: eceasst-1118
      author: Schieweck, Alexander; Margaria, Tiziana
       title: Testing Interconnected Systems with Behavior Mining
        date: 2021-05-10
       words: 3098
      flesch: 56
     summary: DIME is an Integrated Modeling Environment, i.e. a model driven design tool, specialized for web applications. In the case of reactive systems like web applications, those models are often Mealy machines.
    keywords: application; behavior; experiment; learning; model; position; robot; web
       cache: eceasst-1118.pdf
  plain text: eceasst-1118.txt

        item: #79 of 858
          id: eceasst-1119
      author: Silva, Thiago Rocha; Fitzgerald, Brian
       title: Parsing BDD Stories for Automated Verification of Software Artefacts
        date: 2021-05-10
       words: 4129
      flesch: 48
     summary: The solution we propose is based on different strategies for analysing the consistency of user requirements specified in BDD stories on task models, graphical user interfaces (GUIs), GUI prototypes, and domain models. To achieve this goal, we rely on a previously developed ontology for describing common interactive behaviours on BDD stories [5], [6] which is currently used to support the assessment of user interface design artefacts (task models, GUI prototypes and web GUIs).
    keywords: artefacts; bdd; models; requirements; software; stories; task; user
       cache: eceasst-1119.pdf
  plain text: eceasst-1119.txt

        item: #80 of 858
          id: eceasst-112
      author: Folli, Alessandro; Mens, Tom
       title: Refactoring of UML models using AGG
        date: 2008-02-10
       words: 5319
      flesch: 53
     summary: This clearly shows that it is possible to formalise the specification and execution of model refactoring using graph transformation rules. Based on the UML Interaction Overview diagram syntax, we have represented the control flow as a graph structure, which is used to drive the application of graph transformation rules.
    keywords: agg; figure; graph; graph transformation; model; refactoring; rules; software; state; transformation; uml
       cache: eceasst-112.pdf
  plain text: eceasst-112.txt

        item: #81 of 858
          id: eceasst-1120
      author: Mercaldo, Francesco; Martinelli, Fabio; Santone, Antonella
       title: Timed Automata for Mobile Ransomware Detection
        date: 2021-05-10
       words: 4793
      flesch: 50
     summary: This explains also why Android malware is usu- ally grouped in families: in fact, given this way of generating Android malware, the malware belonging to the same family shares common parts of code and behaviors [MMM17]. 4 Related Work The main difference between ransomware and other widespread mobile malware types is in their behaviour: as demonstrated in [ZJ12a], Android malware generally focuses on remaining hidden while gathering and sending to the attackers user sensitive and private information.
    keywords: analysis; android; applications; approach; conference; data; detection; international; malware; method; mobile; ransomware; security; system
       cache: eceasst-1120.pdf
  plain text: eceasst-1120.txt

        item: #82 of 858
          id: eceasst-1124
      author: Mjeda, Anila; Botterweck, Götz
       title: Uncertainty Entangled; Modelling Safety Assurance Cases for Autonomous Systems
        date: 2021-05-10
       words: 4352
      flesch: 48
     summary: 4 GSN Entangled – Designing for Uncertainty We propose to extend GSN nodes with metadata (building on research by [DP18]) to: a) accommodate our vision of ‘solutions superposition-model’ to model autonomous systems; and, b) incorporate the extensive reference lists, different types of prompts and epistemic defeaters provided by the emerging UL 4600 standard as natural elements of our treatment of uncertainty (’entangled uncertainties’). One of the interesting aspects of the Duckiebots for us is that they face a number of software and environment uncertainties (Figure 1), that include: •
    keywords: assurance; cases; gsn; modelling; quantum; safety; software; superposition; systems; uncertainties; uncertainty
       cache: eceasst-1124.pdf
  plain text: eceasst-1124.txt

        item: #83 of 858
          id: eceasst-1125
      author: Basagiannis, Stylianos; Mjeda, Anila; Botterweck, Götz
       title: Second Interactive Workshop on the Industrial Application of Verification and Testing, ETAPS 2020 Workshop (InterAVT 2020)
        date: 2021-05-10
       words: 594
      flesch: 15
     summary: Stylianos Basagiannis, Anila Mjeda, and Goetz Botterweck 1 / 2 Volume 079 (2020) Preface InterAVT Workshop Organization Organizing Committee: Stylianos Basagiannis - Raytheon Technologies Research Centre Goetz Botterweck Lero - The Irish Software Research Centre and University of Limerick Anila Mjeda Lero - The Irish Software Research Centre and University of Limerick Program Committee: Alessandra Bagnato, Softeam, FR Stylianos Basagiannis, Raytheon Technologies Research Centre, IE Cinzia Bernardeschi, University of Pisa, IT Armin Biere,Johannes Kepler University Linz, AT Goetz Botterweck, Lero and University of Limerick, IE Jorg Brauer, Verified Systems, DE Alessandro Fantechi, University of Florence, IT Alberto Griggio, Fondazione Bruno Kessler, IT Patrick Heymans, University of Namur, BE Christian Koenig, TWT, DE Tiziana Margaria, Lero and University of Limerick, IE Anastasia Mavridou, NASA Ames Research Centre, US Anila Mjeda, Lero and University of Limerick, IE David Parker, University of Birmingham, UK Tomáš Vojnar, Brno University of Technology, CZ InterAVT 2020 2 / 2 Modern verification and testing techniques are highly relevant for industrial software- intensive systems.
    keywords: testing; university; verification
       cache: eceasst-1125.pdf
  plain text: eceasst-1125.txt

        item: #84 of 858
          id: eceasst-1126
      author: Hardes, Tobias; Boos, Clemens; Sommer, Christoph
       title: Towards opportunistic UAV relaying for smart cities
        date: 2021-09-08
       words: 1938
      flesch: 50
     summary: 3 Simulations We investigate the impact of opportunistic UAV relaying on cooperative perception using com- puter simulations using the popular open-source vehicular network simulator Veins, coupling the OMNeT++ INET Framework for modeling wireless networking and SUMO for modeling road traffic mobility. Keywords: UAV, vehicular network, wireless network, cooperative perception 1 Introduction A current trend in the Internet of Things (IoT) and Smart Cities are Unmanned Aerial Vehicles (UAVs), or drones, that are considered for more and more use cases every day [LXW+20].
    keywords: communication; intersection; relaying; uavs; vehicles; work
       cache: eceasst-1126.pdf
  plain text: eceasst-1126.txt

        item: #85 of 858
          id: eceasst-1127
      author: Geissler, Stefan; Lange, Stanislav; Hossfeld, Tobias; Tran-Gia, Phuoc
       title: Discrete-time Analysis of Multicomponent GI/GI/1 Queueing Networks
        date: 2021-09-08
       words: 1840
      flesch: 53
     summary: We investigate the magnitude of this error regarding both the sojourn time as well as interdeparture time distributions for a broad set of parameters. [5] W. K. Grassmann and J. L. Jain, “Numerical solutions of the waiting time distribution and idle time distribution of the arithmetic gi/g/1 queue,” Operations Research, vol.
    keywords: distribution; queueing; time
       cache: eceasst-1127.pdf
  plain text: eceasst-1127.txt

        item: #86 of 858
          id: eceasst-1128
      author: Döpmann, Christoph; Fiedler, Felix; Lucia, Sergio; Tschorsch, Florian
       title: Towards Optimization-Based Predictive Congestion Control for the Tor Network
        date: 2021-09-08
       words: 1913
      flesch: 49
     summary: In this paper, we investigate PredicTor, a novel approach towards multi-hop congestion control based on distributed model predic- tive control (MPC), an advanced optimization-based control technique. In this paper, we complement a networking perspective and investigate PredicTor’s ability to improve congestion control in non-trivial network scenarios.
    keywords: congestion; control; data; network; optimization; predictor
       cache: eceasst-1128.pdf
  plain text: eceasst-1128.txt

        item: #87 of 858
          id: eceasst-113
      author: Beecher, Karl; Boldyreff, Cornelia; Capiluppi, Andrea; Rank, Stephen
       title: Evolutionary Success of Open Source Software: an Investigation into Exogenous Drivers
        date: 2008-02-10
       words: 7026
      flesch: 60
     summary: Debian projects were shown to have a longer period of evolution, were larger in size, attracted more developers and experienced greater activity than SourceForge projects. 7 / 14 Volume 8 (2008) Evolutionary Success of Open Source Software – Beecher, Boldyreff, Capiluppi and Rank Hypothesis 1.1: Days of evolution H0: Debian and sf.net projects have a similar time span H1: Debian projects have a longer time span min Q1 median Q3 max debian 1 588 1740 2916 4088 sf.net 1 247 495.5 1290 2479 t-test t = -5.279
    keywords: debian; developers; evolution; floss; hypothesis; number; projects; sample; software; sourceforge; test
       cache: eceasst-113.pdf
  plain text: eceasst-113.txt

        item: #88 of 858
          id: eceasst-1130
      author: Pacheco, Lucas de Sousa; Rosário, Denis; Cerqueira, Eduadro; Braun, Torsten
       title: Federated User Clustering for non-IID Federated Learning
        date: 2021-09-08
       words: 2216
      flesch: 48
     summary: However, FL has the significant shortcoming of requiring user data to be Independent Identi- cally Distributed (IID) to make reliable predictions for a given group of users. While the majority of the events that impact network functioning are user-generated, such as user requests and mobility, collecting user data in order to train machine learning models at the network level raises privacy and scalability concerns, as training massive amounts of user data in a centralized manner may pose a limitation for the learning process
    keywords: clustering; data; federated; learning; models; similarity; user
       cache: eceasst-1130.pdf
  plain text: eceasst-1130.txt

        item: #89 of 858
          id: eceasst-1131
      author: Dede, Jens; Udugama, Asanga; Förster, Anna
       title: Demo: Simulation-as-a-Service to Benchmark Opportunistic Networks
        date: 2021-09-08
       words: 1443
      flesch: 38
     summary: Mail address, personal data, privacy consent Admin features Simulation Manager Simulation status Simulation Queue Enqueue simulations Simulation status Send notifications to user Simulation Server Worker run simulation create graphs (pdf) scale down and convert results Worker run simulation create graphs (pdf) scale down and convert results Worker run simulation create graphs (pdf) scale down and convert results File & Result Storage Store .sca files for X days Store .csv files for Y days Store .pdf files for Z days Figure 1: The architectural overview of OOTB model framework. Demo: Simulation-as-a-Service to Benchmark Opportunistic Networks Jens Dede, Asanga Udugama and Anna Förster 4 pages Guest Editors: Andreas Blenk, Mathias Fischer, Stefan Fischer, Horst Hellbrueck, Oliver Hohlfeld, Andreas Kassler, Koojana Kuladinithi, Winfried Lamersdorf, Olaf Landsiedel, Andreas Timm-Giel, Alexey Vinel ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Demo: Simulation-as-a-Service to Benchmark Opportunistic Networks Jens Dede1, Asanga Udugama2 and Anna Förster3 jd@comnets.uni-bremen.de adu@comnets.uni-bremen.de anna.foerster@uni-bremen.de Sustainable Communication Networks University of Bremen, Germany Abstract: Repeatability, reproducibility, and replicability are essential aspects of experimental and simulation-driven research.
    keywords: networks; ootb; results; simulation; user
       cache: eceasst-1131.pdf
  plain text: eceasst-1131.txt

        item: #90 of 858
          id: eceasst-1132
      author: Dede, Jens; Helms, Daniel; Förster, Anna
       title: MoleNet: An Underground Sensor Network for Soil Monitoring
        date: 2021-09-08
       words: 1364
      flesch: 53
     summary: 1 is the sensor network itself containing the MoleNet nodes with different sensors attached. One focus is to extend the MoleNet nodes to a more modular system: Adding new sensors with different hardware interfaces is currently simplified.
    keywords: data; molenet; monitoring; sensor; soil
       cache: eceasst-1132.pdf
  plain text: eceasst-1132.txt

        item: #91 of 858
          id: eceasst-1133
      author: Tärneberg, William; Gunnarsson, Martin; Kihl, Maria; Gehrmann, Christian
       title: Demonstration: A cloud-native digital twin with adaptive cloud-based control and intrusion detection
        date: 2021-09-08
       words: 1799
      flesch: 54
     summary: In addition to the PT and DT controllers, there is a PLC able to control the plant. The relationship between the Physcial Twin (PT) and the DT has crystallized, and the cloud has become the de-facto deployment environment for DTs.
    keywords: cloud; control; cps
       cache: eceasst-1133.pdf
  plain text: eceasst-1133.txt

        item: #92 of 858
          id: eceasst-1134
      author: Friesel, Daniel; Spinczyk, Olaf
       title: Data Serialization Formats for the Internet of Things
        date: 2021-09-08
       words: 1630
      flesch: 57
     summary: Given the payloads, data formats, and implementations, our evaluation program generates and executes (de)serialization code on the target MCUs and measures clock cycles, serialized data size, text segment size, and memory usage (i.e., data + bss + stack). We use C++ and Python3 libraries to measure serialized data size for data formats without embedded implementations.
    keywords: data; energy; formats; protocol; serialization; xdr
       cache: eceasst-1134.pdf
  plain text: eceasst-1134.txt

        item: #93 of 858
          id: eceasst-1137
      author: Kundel, Ralf; Stiegele, Paul; Tran, Dat; Zobel, Julian; Abboud, Osama; Hark, Rhaban; Steinmetz, Ralf
       title: User Space Packet Schedulers: Towards Rapid Prototyping of Queue-Management Algorithms
        date: 2021-09-08
       words: 2022
      flesch: 52
     summary: The results have shown that raw sockets and user space packet queues achieve bandwidths above 1 Gbit/s, which is sufficient for most AQM-experiments. Because AQM prototyping in user space allows to conveniently test and evaluate novel AQM approaches, future work will focus on the realization of programmable user space queues in real computer networks based on high performance packet I/O frameworks together with high-level programming languages.
    keywords: algorithms; kernel; packet; queue; queuing; space; user
       cache: eceasst-1137.pdf
  plain text: eceasst-1137.txt

        item: #94 of 858
          id: eceasst-1138
      author: Bradatsch, Leonard; Kargl, Frank; Miroshkin, Oleksandr
       title: Zero Trust Service Function Chaining
        date: 2021-09-08
       words: 2177
      flesch: 54
     summary: The concepts leverages context- based deterministic rules evaluated by the Zero Trust PEP to decide which security functions are chained and afterwards applied to the affected packets. To achieve a dynamic orchestration of traditional security functions by the ZT components and thus a more efficient security-relevant packet processing, we propose a novel network security concept called Zero Trust Service Function Chaining (ZTSFC).
    keywords: functions; http; pep; security; service
       cache: eceasst-1138.pdf
  plain text: eceasst-1138.txt

        item: #95 of 858
          id: eceasst-1139
      author: Fawaz, Hassan; Zeghlache, Djamal; Pham, Tran Anh Quang; Leguay, Jérémie; Medagliani, Paolo
       title: Deep Reinforcement Learning for Smart Queue Management
        date: 2021-09-08
       words: 6492
      flesch: 66
     summary: The authors in [BFZ20] use a deep neural network to dynamically learn the optimal buffer size per network flow. Our objective is to meet stringent demands for network flows belonging to a set of three classes: Gold, Silver, and Bronze, by descending priority.
    keywords: agent; algorithm; bronze; delay; dqn; flows; gold; learning; network; queue; reinforcement; silver; throughput; traffic; weights; wfq
       cache: eceasst-1139.pdf
  plain text: eceasst-1139.txt

        item: #96 of 858
          id: eceasst-114
      author: Angyal, László; Lengyel, László; Charaf, Hassan
       title: Novel Techniques For Model-Code Synchronization
        date: 2008-02-10
       words: 6108
      flesch: 53
     summary: [26] introduces how VMTS generates source code using model transformation methods and CodeDOM metamodel. The last synchronized AST model (M0) is logically equal to the common ancestor (S0) that reflects the last synchronization state.
    keywords: approach; ast; code; development; edit; merge; model; node; operations; public; software; source; synchronization; tree; way
       cache: eceasst-114.pdf
  plain text: eceasst-114.txt

        item: #97 of 858
          id: eceasst-1140
      author: Krüger, Thorben; Hausheer, David
       title: Early Work: Path Selection in a Path-aware Network Architecture
        date: 2021-09-08
       words: 1680
      flesch: 42
     summary: In our work, we aim to generalize this approach to network paths instead of peers, where a network operator can offer comparable functionality to hosts that wish to adjust their multipath communication to current network conditions for mutual benefit. How exactly hosts can chose paths in a meaningful way while maintaining good network utilization as well as user satisfaction is the subject of this research.
    keywords: communication; multipath; network; path; selection; utilization
       cache: eceasst-1140.pdf
  plain text: eceasst-1140.txt

        item: #98 of 858
          id: eceasst-1141
      author: Stolpmann, Daniel; Timm-Giel, Andreas
       title: FlowEmu: An Open-Source Flow-Based Network Emulator
        date: 2021-09-08
       words: 1860
      flesch: 50
     summary: In Section 2, existing network emulators are presented and compared to FlowEmu. Interface FlowEmu is fully controllable via MQTT.
    keywords: application; emulator; flowemu; network; packet; source
       cache: eceasst-1141.pdf
  plain text: eceasst-1141.txt

        item: #99 of 858
          id: eceasst-1142
      author: Alhamwy, Yasin
       title: Information Management for Multi-Agent Systems
        date: 2021-09-08
       words: 2544
      flesch: 54
     summary: FIWARE is able to represent context information based on the notation of entities using data models, exchange information with entities using a context data interface and exchange information on how to obtain context information using a context availability inter- face. The Open Source Platform for Our Smart Digital Future; www.fiware.org; Accessed on 27.05.2021 2 What is - Sentilo; www.sentilo.io/wordpress/sentilo-about-product/what-is/; Accessed on 27.05.2021 3 Cloud-Edge Computing; https://fiware-tutorials.readthedocs.io/en/latest/edge-computing/index.html; Accessed on 27.05.2021 NetSys 2021 2 / 5 www.fiware.org www.sentilo.io/wordpress/sentilo-about-product/what-is/ https://fiware-tutorials.readthedocs.io/en/latest/edge-computing/index.html ECEASST it is possible to extend the capabilities of agents to be able to receive and share information from the environment (context information) and collectively learn by sharing their trajectories, plans, outcomes, information and so on.
    keywords: agents; alica; context; domains; fiware; information; systems
       cache: eceasst-1142.pdf
  plain text: eceasst-1142.txt

        item: #100 of 858
          id: eceasst-1143
      author: Basso, Maik; Vinel, Alexey; Pignaton de Freitas, Edison
       title: An Application Layer Protocol to Support Cooperative Navigation of Multiple UAVs Systems
        date: 2021-09-08
       words: 1477
      flesch: 50
     summary: 1 / 4 Volume 080 (2021) mailto:maik@maikbasso.com.br mailto:edison.pignaton@ufrgs.br mailto:alexey.vinel@hh.se An Application Layer Protocol to Support Cooperative Navigation of Multiple UAVs Systems 2 Approach Overview 4 Conclusion This work demonstrates a communication system used for information sharing to support coop- erative navigation systems used in multiple UAVs systems.
    keywords: figure; information; navigation; systems; uavs
       cache: eceasst-1143.pdf
  plain text: eceasst-1143.txt

        item: #101 of 858
          id: eceasst-1144
      author: Romanchenko, Daniil; Tartie, Matis; Que Le, Ba; Torres Gómez, Jorge; Dressler, Falko
       title: Molecular Communication Channel Modelling in FPGA Technology
        date: 2021-09-08
       words: 1879
      flesch: 51
     summary: Receiver 10 5 -40 -30 -20 -10 0 Figure 3: Comparison of FPGA simulations and modelled transfer functions. technology. The suggested design is generic, meaning it is not fixed to any concrete implementation, thus, it can be applied in any FPGA 3 / 4 Volume 080 (2021) Molecular Communication Channel Modelling in FPGA Technology Frequency [Hz] C h a n n e l A tt e n u a ti o n [d B ] 0 500 1000 (a) Transmitter -200 -150 -100 -50 0 0 500 1000 (b) Channel -60 -50 -40 -30 -20 -10 0 0 5 10 (c)
    keywords: communication; figure; fpga; function; particle
       cache: eceasst-1144.pdf
  plain text: eceasst-1144.txt

        item: #102 of 858
          id: eceasst-1146
      author: Tyagi, Aditya; Nokhbeh Zaeem, Razieh; Barber, K. Suzanne
       title: Early Warning Identity Threat and Mitigation System
        date: 2021-09-08
       words: 8
      flesch: -12
     summary: Early Warning Identity Threat and Mitigation System - ECEASST_NETSYS2021_camera_ready_Latex-2.pdf
    keywords: eceasst_netsys2021_camera_ready_latex-2.pdf
       cache: eceasst-1146.pdf
  plain text: eceasst-1146.txt

        item: #103 of 858
          id: eceasst-1147
      author: Makama, Aliyu; Kuladinithi, Koojana; Ahmed, Musab Eltayeb Ahmed; Timm-Giel, Andreas
       title: Evaluation of Multi-hop Ad-hoc Routing Protocols in Wireless Seismic Data Acquisition
        date: 2021-09-08
       words: 2232
      flesch: 49
     summary: Each subnetwork consists of certain number of geophones that relay their seismic data via neighbouring geophones to a GW node over multi-hop wireless network. Energy-Efficient Routing Proto- cols in Wireless Sensor Networks: A Survey.
    keywords: data; geophone; hop; network; protocols; routing; subnetwork
       cache: eceasst-1147.pdf
  plain text: eceasst-1147.txt

        item: #104 of 858
          id: eceasst-1149
      author: Walther, Paul; Richter, Markus; Strufe, Thorsten
       title: Ray-tracing based Inference Attacks on Physical Layer Security
        date: 2021-09-08
       words: 1940
      flesch: 50
     summary: We realize this at- tack and evaluate it with real world measurement, and thereby show that such attacks can predict channel properties better than previous attacks and are also more gener- ally applicable. Such attacks have 1 / 4 Volume 080 (2021) Ray-tracing based Inference Attacks on Physical Layer Security the following advantage: Due to noise and interference, differences between observations also occur between the channel characteristics of the legitimate partners.
    keywords: attack; channel; layer; properties; ray; security
       cache: eceasst-1149.pdf
  plain text: eceasst-1149.txt

        item: #105 of 858
          id: eceasst-115
      author: Adams, Bram; De Schutter, Kris; Tromp, Herman; De Meuter, Wolfgang
       title: The Evolution of the Linux Build System
        date: 2008-02-10
       words: 6733
      flesch: 62
     summary: We do this by analysing the kernel’s build traces with MAKAO, our re(verse)-engineering framework for build systems. [ADTD07], our re(verse)-engineering framework for build systems, in order to obtain the corresponding build dependency graphs, and some figures on the number of targets and dependencies.
    keywords: build; code; dependencies; e p; evolution; figure; kernel; linux; s e; source; system
       cache: eceasst-115.pdf
  plain text: eceasst-115.txt

        item: #106 of 858
          id: eceasst-1150
      author: Funda, Christoph; Hielscher, Kai-Steffen; German, Reinhard
       title: Discrete event simulation for the purpose of real-time performance evaluation of distributed hardware-in-the-loop simulators for autonomous driving vehicle validation
        date: 2021-09-08
       words: 2033
      flesch: 49
     summary: Latency measurements are taken as service times of the servers in the model, and we compare these service times of the simulation output of the model and the measurements as depicted in Figure 2. Figure 2: Example of process service times; from left to right: upper figures: scatter plot of simulation and measurement data, lower figures: Boxplot of Simulation and Measurements, Difference between Simulation and Measurements at each point over time. Keywords: distributed system, networks, hardware-in-the-loop simulation, HIL, real-time performance evaluation, discrete event simulation, DES, OMNeT++ 1 Introduction Autonomous driving functions are safety-critical and have to be tested thoroughly.
    keywords: measurements; model; performance; process; simulation; system; time
       cache: eceasst-1150.pdf
  plain text: eceasst-1150.txt

        item: #107 of 858
          id: eceasst-1151
      author: Reuter, Sebastian; Hiller, Jens; Pennekamp, Jan; Panchenko, Andriy; Wehrle, Klaus
       title: Demo: Traffic Splitting for Tor – A Defense against Fingerprinting Attacks
        date: 2021-09-08
       words: 1913
      flesch: 58
     summary: Specifically, the attacker employs machine learning to identify traffic patterns for the loading of websites over Tor circuits. During the data transmission, each RPi uses the LED corresponding to the transmission direction (and circuit, if applicable) to signal the transmission of Tor traffic cells, thereby evidently illustrating the transmission behavior of our multipath defense.
    keywords: circuit; defense; demo; splitting; tor; traffic
       cache: eceasst-1151.pdf
  plain text: eceasst-1151.txt

        item: #108 of 858
          id: eceasst-1152
      author: Dalpathadu, Yamani; Thumma, Showry; Udugama, Asanga; Förster, Anna
       title: Demo: Using LoRa Communications and Epidemic Routing in Disaster Rescue Operations
        date: 2021-09-08
       words: 1617
      flesch: 46
     summary: 1 https://pycom.io 1 / 4 Volume 080 (2021) mailto:sachitha@uni-bremen.de mailto:thumma@uni-bremen.de mailto:adu@comnets.uni-bremen.de mailto:anna.foerster@uni-bremen.de Demo: Using LoRa Communications and Epidemic Routing in Disaster Rescue Operations use Opportunistic Networking (OppNets) with Epidemic Forwarding 2 Related Work There are a number of work focusing on using LoRa in disaster communications.
    keywords: communications; data; disaster; epidemic; lora; operations
       cache: eceasst-1152.pdf
  plain text: eceasst-1152.txt

        item: #109 of 858
          id: eceasst-1153
      author: Marquardt, Fabian; Buhl, Lennart
       title: Large Scale Monitoring of Web Application Software Distribution to Measure Threat Response Behavior
        date: 2021-09-08
       words: 1996
      flesch: 56
     summary: Our work focuses on measuring the distribution of different web application software versions on a large scale. Andreas Blenk, Mathias Fischer, Stefan Fischer, Horst Hellbrueck, Oliver Hohlfeld, Andreas Kassler, Koojana Kuladinithi, Winfried Lamersdorf, Olaf Landsiedel, Andreas Timm-Giel, Alexey Vinel ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Large Scale Monitoring of Web Application Software Distribution to Measure Threat Response Behavior Fabian Marquardt1 and Lennart Buhl2 1 marquard@cs.uni-bonn.de 2 buhl@cs.uni-bonn.de Department of Computer Science 4 University of Bonn, Germany Abstract: Web application software may be affected by vulnerabilities and a fast deployment of security updates is required to protect users from attacks.
    keywords: application; response; software; versions; web; wordpress
       cache: eceasst-1153.pdf
  plain text: eceasst-1153.txt

        item: #110 of 858
          id: eceasst-1155
      author: Byrenheid, Martin; Roos, Stefanie; Strufe, Thorsten
       title: Improvements to the Secure Construction and Utilization of Greedy Embeddings in Friend-to-Friend Overlays
        date: 2021-09-08
       words: 2024
      flesch: 54
     summary: [RBS16, H+15, HWT11] however provide limited pro- tection against denial of service attacks by malicious nodes. Furthermore, we propose an adaptive packet replication mechanism to further increase the chance of succesful routing in the presence of malicious nodes. 1 / 4 Volume 080 (2021) Improvements to the Secure Construction and Utilization of Embeddings in F2F Overlays (a) (b) () (7) (53)(53,9) (53,24) (c) Figure 1: Primary steps of state of the art embedding algorithms: (a) root election, (b) tree construction, (c) coordinate assignment.
    keywords: friend; node; root; routing
       cache: eceasst-1155.pdf
  plain text: eceasst-1155.txt

        item: #111 of 858
          id: eceasst-1157
      author: See, August
       title: Polymorphic Protocols for Fighting Bots
        date: 2021-09-08
       words: 2429
      flesch: 56
     summary: Section 3 explains how polymorphic protocols can be created and applied, and proposes possible research questions. Polymorphic protocols are mostly mentioned in literature in connection with censorship resistance and privacy
    keywords: application; approach; bots; cost; protocol; service
       cache: eceasst-1157.pdf
  plain text: eceasst-1157.txt

        item: #112 of 858
          id: eceasst-1158
      author: Bornholdt, Heiko; Jost, David; Kisters, Philipp; Rottleuthner, Michel; Shafeeq, Sehrish; Lamersdorf, Winfried; Schmidt, Thomas C.; Fischer, Mathias
       title: Smart Urban Data Space for Citizen Science
        date: 2021-09-08
       words: 1943
      flesch: 52
     summary: Citizens can participate by con- necting their sensors and publishing collected data, creating data processing services, and pro- viding storage space to cache existing data on their hardware. Bootstrapping user-owned sensors Local sensors Local SANE Node Remote SANE Node Integrating external data repositories External sensors Figure 1: Demonstration setup showing locally deployed sensors, sensor bootstrapping, integra- tion of external sensor data, and the interactive web interface to explore the SANE data space.
    keywords: citizen; city; data; sane; sensors; space
       cache: eceasst-1158.pdf
  plain text: eceasst-1158.txt

        item: #113 of 858
          id: eceasst-1159
      author: Schulz, Lars-Christian; Hausheer, David
       title: Towards SCION-enabled IXPs: The SCION Peering Coordinator
        date: 2021-09-08
       words: 2104
      flesch: 49
     summary: 1 / 4 Volume 080 (2021) mailto:lschulz@ovgu.de mailto:hausheer@ovgu.de Towards SCION-enabled IXPs: The SCION Peering Coordinator 3 SCION Peering Coordinator
    keywords: ases; bgp; coordinator; core; peering; scion
       cache: eceasst-1159.pdf
  plain text: eceasst-1159.txt

        item: #114 of 858
          id: eceasst-116
      author: Du Bois, Bart; Van Rompaey, Bart; Meijfroidt, Karel; Suijs, Eric
       title: Supporting Reengineering Scenarios with FETCH: an Experience Report
        date: 2008-02-10
       words: 6426
      flesch: 58
     summary: As C++ fact extractors, these tools invariably process C++ source code and generate an abstract, query-able representation. A tool named Ccia transforms C++ source code to a relational database, queried using Ciao [CFKW95].
    keywords: analysis; case; code; e n; e r; engineering; fetch; model; refactoring; software; source; table; user
       cache: eceasst-116.pdf
  plain text: eceasst-116.txt

        item: #115 of 858
          id: eceasst-1160
      author: Delooz, Quentin; Festag, Andreas; Vinel, Alexey
       title: Congestion Aware Objects Filtering for Collective Perception
        date: 2021-09-08
       words: 2186
      flesch: 61
     summary: The first step to decide if a CPM needs to be generated depends on three parame- ters: T GenC pmMin = 100 ms, T GenC pmMax = 1 s, and To f f . The last parameter To f f comes from the Decentralized Congestion Control (DCC) mechanism.
    keywords: cpm; objects; rules
       cache: eceasst-1160.pdf
  plain text: eceasst-1160.txt

        item: #116 of 858
          id: eceasst-1162
      author: Sharma, Salil; Al-Khannaq, Ehab; Riebl, Raphael; Schakel, Wouter; Knoppers, Peter; Verbraeck, Alexander; van Lint, Hans
       title: Impact of radio channel characteristics on the longitudinal behaviour of truck platoons in critical car-following situations
        date: 2021-09-08
       words: 2351
      flesch: 49
     summary: Keywords: Truck platoons, cooperative adaptive cruise control, V2V, VANET, radio channel, Impact of radio channel characteristics on truck platoons NetSys 2021 3 / 8 1 Introduction Truck platooning is a promising technology that is expected to generate fuel savings, emission reduction, and safer operations. Impact of radio channel characteristics on the longitudinal behaviour of truck platoons in critical car-following situations Salil Sharma, Ehab Al-Khannaq, Raphael Riebl, Wouter Schakel, Peter Knoppers, Alexander Verbraeck and Hans van Lint 7 Pages ECEASST 2 / 8 Volume 080 (2021) Impact of radio channel characteristics on the longitudinal behaviour of truck platoons in critical car-following situations Salil Sharma1, Ehab Al-Khannaq2, Raphael Riebl3, Wouter Schakel4, Peter Knoppers5, Alexander Verbraeck6 and Hans van Lint7 1S.Sharma-4@tudelft.nl Delft University of Technology, Delft, The Netherlands 2ehabsoa@gmail.com Van Oord, Rotterdam, The Netherlands 3Raphael.Riebl@carissma.eu Technische Hochschule Ingolstadt, Germany 4w.j.schakel@tudelft.nl 5P.Knoppers@tudelft.nl 6a.verbraeck@tudelft.nl 7J.W.C.vanLint@tudelft.nl Delft University of Technology, Delft,
    keywords: channel; impact; ots; platoons; radio; speed; truck
       cache: eceasst-1162.pdf
  plain text: eceasst-1162.txt

        item: #117 of 858
          id: eceasst-1163
      author: Wettlaufer, Jens
       title: Property Inference-based Federated Learning Groups for Collaborative Network Anomaly Detection
        date: 2021-09-08
       words: 2508
      flesch: 51
     summary: In consequence, network anomaly detection is rarely used in practice, even though it is capable of detecting unknown attacks in contrast to sig- nature or policy-based approaches. The method is not restricted to, but evaluated on network anomaly detection in this work.
    keywords: anomaly; data; detection; groups; learning; network; property; training
       cache: eceasst-1163.pdf
  plain text: eceasst-1163.txt

        item: #118 of 858
          id: eceasst-1165
      author: Marin-Lopez, Andres; Arias-Cabarcos, Patricia; Strufe, Thorsten; Barceló-Soteras, Gabriel; Almenares-Mendoza, Florina; Díaz-Sánchez, Daniel
       title: Implementing DNSSEC soft delegation for microservices
        date: 2021-09-08
       words: 2418
      flesch: 57
     summary: Chameleon signatures are a lightweight solution compared to normal DNSSEC delegation. Implementing DNSSEC soft delegation for microservices Electronic Communications of the EASST Volume 080 (2021) Conference on Networked Systems 2021 (NetSys 2021) Implementing DNSSEC soft delegation for microservices Andrés Marı́n-López, Patricia Arias-Cabarcos, Thorsten Strufe, Gabriel Barceló-Soteras, Daniel Dı́az-Sánchez, Florina Almenares-Mendoza 5 pages Guest Editors: Andreas Blenk, Mathias Fischer, Stefan Fischer, Horst Hellbrueck, Oliver Hohlfeld, Andreas Kassler, Koojana Kuladinithi, Winfried Lamersdorf, Olaf Landsiedel, Andreas Timm-Giel, Alexey Vinel ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Implementing DNSSEC soft delegation for microservices Andrés Marı́n-López12∗, Patricia Arias-Cabarcos1, Thorsten Strufe1†, Gabriel Barceló-Soteras3, Daniel Dı́az-Sánchez2, Florina Almenares-Mendoza2 1 Karlsruhe Institute of Technology, Germany 2 Universidad Carlos III de Madrid, Spain 3 Parliament of the Balearic Islands, Spain Abstract: Securing DNS in Edge- and Fog computing, or other scenarios where microservices are offloaded, requires the provision of zone signing keys to the third parties who control the computing infrastructure.
    keywords: chameleon; delegation; dnscore; dnsfog; dnssec; key; microservices; records
       cache: eceasst-1165.pdf
  plain text: eceasst-1165.txt

        item: #119 of 858
          id: eceasst-1166
      author: Cooney, Martin; Järpe, Eric; Vinel, Alexey
       title: “Vehicular Steganography”?: Opportunities and Challenges
        date: 2021-09-08
       words: 1710
      flesch: 46
     summary: (1) Assuming a message comprises 1 to n short propositions mi, of varying importance vi (representing e.g. the nature of the emergency, location, or names) and time required to send ti, we propose that message generation can be formulated as an unbounded Knapsack problem max ∑ vi f (xi) s. t. T∗ = ∑tixi ≤ T, xi ≥ 0, and f (2) < 2 f (1) (1) where xi stipulates if a proposition i will be included, T is the max time available for transmission, and f is a function that rises swifty from zero then slows (e.g. f ∼ e−(1/x) for x 6= 0, f (0) = 0), which expresses the higher likelihood of a proposition being received if it is repeated.5 (2) Assuming a simplified locomotive scenario using sideways drifting to encode Morse sig- nals, T , the time available for sending messages can be computed by dividing d, the distance from an AV to its next interruption (e.g., an intersection) by the velocity v0 and multiplying by α , the intended rate of message to non-message in the signal, related to encoding density (e.g. 1 : 10). Here, we shine light on the concept of vehicular steganography (VS) using a speculative approach: We identify some key scenarios, highlighting unique challenges that arise from indirect perception, message generation, and effects of perspective–as well as potential carrier signals and message generation considerations.
    keywords: carriers; challenges; generation; message; motion; steganography
       cache: eceasst-1166.pdf
  plain text: eceasst-1166.txt

        item: #120 of 858
          id: eceasst-1167
      author: Alkhalili, Yassin; Weil, Jannis; tahir, anam; Meuser, Tobias; Koldehofe, Boris; Mauthe, Andreas; Koeppl, Heinz; Steinmetz, Ralf
       title: Towards QoE-Driven Optimization of Multi-Dimensional Content Streaming
        date: 2021-09-08
       words: 7473
      flesch: 56
     summary: In the scope of this paper, the overall QoE is composed of the QoE of individual users consuming different MD content types. The interface should allow to include and combine specific implementations for our components A to E and therefore provide the foundation to support different MD content types.
    keywords: adaptation; conditions; conference; content; learning; mechanisms; network; point; qoe; quality; streaming; streams; system; types; user; video
       cache: eceasst-1167.pdf
  plain text: eceasst-1167.txt

        item: #121 of 858
          id: eceasst-1168
      author: Shudrenko, Yevhenii; Plöger, Daniel; Kuladinithi, Koojana; Timm-Giel, Andreas
       title: A Novel Approach to Achieving End-to-End QoS for Avionic Applications
        date: 2021-09-08
       words: 2051
      flesch: 49
     summary: It enables the end-to-end QoS for wireless sensor networks under the IPv6 Over the TSCH Mode of IEEE 802.15.4 (6TiSCH). A Novel Approach to Achieving End-to-End QoS for Avionic Applications Electronic Communications of the EASST Volume 080 (2021) Conference on Networked Systems 2021 (NetSys 2021)
    keywords: 6tisch; clx; delay; end; layer; msf; qos
       cache: eceasst-1168.pdf
  plain text: eceasst-1168.txt

        item: #122 of 858
          id: eceasst-117
      author: Van Geet, Joris; Demeyer, Serge
       title: Lightweight Visualisations of COBOL Code for Supporting Migration to SOA
        date: 2008-02-10
       words: 4742
      flesch: 53
     summary: In this position paper we present such a lightweight technique for visualising functional depen- dencies and data dependencies between COBOL programs. Note that there are typically two usage modes of COBOL programs on mainframe, namely online and in batch.
    keywords: cobol; code; data; dependencies; dependency; nodes; programs; service; software; system; view
       cache: eceasst-117.pdf
  plain text: eceasst-117.txt

        item: #123 of 858
          id: eceasst-1172
      author: Thimmaraju, Kashyap; Scheuermann, Björn
       title: Count Me If You Can: Enumerating QUIC Servers Behind Load Balancers
        date: 2021-09-08
       words: 2189
      flesch: 57
     summary: [SBFF19] pointed out that QUIC servers can identify a user across multiple connections using two features of the protocol and in 2020, Reen et al. This allows an attacker to count the number of server instances behind a middlebox, e.g., a load balancer.
    keywords: cid; connection; instances; load; quic; server
       cache: eceasst-1172.pdf
  plain text: eceasst-1172.txt

        item: #124 of 858
          id: eceasst-1173
      author: Akbarian, Fatemeh; Tärneberg, William; Fitzgerald, Emma; Kihl, Maria
       title: Demonstration: A cloud-control system equipped with intrusion detection and mitigation
        date: 2021-09-08
       words: 1698
      flesch: 49
     summary: However, in cloud control systems (CCs), there is a network between the plant and the cloud that the measurement and control signals are sent through this network and this can make these systems vulnerable to cyber attacks. Keywords: Cloud control systems, Intrusion detection, Attack mitigation, Test-bed, Cyber security 1 Introduction By adoption of new technologies, we have had several revolutions in industry and now some modern technologies like IoT, cloud computing, etc are paving the way for smart factory that will realise industry 4.0.
    keywords: cloud; control; controller; mitigation; system
       cache: eceasst-1173.pdf
  plain text: eceasst-1173.txt

        item: #125 of 858
          id: eceasst-1174
      author: Frank, Matthias
       title: IDN-Laser-Tester: A Framework for Detecting and Testing ILDA Digital Network Consumers for Laser Projection
        date: 2021-09-08
       words: 1969
      flesch: 53
     summary: Traditionally, laser projectors are controlled with analogue input signals. The analogue ILDA Standard Projector (ISP, [ILD99], the connector is also called ISP-DB25) was the relevant specification on how to connect laser control interfaces with laser projectors in a vendor-independent way, which is in use for more than two decades (technical specification of 1999).
    keywords: digital; idn; ilda; laser; network; software; tester
       cache: eceasst-1174.pdf
  plain text: eceasst-1174.txt

        item: #126 of 858
          id: eceasst-1175
      author: Monschein, David; Waldhorst, Oliver
       title: Privacy-Preserving and Scalable Authentication based on Network Connection Traces
        date: 2021-09-08
       words: 2465
      flesch: 54
     summary: Because we need two classes of training samples (valid and invalid), we first built valid pairs of observation frames and history frames (i.e., data within both frames comes from the same user) and then artificially added invalid pairs by recombining the history frames with observation frames from other users. Thus, sophisticated security measures such as a comprehensive authentication of users are indispensable to prevent the misuse of digital identi- ties.
    keywords: authentication; connection; data; information; mobile; network; privacy; user
       cache: eceasst-1175.pdf
  plain text: eceasst-1175.txt

        item: #127 of 858
          id: eceasst-1177
      author: Krämer, Patrick; Blenk, Andreas
       title: Navigating Communication Networks with Deep Reinforcement Learning
        date: 2021-09-08
       words: 7324
      flesch: 64
     summary: Indeed, we find that RL can be used to learn strategies for different network states and differentiate path selection critera based on observed flow characteristics and network state information. The restricted space for rules can thus limit their expressiveness and thus the extend to which forwarding decision can be conditioned on network state.
    keywords: agent; communication; flow; forwarding; information; layer; learning; network; packet; path; reinforcement; routing; state; time; traffic
       cache: eceasst-1177.pdf
  plain text: eceasst-1177.txt

        item: #128 of 858
          id: eceasst-1178
      author: Elmisery, Ahmed M.; Sertovic, Mirela
       title: Modular Platform for Detecting and Classifying Phishing Websites Using Cyber Threat Intelligence
        date: 2021-09-08
       words: 2302
      flesch: 47
     summary: Characterization of suspicious websites relies on a set of pre-defined features and a multi-stage threat intelligence technique, the functionality of which has been ascertained in initial tests on real data sets. 2 Related Work Most of the literature deals with the problem of detecting suspicious websites using different methods and approaches.
    keywords: data; features; intelligence; phishing; platform; threat; websites
       cache: eceasst-1178.pdf
  plain text: eceasst-1178.txt

        item: #129 of 858
          id: eceasst-1179
      author: Dietz, Katharina; Mühlhauser, Michael; Seufert, Michael; Gray, Nicholas; Hoßfeld, Tobias; Herrmann, Dominik
       title: Browser Fingerprinting: How to Protect Machine Learning Models and Data with Differential Privacy?
        date: 2021-09-08
       words: 7549
      flesch: 57
     summary: Secondly, since this protection mechanism does not protect the raw data, we, therefore, evaluate the utility of dif- ferentially private synthetic data, i. e., we apply ML algorithms on private synthetic data. Jordon et al. combine GANs with the Private Aggregation of Teacher Ensem- bles (PATE) framework to generate private synthetic data [JYv19].
    keywords: accuracy; browser; browser fingerprinting; classifier; data; dataset; differential; features; fingerprinting; learning; machine; model; privacy; private; traffic
       cache: eceasst-1179.pdf
  plain text: eceasst-1179.txt

        item: #130 of 858
          id: eceasst-118
      author: Schmid, Klaus; Eichelberger, Holger
       title: A Requirements-Based Taxonomy of Software Product Line Evolution
        date: 2008-02-10
       words: 5078
      flesch: 46
     summary: While the various descriptions of product line evolution provided significant contributions, none so far provided a consistent categorization of product line change on all three levels: ranging from individual requirements over products to product lines. Situation Evolution Operator Traceability Information Requirements Level Add Requirement Add product-specific requirement --- Add new variability relation between product requirements and the infrastructure relation between this variability and other ones Add new resolution in existing variability constraints among variability resolutions; relation between product requirements and the infrastructure Add new commonality relation between product requirements and the infrastructure relation between new commonality and other requirements in the product line infrastructure Modify Requirement Modify content of product- specific requirement relation among product-specific requirements relation between modified requirement and product line infrastructure.
    keywords: change; evolution; level; line; product; product line; relation; requirements; software; variability
       cache: eceasst-118.pdf
  plain text: eceasst-118.txt

        item: #131 of 858
          id: eceasst-1180
      author: Zhou, Zikai George; Kellerer, Wolfgang
       title: Towards Deterministic Reconfigurable Networks
        date: 2021-09-08
       words: 2042
      flesch: 56
     summary: 3 Towards Consistent Network Updates in Programmable Networks with P4 When implementing network updates, operators commonly choose a trade-off between update speed and consistency. Dynamic scheduling of network updates.
    keywords: data; network; plane; state; time; update
       cache: eceasst-1180.pdf
  plain text: eceasst-1180.txt

        item: #132 of 858
          id: eceasst-1183
      author: Afzali, Sanaz; Udugama, Asanga; Förster, Anna; Fischer, Mathias
       title: On the Resilience of Opportunistic Networks against DoS Attacks
        date: 2021-09-08
       words: 1834
      flesch: 56
     summary: On the Resilience of Opportunistic Networks against DoS Attacks In a low-rate DoS attack, the attacker injects apparently valid packets into the network to deplete the network bandwidth and forwarding resources of other nodes for legitimate users. Simulation - The evaluation of the effects of DoS attacks on OppNets are performed using the OMNeT++ network simulator together with the OppNets framework OPS
    keywords: attacks; dos; nodes; oppnets
       cache: eceasst-1183.pdf
  plain text: eceasst-1183.txt

        item: #133 of 858
          id: eceasst-1185
      author: Häberle, Marco; Steinert, Benjamin; Menth, Michael
       title: Firewall-as-a-Service for Campus Networks Based on P4-SFC
        date: 2021-09-08
       words: 1691
      flesch: 54
     summary: For this reason, we propose a cloud-like infrastructure based on service function chaining (SFC) and network function virtualization (NFV) that allows users to deploy network functions like firewalls at a central place while hiding most technical details from the users. Network traffic is often steered through VNFs with the help of service function chaining (SFC).
    keywords: campus; function; network; service; sfc; vnf
       cache: eceasst-1185.pdf
  plain text: eceasst-1185.txt

        item: #134 of 858
          id: eceasst-1189
      author: Mayoral-Vilches, Victor; Glera-Picón, Alfonso; Ayúcar-Carbajo, Unai; Rass, Stefan; Pinzger, Martin; Maggi, Federico; Gil-Uriarte, Endika
       title: Hacking planned obsolescense in robotics, towards security-oriented robot teardown
        date: 2021-09-08
       words: 1722
      flesch: 40
     summary: Given these premises, we promote robot teardown as a systematic process to repair robots, improve robot hardware and research its security. We presented robot teardowns as an approach to study robot hardware architectures, obtain re- pairing capabilities, uncover planned obsolescence, and research its security.
    keywords: hardware; robot; robotics; security; series; teardown
       cache: eceasst-1189.pdf
  plain text: eceasst-1189.txt

        item: #135 of 858
          id: eceasst-119
      author: Ricca, Filippo; Torchiano, Marco; Di Penta, Massimiliano; Ceccato, Mariano; Tonella, Paolo
       title: The Use of Executable FIT Tables to support Maintenance and Evolution Tasks
        date: 2008-02-10
       words: 4440
      flesch: 61
     summary: Other than looking at requirements, developers continuously execute FIT test cases to (i) ensure that FIT tables related to the change requirements passed and (ii) use requirement FIT tables to regression test the existing pieces of functionality. The availability of FIT test cases does not significantly improve the correctness of the maintained source code.
    keywords: acceptance; evolution; experiment; fit; maintenance; requirements; subjects; tables; tasks; test
       cache: eceasst-119.pdf
  plain text: eceasst-119.txt

        item: #136 of 858
          id: eceasst-1190
      author: Fischer, Mathias; Lamersdorf, Winfried
       title: Preface and Table of Contents
        date: 2021-09-08
       words: 2244
      flesch: 39
     summary: Finally, we would like to thank all those who contributed to making NetSys 2021 a success, especially the Workshop Chairs Olaf Landsiedel, University of Kiel, Germany Andreas Kassler, Karlstad University, Sweden PhD Forum Chairs Andreas Blenk, TU München, Germany Oliver Hohlfeld, BTU Cottbus, Germany Demo Chairs Andreas Timm-Giel, TU Hamburg, Germany Koojana Kuladinithi, TU Hamburg, Germany Alexey Vinel, Halmstad University, Sweden Tutorial Chair Janick Edinger, Universität Hamburg, Germany Web Chair Regine Wendt, Universität zu Lübeck, Germany Program Committee Nils Aschenbruck, University of Osnabrück, Germany Christian Becker, University of Mannheim, Germany Torsten Braun, University of Bern, Switzerland Georg Carle, TU München, Germany Joachim Charzinski, Stuttgart Media University, Germany Hermann de Meer, University of Passau, Germany Falko Dressler, University of Paderborn, Germany Michael Engel, TU Trondheim, Norway Markus Fiedler, Blekinge Institute of Technology, Sweden Kurt Geihs, Universität Kassel, Germany Wieland Hohlfelder, Google Munich, Germany Yuming Jiang, Norwegian University of Science and Technology, Norway NetSys 2021 2 / 8 ECEASST Holger Karl, University of Paderborn, Germany Gunnar Karlsson, KTH Royal Institute of Technology, Sweden Mikkel Baun, Kjærgaard University of Southern Denmark, Odense Jorg Liebeherr, University of Toronto, Canada Martin Mauve, Heinrich Heine University Düsseldorf, Germany Michael Menth, Universität Tuebingen, Germany Max Mühlhäuser, TU Darmstadt Andreas Polze, Hasso Plattner Institute Potsdam, Germany Jacek Rak, Gdansk University of Technology, Poland Stefanie Roos, TU Delft, Netherlands Günter Schäfer, TU Ilmenau, Germany Björn Scheuermann, Humboldt Universität Berlin, Germany Thomas Schmidt, Hamburg University of Applied Sciences, Germany Corinna Schmitt, Universität der Bundeswehr, Research Institute CODE, Germany Stefan Schulte, TU Wien, Austria Stephan Sigg, Aalto University, Finland Olaf Spinczyk, Universität Osnabrück, Germany Ralf Steinmetz, TU Darmstadt, Germany Burkhard Stiller, University of Zürich, Switzerland Thorsten Strufe, Karlsruhe Institute of Technology, Germany Sasu Tarkoma, University of Helsinki, Finland Florian Tschorsch, TU Berlin, Germany Matthias Wählisch, Freie Universität Berlin, Germany Krzysztof Walkowiak, Wroclaw University of Science and Technology, Poland Klaus Wehrle, RWTH Aachen University, Germany Lars Wolf, TU Braunschweig, Germany Martina Zitterbart, Karlsruhe Institute of Technology, Germany Finally, we thank all reviewers and subreviewers in the Technical Program Committee, all speakers, workshop organizers, tutorial and PhD forum presenters, panelists, organization sup- port etc. who helped to make Netsys 2021 a success despite the digital format and all other obstacles which occurred during this specific year. Zero Trust Service Function Chaining Leonard Bradatsch, Frank Kargl and Oleksandr Miroshkin NetSys Demonstrations Demo Chairs: • Prof. Dr. Andreas Timm-Giel, Hamburg University of Technology, Germany • Dr. Koojana Kuladinithi, Hamburg University of Technology, Germany • Prof. Dr. Alexey Vinel, Halmstad University, Sweden Demo Papers: 1.
    keywords: andreas; chairs; conference; contents; germany; netsys; systems; table; technology; universität; university; workshop
       cache: eceasst-1190.pdf
  plain text: eceasst-1190.txt

        item: #137 of 858
          id: eceasst-1192
      author: Zafeirakopoulos, Dimitrios; Almpani, Sofia; Stefaneas, Petros
       title: Supporting Ethical Decisions in Wearable Technology with Deontic Logic: A Brief Introduction
        date: 2022-11-22
       words: 5065
      flesch: 51
     summary: A code of obligations for caretakers with a concrete foundation in mathematical formulas, such as deontic logic, can indeed be helpful in showing that patients using wearable devices deserve as much attention as the ones without. We use it as a means to introduce the use that deontic logic might have for matters of responsibility and choice, for artificial intelligence agents in wearable devices.
    keywords: check; data; device; divulge; logic; patient; technology
       cache: eceasst-1192.pdf
  plain text: eceasst-1192.txt

        item: #138 of 858
          id: eceasst-1193
      author: Guevara, Ivan Hugo
       title: Synthesis of smart manufacturing environments. Towards evolvable robotic navigation scenarios.
        date: 2022-11-22
       words: 4914
      flesch: 50
     summary: We introduce in this paper an improved version of our ”maze generator”, a naviga- tion scenario generator that uses a machine learning approach from the Evolution- ary Computing branch called Grammatical Evolution (GE) to automatically gener- ate different scenarios with different configurations. Synthesising evolvable smart manufacturing scenarios Electronic Communications of the EASST Volume 81 (2021) 9th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation - Doctoral Symposium, 2021 Synthesising evolvable smart manufacturing scenarios Ivan Guevara 14 pages Guest Editors:
    keywords: complexity; elements; experiment; fitness; generation; grammar; manufacturing; maze; process; scenarios
       cache: eceasst-1193.pdf
  plain text: eceasst-1193.txt

        item: #139 of 858
          id: eceasst-1194
      author: Ryan, Stephen
       title: The Qualitative background of why a DSL knowledge based platform is needed in the context of Sustainability
        date: 2022-11-22
       words: 5743
      flesch: 46
     summary: From strategy to business models and onto tactics. It is important to understand that two main areas of work are being examined which are expanding or creating new easy to follow frameworks for risk and sustainability and gaining an understanding of how a multi perspective approach and canvas based approach for implementing these new or altered frameworks is needed.
    keywords: approach; business; dsl; figure; knowledge; organisations; platform; research; risk; sustainability
       cache: eceasst-1194.pdf
  plain text: eceasst-1194.txt

        item: #140 of 858
          id: eceasst-1195
      author: Steffen, Barbara
       title: Asking Why: Towards Conscious Decision-making in times of VUCA
        date: 2022-11-22
       words: 10604
      flesch: 46
     summary: 5 Applying the Digital VALUE Canvas To illustrate the effects and benefits of the Digital VALUE Canvas it gets applied twice to the context of hospital digitalization as described in Section 3: From the technology-driven perspective which closely focuses on the KHZG requirements in order to avoid sanctions, and from the value-driven perspective which emphasizes on the needs of the hospital. Organizations achieve the best results, if the Digital VALUE Canvas gets filled out by an interdisciplinary team covering (at least) the three competences and perspectives relevant for digitalization projects.
    keywords: approach; asking; canvas; digitalization; figure; hospitals; khzg; organizations; project; section; solutions; strategy; success; technologies; technology; time; transformation; understanding; value
       cache: eceasst-1195.pdf
  plain text: eceasst-1195.txt

        item: #141 of 858
          id: eceasst-1198
      author: Chaudhary, Hafiz Ahmad Awais; Margaria, Tiziana
       title: DSL-based Interoperability and Integration in the Smart Manufacturing Digital Thread
        date: 2022-11-22
       words: 8713
      flesch: 48
     summary: Model driven development (MDD) with adequate models is an automated approach to the rapid design of flexible and cost effective applications by means of drag & drop visual inter- faces. Model driven development of distributed control applications.
    keywords: analytics; code; data; development; dime; domain; dsls; integration; manufacturing; margaria; model; modeling; platform; process; pyrus; specific; steffen; thread
       cache: eceasst-1198.pdf
  plain text: eceasst-1198.txt

        item: #142 of 858
          id: eceasst-12
      author: Varró, Gergely; Varró, Dániel; Schürr, Andy
       title: Incremental Graph Pattern Matching: Data Structures and Initial Experiments
        date: 2006-12-11
       words: 6920
      flesch: 62
     summary: In the current paper, we propose initial concepts (including a common representation for mod- els, metamodels and graph patterns in Section 2), data structures (Section 3) and experiments for incremental graph pattern matching. In the paper, we present the foundational data structures and initial experiments for an incremental graph pattern matching engine which keeps track of existing matchings in an incremental way to reduce the execution time of graph pattern matching.
    keywords: cation; edge; figure; graph; lhs; matching; model; noti; pattern; pattern matching; transformation; type
       cache: eceasst-12.pdf
  plain text: eceasst-12.txt

        item: #143 of 858
          id: eceasst-120
      author: Mubarak, Asma; Counsell, Steve; Hierons, Rob; Hassoun, Youssef
       title: Package Evolvability and its Relationship with Refactoring
        date: 2008-02-09
       words: 6077
      flesch: 59
     summary: Extracting refactoring trends from open- source software and a possible solution to the related refactoring conundrum. Software Evolution 2007 9 / 15 Versions 3, 5 and 6 can be seen as the main points when refactoring effort was applied to the Velocity system (these columns are bolded).
    keywords: changes; classes; methods; number; package; refactoring; software; system; versions
       cache: eceasst-120.pdf
  plain text: eceasst-120.txt

        item: #144 of 858
          id: eceasst-1200
      author: Doherty, Adam
       title: Automating the referral pathways for Multiple Myeloma through a Web Application and XMDD
        date: 2022-11-22
       words: 8937
      flesch: 48
     summary: 7.1.1 CommonExtension Service Library Currently, DIME comes with a common service library, a collection of Java native methods to aid in developing DIME applications. Specifically, we set the MyMM polling time to match the polling policy of the refresh of the ingestion database with new patient data.
    keywords: application; data; department; development; dime; fig; haematology; healthcare; model; myeloma; mymm; mymm application; patient; process; risk; risk stratification
       cache: eceasst-1200.pdf
  plain text: eceasst-1200.txt

        item: #145 of 858
          id: eceasst-1206
      author: Jörges, Sven; Lamprecht, Anna-Lena; Mjeda, Anila; Naujokat, Stefan
       title: Preface
        date: 2022-11-22
       words: 396
      flesch: 23
     summary: The organizers of the 2021 ISoLA Doctoral Symposium, Sven Jörges, Anna-Lena Lamprecht, Anila Mjeda, and Stefan Naujokat Volume Reviewers Samih Al-Areqi, Mazars Berlin, Germany Steve Boßelmann, TU Dortmund University, Germany Ivan Hugo Guevara, University of Limerick, Ireland Sven Jörges, FH Dortmund, Germany Rafflesia Khan, University of Limerick, Ireland Anna-Lena Lamprecht, University of Potsdam, Germany Anila Mjeda, Munster Technical University, Ireland Stefan Naujokat, TU Dortmund University, Germany Stephen Ryan, University of Limerick, Ireland Barbara Steffen, TU Dortmund University, Germany Dimitrios Zafeirakopoulos, National Technical University of Athens, Greece Microsoft Word - ISOLADS2021.doc Electronic Communications of the EASST Volume 081 (2022) Guest Editors: Sven Jörges, Anna-Lena Lamprecht, Anila Mjeda, Stefan Naujokat ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 9th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation - Doctoral Symposium, 2021 (ISoLA DS 2021) Preface Sven Jörges, Anna-Lena Lamprecht, Anila Mjeda, Stefan Naujokat 1 Page ECEASST 2 / 2 Volume 081 (2022)
    keywords: symposium; university
       cache: eceasst-1206.pdf
  plain text: eceasst-1206.txt

        item: #146 of 858
          id: eceasst-121
      author: Vasa, Rajesh; Schneider, Jean-Guy; Nierstrasz, Oscar; Woodward, Clinton
       title: On the Resilience of Classes to Change
        date: 2008-02-15
       words: 4811
      flesch: 62
     summary: On the Resilience of Classes to Change 0.0% 10.0% 20.0% 30.0% 40.0% 50.0% 60.0% 70.0% 80.0% 90.0% 100.0% 0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 Number of metrics modified % C la s s e s ( C u m u la ti v e ) Axis Azureus Castor Checkstyle Findbugs Groovy Hibernate Jung Spring Struts Webwork Wicket Figure 3: Number of measures that change for modified classes. What is the probability that a class is modified after it is created? • How is modification frequency distributed for classes that do change? 1 / 11 Volume 8 (2008) mailto:rvasa@swin.edu.au mailto:jschneider@swin.edu.au mailto:cwoodward@swin.edu.au mailto:oscar@iam.unibe.ch On the Resilience of Classes to Change • Does a class or component tend to change a lot or are most modifications minor adjust- ments?
    keywords: analysis; change; classes; measures; modification; number; release; software; systems; version; work
       cache: eceasst-121.pdf
  plain text: eceasst-121.txt

        item: #147 of 858
          id: eceasst-123
      author: Scholz, Ulrich; Rouvoy, Romain
       title: Divide and Conquer - Organizing Component-based Adaptation
        date: 2008-06-02
       words: 6468
      flesch: 52
     summary: Applications are divided into smaller units, called application parts, and D&C organizes the adaptation and distribution of collections of such parts, called packs, in a decentralized and flexible manner. With respect to complexity and autonomy, application parts are positioned between compo- nents and full applications.
    keywords: adaptation; application; d&c; decomposition; negotiation; nodes; packs; parts; resource; tree; utility
       cache: eceasst-123.pdf
  plain text: eceasst-123.txt

        item: #148 of 858
          id: eceasst-124
      author: Fraga, Luí­s; Hallsteinsen, Svein; Scholz, Ulrich
       title: InstantSocial – Implementing a Distributed Mobile Multi-user Application with Adaptation Middleware
        date: 2008-06-02
       words: 3083
      flesch: 43
     summary: The following scenario exemplifies how a user could experience the capabilities of such distributed mobile multi-user application. 5 Conclusions and future work In this paper we have introduced “InstantSocial” as an example of a value-added service provided by a distributed, multi-user, mobile application.
    keywords: adaptation; application; content; devices; mobile; service; user
       cache: eceasst-124.pdf
  plain text: eceasst-124.txt

        item: #149 of 858
          id: eceasst-125
      author: Sahli, Nabil
       title: Survey: Agent-based Middlewares for Context Awareness
        date: 2008-06-02
       words: 5956
      flesch: 56
     summary: (CA3) Stu21 proposes context aware agents which offer several features concerning context awareness: keeps a model of context, listens to context changes, uses RDF/XML to interact with other agents about context, tec. Here, agent systems are very well suited.
    keywords: agents; awareness; context; middlewares; mobile; security; services; systems; user
       cache: eceasst-125.pdf
  plain text: eceasst-125.txt

        item: #150 of 858
          id: eceasst-126
      author: Weiss, Diana; Helas, Stefan; Martens, Johannes
       title: Context-Aware Adaptation of Mobile Multimedia Presentations
        date: 2008-06-02
       words: 2845
      flesch: 44
     summary: On the one hand, servers have much more processing power and can achieve content adaptation much more efficiently. This language was designed for defining rules that specify content adaptation based on device parameters, user preferences and context information.
    keywords: adaptation; context; device; mobile; multimedia; parameters; user
       cache: eceasst-126.pdf
  plain text: eceasst-126.txt

        item: #151 of 858
          id: eceasst-127
      author: Fuchs, Simone; Rass, Stefan; Kyamakya, Kyandoghere
       title: Integration of Ontological Scene Representation and Logic-Based Reasoning for Context-Aware Driver Assistance Systems
        date: 2008-06-02
       words: 5243
      flesch: 48
     summary: DAS will become increasingly knowledge-based and methods will 1 / 12 Volume 11 (2008) mailto:simone.fuchs@uni-klu.ac.at mailto:stefan.rass@uni-klu.ac.at mailto:kyandoghere.kyamakya@uni-klu.ac.at Context-Aware Reasoning for Driver Assistance be needed for modeling, handling and exchanging the vast amount of context information. Ontologies with context information for DAS have been developed in the RENA project [WBSS].
    keywords: context; driver; driving; information; model; ontology; reasoning; scene; speed; systems; traffic; vehicle
       cache: eceasst-127.pdf
  plain text: eceasst-127.txt

        item: #152 of 858
          id: eceasst-128
      author: Autili, Marco; Di Benedetto, Paolo; Inverardi, Paola; Tamburri, Damien
       title: Towards Self-evolving Context-aware Services
        date: 2008-06-02
       words: 7228
      flesch: 55
     summary: Towards Self-evolving Context-aware Services to derive an XML-based representation of the models that are used to match service alternatives to resource consumption profiles and requested SLS. Acknowledgements: [MM07], it can be extended towards a compromise between self-contained and tailored service applications aiming at a more seamless self-evolution.
    keywords: alternative; applications; c t; context; model; resource; self; service; sls; t e
       cache: eceasst-128.pdf
  plain text: eceasst-128.txt

        item: #153 of 858
          id: eceasst-129
      author: Böhm, Sebastian; Koolwaaij, Johan; Luther, Marko
       title: Share Whatever You Like
        date: 2008-06-02
       words: 6474
      flesch: 43
     summary: CAMPUS 2008 3 / 13 to automatically record, store, and use context information, e.g. for personalization purposes, as input parameter to information services or simply to share this information with others. Social relationships allow for defining simple group access directives to restrict the distribution of context information.
    keywords: access; cmf; components; context; control; data; directives; information; mobile; services; user
       cache: eceasst-129.pdf
  plain text: eceasst-129.txt

        item: #154 of 858
          id: eceasst-13
      author: Ermel, Claudia; Ehrig, Hartmut; Ehrig, Karsten
       title: Semantical Correctness of Simulation-to-Animation Model and Rule Transformation
        date: 2006-12-11
       words: 6667
      flesch: 61
     summary: S2A transformation is defined by a set of S2A graph transformation rules, and an additional formal construction allowing to apply S2A rules to simulation rules, resulting in a new set of graph transformation rules, called animation rules. 1 / 14 Volume 4 (2006) mailto:lieske@cs.tu-berlin.de mailto:ehrig@cs.tu-berlin.de mailto:karsten@mcs.le.ac.uk Semantical Correctness of S2A Transformation Comparable theoretical research in the area of applying graph transformation rules to rules has been done by Parisi-Presicce [PP96].
    keywords: animation; graph; model; rule; s2a; s2am; simulation; transformation
       cache: eceasst-13.pdf
  plain text: eceasst-13.txt

        item: #155 of 858
          id: eceasst-130
      author: Parra, Carlos Andres; Duchien, Laurence
       title: Model-Driven Adaptation of Ubiquitous Applications
        date: 2008-06-02
       words: 2360
      flesch: 47
     summary: We start from a model of context, which is used for two main purposes: to exchange context information between devices, and to allow the generation of components that will enrich client applications. In this proposal paper we discuss several challenges for context-aware software development and present our proposal to achieve software adaptation based on context information.
    keywords: adaptation; client; context; information; model; software
       cache: eceasst-130.pdf
  plain text: eceasst-130.txt

        item: #156 of 858
          id: eceasst-131
      author: Vanrompay, Yves; Rigole, Peter; Berbers, Yolande
       title: Learning-based Coordination of Distributed Component Deployment
        date: 2008-06-02
       words: 2518
      flesch: 44
     summary: The planning algorithm for distributed component deployment (DiComPloy) is based on Collabo- rative Reinforcement Learning (CRL) In the following, we describe a scenario showing how mobile, context-aware adaptive applica- tions may need distributed component deployment and migration.
    keywords: applications; component; cost; deployment; learning; mobile; resource
       cache: eceasst-131.pdf
  plain text: eceasst-131.txt

        item: #157 of 858
          id: eceasst-132
      author: Liu, Yu; Meier, René
       title: Feature Interaction in Pervasive Computing Systems
        date: 2008-06-02
       words: 2828
      flesch: 39
     summary: Guest Editors: Romain Rouvoy, Mauro Caporuscio, Michael Wagner Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 Proceedings of the First International DisCoTec Workshop on Context-aware Adaptation Mechanisms for Pervasive and Ubiquitous Services (CAMPUS 2008) Feature Interaction in Pervasive Computing Systems Yu Liu and René Meier 6 Pages ECEASST 2 / 7 Volume 11 (2008) Feature Interaction in Pervasive Computing Systems Yu Liu and René Meier Lero @ TCD, Department of Computer Science, Trinity College Dublin, Ireland {yuliu, rene.meier}@cs.tcd.ie Abstract: Feature interaction describes a situation where the combination of two or more services that individually perform correctly results in unexpected and possibly adverse behaviour. The classification aims to aid the understanding of feature interaction in pervasive computing systems, and to serve as a guideline for designers of pervasive applications.
    keywords: applications; computing; environment; feature; interaction; systems
       cache: eceasst-132.pdf
  plain text: eceasst-132.txt

        item: #158 of 858
          id: eceasst-133
      author: Mostinckx, Stijn; Lombide Carreton, Andoni; De Meuter, Wolfgang
       title: Reactive Context-Aware Programming
        date: 2008-06-02
       words: 6135
      flesch: 50
     summary: In this paper, we propose using reactive programming techniques to deal with context change events. Modelling the results of such context queries is achieved through the introduction of reactive context-aware collections.
    keywords: ambienttalk; application; context; event; fact; language; middleware; model; object; programming; space
       cache: eceasst-133.pdf
  plain text: eceasst-133.txt

        item: #159 of 858
          id: eceasst-134
      author: Rouvoy, Romain; Vitenberg, Roman; Eliassen, Frank
       title: Enhancing Planning-Based Adaptation Middleware with Support for Dependability: a Case Study
        date: 2008-06-02
       words: 5569
      flesch: 37
     summary: In particular, we proposed a component-based architecture for discovering, negotiating, and planning application configurations supporting SOA. By reflecting dependability as a new QoS dimension, the developer can model application configuration that are resilient to faults.
    keywords: adaptation; application; component; configuration; dependability; device; mechanisms; middleware; model; planning; properties; qos; support
       cache: eceasst-134.pdf
  plain text: eceasst-134.txt

        item: #160 of 858
          id: eceasst-135
      author: Rouvoy, Romain; Caporuscio, Mauro; Wagner, Michael
       title: Preface
        date: 2008-06-02
       words: 883
      flesch: 12
     summary: CAMPUS 2008 3 / 4 Organization Steering Committee Frank Eliassen University of Oslo, Norway Kurt Geihs University of Kassel, Germany Svein Hallsteinsen SINTEF ICT, Norway Geir Horn SINTEF ICT, Norway Valérie Issarny INRIA, France Organizing Committee Program chair: Romain Rouvoy University of Oslo, Norway Publicity chair: Mauro Caporuscio INRIA, France Publication chair: Michael Wagner University of Kassel, Germany Program Committee Luciano Baresi Politecnico di Milano, Italy Gordon Blair Lancaster University, UK Mauro Caporuscio INRIA, France Licia Capra University College of London, UK Denis Conan Intitut TELECOM, SudParis, France Vittorio Cortellessa UDA, Italy Geoff Coulson Lancaster University, UK Schahram Dustdar Vienna University of Technology, Austria Frank Eliassen University of Oslo, Norway Kurt Geihs University of Kassel, Germany Svein Hallsteinsen SINTEF ICT, Norway Manuele Kirsch Pinheiro K.U.Leuven, Belgium Joseph Loyall BBN Technologies, Massachusetts Per Håkon Meland SINTEF ICT, Norway Hassine Moungla INRIA, France Nearchos Paspallis University of Cyprus, Cyprus Roland Reichle University of Kassel, Germany Romain Rouvoy University of Oslo, Norway Ulrich Scholz European Media Laboratory GmbH, Germany Lionel Seinturier University of Lille 1, France Roberto Speicys-Cardoso INRIA, France Giovanni Toffetti Carughi USI, Switzerland Massimo Tivoli UDA, Italy Nalini Venkatasubramanian University of California, Irvine Michael Wagner University of Kassel, Germany Referees Vidhya Balasubramanian University of California, Irvine Mikaël Beauvois University of Oslo, Norway Paul Grace Lancaster University, UK Danny Hughes Lancaster University, UK Daniel Massaguer University of California, Irvine ECEASST 4 / 4 Volume 11 (2008) Contents Integration of Ontological Scene Representation and Logic-Based Reasoning for Context-Aware Driver Assistance Systems Simone Fuchs, Stefan Rass and Kyandoghere Kyamakya Towards Self-evolving Context-aware Services Marco Autili, Paolo Di Benedetto, Paola Inverardi and Damien Andrew Tamburri Survey: Agent-based Middlewares for Context Awareness Nabil Sahli Reactive Context-Aware Programming Stijn Mostinckx, Andoni Carreton Lombide and Wolfgang De Meuter Share Thus, the CAMPUS workshop will focus on the promising approaches in the domain of context aware adaptation mechanisms supporting the dynamic evolution of the execution context (e.g., network/device/service failures).
    keywords: adaptation; context; norway; romain; rouvoy; university
       cache: eceasst-135.pdf
  plain text: eceasst-135.txt

        item: #161 of 858
          id: eceasst-136
      author: Ermel, Claudia; de Lara, Juan; Heckel, Reiko
       title: Preface of Proceedings 7th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2008)
        date: 2008-06-20
       words: 656
      flesch: 27
     summary: Preface Claudia Ermel, Reiko Heckel, Juan de Lara 2 pages Guest Editors: Claudia Ermel, Reiko Heckel, Juan de Lara Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Preface GT-VMT 2008 is the seventh workshop of a series that serves as a forum for all researchers and practitioners interested in the use of graph transformation-based notations, techniques and tools for the specification, modelling, validation, manipulation and verification of complex sys- tems. Claudia Ermel, Reiko Heckel, Juan de Lara. PC chairs of GT-VMT 2008.
    keywords: germany; universität; university; workshop
       cache: eceasst-136.pdf
  plain text: eceasst-136.txt

        item: #162 of 858
          id: eceasst-138
      author: Koehler, Christian; Costa, David; Proenca, Jose; Arbab, Farhad
       title: Reconfiguration of Reo Connectors Triggered by Dataflow
        date: 2008-07-14
       words: 5972
      flesch: 57
     summary: In Figure 1 we present two examples of Reo connectors that illustrate how non-trivial dataflow behaviour emerges from composing channels using Reo nodes. To use graph transformation for connector reconfiguration we make the following assump- tions.
    keywords: channel; colouring; connector; dataflow; figure; nodes; reconfiguration; reo; rule; transformation
       cache: eceasst-138.pdf
  plain text: eceasst-138.txt

        item: #163 of 858
          id: eceasst-139
      author: Lambers, Leen; Ehrig, Hartmut; Taentzer, Gabriele
       title: Sufficient Criteria for Applicability and Non-Applicability of Rule Sequences
        date: 2008-07-13
       words: 6032
      flesch: 61
     summary: More- over if a certain criterion is not satisfied, then this is an indication for reasons why rule sequences may or may not be applicable. [LEMP07, MMT06] for consistency, a considerable amount of rule sequences is to be checked for applicability (resp.
    keywords: applicability; criteria; graph; independent; parallel; rule; sequence; sequential
       cache: eceasst-139.pdf
  plain text: eceasst-139.txt

        item: #164 of 858
          id: eceasst-14
      author: Silva, Viviane Torres da; de Maria, Beatriz; de Lucena, Carlos J. P.
       title: A MDE-Based Approach for Developing Multi-Agent Systems
        date: 2007-02-20
       words: 5048
      flesch: 48
     summary: All application entities, properties and relationships modeled on the three MAS-ML structural diagrams are represented in the target UML class model. The MAS-ML design models (the source models) will be transformed into UML implementation models (the target models) by instantiating the ASF framework according to the application characteristics.
    keywords: abstract; agent; asf; design; mas; models; rules; transformation; uml
       cache: eceasst-14.pdf
  plain text: eceasst-14.txt

        item: #165 of 858
          id: eceasst-140
      author: Rein, Alexander; Prange, Ulrike; Lambers, Leen; Hoffmann, Kathrin; Padberg, Julia
       title: Negative Application Conditions for Reconfigurable Place/Transition Systems
        date: 2008-07-14
       words: 6625
      flesch: 61
     summary: AHO nets have dynamical tokens like Petri systems as well as transformation rules. This property is needed mainly for the embedding and extension of transformation pairs.
    keywords: fairweather; morphism; nacs; nets; reconfigurable; rule; runway; systems; transformation
       cache: eceasst-140.pdf
  plain text: eceasst-140.txt

        item: #166 of 858
          id: eceasst-142
      author: Grohmann, Davide; Miculan, Marino
       title: Controlling resource access in Directed Bigraphs
        date: 2008-07-13
       words: 9610
      flesch: 73
     summary: Definition 4 The precategory ′DBIG of directed bigraph with signature K has interfaces I = 〈m, X〉 as objects and directed bigraphs G = 〈GP, GL〉 : I → J as morphisms. This notion of composition between bigraphs yields a categorical structure. 1 / 21 Volume 10 (2008) mailto:grohmann@dimi.uniud.it mailto:miculan@dimi.uniud.it Controlling resource access in Directed Bigraphs directed bigraph G : 〈3, ({r},{w, u})〉→〈2, ({x, z},{y})〉 0 v0 v1 v2 0 1 x y e0 w 1 v3 v4 2 e1 z ur place graph GP : 3 → 2 0 v0 v2 v1 1 0 1 v3 v4 2 directed link graph GL : ({r},{w, u}) → ({x, z},{y}) v0 v1 v2 x y e0 w v3 v4 e1 z ur Figure 1: An example of directed bigraph, with negative ports.
    keywords: bigraphs; definition; e e; figure; link; names; nodes; place; ports; systems; transition
       cache: eceasst-142.pdf
  plain text: eceasst-142.txt

        item: #167 of 858
          id: eceasst-143
      author: Mazanek, Steffen; Minas, Mark
       title: Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators
        date: 2008-07-14
       words: 5828
      flesch: 62
     summary: Inspired by this approach, we have proposed graph parser combinators in a recent paper, a framework for the rapid development of special-purpose graph parsers. Therefore, in a recent paper [MM08] we have proposed graph parser combinators, a new approach to graph parsing that allows the rapid construction of special-purpose graph parsers.
    keywords: combinators; context; grammars; graph; hyperedge; instance; language; node; parser; parsing; purpose; string
       cache: eceasst-143.pdf
  plain text: eceasst-143.txt

        item: #168 of 858
          id: eceasst-144
      author: Gruner, Stefan
       title: Graph Transformation Model of a Triangulated Network of Mobile Units
        date: 2008-07-14
       words: 6097
      flesch: 52
     summary: In such a case the isolated node would assume a NEW state, like the one which is depicted in Figure 7. Graph Transformation Model of a Triangulated Network of Mobile Units 9 / 15 Volume 10 (2008) Figure 10: Graph rule describing the detection and deletion of a conflicting network link. Moreover, graph transformation systems do not play a dominant role as background formalism to the implemenation of the Network Simulator tool.
    keywords: communication; figure; graph; graph transformation; mobile; model; network; nodes; rule; transformation; units
       cache: eceasst-144.pdf
  plain text: eceasst-144.txt

        item: #169 of 858
          id: eceasst-145
      author: Bucchiarone, Antonio; Galeotti, Juan P.
       title: Dynamic Software Architectures Verification using DynAlloy
        date: 2008-06-25
       words: 5915
      flesch: 59
     summary: Give a graph G and a production p, a rewriting of G using p is realised using a single-pushout graph transformation approach [EHK+97]. Give a graph G and a production p, a rewriting of G using p is realised using a single-pushout graph transformation [EHK+97].
    keywords: alloy; architecture; configuration; dsa; dynalloy; grammars; graph; model; node; set; software; use; verification
       cache: eceasst-145.pdf
  plain text: eceasst-145.txt

        item: #170 of 858
          id: eceasst-146
      author: Grabska, Ewa; Ślusarczyk, Grażyna Maria; Le, Truong Lan
       title: Visual Design and Reasoning with the Use of Hypergraph Transformations
        date: 2008-07-14
       words: 5619
      flesch: 53
     summary: To reflect these changes in our internal representation of a visual language we equip the proposed system with operations acting on hierarchical layout hypergraphs. The system allows the designer to edit diagrams and automatically applies operations on hierarchical layout hypergraphs being internal representations of diagrams.
    keywords: area; design; designer; diagram; figure; hyperedge; hypergraph; layout; nodes; operation
       cache: eceasst-146.pdf
  plain text: eceasst-146.txt

        item: #171 of 858
          id: eceasst-147
      author: Maier, Sonja; Minas, Mark
       title: A Static Layout Algorithm for DiaMeta
        date: 2008-07-13
       words: 5767
      flesch: 57
     summary: The layouter control then inserts this graph transformation or dynamic layout algorithm, and initiates the process shown in Figure 5. Graph transformations operate on the internal graph model and change this model. We also need to distinguish the two terms static layout and dynamic layout.
    keywords: algorithm; diagram; diameta; editor; figure; graph; layout; layout algorithm; model; states
       cache: eceasst-147.pdf
  plain text: eceasst-147.txt

        item: #172 of 858
          id: eceasst-148
      author: Azab, Karl; Pennemann, Karl-Heinz
       title: Type Checking C++ Template Instantiation by Graph Programs
        date: 2008-07-14
       words: 6693
      flesch: 71
     summary: We now define graph programs as introduced in [HP01]. Definition 3 (Graph programs) Keywords: Graph programs, Type checking, C++ 1 Introduction Templates are a feature of the C++ programming language for generic programming, i.e. pro- grammed code generation.
    keywords: code; graph; type; t|d
       cache: eceasst-148.pdf
  plain text: eceasst-148.txt

        item: #173 of 858
          id: eceasst-149
      author: Xing, Cong-Cong
       title: A Graph-Based Type Representation for Objects
        date: 2008-07-14
       words: 8057
      flesch: 73
     summary: Specifically, we (1) identity the problems that have motivated this paper; (2) propose an extension to Abadi-Cardelli’s ς -calculus towards fixing the problems; (3) present definitions of object type graphs followed by examples; (4) define subtyping and inheritance using object type graphs; (5) show how the problems can be easily resolved under object type graphs; and (6) summarize the contributions of this paper. To effectively analyze and reason about the structure of the new object types, we present a graph-based representation for object types – object type graphs (OTG).
    keywords: graph; inheritance; int; node; object; object type; self; subtyping; type; type graph
       cache: eceasst-149.pdf
  plain text: eceasst-149.txt

        item: #174 of 858
          id: eceasst-15
      author: Bottoni, Paolo; Hoffmann, Kathrin; Parisi Presicce, Francesco
       title: Termination of Algebraic Rewriting with Inhibitors
        date: 2006-12-11
       words: 6113
      flesch: 61
     summary: Rule p is said to terminate if ∀G ∈ G , p terminates on G. A function F : G → N from objects to natural numbers is a termination criterion for (CAT, M ) if for any two morphisms a : C → A and b : C → B in M , the value F(A +C B) of the pushout object A +C B of a and b is given by F(A +C B) = F(A) + F(B)−F(C). Inhibitors prevent elements in an algebra to participate in rule matches, so that termination depends only on whether new possi- bilities for matches are created.
    keywords: criterion; inhibitors; rewriting; rule; systems; termination
       cache: eceasst-15.pdf
  plain text: eceasst-15.txt

        item: #175 of 858
          id: eceasst-150
      author: Manning, Greg; Plump, Detlef
       title: The GP Programming System
        date: 2008-07-14
       words: 5117
      flesch: 65
     summary: Nondeterministic choice between a set of graph rules is handled by trying them in textual order until one succeeds. The GP compiler decomposes graph rules into a static searchplan of node lookups, edge lookups (find an edge whose source and target have not been found yet) and ex- tensions (find an edge whose source or target has been found).
    keywords: edges; failure; figure; generation; graph; node; program; rule
       cache: eceasst-150.pdf
  plain text: eceasst-150.txt

        item: #176 of 858
          id: eceasst-151
      author: Kumar, Rahul; Mercer, Eric G
       title: Improving Live Sequence Chart to Automata Transformation for Verification
        date: 2008-06-20
       words: 7332
      flesch: 62
     summary: The safety transitions enable the detection of safety violations which consist of duplicate messages (messages that have been observed before) and out of order messages in states that correspond to main chart states. We first show that for any main chart state in the automaton at least one transition is enabled for any arbitrary input (i.e. the transition relation for main chart states is total).
    keywords: algorithm; approach; automaton; chart; example; fig; lsc; message; state; system; transformation; transition; verification
       cache: eceasst-151.pdf
  plain text: eceasst-151.txt

        item: #177 of 858
          id: eceasst-152
      author: Brieler, Florian; Minas, Mark
       title: Ambiguity Resolution for Sketched Diagrams by Syntax Analysis Based on Graph Grammars
        date: 2008-07-13
       words: 6781
      flesch: 61
     summary: For a terminal t, where t is in the occurrence of the RHS of some reduction rule r, we denote by model(t) the corresponding occurrence of the LHS of r, and by nacs(t) a set of all matches for NACs that would have prohibited the creation of t. In the following, we omit all relation edges in nacs(t) and keep only the component edges, as relation edges completely depend on component edges. GT-VMT 2008 8 / 14 ECEASST Based on the ratings for component edges and relation edges, a rating can be computed for a terminal t by adding up all ratings from all edges in model(t).
    keywords: ambiguity; components; dag; diagram; edges; fig; petri; place; productions; resolution; set
       cache: eceasst-152.pdf
  plain text: eceasst-152.txt

        item: #178 of 858
          id: eceasst-153
      author: Rensink, Arend; Kleppe, Anneke
       title: On a Graph-Based Semantics for UML Class and Object Diagrams
        date: 2008-07-13
       words: 7175
      flesch: 66
     summary: Instead, UML knows several ways to define specialisation-like relationships between edges, which we here formalise through edge type constraints. On a Graph-Based Semantics for UML Class and Object Diagrams Electronic Communications of the EASST Volume 10 (2008) Proceedings of the Seventh International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2008) On a Graph-Based Semantics for UML Class and Object Diagrams Anneke Kleppe, Arend Rensink 16 pages Guest Editors: Claudia Ermel, Reiko Heckel, Juan de Lara Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST On a Graph-Based Semantics for UML Class and Object Diagrams Anneke Kleppe, Arend Rensink a.kleppe@utwente.nl, a.rensink@utwente.nl Department of Computer Science University of Twente, Enschede, The Netherlands Abstract: In this paper we propose a formal extension of type graphs with notions that are commonplace in the UML and have long proven their worth in that context: namely, inheritance, multiplicity, containment and the like.
    keywords: class; constraint; diagrams; edge; graph; instance; node; semantics; type; type graph; uml
       cache: eceasst-153.pdf
  plain text: eceasst-153.txt

        item: #179 of 858
          id: eceasst-154
      author: Ehrig, Hartmut; Ehrig, Karsten; Hermann, Frank
       title: From Model Transformation to Model Integration based on the Algebraic Approach to Triple Graph Grammars
        date: 2008-06-20
       words: 7047
      flesch: 62
     summary: In our main result we charac- terize existence and construction of model integration sequences sequences from (GS, GT ) to G by model transformation sequences from GS to GT . Once model transformation triple rules are defined for translations between the involved languages, integration rules can be derived automatically for maintaining consistency in the overall integrated modelling process.
    keywords: graph; integration; model; rules; sequence; source; target; transformation; � �
       cache: eceasst-154.pdf
  plain text: eceasst-154.txt

        item: #180 of 858
          id: eceasst-155
      author: Baresi, Luciano; Ghezzi, Carlo; Mocci, Andrea; Monga, Mattia
       title: Using Graph Transformation Systems to Specify and Verify Data Abstractions
        date: 2008-07-14
       words: 5757
      flesch: 58
     summary: With this approach, non-canonical method rules can 9 / 14 Volume 10 (2008) Using Graph Transformation Systems to Specify and Verify Data Abstractions be applied iff the related states have been already generated by canonical form rules. We can limit the application of canonical rules, and thus the size of the model, by adding this constraint as a constraint to the attributes of canonical form rules.
    keywords: behavior; data; example; form; graph; model; specification; stack; state; transformation
       cache: eceasst-155.pdf
  plain text: eceasst-155.txt

        item: #181 of 858
          id: eceasst-156
      author: Hassan, Abubakar; Mackie, Ian; Sato, Shinya
       title: Interaction nets: programming language design and implementation
        date: 2008-07-13
       words: 6535
      flesch: 70
     summary: Interaction nets: programming language design and implementation Electronic Communications of the EASST Volume 10 (2008) Proceedings of the Seventh International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2008) Interaction nets: programming language design and implementation Abubakar Hassan, Ian Mackie and Shinya Sato 16 pages Guest Editors: Claudia Ermel, Reiko Heckel, Juan de Lara Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Interaction nets: programming language design and implementation Abubakar Hassan, Ian Mackie and Shinya Sato 1 Department of Informatics, University of Sussex, Falmer, Brighton BN1 9QJ, UK 2 LIX, CNRS UMR 7161, École Polytechnique, 91128 Palaiseau Cedex, France 3 Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Abstract: This paper presents a compiler for interaction nets, which, just like term rewriting systems, are user-definable rewrite systems which offer the ability to spec- ify and program.
    keywords: agent; interaction; language; nets; programming
       cache: eceasst-156.pdf
  plain text: eceasst-156.txt

        item: #182 of 858
          id: eceasst-157
      author: Narayanan, Anantha; Karsai, Gabor
       title: Verifying Model Transformations by Structural Correspondence
        date: 2008-06-20
       words: 5473
      flesch: 51
     summary: Verifying Model Transformations by Structural Correspondence Anantha Narayanan and Gabor Karsai 14 pages Guest Editors: Claudia Ermel, Reiko Heckel, Juan de Lara Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Verifying Model Transformations by Structural Correspondence Anantha Narayanan1 and Gabor Karsai1 1Institute for Software Integrated Systems, Vanderbilt University Nashville, TN 37203 USA Abstract: Model transformations play a significant role in model based software development, and the correctness of the transformation is crucial to the success of the development effort. Keywords: Verification, Model transformations 1 Introduction Model transformations that translate a source model into an output model are often expressed in the form of rewriting rules, and can be classified according to a number of categories
    keywords: activity; correspondence; csp; model; node; process; rules; source; target; transformation
       cache: eceasst-157.pdf
  plain text: eceasst-157.txt

        item: #183 of 858
          id: eceasst-158
      author: Braatz, Benjamin; Brandt, Christoph
       title: Graph Transformations for the Resource Description Framework
        date: 2008-07-13
       words: 7299
      flesch: 55
     summary: Proposition 2 (Category RDFInst) RDF graphs and RDF graph instantiations constitute a category, denoted by RDFInst, with RDFHom ⊆ RDFInst. Moreover, conditions for the reversiblity of RDF graph transformations are shortly discussed.
    keywords: approach; blank; category; graph; mpoc; nodes; pushout; rdf; rdf graph; rule; set; transformation; triple
       cache: eceasst-158.pdf
  plain text: eceasst-158.txt

        item: #184 of 858
          id: eceasst-159
      author: Weinell, Erhard
       title: Extending Graph Query Languages by Reduction
        date: 2008-07-15
       words: 7098
      flesch: 67
     summary: Graph transformation languages like PRO- GRES provide similar functionality like the DRAGOS QTL. The present paper introduces this extension mechanism by means of a simple example, namely the detailed modeling of type checking in graph languages.
    keywords: b l; c t; e c; e n; graph; l e; l l; n t; s e; s s
       cache: eceasst-159.pdf
  plain text: eceasst-159.txt

        item: #185 of 858
          id: eceasst-160
      author: Biermann, Enrico; Modica, Tony
       title: Independence Analysis of Firing and Rule-based Net Transformations in Reconfigurable Object Nets
        date: 2008-07-14
       words: 5364
      flesch: 54
     summary: Firing of high-level transitions may involve firing of object net transitions, transporting object net tokens through the high-level net, and applying net transformation rules to object nets. As object nets in RONs can evolve in two different ways (by firing object net transitions and by applying net transformation rules), the notions of conflict and concurrency become quite complex.
    keywords: analysis; firing; net; nets; object; ron; rule; transformation; transition
       cache: eceasst-160.pdf
  plain text: eceasst-160.txt

        item: #186 of 858
          id: eceasst-161
      author: Bottoni, Paolo; Mirenkov, Nikolay; Watanobe, Yutaka; Yoshioka, Rentaro
       title: Composing control flow and formula rules for computing on grids
        date: 2008-07-13
       words: 4906
      flesch: 61
     summary: Section 4 introduces the categories on grids needed to define control flow rules in Section 5. Keywords: Grids, Control flow rules, DPO 1 Introduction Graphs have been long proposed as a universal formalism for describing the structure of sys- tem configurations and to support computational specifications of the transformations they may undergo.
    keywords: control; data; figure; flashing; flow; graph; grids; nodes; relations; rules; type
       cache: eceasst-161.pdf
  plain text: eceasst-161.txt

        item: #187 of 858
          id: eceasst-162
      author: Vangheluwe, Hans
       title: Foundations of Modelling and Simulation of Complex Systems
        date: 2008-07-13
       words: 4392
      flesch: 50
     summary: The vertical dashed line demarcates con- tinous model formalisms (on the left) from discrete model formalisms (on the right). 5 / 12 Volume 10 (2008) Foundations of Modelling and Simulation Figure 4: Time base for hybrid system models • T = R. Models with this time base are called continuous-time models.
    keywords: behaviour; components; event; formalism; level; model; modelling; simulation; state; system; time
       cache: eceasst-162.pdf
  plain text: eceasst-162.txt

        item: #188 of 858
          id: eceasst-164
      author: Fish, Andrew; Störrle, Harald
       title: Preface of the Proceedings of the Second International Workshop on Layout of (Software) Engineering Diagrams (LED 2008)
        date: 2008-09-11
       words: 661
      flesch: 32
     summary: Andrew Fish and Harald Störrle September 2008 I / II Volume 13 (2008) Program Chairs Andrew Fish, University of Brighton Harald Störrle, Software and Methodology consultant Programme Committee Phil Cox, Dalhousie University Holger Eichelberger, University of Hildesheim Wolfgang Glock, mgm technology partners GmbH Ulrike Gröttrup, Bayerische Landesbank Corin Gurr, University of Reading Florian Hacklinger, Zühlke Engineering John Hosking, University of Auckland Chris Hundhausen, Washington State University Alexander Knapp, University of Munich Eileen Kraemer, University of Georgia Kim Marriott, Monash University Mark Minas, Universität der Bundeswehr München Nikolaus Müssigmann, FH des Saarlandes Barbara Paech, University of Heidelberg Helen Purchase, University of Glasgow Peter Rodgers, University of Kent Gabriele Taentzer, Philipps-Universität Marburg Thomas Tensi, sd&m Proc. The six papers presented here were each reviewed by three programme committee members, with at least one review being from a software professional, and provide an insight into some of the interesting areas of software engineering diagram layout currently being investigated.
    keywords: diagrams; engineering; layout; university
       cache: eceasst-164.pdf
  plain text: eceasst-164.txt

        item: #189 of 858
          id: eceasst-165
      author: McIntosh, Paul; von Pilgrim, Jens
       title: 3D UML Heuristic Challenge
        date: 2008-09-12
       words: 3949
      flesch: 57
     summary: The 3D UML Heuristic Challenge presents a workshop session that challenges the traditional methods for layout of UML diagrams and tests 10 information visualization heuristics as a means of evaluating the quality of 3D UML diagrams. Keywords: Heuristic Evaluation, 3D Software Visualization, UML, Usability, 3D UML 1 Introduction The goal of the 3D UML Heuristic Challenge is to workshop 10 well known heuristics using UML diagrams and 3D layout techniques.
    keywords: diagram; heuristic; layout; model; uml; user
       cache: eceasst-165.pdf
  plain text: eceasst-165.txt

        item: #190 of 858
          id: eceasst-166
      author: Mazanek, Steffen; Maier, Sonja; Minas, Mark
       title: Exploiting the Layout Engine to Assess Diagram Completions
        date: 2008-09-11
       words: 6165
      flesch: 61
     summary: Keywords: layout, diagram completion, assessment 1 Introduction With the advent of more and more visual domain-specific modeling languages, user assistance for diagram editors becomes increasingly important. So it is surely necessary to restrict the number of new diagram components to be introduced.
    keywords: approach; completions; components; diagram; fig; graph; layout; model; stmt; user
       cache: eceasst-166.pdf
  plain text: eceasst-166.txt

        item: #191 of 858
          id: eceasst-167
      author: Stapleton, Gem; Howse, John; Rodgers, Peter; Zhang, Leishi
       title: Generating Euler Diagrams from Existing Layouts
        date: 2008-09-11
       words: 7242
      flesch: 68
     summary: Generating Euler Diagrams from Existing Layouts Electronic Communications of the EASST Volume 13 (2008) Proceedings of the Second International Workshop on Layout of (Software) Engineering Diagrams (LED 2008) Generating Euler Diagrams from Existing Layouts Gem Stapleton, John Howse Peter Rodgers and Leishi Zhang 16 pages Guest Editors: Andrew Fish, Harald Störrle Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Generating Euler Diagrams from Existing Layouts Gem Stapleton1, John Howse2 Peter Rodgers3 and Leishi Zhang4 1 g.e.stapleton@brighton.ac.uk,2 john.howse@brighton.ac.uk www.cmis.brighton.ac.uk/reseach/vmg University of Brighton, UK 3 p.j.rodgers@kent.ac.uk, 4 l.zhang@kent.ac.uk University of Kent, UK Abstract: Euler diagrams have a wide variety of uses, from information visualiza- tion to logical reasoning. In all of their application areas, the ability to automatically layout Euler diagrams brings consid- erable benefits.
    keywords: abstract; concrete; curve; diagram; dual; euler; figure; layout; zone
       cache: eceasst-167.pdf
  plain text: eceasst-167.txt

        item: #192 of 858
          id: eceasst-168
      author: Dwyer, Tim; Marriott, Kim; Wybrow, Michael
       title: Interactive, Constraint-based Layout of Engineering Diagrams
        date: 2008-09-11
       words: 3351
      flesch: 58
     summary: Con- strained graph layout is a powerful new approach to network layout that allows the user to impose a wide variety application-specific placement constraints—such as downwards pointing directed edges, alignment of nodes, cluster containment and non-overlapping nodes and clusters—on the layout. The approach, constrained graph layout [HM98, DKM06a, DKM06b], generalises the popular force-directed model for graph layout.
    keywords: constraints; diagram; graph; layout; network; nodes; tool; topology
       cache: eceasst-168.pdf
  plain text: eceasst-168.txt

        item: #193 of 858
          id: eceasst-169
      author: Genon, Nicolas; Matulevicius, Raimundas; Englebert, Vincent; Heymans, Patrick
       title: Positioning Map: a Visual Technique to Improve the Layout of Diagram Contextual Information
        date: 2008-09-12
       words: 3202
      flesch: 49
     summary: It requires a cognitive effort from the user to see the link between locator map and navigation map. Positioning map e c M od el Di ag ra m 2 Diagram 3 Figure 3: Building a positioning map 5 / 8 Volume 13 (2008) Table 1: Comparison navigation map + locator map vs. positioning map Navigation Map + Locator Map Positioning Map Locator map: information related to cognitive integration.
    keywords: diagram; information; locator; map; model; navigation; positioning; principles
       cache: eceasst-169.pdf
  plain text: eceasst-169.txt

        item: #194 of 858
          id: eceasst-17
      author: Minas, Mark
       title: Parsing of Adaptive Star Grammars
        date: 2006-12-11
       words: 8717
      flesch: 79
     summary: Parsing of Adaptive Star Grammars Mark Minas 15 pages Guest Editors: Gabor Karsai, Gabriele Taentzer Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Parsing of Adaptive Star Grammars Mark Minas Mark.Minas@unibw.de, http://www.unibw.de/Mark.Minas Institut für Softwaretechnik Universität der Bundeswehr München, Germany Abstract: In a recent paper, adaptive star grammars have been proposed as an ex- tension of node and hyperedge replacement grammars [DHJ+06]. Adaptive star grammars are motivated by application areas such as modeling and refactoring object-oriented programs, and they are more powerful than node and hyperedge replacement gram- mars by this mechanism.
    keywords: adaptive; f f; grammars; nodes; star; vv vv
       cache: eceasst-17.pdf
  plain text: eceasst-17.txt

        item: #195 of 858
          id: eceasst-170
      author: Sedlmair, Michael
       title: MSCar: Enhancing Message Sequence Charts with Interactivity for Analysing (Automotive) Communication Sequences
        date: 2008-09-11
       words: 4245
      flesch: 47
     summary: 4.1 Design adaptations Based on the special requirements described above, we designed MSCar, a visual variant of MSC representation, to enable the interactive presentation of automotive communication tasks. Hence, the statically shown information in the MSC diagram regarding this ECU is reduced to drawing the physical dependencies and so is semantically downscaled from detailed FB to overview ECU information (cf
    keywords: communication; concepts; ecu; fbs; figure; information; mscar; mscs; visualization
       cache: eceasst-170.pdf
  plain text: eceasst-170.txt

        item: #196 of 858
          id: eceasst-171
      author: Kraemer, Eileen Theresa
       title: Designing, Conducting, and Analyzing Empirical Studies
        date: 2008-09-16
       words: 308
      flesch: 25
     summary: She received an MS in Computer Science in 1986 from Polytechnic University in Brooklyn, NY and a BS in Biology in 1980 from Hofstra University in Hempstead, NY. She received her Ph.D. in Computer Science in September of 1995 from the College of Computing at the Georgia Institute of Technology in Atlanta, where she studied with Professor John Stasko in the Graphics, Visualization, and Usability Center.
    keywords: science; studies
       cache: eceasst-171.pdf
  plain text: eceasst-171.txt

        item: #197 of 858
          id: eceasst-172
      author: Maier, Sonja; Mazanek, Steffen; Minas, Mark
       title: Layout Specification on the Concrete and Abstract Syntax Level of a Diagram Language
        date: 2008-09-16
       words: 6315
      flesch: 59
     summary: Syntax analysis for diagram editors: a constraint satisfaction problem. Free-hand editors, on the other hand, allow to arrange diagram components from a language-specific set on the screen without any restrictions, thus giving the user more freedom and enabling sketching [BM08].
    keywords: abstract; concrete; diagram; graph; layout; level; model; syntax; transformation
       cache: eceasst-172.pdf
  plain text: eceasst-172.txt

        item: #198 of 858
          id: eceasst-173
      author: Vajk, Tamas; Mezei, Gergely; Levendovszky, Tihamer
       title: An Incremental OCL Compiler for Modeling Environments
        date: 2008-12-01
       words: 6250
      flesch: 57
     summary: 3.1 Package The largest segments of OCL code are packages, see Figure 3, thus, this can serve as an obvi- ous unit for the separation. 4 High-Complexity Incremental OCL Compilation In this section, we provide an algorithm that incrementally compiles the modified expressions in the source OCL code.
    keywords: code; compiler; figure; incremental; language; model; modeling; ocl; time; transformation; tree
       cache: eceasst-173.pdf
  plain text: eceasst-173.txt

        item: #199 of 858
          id: eceasst-174
      author: Seifert, Mirko; Samlaus, Roland
       title: Static Source Code Analysis using OCL
        date: 2008-12-01
       words: 6309
      flesch: 56
     summary: Due to space limitations we omit more examples for OCL queries. For example, using OCL queries for Java programs and using rights management to enforce database integrity implies learning more concepts and mastering another technology.
    keywords: analysis; ast; code; example; java; language; model; ocl; queries; query; source; static; syntax
       cache: eceasst-174.pdf
  plain text: eceasst-174.txt

        item: #200 of 858
          id: eceasst-175
      author: Büttner, Fabian; Kuhlmann, Mirco
       title: Problems and Enhancements of the Embedding of OCL into QVT ImperativeOCL
        date: 2008-12-01
       words: 3494
      flesch: 46
     summary: A couple of semantical problems arise from the way OCL is embedded into ImperativeOCL – imperative expressions are modelled as a subtype of OCL expressions. Thus, we can have imperative expressions consisting of OCL expressions that again consist of imperative expressions.
    keywords: env; expressions; imperativeocl; ocl; problems; qvt; semantics
       cache: eceasst-175.pdf
  plain text: eceasst-175.txt

        item: #201 of 858
          id: eceasst-176
      author: Krieger, Matthias P.; Knapp, Alexander
       title: Executing Underspecified OCL Operation Contracts with a SAT Solver
        date: 2008-12-01
       words: 7286
      flesch: 58
     summary: 4.2 Translation of OCL Constraints to Arithmetic Formulas We now sketch how OCL constraints can be translated to arithmetic formulas. We present an efficient and fully automatic approach to executing OCL operation contracts which uses a satis- fiability (SAT) solver.
    keywords: animation; class; constraints; contracts; formulas; model; ocl; operation; sat; state; system
       cache: eceasst-176.pdf
  plain text: eceasst-176.txt

        item: #202 of 858
          id: eceasst-177
      author: Mustafa, Tanveer; Sohr, Karsten; Dang, Duc-Hanh; Drouineaud, Michael; Kowski, Stefan
       title: Implementing Advanced RBAC Administration Functionality with USE
        date: 2008-12-01
       words: 7386
      flesch: 48
     summary: The tool provides functionality for creating and managing RBAC policies. As indicated above, the USE system is a general-purpose validation tool and can hence be employed for the other UML/OCL encodings of RBAC policies mentioned above.
    keywords: authorization; constraints; figure; object; ocl; orka; policy; rbac; role; system; tool; use; validation
       cache: eceasst-177.pdf
  plain text: eceasst-177.txt

        item: #203 of 858
          id: eceasst-178
      author: Sánchez Cuadrado, Jesús; Jouault, Frédéric; Garcí­a-Molina, Jesús; Bézivin, Jean
       title: Deriving OCL Optimization Patterns from Benchmarks
        date: 2008-12-01
       words: 5358
      flesch: 49
     summary: 3 Performance patterns In this section we describe five OCL patterns and analyze them in order to improve the perfor- mance of OCL navigation expressions in model transformations. Regarding performance of model transformation languages few work has been been done.
    keywords: atl; benchmark; elements; execution; model; ocl; patterns; performance; time; transformation
       cache: eceasst-178.pdf
  plain text: eceasst-178.txt

        item: #204 of 858
          id: eceasst-179
      author: Clavel, Manuel; Marina, Egea; Miguel Angel, Garcia de Dios
       title: Building an Efficient Component for OCL Evaluation
        date: 2008-12-15
       words: 4232
      flesch: 55
     summary: Finally, we explore various approaches for evaluating OCL expressions on really large scenarios. [CE06], a rewriting-based evaluator for OCL expressions on instances of user-defined models.
    keywords: eos; evaluation; expressions; mdt; ocl; scenarios; table; use
       cache: eceasst-179.pdf
  plain text: eceasst-179.txt

        item: #205 of 858
          id: eceasst-18
      author: Willink, Edward Daniel
       title: Model Instantiation and Type Checking in UMLX
        date: 2006-12-11
       words: 4442
      flesch: 40
     summary: It is too early to tell whether modern tools and the more abstract meta- model based constructs used for model transformations are sufficient to allow Fujaba, GReAT, MOLA or VIATRA2 to overcome the limitations of earlier attempts at imperative graphics. 4 Conclusion We have discussed how an MDA based on progressive model transformations offers an improved programming environment with reduced opportunities for errors.
    keywords: checking; class; errors; example; meta; model; pattern; transformation; type; umlx
       cache: eceasst-18.pdf
  plain text: eceasst-18.txt

        item: #206 of 858
          id: eceasst-180
      author: Chiorean, Dan Ioan; Petrascu, Vladiela; Petrascu, Dragos
       title: How My Favorite Tool Supporting OCL Must Look Like
        date: 2008-12-15
       words: 6375
      flesch: 49
     summary: Therefore, it is important that OCL tools implement this functionality. They also mention that “The future regarding OCL tools is rather uncertain”.
    keywords: evaluation; expressions; model; ocl; ocle; page; results; specifications; tools; use; web
       cache: eceasst-180.pdf
  plain text: eceasst-180.txt

        item: #207 of 858
          id: eceasst-181
      author: Aydal, Emine G; Paige, Richard F; Woodstock, Jim
       title: Observations for Assertion-based Scenarios in the context of Model Validation
        date: 2008-12-15
       words: 7239
      flesch: 49
     summary: Figure 1: Class Diagram - Mondex 1.2 Test Scenarios in UML Specification Environment (USE) We tried these options in different scenarios and noticed that in some situations the second - and the more general - option works, however we were unable to find a pattern that explains the rationale behind this varying behaviour.
    keywords: model; observations; operation; postconditions; scenario; set; state; system; validation; variables
       cache: eceasst-181.pdf
  plain text: eceasst-181.txt

        item: #208 of 858
          id: eceasst-183
      author: Cabot, Jordi; Gogolla, Martin; van Gorp, Pieter
       title: Preface to the Proceedings of the 2008 OCL Workshop
        date: 2009-02-26
       words: 869
      flesch: 41
     summary: First of all, several questions and remarks related to whether OCL tools should be extended with OCL specific algorithms (analyses, optimizations, ...) or whether one should translate OCL into other languages for those purposes. To be successful, all these new OCL applications, extensions and usages require new OCL tools that support them.
    keywords: ocl; tools; university; workshop
       cache: eceasst-183.pdf
  plain text: eceasst-183.txt

        item: #209 of 858
          id: eceasst-184
      author: Rehman, Habib-ur; Wolf, Lars
       title: Analysis of Inconsistent Routing Components in Reactive Routing Protocols
        date: 2009-02-27
       words: 5550
      flesch: 58
     summary: In this work, we have identified such inconsistent components in AODV routing protocol and have analyzed their effect. In section 3, the two inconsistent components of AODV routing protocol selected for the analysis are described.
    keywords: aodv; nodes; route; routing; rreq; ttl
       cache: eceasst-184.pdf
  plain text: eceasst-184.txt

        item: #210 of 858
          id: eceasst-185
      author: Staub, Thomas; Ott, Stefan; Braun, Torsten
       title: Experimental Evaluation of Multi-Path Routing in a Wireless Mesh Network Inside a Building
        date: 2009-02-27
       words: 4511
      flesch: 63
     summary: corresponding code to allow adding multi-path routes. 2 Related work Research on wireless multi-path routing protocols produced several proposals for multi-path extensions to existing single-path ad-hoc routing protocols, namely to the Ad hoc On-Demand Distance Vector (AODV [PBD03]) and the Dynamic Source Routing (DSR [JHM07]) protocols.
    keywords: aodv; end; figure; hop; mesh; multi; network; nodes; path; route; routing; wireless
       cache: eceasst-185.pdf
  plain text: eceasst-185.txt

        item: #211 of 858
          id: eceasst-188
      author: Baldan, Paolo; König, Barbara
       title: Preface
        date: 2009-01-22
       words: 1498
      flesch: 60
     summary: Several approaches to the concurrent semantics of graph transformation systems as well as techniques for their analysis and verification have been strongly influenced by the correspond- ing theories and constructions for Petri nets (see, e.g., [11]). As a further link between the two models, recall that graph transformation systems are also 1 / 4 Volume 14 (2008) Preface used for the development, the simulation, or animation of various types of Petri nets, e.g., via the the definition of visual languages and environments
    keywords: graph; nets; petri; systems; volume
       cache: eceasst-188.pdf
  plain text: eceasst-188.txt

        item: #212 of 858
          id: eceasst-189
      author: Biermann, Enrico; Ermel, Claudia; Modica, Tony; Sylopp, Peggy
       title: Implementing Petri Net Transformations using Graph Transformation Tools
        date: 2009-01-22
       words: 6109
      flesch: 65
     summary: 5 Conclusion We have defined a formal translation of Petri nets and Petri net transformation rules to graphs and graph transformation rules. Similarly, in the approach of Llorens and Oliver [LO04], rewriting of Petri nets by graph transformation rules is used for 1 / 14 Volume 14 (2008) mailto:formalnet@cs.tu-berlin.de Implementing Petri Net Transformations the reconfiguration of nets, but does not preserve the firing behavior.
    keywords: agg; graph; match; morphisms; net; nets; petri; rule; transformation
       cache: eceasst-189.pdf
  plain text: eceasst-189.txt

        item: #213 of 858
          id: eceasst-19
      author: Szemethy, Tivadar; Karsai, Gabor
       title: PML: a Language for Platform Modeling
        date: 2006-12-11
       words: 4513
      flesch: 51
     summary: PML provides an import tool to include GME metamodels into platform models. Additionally, PML models may contain optional crosslinks definitions.
    keywords: analysis; component; filter; graph; language; model; modeling; pattern; platform; pml; transformation
       cache: eceasst-19.pdf
  plain text: eceasst-19.txt

        item: #214 of 858
          id: eceasst-190
      author: Ferrari, Gian Luigi; Guanciale, Roberto; Strollo, Daniele; Tuosto, Emilio
       title: Debugging Distributed Systems with Causal Nets
        date: 2009-01-22
       words: 3789
      flesch: 51
     summary: Here, we propose to use causal nets to define a few debugging primitives to drive the analysis of system developed with SC (after Signal Calculus), a process calculus featuring event-notification communication. 1 Keywords: Causal nets, event notification, debugging 1 Introduction Modern computing is typically distributed as data are stored on systems that are connected to form huge networks and computations take place on several locations.
    keywords: causal; components; debugging; jscl; nets
       cache: eceasst-190.pdf
  plain text: eceasst-190.txt

        item: #215 of 858
          id: eceasst-191
      author: Rein, Alexander
       title: Negative Application Conditions for Reconfigurable Algebraic High-Level Systems
        date: 2009-01-22
       words: 6577
      flesch: 61
     summary: This means, the category is a weak adhesive HLR category and satisfies some additional properties such that negative application conditions can be used within AHL system transformations without losing important qualities of adhesive HLR systems like Local Church-Rosser Theorem, Parallelism Theorem, Completeness Theorem of Critical Pairs, Concurrency Theorem, Embedding and Extension Theorem and Local Confluence Theorem. In the small example of this paper, this result is almost obvious since every transformation step is reversible, although, this result is nontrivial in general, e.g. for transformation systems with non-reversible transformation steps.
    keywords: ahl; airplane; apsize; gate; nacs; reconfigurable; rule; systems; transformation
       cache: eceasst-191.pdf
  plain text: eceasst-191.txt

        item: #216 of 858
          id: eceasst-192
      author: Ullrich, Conny; Padberg, Julia
       title: Reconfigurable Open Algebraic High-Level Systems
        date: 2009-01-22
       words: 7133
      flesch: 65
     summary: Additionally, open AHL systems allow modelling reactive systems, which interact with its environment. Furthermore, open AHL systems can be extended to labeled open AHL systems.
    keywords: ahl; message; nets; open; person; places; reconfigurable; sco; systems
       cache: eceasst-192.pdf
  plain text: eceasst-192.txt

        item: #217 of 858
          id: eceasst-193
      author: Jungk, Bernhard
       title: Selbstorganisierendes Service Level Management basierend auf Mechanismus-Design
        date: 2009-02-27
       words: 4707
      flesch: 56
     summary: Die Ergebnisse der Simulation in Abbildung 3 zeigen, dass das SLO-Spiel tatsächlich immer eine Lösung findet. Ein Mechanismus-Design Problem wird durch ein gewünschtes Ergebnis beschrieben, das von einer Anzahl rationaler Agenten erreicht werden soll.
    keywords: abbildung; agenten; aktivitäten; alle; als; auf; aus; das; dass; der; des; design; die; dieses; durch; ein; eine; für; ist; kann; management; mechanismus; mit; nicht; service; sich; slo; spiel; und; vgl; von; werden; wird; workflow
       cache: eceasst-193.pdf
  plain text: eceasst-193.txt

        item: #218 of 858
          id: eceasst-194
      author: Sudeikat, Jan; Braubach, Lars; Pokahr, Alexander; Renz, Wolfgang; Lamersdorf, Winfried
       title: Systematically Engineering Self-Organizing Systems: The SodekoVS Approach
        date: 2009-02-27
       words: 5576
      flesch: 32
     summary: 3 SodekoVS: Toward Engineering Self–Organization Chapter Building Complex Adaptive Systems: On Engineering Self–Organizing Multi–Agent Sys- tems, pp.
    keywords: agent; application; coordination; design; development; dynamics; engineering; organization; organizing; self; software; strategies; systems
       cache: eceasst-194.pdf
  plain text: eceasst-194.txt

        item: #219 of 858
          id: eceasst-195
      author: Schulze, Michael
       title: FAMOUSO – Eine adaptierbare Publish/Subscribe Middleware für ressourcenbeschränkte Systeme
        date: 2009-02-27
       words: 4305
      flesch: 42
     summary: Die Anwendung sieht, unabhängig von der Konfiguration, nur das einheitliche Interface bestehend aus Ereigniskanälen für Publisher und Subscriber. 3.3 Dynamische Adaption Die Middleware FAMOUSO unterstützt neben der beschriebenen statischen Adaption die Ad- aption zur Laufzeit.
    keywords: adaption; als; anwendung; auch; auf; aus; das; dem; den; der; des; die; diese; eine; famouso; für; hier; ist; kann; kommunikation; layer; middleware; mit; publish; sich; sind; sowie; subscribe; systeme; typedef; und; von; welche; werden; wird; z.b; zur
       cache: eceasst-195.pdf
  plain text: eceasst-195.txt

        item: #220 of 858
          id: eceasst-197
      author: Benzing, Andreas; Herrmann, Klaus; Koldehofe, Boris; Rothermel, Kurt
       title: Identifying the Challenges in Reducing Latency in GSN using Predictors
        date: 2009-02-27
       words: 3745
      flesch: 51
     summary: Sensor value predictors can be further categorized depending on the type of correlations on which they are based. This previously distributed query tree is used to route the emerging streams of sensor data back to the application.
    keywords: applications; challenges; data; gsgm; latency; networks; overlay; predictors; sensor
       cache: eceasst-197.pdf
  plain text: eceasst-197.txt

        item: #221 of 858
          id: eceasst-198
      author: Kalil, Mohamed; Liers, Florian; Volkert, Thomas; Mitschele-Thiel, Andreas
       title: A Novel Opportunistic Spectrum Sharing Scheme for Cognitive Ad Hoc Networks
        date: 2009-02-27
       words: 4357
      flesch: 63
     summary: The advantages of using unlicensed channels as backup channels are: 1) the blocking or data transmission termination probability will be reduced in case of the appearance of PUs. The call holding times of the PUs and SUs are assumed to be an exponential distribution with expectation 1µ1 and 1 µ 2 respectively The states of the system is described by (i, j, k), where i is the number of licensed channels used by PUs, j is the number of remaining licensed channels; c1-i used by the SUs and k is the number of unlicensed channels used by SUs as backup channels.
    keywords: backup; channels; networks; scheme; spectrum; sus; transmission
       cache: eceasst-198.pdf
  plain text: eceasst-198.txt

        item: #222 of 858
          id: eceasst-199
      author: Sonnenfroh, Michael; Möller, Kim-Thomas; Müller, Marc-Florian; Schoettner, Michael; Schulthess, Peter
       title: Massively Multiuser Virtual Environments using Object Based Sharing
        date: 2009-02-27
       words: 5161
      flesch: 56
     summary: Object views on different nodes can show different subsets of objects with different data versions. We are saying that an object A residing in object view N is alike to object B residing in object view N+1 if both objects have the same ID.
    keywords: consistency; data; global; model; object; peer; scene; store; tgos; transactional; view; wissenheim
       cache: eceasst-199.pdf
  plain text: eceasst-199.txt

        item: #223 of 858
          id: eceasst-20
      author: Hermann, Frank; Kastenberg, Harmen; Modica, Tony
       title: Towards Translating Graph Transformation Approaches by Model Transformations
        date: 2006-12-11
       words: 6690
      flesch: 66
     summary: Trans- forming UML models by graph transformation rules is especially supported by the tool VIATRA A graph production system P = 〈R, G〉 consists of a set R = {p : L ⇀ R | L, R ∈ G } of graph transformation rules and a graph G; G is said to be the initial graph.
    keywords: agg; application; approaches; edges; graph; groove; nac; nacs; nodes; person; rule; transformation
       cache: eceasst-20.pdf
  plain text: eceasst-20.txt

        item: #224 of 858
          id: eceasst-200
      author: Hurni, Philipp; Staub, Thomas; Wagenknecht, Gerald; Anwander, Markus; Braun, Torsten
       title: A Secure Remote Authentication, Operation and Management Infrastructure for Distributed Wireless Sensor Network Testbeds
        date: 2009-02-27
       words: 2443
      flesch: 43
     summary: Remote Authentication, Management and Operation Infrastructure for WSN Testbeds system for remote wireless sensor network configuration and experimentation within a federation of distributed wireless sensor network laboratories. 4 Conclusions In this paper we propose an infrastructure for secure remote authentication, management and operation of an interconnected network of wireless sensor network testbeds basing on the open source Shibboleth system.
    keywords: access; authentication; network; sensor; shibboleth; system; testbed
       cache: eceasst-200.pdf
  plain text: eceasst-200.txt

        item: #225 of 858
          id: eceasst-201
      author: Furthmüller, Jochen Wolfgang; Pink, Mario; Hartenstein, Hannes; Waldhorst, Oliver P.
       title: Overcoming a Communication Barrier on the Way Towards a Global Sensor Network
        date: 2009-02-27
       words: 2871
      flesch: 54
     summary: With further investigations in the area of heterogeneous sensor networks we hope to further alleviate the usage of diverse sensor platforms within one single sensor network deployment. That way sensor networks consisting of diverse platforms can be accessed via the same base stations and even more, heterogeneous sensor networks can be created in which different sensors fulfill different tasks.
    keywords: communication; layer; micaz; network; nodes; sensor; spot; sun
       cache: eceasst-201.pdf
  plain text: eceasst-201.txt

        item: #226 of 858
          id: eceasst-202
      author: Schloss, Hermann; Scholtes, Ingo; Botev, Jean; Esch, Markus; Höhfeld, Alexander; Sturm, Peter
       title: Fuzzy Logic supported Consistency Management in DDVEs
        date: 2009-02-27
       words: 4970
      flesch: 51
     summary: In our approach, depending on the considered application scenario and addressed consistency problem at each level, we assign a Proc. To minimize the presence of inconsistent states or data, the Elastic Consistency model aims at providing an optimal trade-off between consistency and system responsive- ness.
    keywords: consistency; crt; figure; logic; number; parameter; set; users; value
       cache: eceasst-202.pdf
  plain text: eceasst-202.txt

        item: #227 of 858
          id: eceasst-203
      author: Kleiner, Carsten; Koschel, Arne
       title: Praxisfallbeispiel: Modernisierung einer Mainframe-Anwendung durch eine verteilte SOA
        date: 2009-02-27
       words: 3099
      flesch: 47
     summary: In unserer Fallstudie wird letztendlich der Weg des „Business Logic Wrapping“ aus der Familie der invasiven Methoden (Klassifizierung nach [EAK06]) gewählt. Der Ansatz einer Neuimplementierung (aus der Familie der invasiven Methoden nach [EAK06]) der vorhandenen Funktionalität ([SYON08]) in einer Programmiersprache, die sich besser für die Verwendung in einer SOA eignet (z.B. Java oder .NET), scheidet in vielen Fällen schon aufgrund des erforderlichen hohen Aufwands aus.
    keywords: abb; adabas; altanwendung; anwendung; auch; auf; aus; der; des; die; dienste; eine; für; integration; ist; legacy; mainframe; mit; natural; nicht; services; soa; und; von; web; werden; wird
       cache: eceasst-203.pdf
  plain text: eceasst-203.txt

        item: #228 of 858
          id: eceasst-204
      author: Bleul, Steffen; Weise, Thomas; Geihs, Kurt
       title: The Web Service Challenge - A review on Semantic Web Service Composition
        date: 2009-02-27
       words: 6395
      flesch: 77
     summary: Keywords: Business Process Management, quality of service, Web Service com- position, orchestration, sub-orchestration, BPEL, WSBPEL, WSDL, OWL, WSC, Web Service Challenge 1 Introduction Since 2005, the annual Web Service Challenge1 (WSC) provides a platform for researchers in the area of Web Service composition which allows them to compare their systems and to ex- change experiences [1]. The search space that needs to be investigated in Web Service composition [8] is the set of all possible permutations of all possible sets of services.
    keywords: e n; e s; l e; n s; o n; s s; t e
       cache: eceasst-204.pdf
  plain text: eceasst-204.txt

        item: #229 of 858
          id: eceasst-205
      author: Podlich, Alexander; Weise, Thomas; Menze, Manfred; Gorld, Christian
       title: Intelligente Wechselbrückensteuerung für die Logistik von Morgen
        date: 2009-02-27
       words: 3524
      flesch: 45
     summary: Eine weitere Anforderung, die von der Inwest Middleware erfüllt wird, ist eine detaillierte Rollen- und Rech- teverwaltung. Die Module messen dabei Entfernungen von der Decke der Wechselbrücke nach unten, respektive von der Decke der Wechselbrücke zu der darunter liegenden Beladung (z.B. Paletten, Stückgut, . . . )
    keywords: als; auf; bei; das; der; des; die; diese; durch; eine; für; intelligente; inwest; logistik; middleware; mit; problem; routing; sensorknoten; sind; und; über; vehicle; von; wechselbrücken; wechselbrückensteuerung; werden; wird; yellowbox; zur
       cache: eceasst-205.pdf
  plain text: eceasst-205.txt

        item: #230 of 858
          id: eceasst-206
      author: Lau, Sian Lun; Klein, Niklas; Pirali, Andreas; König, Immanuel; David, Klaus
       title: Implementation of a User-Centric Context-Aware Playground
        date: 2009-02-27
       words: 5239
      flesch: 56
     summary: There lacks a convenient package that is deployable as a product to enable context aware rooms and is easily manageable by the costumers. Last but not least, we also foresee the need of context processing components, where output from the context provider components are pro- cessed to produce inferred results.
    keywords: actuators; applications; architecture; components; context; implementation; playground; room; sensors; system; user
       cache: eceasst-206.pdf
  plain text: eceasst-206.txt

        item: #231 of 858
          id: eceasst-207
      author: Schoene, Thomas; Kaspar, Friedbert; Reich, Christoph
       title: Using WSDM and Web Service Ping for QoS based Web Service Selection
        date: 2009-02-27
       words: 4355
      flesch: 56
     summary: Keywords: SOA, Web Services, QoS, Web Service Ping, WSDM, MUWS, MOWS, Web Service Routing, Web Service selection, Delegation Web Service as selector 1 Introduction The growing demand to increase the flexibility of the IT infrastructure to support rapidly evolv- ing business needs, has led to a rising interest in Service-Oriented Architectures (SOA). All QoS data retrieved by using MOWS, MUWS and Web Service Ping, can be used for Web Service selection.
    keywords: consumer; delegation; ping; qos; selection; selector; service; web; web service
       cache: eceasst-207.pdf
  plain text: eceasst-207.txt

        item: #232 of 858
          id: eceasst-208
      author: Mayer, Christoph P.
       title: Security and Privacy Challenges in the Internet of Things
        date: 2009-02-27
       words: 5778
      flesch: 53
     summary: Physical mechanisms to preserve RFID privacy is detailed in Section 3.2.1 and cryptographic RFID protocols in Section 3.2.2. These numbers are predicted to grow and RFID tags posing an important technology in the Internet of Things.
    keywords: + +; communication; data; integrity; internet; localization; privacy; research; rfid; security; sensor; tag; things
       cache: eceasst-208.pdf
  plain text: eceasst-208.txt

        item: #233 of 858
          id: eceasst-209
      author: Scholz, Andreas; Buckl, Christian; Sommer, Stephan; Kemper, Alfons; Knoll, Alois; Heuer, Jörg; Schmitt, Anton
       title: eSOA - SOA für eingebettete Netze
        date: 2009-02-27
       words: 2705
      flesch: 43
     summary: Netzwerkarchitektur, in der Daten von den Sensoren ausgehend im- mer weiter verdichtet werden, bis sie einen zentralen Knoten erreichen, der sie speichern oder an externe Systeme versenden kann. Die nachfolgenden Schritte können vollauto- matisch von der verwendeten Middleware durchgeführt werden.
    keywords: auf; aus; der; die; dienste; durch; eine; eingebettete; für; hardware; ist; kann; knoten; können; mit; netze; oder; soa; und; von; web; welche; werden
       cache: eceasst-209.pdf
  plain text: eceasst-209.txt

        item: #234 of 858
          id: eceasst-21
      author: Lengyel, Laszlo; Levendovszky, Tihamér; Vajk, Tamás; Charaf, Hassan
       title: Realizing QVT with Graph Rewriting-Based Model Transformation
        date: 2006-12-11
       words: 4951
      flesch: 51
     summary: Realizing QVT with Graph Rewriting-Based Model Transformation László Lengyel, Tihamér Levendovszky, Tamás Vajk and Hassan Charaf 12 pages Guest Editors: Gabor Karsai, Gabriele Taentzer Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/� ECEASST Realizing QVT with Graph Rewriting-Based Model Transformation László Lengyel1, Tihamér Levendovszky2, Tamás Vajk3 and Hassan Charaf4 1 lengyel@aut.bme.hu 2 tihamer@aut.bme.hu 3 tamas.vajk@aut.bme.hu 3 hassan@aut.bme.hu Budapest University of Technology and Economics Goldmann György tér 3., Hungary 1111, Budapest Abstract: Model-based development is an increasingly applied method in produc- ing software artifacts that is driven by model transformation. Extensive research of graph transformation provides a strong formal background for model transformation.
    keywords: graph; lhs; metamodel; model; model transformation; qvt; rewriting; rules; transformation; vmts
       cache: eceasst-21.pdf
  plain text: eceasst-21.txt

        item: #235 of 858
          id: eceasst-210
      author: Schmid, Markus; Schäfer, Jan; Kröger, Reinhold
       title: Integriertes Performance-Monitoring von SOA-Anwendungen
        date: 2009-02-27
       words: 4333
      flesch: 34
     summary: [Gü02], existiert speziell zur detaillierten Vermessung von Vorgängen in verteilten Anwendungen das von der Open Group spezifizierte Application Response Measurement (ARM) 4.0 API [Ope03]. Diese Monitoring-Um- gebung bildet die dann Grundlage für ein Performance-Monitoring auf Ebene von SOA-Anwen- dungen, welche als Komposition unterschiedlicher Dienste aufgefasst werden können.
    keywords: abbildung; als; ansatz; anwendungen; arm; auf; das; der; des; die; dienste; durch; eine; für; instrumentierung; integration; ist; kann; komponenten; können; management; messungen; mit; monitoring; performance; sca; service; sich; soa; und; von; werden; wird; zum; zur; über
       cache: eceasst-210.pdf
  plain text: eceasst-210.txt

        item: #236 of 858
          id: eceasst-211
      author: Comes, Diana Elena; Bleul, Steffen; Zapf, Michael
       title: Management of Business Processes with the BPRules Language in Service Oriented Computing
        date: 2009-02-27
       words: 6078
      flesch: 68
     summary: BPRules is an expressive language, providing all the features that we identified as mandatory for business process management. 12 pages Guest Editors: M. Wagner, D. Hogrefe, K. Geihs, K. David Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Management of Business Processes with the BPRules Language in Service Oriented Computing Diana Comes1, Steffen Bleul2 and Michael Zapf3 1 comes@vs.uni-kassel.de 2 bleul@vs.uni-kassel.de 3 zapf@vs.uni-kassel.de Distributed Systems Kassel University, Germany Abstract: Quality of Service (QoS) concerns are an important topic for the realiza- tion of business processes.
    keywords: c t; e c; e t; process; r e; s e; s s
       cache: eceasst-211.pdf
  plain text: eceasst-211.txt

        item: #237 of 858
          id: eceasst-213
      author: Heger, Florian; Schiele, Gregor; Süselbeck, Richard; Becker, Christian
       title: Towards an Interest Management Scheme for Peer-based Virtual Environments
        date: 2009-02-27
       words: 4825
      flesch: 61
     summary: The identification of such peers is known as Interest Management. Typically Interest Management is done based on so-called Areas of Interest.
    keywords: aoi; interest; management; peer; scheme; state; updates; user
       cache: eceasst-213.pdf
  plain text: eceasst-213.txt

        item: #238 of 858
          id: eceasst-214
      author: Peddemors, Arjan; Yoneki, Eiko
       title: Decentralized Probabilistic World Modeling with Cooperative Sensing
        date: 2009-02-27
       words: 4261
      flesch: 44
     summary: Every device holds model data describing its current surroundings, and obtains model data from others when moving into unknown territory. When capable of structuring frequent patterns on a single device, we focus in section 3 on the exchange of model data using opportunistic communication.
    keywords: data; devices; location; model; patterns; person; speed; world
       cache: eceasst-214.pdf
  plain text: eceasst-214.txt

        item: #239 of 858
          id: eceasst-215
      author: Loeser, Christoph; Trunko, Ralf; Steckel, Thilo; Podratz, Kevin; Georgiew, Emanuel; Swoboda, Frieder
       title: Kontextsensitive Konfiguration und Ausführung verteilter Geschäftsprozesse
        date: 2009-02-27
       words: 4448
      flesch: 36
     summary: Die Verknüpfung von Kontextinformationen mit ihren korrespondierenden Ausnahmebehandlungen erfolgt ebenfalls durch einen regelbasierten Ansatz. Die Integration von Kontext wird dabei auf drei unterschiedlichen Ebenen be- rücksichtigt (Dienstleistungen, Geschäftsprozesse, Technologie).
    keywords: als; auch; auf; ausführung; context; das; dem; der; des; die; dienstleistungen; diese; durch; eine; engine; für; instanz; ist; konfiguration; kontextinformationen; kontextsensitivität; können; management; member; mit; oder; process; prozesse; services; sich; sind; und; von; werden; wie; wird; zur; über
       cache: eceasst-215.pdf
  plain text: eceasst-215.txt

        item: #240 of 858
          id: eceasst-216
      author: Tutschku, Kurt; Zinner, Thomas; Nakao, Akihiro; Tran-Gia, Phuoc
       title: Network Virtualization: Implementation Steps Towards the Future Internet
        date: 2009-02-27
       words: 5466
      flesch: 46
     summary: The suggested stripping mechanism constitutes a first instance of a refinement of the concept of NV, the idea of transport system virtualization. In transport system virtualization local transport resources (cf.
    keywords: application; future; internet; network; overlays; p2p; router; routing; source; system; transport; virtualization
       cache: eceasst-216.pdf
  plain text: eceasst-216.txt

        item: #241 of 858
          id: eceasst-217
      author: Weingärtner, Elias; Terwelp, Christoph; Wehrle, Klaus
       title: ProMoX: A protocol stack monitoring framework
        date: 2009-02-27
       words: 4541
      flesch: 47
     summary: By utilizing system virtualization for external monitoring, ProMoX can transparently inspect any protocol state and performance metrics of protocol implementations carried by a guest operating system. Keywords: system virtualization, protocol stack monitoring, development support 1 Introduction Over the last decade, overlay networks and peer-to-peer technologies have drawn much attention in the network research community.
    keywords: domain; implementation; introspection; memory; monitoring; operating; promox; protocol; stack; system; virtualization; xen
       cache: eceasst-217.pdf
  plain text: eceasst-217.txt

        item: #242 of 858
          id: eceasst-218
      author: Berl, Andreas; Fischer, Andreas; de Meer, Hermann
       title: Using System Virtualization to Create Virtualized Networks
        date: 2009-02-27
       words: 5063
      flesch: 52
     summary: Its high popularity, its extensive usage in productive environments, and the current rapid development of management solutions for sys- tem virtualization are the main reasons to investigate it in the context of network virtualization. The network model consists of virtual networks, virtual routers, and virtual links that form overlays on top of the physical network.
    keywords: network; properties; resources; routers; system; system virtualization; virtualization; vls; vns; vrs
       cache: eceasst-218.pdf
  plain text: eceasst-218.txt

        item: #243 of 858
          id: eceasst-219
      author: Christmann, Dennis; Gotzhein, Reinhard; Kuhn, Thomas
       title: Multi-hop Clock Synchronization in Wireless Ad-Hoc Networks
        date: 2009-02-27
       words: 5841
      flesch: 59
     summary: Based on the analysis in Section 3 and for given hardware platforms, we can now determine concrete values for maximum clock offset, time synchronization delay, and time synchronization overhead. Since both encodings are significantly less efficient than regular encodings for (collision-prone) data transmissions on MAC level, they are applied to certain control frames, in particular, tick frames and time frames, only.
    keywords: bit; clock; encoding; frame; hop; network; node; round; synchronization; tick; time
       cache: eceasst-219.pdf
  plain text: eceasst-219.txt

        item: #244 of 858
          id: eceasst-22
      author: Narayanan, Anantha; Karsai, Gabor
       title: Using Semantic Anchoring to Verify Behavior Preservation in Graph Transformations
        date: 2006-12-11
       words: 5657
      flesch: 50
     summary: Instantaneous states will be discussed in the next subsection. Instantaneous states are not allowed in most common Statecharts variants.
    keywords: anchoring; behavior; model; semantic; state; statechart; transformation; transitions; variant
       cache: eceasst-22.pdf
  plain text: eceasst-22.txt

        item: #245 of 858
          id: eceasst-220
      author: Schuster, Sebastian; Wacker, Arno; Weis, Torben
       title: Fighting Cheating in P2P-based MMVEs with Disjoint Path Routing
        date: 2009-02-27
       words: 6282
      flesch: 66
     summary: As node IDs are uniformly distributed and nodes cannot choose their IDs, picking r nodes creates a random subset of all nodes. While this simple scheme ensures availability of data without any modification to the routing mechanism, it is highly vulnerable to attacks by malicious nodes.
    keywords: data; disjoint; messages; node; p2p; paths; replicas; replication; routing; table
       cache: eceasst-220.pdf
  plain text: eceasst-220.txt

        item: #246 of 858
          id: eceasst-221
      author: Weis, Torben; Wacker, Arno; Schuster, Sebastian; Holzapfel, Sebastian
       title: Towards Logical Clocks in P2P-based MMVEs
        date: 2009-02-27
       words: 4164
      flesch: 69
     summary: Then we present a novel variation of vector clocks – pruned vector clocks – which overcome the deficits of standard vector clocks and are therefore suited for their usage in MMVEs. Keywords: MMVE, Synchronization, Clocks, Consistency 1 Introduction In this paper we will present a variation of vector clocks to synchronize actions in P2P-based MMVEs.
    keywords: actions; clocks; players; vector
       cache: eceasst-221.pdf
  plain text: eceasst-221.txt

        item: #247 of 858
          id: eceasst-222
      author: Egi, Norbert; Greenhalgh, Adam; Handley, Mark; Hoerdt, Mickael; Huici, Felipe; Mathy, Laurent; Papadimitriou, Panagiotis
       title: Designing a Platform for Flexible and Performant Virtual Routers on Commodity Hardware.
        date: 2009-02-27
       words: 1616
      flesch: 49
     summary: In this context, we present the design of a new platform for virtual routers on x86 hardware. • Hardware multi-queueing for sharing interfaces between virtual routers.
    keywords: domain; forwarding; guest; hardware; platform; router
       cache: eceasst-222.pdf
  plain text: eceasst-222.txt

        item: #248 of 858
          id: eceasst-223
      author: Greenhalgh, Adam; Handley, Mark; Hoerdt, Mickael; Huici, Felipe; Mathy, Laurent; Papadimitriou, Panagiotis
       title: Flowstream Architectures
        date: 2009-02-27
       words: 1758
      flesch: 50
     summary: In this context, we propose a generic network control, forwarding and flow processing platform built from commodity switch hardware and a small cluster of servers. Each host runs a number of processing modules where all of the actual flow processing takes place except for basic forward- ing which can be done by the switch.
    keywords: flow; module; platform; processing; switch
       cache: eceasst-223.pdf
  plain text: eceasst-223.txt

        item: #249 of 858
          id: eceasst-224
      author: Fuertes, Walter; López de Vergara M., Jorge E.
       title: An emulation of VoD services using virtual network environments
        date: 2009-02-27
       words: 6070
      flesch: 48
     summary: This paper proposes to develop a method to improve the results obtained in virtual network environments, trying to resemble those obtained in a real environment. Connectivity, IP addressing, switching, routing and video streaming were tested to check the functionality of virtual network environments.
    keywords: adsl; client; emulation; environment; figure; network; performance; results; server; service; step; time; traffic; video; virtualization; vod
       cache: eceasst-224.pdf
  plain text: eceasst-224.txt

        item: #250 of 858
          id: eceasst-225
      author: Bless, Roland; Werle, Christoph
       title: Control Plane Issues in the 4WARD Network Virtualization Architecture
        date: 2009-02-27
       words: 5607
      flesch: 41
     summary: In this paper, we discuss control mechanisms, interfaces, and protocols required in order to allow for dynamic setup of virtual networks. Furthermore, it provides more flexibility in network provisioning, because virtual networks can be expanded or shrunk easier than physical networks.
    keywords: access; control; infrastructure; network; node; operator; provider; resources; substrate; virtual; virtualization; vnet
       cache: eceasst-225.pdf
  plain text: eceasst-225.txt

        item: #251 of 858
          id: eceasst-226
      author: Coskun, Hakan; Schieferdecker, Ina; Al-Hazmi, Yahya
       title: Virtual WLAN: Going beyond Virtual Access Points
        date: 2009-02-27
       words: 5216
      flesch: 57
     summary: Listen Interval (Beacon Interval) Throughput (kbit/s) 3 170 4 156.6 5 133.3 6 117.6 7 108.3 8 101.3 Table 2: Variation in the Number of dropped frames in the AP by changing the Listen Interval value 5 Conclusion Using virtual 802.11 interfaces to connect to multiple networks simultaneously, instead of using multiple network interface cards, enables savings in energy costs, minimizes the physical space, and provides the capability to build large and small wireless mesh networks. Wire- less network interfaces are tuned into one channel and configured to operate as STA or as AP.
    keywords: access; frames; interface; multiple; network; power; psm; sta; wireless
       cache: eceasst-226.pdf
  plain text: eceasst-226.txt

        item: #252 of 858
          id: eceasst-227
      author: Wagner, Michael; Hogrefe, Dieter; Geihs, Kurt; David, Klaus
       title: Vorwort
        date: 2009-02-27
       words: 1557
      flesch: -5
     summary: WowKiVS 2009 7 / 8 Selbstorganisierende, Adaptive, Kontextsensitive verteilte Systeme (SAKS '09) Organisation Michael Zapf, Universität Kassel Klaus David, Universität Kassel Michael Wagner, Universität Kassel Programmkomitee Uwe Baumgarten, TU München Klaus David, Universität Kassel Kurt Geihs, Universität Kassel Klaus Herrmann, Universität Stuttgart Reinhold Kröger, FH Wiesbaden Klaus Mößner, University of Surrey, Gero Mühl, TU Berlin Christian Müller-Schloer, Leibniz-Universität Hannover Andreas Polze, Hasso-Plattner-Institut Gregor Schiele, Universität Mannheim Manfred Wojciechowski, Fraunhofer ISST Michael Zapf, Universität Kassel Beiträge Kontextsensitive Konfiguration und Ausführung verteilter Geschäftsprozesse Christoph Loeser, Ralf Trunko, Thilo Steckel, Kevin Podratz, Emanuel Georgiew, Frieder Swoboda Selbstverwaltung im WowKiVS 2009 5 / 8 Mobile Ad-Hoc Netzwerke (WMAN 2009) Organisation Matthias Frank, Universität Bonn Frank Kargl, Universität Ulm Burkhard Stiller, Universität und ETH Zürich Programmkomitee Matthias Frank, Universität Bonn Frank Kargl, Universität Ulm Burkhard Stiller, Universität Zürich Nils Aschenbruck, Universität Bonn Marc Bechler, BMW Group Torsten Braun, Universität Bern Georg Carle, TU München Vasilios Darlagiannis, EPFL Stefan Fischer, Universität Lübeck Hannes Hartenstein, Universität Karlsruhe Horst Hellbrück, FH Lübeck Matthias Hollick, TU Darmstadt Andreas J. Kassler, Universität Karlstad Tim Leinmüller, DENSO AUTOMOTIVE Pascal Lorenz, Universität Haute Alsace Peter Martini, Universität Bonn Martin Mauve, Universität Düsseldorf Michael Menth, Universität Würzburg Parag Mogre, TU Darmstadt Björn Scheuermann, Universität Düsseldorf Jochen Schiller, FU Berlin Elmar Schoch, Universität Ulm Ralf Steinmetz, TU Darmstadt Ralf Tönjes, FH Osnabrück Kurt Tutschku, NICT/Universität Wien Michael Weber, Universität Ulm Beiträge A Novel Opportunistic Spectrum Sharing Scheme for Cognitive Ad Hoc Networks Mohamed Abd rabou Kalil, Florian Liers, Thomas Volkert and Andreas Mitschele-Thiel Experimental Evaluation of Multi-Path Routing in a Wireless Mesh Network Inside a Building Thomas Staub, Stefan Ott and Torsten Braun Analysis of Inconsistent Routing Components in Reactive Routing Protocols Habib-ur Rehman and Lars Wolf Multi-hop Clock Synchronization in Wireless Ad-Hoc Networks Dennis Christmann, Reinhard Gotzhein, Thomas Kuhn ECEASST 6 / 8 Volume 17 (2009) Global Sensor Networks (GSN’09) Organisation Klaus Herrmann, Universität Stuttgart Boris Koldehofe, Universität Stuttgart Programmkomitee Falko Dressler, Universität Erlangen-Nürnberg Wilfried Elmenreich, Universität Klagenfurt Christof Fetzer, Universität Dresden Stefan Fischer, Universität Lübeck Thomas Fuhrmann, TU München Marcus Handte, Universität Bonn Holger Karl, Universität Paderborn Pedro Marron, Universität Bonn Hartmut Ritter, ScatterWeb GmbH Kay Römer, ETH Zürich Jochen Schiller, FU Berlin Stefan Weber, Trinity College, Dublin Klaus Wehrle, RWTH Aachen Beiträge A Secure Remote Authentication, Operation and Management Infrastructure for Distributed Wireless Sensor Network Testbeds Philipp Hurni, Thomas Staub, Gerald Wagenknecht, Markus Anwander, Torsten Braun Data Centric Peer-to-Peer Communication in Power Grids Christoph Gerdes and Jörg Müller Identifying the Challenges in Reducing Latency in GSN using Predictors Andreas Benzing, Klaus Herrmann, Boris Koldehofe and Kurt Rothermel Overcoming a Communication Barrier on the Way Towards a Global Sensor Network Jochen Furthmüller, Mario Pink, Hannes Hartenstein and Oliver P. Waldhorst Security and Privacy Challenges in the Internet of Things Christoph P. Mayer Decentralized Probabilistic World Modeling with Cooperative Sensing Arjan Peddemors and Eiko Yoneki Intelligente Wechselbrückensteuerung für die Logistik von Morgen Alexander Podlich, Thomas Weise, Manfred Menze, Christian Gorldt Vorwort Proc.
    keywords: andreas; beiträge; darmstadt; der; die; geihs; kassel; klaus; kurt; michael; thomas; und; universität; universität kassel; workshops
       cache: eceasst-227.pdf
  plain text: eceasst-227.txt

        item: #253 of 858
          id: eceasst-228
      author: Gerdes, Christoph; Eger, Kolja; Müller, Jörg
       title: Data Centric Peer-to-Peer Communication in Power Grids
        date: 2009-03-26
       words: 5068
      flesch: 56
     summary: The data centric approach is highly beneficial in large networks such as power networks where a small fraction of nodes is constantly being added or replaced or do fail. We propose methods and an architecture for data centric communication in power networks; a proof-of-concept decentralized communication infrastructure is presented that uses and advances state of the art peer-to-peer and distributed data management protocols to provide real time access to network state information.
    keywords: architecture; communication; data; execution; group; indexing; language; network; nodes; peer; power; processing; queries; query; systems
       cache: eceasst-228.pdf
  plain text: eceasst-228.txt

        item: #254 of 858
          id: eceasst-229
      author: Turky, Abutaleb Abdelmohdi; Mitschele-Thiel, Andreas
       title: Prediction-based Decentralized Routing Algorithm
        date: 2009-03-26
       words: 3910
      flesch: 63
     summary: The future load on network links depends on many parameters such as network topology, network load condition (inter-arrival rate of requests and holding time of these requests in the network) and the behaviour of the used routing algorithm. a. Compute LW(i) of outgoing link i on every link in the backward path.
    keywords: algorithm; ant; link; load; network; pdr; prediction; routing; time
       cache: eceasst-229.pdf
  plain text: eceasst-229.txt

        item: #255 of 858
          id: eceasst-23
      author: Llorens, Marisa; Oliver, Javier
       title: A basic tool for the modeling of Marked-Controlled Reconfigurable Petri Nets
        date: 2007-05-15
       words: 5606
      flesch: 70
     summary: Even though the expressiveness of Petri nets and marked-controlled reconfigurable Petri nets is the same, with marked- controlled reconfigurable Petri nets, we can easily and directly model concurrent and distributed systems that change their structure dynamically. The goal of these lines of research is to enhance the expressiveness of the basic model of Petri nets so that it can support the description of structural dynamic changes in concurrent and distributed systems.
    keywords: configuration; mcrn; net; nets; petri; places; reconfigurable; rewriting; state; tool
       cache: eceasst-23.pdf
  plain text: eceasst-23.txt

        item: #256 of 858
          id: eceasst-230
      author: Singh, Lally; Gračanin, Denis
       title: Load Characterization for Distributed Virtual Environments
        date: 2009-03-30
       words: 4879
      flesch: 54
     summary: Combined with new re- quirements elicitation and analysis techniques for DVE system performance, we expect further capabilities to relate load requirements to the resource requirements of an analyzed DVE. In either case, the analyst must look at the collected data to determine the viability of these transformations: the spatial behavior of users differs between different DVE systems and specific terrains.
    keywords: analysis; cell; data; density; dve; load; model; performance; requirements; system; user; visibility
       cache: eceasst-230.pdf
  plain text: eceasst-230.txt

        item: #257 of 858
          id: eceasst-231
      author: Köhler-Bußmeier, Michael; Moldt, Daniel
       title: Analysis of Mobile Agents using Invariants of Object Nets
        date: 2009-11-21
       words: 8156
      flesch: 79
     summary: The formalism of mobile object nets is well suited to this finer granularity of namespaces while elementary objects are not since for object nets each place is one single namespace. The expressibility of mobile object nets leads to the fact that mobile object net can simulate Petri nets with inhibitor arcs (cf.
    keywords: eos; marking; mobile; net; nets; object; system; tokens
       cache: eceasst-231.pdf
  plain text: eceasst-231.txt

        item: #258 of 858
          id: eceasst-232
      author: Bottoni, Paolo; De Rosa, Fabio; Mecella, Massimo
       title: Using Resources as Synchronizers to Manage Mobile Process Adaptation
        date: 2009-11-21
       words: 8915
      flesch: 62
     summary: Control channels represent the business policies of the process; they describe tem- poral relations among process tasks, i.e. when a task can be carried out with respect to the execution of other process tasks. There may also be a distinct data channel between process tasks for communicating data elements between two tasks.
    keywords: data; execution; member; process; resources; rewriting; rule; rule(id; set; start(name; system; tasks; team; wippog
       cache: eceasst-232.pdf
  plain text: eceasst-232.txt

        item: #259 of 858
          id: eceasst-233
      author: Bottoni, Paolo; Saporito, Andrea
       title: Resource-based enactment and adaptation of workflows from activity diagrams
        date: 2009-09-08
       words: 5111
      flesch: 57
     summary: Section 4 dis- cusses the triple metamodel relating activity diagrams and multiset rewriting rules, and illustrates the translation process, while Section 5 presents the basic mechanisms for coherent modification of diagrams and rules. The abstract representation of resource rewriting rules can actually be translated to several concrete rule-based languages, as discussed in Section 6.
    keywords: activity; control; data; diagrams; figure; node; resources; rewriting; rule; triple; workflow
       cache: eceasst-233.pdf
  plain text: eceasst-233.txt

        item: #260 of 858
          id: eceasst-234
      author: Beierle, Christoph; Kern-Isberner, Gabriele
       title: On the Modelling of an Agent's Epistemic State and its Dynamic Changes
        date: 2009-11-21
       words: 6762
      flesch: 52
     summary: Besides certain (logical) knowledge, epistemic states are supposed to allow the representation of preferences, beliefs, assumptions etc. of an intelligent agent. Keywords: knowledge representation, agent model, epistemic state, belief change, abstract state machine 1 Introduction Any intelligent agent must be capable to represent knowledge internally and to reason about it.
    keywords: agent; belief; conditionals; function; knowledge; probability; representation; revision; sentences; set; state
       cache: eceasst-234.pdf
  plain text: eceasst-234.txt

        item: #261 of 858
          id: eceasst-235
      author: Corradini, Andrea; Tuosto, Emilio
       title: Preface
        date: 2009-07-20
       words: 636
      flesch: 40
     summary: Annegret Habel Oldenburg (Germany) Reiko Heckel Leicester (United Kingdom) Doctoral Symposium ICGT 2008 2 / 3 ECEASST Program Committee Paolo Baldan Padova (Italy) Luciano Baresi Milano (Italy) Michel Bauderon Bordeaux (France) Andrea Corradini (co-chair)
    keywords: conference; germany; icgt; symposium; volume
       cache: eceasst-235.pdf
  plain text: eceasst-235.txt

        item: #262 of 858
          id: eceasst-236
      author: Striewe, Michael; Goedicke, Michael
       title: Using a Triple Graph Grammar for State Machine Implementations
        date: 2009-07-04
       words: 6384
      flesch: 59
     summary: Section 3 explains the formal base of our approach in terms of type graphs and mappings and gives an example. 3 Defining the approach In this section, we describe the formal parts our approach is based on in terms of type graphs and mappings.
    keywords: approach; code; graph; machine; model; rules; source; state; syntax; triple; type
       cache: eceasst-236.pdf
  plain text: eceasst-236.txt

        item: #263 of 858
          id: eceasst-237
      author: Dodds, Mike; Plump, Detlef
       title: From Hyperedge Replacement to Separation Logic and Back
        date: 2009-07-04
       words: 8638
      flesch: 71
     summary: We define a representation function α mapping heaps to corresponding heap graphs. Keywords: hyperedge replacement, separation logic, graph grammars, program verification, graph transformation 1 Introduction Hyperedge replacement grammars and separation-logic formulas both define classes of graph- like structures.
    keywords: formula; function; grammars; graph; heap; hyperedge; let; logic; nil; predicate; replacement; separation
       cache: eceasst-237.pdf
  plain text: eceasst-237.txt

        item: #264 of 858
          id: eceasst-238
      author: Matos, Carlos; Heckel, Reiko
       title: Migrating Legacy Systems to Service-Oriented Architectures
        date: 2009-07-04
       words: 5646
      flesch: 49
     summary: In order to obtain the final code, the forward engineering step uses the information gathered in the redesign step to drive code transformations. 6.2 Reverse engineering The abstract syntax tree representation, adequate for code annotation, is not scalable for the re- design step.
    keywords: annotation; code; dimension; engineering; graph; legacy; proc; services; soa; software; step; transformation; work
       cache: eceasst-238.pdf
  plain text: eceasst-238.txt

        item: #265 of 858
          id: eceasst-239
      author: Rouvoy, Romain; Wagner, Michael
       title: Preface
        date: 2009-06-04
       words: 802
      flesch: 17
     summary: CAMPUS 2009 3 Organization Steering Committee Frank Eliassen University of Oslo, Norway Kurt Geihs University of Kassel, Germany Svein Hallsteinsen SINTEF ICT, Norway Geir Horn SINTEF ICT, Norway Valérie Issarny INRIA, France Organizing Committee Program chair Romain Rouvoy University of Lille 1, France & University of Oslo, Norway Publication chair Michael Wagner University of Kassel, Germany Program Committee Olivier Barais University de Rennes 1, France Benoit Baudry INRIA, France Yolande Berbers K.U.Leuven, Belgium Gordon Blair Lancaster University, UK Licia Capra University College of London, UK Ruzanna Chitchyan Lancaster University, UK Denis Conan Institut TELECOM, SudParis, France Geoff Coulson Lancaster University, UK Schahram Dustdar Vienna University of Technology, Austria Frank Eliassen University of Oslo, Norway Kurt Geihs University of Kassel, Germany Svein Hallsteinsen SINTEF ICT, Norway Geir Horn SINTEF ICT, Norway Joseph Loyall BBN Technologies, Massachusetts René Meier Trinity College Dublin, Ireland Nearchos Paspallis University of Cyprus, Cyprus Roland Reichle University of Kassel, Germany Romain Rouvoy University of Lille 1, France & University of Oslo, Norway Ulrich Scholz European Media Laboratory GmbH, Germany Lionel Seinturier University of Lille 1, France Sotirios Terzis University of Strathclyde, UK Michael Wagner University of Kassel, Germany External Referees Christoph Evers University of Kassel, Germany Lukasz Jusczyk Vienna University of Technology, Austria ECEASST 4 Volume 19 (2009) Contents Language Abstractions for RFID Technology Andoni Lombide Carreton, Kevin Pinte and Wolfgang De Meuter 5 TOTAM: Scoped Tuples for the Ambient Christophe Scholliers, Elisa Gonzalez Boix and Wolfgang De Meuter 19 VOLARE: Thus, the CAMPUS workshop will focus on the promising approaches in the domain of context aware adaptation mechanisms supporting the dynamic evolution of the execution context (e.g., network/device/service failures).
    keywords: adaptation; context; germany; norway; university; workshop
       cache: eceasst-239.pdf
  plain text: eceasst-239.txt

        item: #266 of 858
          id: eceasst-24
      author: Karsai, Gabor; Taentzer, Gabriele
       title: Preface to GraMoT 2006 Workshop Proceedings
        date: 2006-12-11
       words: 469
      flesch: 36
     summary: The workshop consisted of 11 papers, organized into four thematic sessions: (1) Relations between model transformation languages, (2) Syntax checking, (3) Execution of graph transformations and model transformations, and (4) Semantics of model transformations. Recent research has shown that graph transformation is a promising formalism to specify model transformations.
    keywords: model; workshop
       cache: eceasst-24.pdf
  plain text: eceasst-24.txt

        item: #267 of 858
          id: eceasst-240
      author: Bisztray, Dénes; Heckel, Reiko; Ehrig, Hartmut
       title: Verification of Architectural Refactorings: Rule Extraction and Tool Support
        date: 2009-07-04
       words: 5254
      flesch: 59
     summary: 6 Tool Support This section discusses tool support that enables the developers to refactor system architecture, extract refactoring rules and verify them. A mapping sem has been defined from the UML diagrams to CSP processes by means of graph transformation rules.
    keywords: context; extraction; graph; pushout; refactoring; rule; transformation; verification
       cache: eceasst-240.pdf
  plain text: eceasst-240.txt

        item: #268 of 858
          id: eceasst-241
      author: Scholliers, Christophe; Gonzalez Boix, Elisa; De Meuter, Wolfgang
       title: TOTAM: Scoped Tuples for the Ambient
        date: 2009-06-04
       words: 7224
      flesch: 59
     summary: Players periodi- cally send their latest location information (e.g. GPS coordinates) to any nearby team member by means of location tuples. In order to update the visual representation of nearby team members, for example a dot in the campus map, players subscribe to the arrival of location tuples as follows:
    keywords: ambient; blue; descriptors; location; mobile; network; scope; space; team; totam; tuple; tuple space
       cache: eceasst-241.pdf
  plain text: eceasst-241.txt

        item: #269 of 858
          id: eceasst-242
      author: Lombide Carreton, Andoni; Pinte, Kevin; De Meuter, Wolfgang
       title: Language Abstractions for RFID Technology
        date: 2009-06-04
       words: 5998
      flesch: 52
     summary: However, such a col- lection of RFID tag objects is highly volatile because of the volatile connections with the RFID tags. Language Abstractions for RFID Technology Electronic Communications of the EASST Volume 19 (2009) Proceedings of the Second International DisCoTec Workshop on Context-aware Adaptation Mechanisms for Pervasive and Ubiquitous Services (CAMPUS 2009) Language Abstractions for RFID Technology Andoni Lombide Carreton, Kevin Pinte, Wolfgang De Meuter 13 pages Guest Editors: Romain Rouvoy, Michael Wagner Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Language Abstractions for RFID Technology Andoni Lombide Carreton1, Kevin Pinte2, Wolfgang De Meuter3 1 alombide@vub.ac.be, 2 kpinte@vub.ac.be, 3 wdmeuter@vub.ac.be Programming Technology Lab Vrije Universiteit Brussel, Belgium Abstract: Developing pervasive and context-aware applications that make use of RFID technology is a daunting task given the high degree of failures inherent to communication with RFID tags.
    keywords: actor; ambienttalk; event; language; message; network; objects; programming; reference; rfid; tags
       cache: eceasst-242.pdf
  plain text: eceasst-242.txt

        item: #270 of 858
          id: eceasst-243
      author: Papakos, Panagiotis; Rosenblum, David S.; Mukhija, Arun; Capra, Licia
       title: VOLARE: Adaptive Web Service Discovery Middleware for Mobile Systems
        date: 2009-06-04
       words: 3329
      flesch: 49
     summary: Keywords: mobile systems, semantic Web, context awareness, Web services, service discovery, quality of service metrics 1 Introduction Service discovery is of vital importance in the architecture of a Service Centric System (SCS). From the provider side, Web services are advertised via schematic descriptions, which describe the functionality of the service and advertise the QoS levels that this service can provide [Ben05].
    keywords: context; device; mobile; provider; service; volare; web
       cache: eceasst-243.pdf
  plain text: eceasst-243.txt

        item: #271 of 858
          id: eceasst-244
      author: Vanrompay, Yves; Kirsch-Pinheiro, Manuele; Berbers, Yolande
       title: Context-Aware Service Selection with Uncertain Context Information
        date: 2009-06-04
       words: 4865
      flesch: 43
     summary: Service context requirements are modeled following the MUSIC context modeling approach, presented in the previous section. These are services whose description is enriched with context information related to the service execu- tion environment and adaptation capabilities.
    keywords: context; degree; information; mean; music; selection; service; uncertainty; utility
       cache: eceasst-244.pdf
  plain text: eceasst-244.txt

        item: #272 of 858
          id: eceasst-245
      author: Anthony, Richard John; Chen, Dejiu; Pelc, Mariusz; Persson, Magnus; Torngren, Martin
       title: Context-Aware Adaptation in DySCAS
        date: 2009-06-11
       words: 7633
      flesch: 37
     summary: The System Condition&Status Description package imports the data types of system configuration and augments them with related dynamic condition and status information. This description uses the basic data types of system configuration item and the variability concepts.
    keywords: adaptation; application; component; configuration; context; control; data; design; dyscas; figure; information; management; middleware; policy; qos; self; software; system; time
       cache: eceasst-245.pdf
  plain text: eceasst-245.txt

        item: #273 of 858
          id: eceasst-246
      author: Khan, Mohammad Ullah; Reichle, Roland; Wagner, Michael; Geihs, Kurt; Scholz, Ulrich; Kakousis, Constantinos; Papadopoulos, George A.
       title: An Adaptation Reasoning Approach for Large Scale Component-based Applications
        date: 2009-06-11
       words: 5813
      flesch: 43
     summary: The number of application variants (section 0) increases rapidly with the number of component types participating in a composition. This technique will enable evaluation of composition plan utilities, without recalculating utilities of unaffected component types.
    keywords: adaptation; application; approach; component; composition; plan; reasoning; types; utility; variants
       cache: eceasst-246.pdf
  plain text: eceasst-246.txt

        item: #274 of 858
          id: eceasst-247
      author: Payton, Jamie; Souvenir, Richard; Liu, Dingxiang
       title: An Architecture to Support Learning-based Adaptation of Persistent Queries in Mobile Environments
        date: 2009-06-11
       words: 3265
      flesch: 51
     summary: The goal of this paper is to provide automated support for the processes involved in deciding when and how to adapt persistent queries. 4 Related Work Query processing for streaming data has been an active area of research in the sensor networks community [IGE+03, MFHH03, MFHH02], and several query processing systems provide some version of persistent queries, typically implemented as a sequence of one-time queries.
    keywords: inquiry; learning; module; network; queries; query; strategy; time
       cache: eceasst-247.pdf
  plain text: eceasst-247.txt

        item: #275 of 858
          id: eceasst-248
      author: Hammoudeh, Mohammad; Newman, Robert; Mount, Sarah
       title: Modelling Clustering of Wireless Sensor Networks with Synchronised Hyperedge Replacement
        date: 2009-07-04
       words: 6426
      flesch: 60
     summary: each dependent node does the following: 6. calculate S 7. forwarded current cluster head id and received n and m values 8. IF S′ > S THEN 11. leave current cluster head 12.
    keywords: cluster; clustering; head; membership; modelling; network; nodes; nutrient; sensor; shr; wsns
       cache: eceasst-248.pdf
  plain text: eceasst-248.txt

        item: #276 of 858
          id: eceasst-249
      author: Hermann, Frank
       title: Permutation Equivalence of DPO Derivations with Negative Application Conditions based on Subobject Transformation Systems
        date: 2009-07-04
       words: 8457
      flesch: 56
     summary: It allows us to first characterise equivalent derivations with NACs within an STS. This shows that switch equiva- lence with NACs based on sequential independence of derivations with NACs [HHT96, LEO06, LEOP08] only leads to a subclass of equivalent derivations and in general, many equivalent derivations cannot be derived.
    keywords: analysis; derivation; equivalence; nacs; permutation; person; rule; sts; systems; task; transformation
       cache: eceasst-249.pdf
  plain text: eceasst-249.txt

        item: #277 of 858
          id: eceasst-25
      author: Massoni, Tiago
       title: An Approach to Invariant-based Program Refactoring
        date: 2007-02-20
       words: 3878
      flesch: 51
     summary: Our intuition is that catalogs of program refactorings could be extended with improvements based on invariants, conditionally applied based on a set of found invariants. However, program invariants – semantic information about classes and fields assumed valid during program exe- cution – are not considered by this precondition checking.
    keywords: approach; dir; field; invariants; object; program; refactoring; transformations
       cache: eceasst-25.pdf
  plain text: eceasst-25.txt

        item: #278 of 858
          id: eceasst-251
      author: Khan, Ajab; Torrini, Paolo; Heckel, Reiko
       title: Model-based Simulation of VoIP Network Reconfigurations using Graph Transformation Systems
        date: 2009-07-04
       words: 6557
      flesch: 58
     summary: As an example of graph transformation rule in a GSGTS we then consider the chronos rule clock tick in fig. Incremental pattern matching [VV04] is an approach in the implementation of graph transformation systems that can help to cope with this issue.
    keywords: figure; graph; list; model; network; node; packet; rule; simulation; stochastic; systems; time; transformation; voip
       cache: eceasst-251.pdf
  plain text: eceasst-251.txt

        item: #279 of 858
          id: eceasst-252
      author: Barbosa, Luis Soares; Cerone, Antonio; Shaikh, Siraj Ahmed
       title: Preface
        date: 2009-11-26
       words: 711
      flesch: 21
     summary: The organisers would also like to thank members of the ETAPS 2009 Organising Committee and the staff at the University of York for their logistical, administrative and technical support before and during the event. June 2009 1 / 2 Volume 20 (2009) mailto:lsb@di.uminho.pt mailto:antonio@iist.unu.edu mailto:s.shaikh@coventry.ac.uk Preface Committees Steering Committee - Bernhard Aichernig, Technical University of Graz, Austria - Antonio Cerone, United Nations University, Macau SAR China - Martin Michlmayr, University of Cambridge, UK - David von Oheimb, Siemens AG, Germany - José Nuno Oliveira, University of Minho, Portugal Program Committee - Luı́s Soares Barbosa (Co-chair), University of Minho, Portugal - Manuel Barbosa, University of Minho, Portugal - Roberto Barbuti, Università di Pisa, Italy - Cornelia Boldyreff, University of Lincoln, UK - Vicky Bush, University of Gloucestershire, UK - Andrea Capiluppi, University of Lincoln, UK - Antonio Cerone (Co-chair), United Nations University, Macau SAR China - Gabriel Ciobanu, Alexandru Ioan Cuza University, Romania - Ernesto Damiani, University of Milan, Italy - Roberto Di Cosmo, Université Paris Diderot - Paris 7, France - Jesus Arias Fisteus, Universidad Carlos III de Madrid, Spain - Dan Ghica, University of Birmingham, UK - Stefania Gnesi, ISTI-CNR, Italy - Sotiris Ioannidis, FORTH-ICS, Greece - Tomasz Janowski, United Nations University, Macau SAR China - Fabio Kon, University of São Paulo, Brazil - Paddmanabhan Krishnan, Bond University, Australia - Bernard Lang, INRIA, France - John Noll, Santa Clara University, USA - David von Oheimb, Siemens Corporate Technology, Germany - Alexander K. Petrenko, ISP RAS, Russia - Simon Pickin, Universidad Carlos III de Madrid, Spain - Siraj Ahmed Shaikh (Co-chair), Cranfield University, UK - Volker Stolz, United Nations University, Macau SAR China - Ralf Treinen, Université Paris Diderot - Paris 7, France - Joost Visser, Software Improvement Group, the Netherlands - Tanja Vos, Universidad Politécnica de Valencia, Spain - Tony Wasserman, Carnegie Mellon University, USA Proc. Preface Luı́s Soares Barbosa, Antonio Cerone and Siraj Ahmed Shaikh 2 pages Guest Editors: Luis S. Barbosa, Antonio Cerone, Siraj A. Shaikh Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Preface Luı́s Soares Barbosa1, Antonio Cerone2 and Siraj Ahmed Shaikh3 1 lsb@di.uminho.pt, University of Minho, Portugal 2 antonio@iist.unu.edu, United Nations University, Macau SAR China 3 s.shaikh@coventry.ac.uk Coventry University, UK Free/Libre/Open Source Software (FLOSS) has proved to be very successful over the years.
    keywords: international; software; source; university; workshop
       cache: eceasst-252.pdf
  plain text: eceasst-252.txt

        item: #280 of 858
          id: eceasst-253
      author: Taylor, Richard
       title: Understanding how OSS Development Models can influence assessment methods
        date: 2009-11-26
       words: 6527
      flesch: 57
     summary: This paper documents the more common develop- ment models used by OSS projects and explores the complex landscape of stake- holders that these models expose. This paper the more common development models used by OSS projects and explores the complex landscape of stakeholders that these models expose.
    keywords: assessment; code; cots; developers; development; models; oss; oss projects; projects; software; source; support
       cache: eceasst-253.pdf
  plain text: eceasst-253.txt

        item: #281 of 858
          id: eceasst-254
      author: Grohmann, Davide; Miculan, Marino
       title: Deriving Barbed Bisimulations for Bigraphical Reactive Systems
        date: 2009-07-20
       words: 7515
      flesch: 69
     summary: Intuitively, IPO barbed bisimilarity is finer than barbed bisimilarity because IPO barbs can 13 / 15 Volume 16 (2009) Deriving Barbed Bisimulations for Bigraphical Reactive Systems Rule IPO barb Decorated IPO barb in1 {n} {n(amb)} in2 {n} {n(amb)} in3 {n} {n(〈amb, in)〉} in4 {n0, n1} {n0(int), n1(int)} out1 {n} {n(amb)} out2 {n} {n(amb)} out3 {n0, n1} {n0(int), n1(int)} open1 {n} {n(open)} open2 {n} {n(amb)} open3 {n0, n1} {n0(int), n1(int)} Figure 10: This leads to two notions of barb, IPO barb and decorated IPO barb, which differ on the information about names we extract from IPO labels: in the decorated version, we take advantage of the link and place graphs of the IPO labels to observe also the “role” that each name has in reactions.
    keywords: barbed; barbs; bigraphs; bisimilarity; ipo; names; systems
       cache: eceasst-254.pdf
  plain text: eceasst-254.txt

        item: #282 of 858
          id: eceasst-255
      author: Khoroshilov, Alexey
       title: Open Source Certification and Educational Process
        date: 2009-11-26
       words: 3008
      flesch: 41
     summary: Seminars and practical workshops of courses can use open source certification tasks if a sub- ject of a course has explicit intersection with testing or verification methods and tools, which are used in the open source certification community. Thus, there are two directions for implementing open source certification tasks within educa- tional process: methodical and organizational ones.
    keywords: certification; process; software; source; students; tasks; testing
       cache: eceasst-255.pdf
  plain text: eceasst-255.txt

        item: #283 of 858
          id: eceasst-256
      author: Nesov, Vladimir
       title: Automatically Finding Bugs in Open Source Programs
        date: 2009-11-26
       words: 4877
      flesch: 55
     summary: Automatically Finding Bugs in Open Source Programs Vladimir Nesov 10 pages Guest Editors: Luis Barbosa, Antonio Cerone, Siraj Shaikh Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Automatically Finding Bugs in Open Source Programs Vladimir Nesov nesov@ispras.ru Institute for System Programming of the Russian Academy of Sciences Abstract: We consider properties desirable for static analysis tools targeted at find- ing bugs in the real open source code, and review tools based on various approaches to defect detection. Static analysis tools may be used as a basis for program certification processes [BP08].
    keywords: analysis; bugs; checkers; code; defect; detection; function; programs; source; tools; value
       cache: eceasst-256.pdf
  plain text: eceasst-256.txt

        item: #284 of 858
          id: eceasst-257
      author: Ruiz, Jose F; Comar, Cyrille
       title: Open-DO: Open Framework for Critical Systems
        date: 2009-11-26
       words: 5179
      flesch: 47
     summary: Tool providers can provide a complete supported solution more easily when tools are shared, and open software tools offers an ideal showcase for open technologies. The use of open software tools eases their integration and communication, allowing users to adapt, add or replace the different components, and permitting easier modification and tracking of the workflow.
    keywords: certification; code; development; level; open; processes; requirements; safety; software; source; systems; tools
       cache: eceasst-257.pdf
  plain text: eceasst-257.txt

        item: #285 of 858
          id: eceasst-259
      author: Pfalzgraf, Jochen; Soboll, Thomas
       title: On a General Notion of Transformation for Multiagent Systems and its Implementation
        date: 2009-11-21
       words: 8905
      flesch: 67
     summary: The objects of MAS are Mul- tiagent Systems and the morphisms are MAS morphisms. To be able to model this in categorical no- tions we define the category of all MAS where the objects are typed categories representing the Multiagent Systems in the above sense and the morphisms are MAS morphisms i.e. covariant typed functors between the typed categories.
    keywords: agents; arrows; category; general; mas; morphisms; multiagent; object; set; systems; types
       cache: eceasst-259.pdf
  plain text: eceasst-259.txt

        item: #286 of 858
          id: eceasst-26
      author: Koenig, Barbara
       title: Graph transformation systems, Petri nets and Semilinear Sets: Checking for the Absence of Forbidden Paths in Graphs
        date: 2007-05-15
       words: 5303
      flesch: 70
     summary: First we define the notion of Petri graph which will be used to represent an over-approximation of a given GTS. A marking is reachable (coverable) in Petri graph if it is reachable (coverable) in the underlying Petri net with the multiset ι⊕(EG0 ) as the initial marking.
    keywords: euler; graph; marking; net; paths; petri; semilinear; set; systems; transformation
       cache: eceasst-26.pdf
  plain text: eceasst-26.txt

        item: #287 of 858
          id: eceasst-260
      author: Rensink, Arend; Kuperus, Jan-Hendrik
       title: Repotting the Geraniums: On Nested Graph Transformation Rules
        date: 2009-09-08
       words: 6161
      flesch: 67
     summary: This puts the rule beyond what can be formulated in other approaches to parallel graph transformation rules, such as the cloning rules of [18] or the set nodes and star rules in PROGRES [24], except in the extension recently proposed in [9] — see Section 5 for a more extensive discussion. Nested quantification in graph transformation rules.
    keywords: diagram; figure; formula; geraniums; graph; nested; nodes; rule; transformation
       cache: eceasst-260.pdf
  plain text: eceasst-260.txt

        item: #288 of 858
          id: eceasst-261
      author: Bruni, Roberto; Lluch Lafuente, Alberto
       title: Ten virtues of structured graphs
        date: 2009-09-08
       words: 8042
      flesch: 58
     summary: Ten virtues of structured graphs Roberto Bruni and Alberto Lluch Lafuente 20 pages Guest Editors: Artur Boronat, Reiko Heckel Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Ten virtues of structured graphs Roberto Bruni1 and Alberto Lluch Lafuente1 1bruni@di.unipi.it 2lafuente@di.unipi.it Dipartimento di Informatica, Università di Pisa Abstract: This paper extends the invited talk by the first author about the virtues of structured graphs. We have tried to write an ADR agnostic paper where we raise some drawbacks of flat, unstructured graphs for the design and analysis of software systems and we argue that hierarchi- cal, structured graphs can alleviate such drawbacks.
    keywords: approaches; example; figure; graphs; instance; model; requirements; section; software; structure; systems; transformation; type
       cache: eceasst-261.pdf
  plain text: eceasst-261.txt

        item: #289 of 858
          id: eceasst-262
      author: Mazanek, Steffen; Minas, Mark
       title: Generating Correctness-Preserving Editing Operations for Diagram Editors
        date: 2009-09-08
       words: 5141
      flesch: 58
     summary: However, for a generic approach the user’s selection can be interpreted as follows: A selection should induce editing operations that separate the user-selected diagram part, add to it new diagram components, and finally paste the extended diagram part back into the remaining diagram such that it is correct again. Next, the generation of editing operations is described more formally and the relevance criteria are defined.
    keywords: diagram; editing; fig; hypergraph; operations; stmt; stmt stmt; user
       cache: eceasst-262.pdf
  plain text: eceasst-262.txt

        item: #290 of 858
          id: eceasst-263
      author: Mazanek, Steffen; Minas, Mark
       title: Contraction of Unconnected Diagrams using Least Cost Parsing
        date: 2009-09-08
       words: 5568
      flesch: 64
     summary: In the following the process of finding the correct diagram closest to a rough arrangement of diagram components is called diagram contraction. Extended DIAGEN editing process Hypergraph patches can be naturally used in diagram editors [MMM08b].
    keywords: components; contraction; cost; derivation; diagram; fig; hypergraph; layer; nsd; stmt
       cache: eceasst-263.pdf
  plain text: eceasst-263.txt

        item: #291 of 858
          id: eceasst-265
      author: Bergmann, Gábor; Ráth, István; Varró, Dániel
       title: Parallelization of Graph Transformation Based on Incremental Pattern Matching
        date: 2009-09-08
       words: 6700
      flesch: 48
     summary: [EEKR99] based approach for model transformations, there are even more possibilities for the exploitation of parallelism. Finally, we discuss related work in Section 6 and conclude the paper in Section 7. 2 Foundations of model transformation
    keywords: container; figure; graph; manipulation; matcher; matching; message; model; parallel; pattern; place; rete; thread; transformation; update
       cache: eceasst-265.pdf
  plain text: eceasst-265.txt

        item: #292 of 858
          id: eceasst-266
      author: Fish, Andrew
       title: Euler Diagram Transformations
        date: 2009-09-08
       words: 8701
      flesch: 63
     summary: The effects of altering rule sets within an automated reasoning environment for Euler diagram systems were investigated in [SMF+07]. Artur Boronat, Reiko Heckel Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Euler Diagram Transformations Andrew Fish1 1 andrew.fish@brighton.ac.uk, http://www.brighton.ac.uk/cmis/contact/details.php?uid=agf School of Computing, Mathematical and Information Sciences University of Brighton, UK Abstract: Euler diagrams are a visual language which are used for purposes such as the presentation of set-based data or as the basis of visual logical languages which can be utilised for software specification and reasoning.
    keywords: abstract; concrete; conditions; diagram; dual; euler; graph; label; level; set; transformations; vertex
       cache: eceasst-266.pdf
  plain text: eceasst-266.txt

        item: #293 of 858
          id: eceasst-267
      author: Ermel, Claudia; Ehrig, Hartmut; Ehrig, Karsten
       title: Refactoring of Model Transformations
        date: 2009-09-08
       words: 7420
      flesch: 57
     summary: Moreover suitable verifi- cation techniques are available, e.g. architectural refactoring by rule extraction [BHE08]. From a technical point of view, in this paper we apply model refactoring rules Q deleting (on edges) to non-deleting transformation rules P, which is in some sense dual to the S2A- construction of animation rules PA from simulation rules PS in [EE08], where non-deleting rules Q are applied to deleting rules PS. Figure 3 shows an overview of changes in the type graph and the necessity of changing (migrating) the corre- sponding models and/or model transformation rules, as well.
    keywords: figure; graph; model; model transformation; refactoring; rules; state; transformation
       cache: eceasst-267.pdf
  plain text: eceasst-267.txt

        item: #294 of 858
          id: eceasst-268
      author: Giese, Holger; Hildebrandt, Stephan; Seibel, Andreas
       title: Improved Flexibility and Scalability by Interpreting Story Diagrams
        date: 2009-09-08
       words: 5865
      flesch: 55
     summary: Furthermore, once the MDE environment is deployed to end- users, adding or updating existing Story Diagrams requires an additional mechanism to generate Story Diagram code, compile the code and integrate it into the running MDE environment. One the other hand, Story Diagrams can 1 http://www.fujaba.de 2 http://www.eclipse.org/modeling/emf/ 1 / 12 Volume 18 (2009) mailto:[holger.giese$|$stephan.hildebrandt$|$andreas.seibel]@hpi.uni-potsdam.de Improved Flexibility and Scalability by Interpreting Story Diagrams be modified and re-executed by the Story Diagram interpreter immediately without recompiling the source code and restarting the application.
    keywords: code; diagrams; fujaba; interpreter; meta; model; n.a; pattern; story; story diagrams; strategy
       cache: eceasst-268.pdf
  plain text: eceasst-268.txt

        item: #295 of 858
          id: eceasst-269
      author: Padberg, Julia; Biermann, Enrico; Hoffmann, Kathrin
       title: Layered Architecture Consistency for MANETs: Introducing New Team Members
        date: 2009-11-21
       words: 6383
      flesch: 59
     summary: and we have conformance of activity rules and team member nets (see Def. 3 and Def. 4 in [BMH06]). 1. compatibility with the place refinement, i. e. the specialization rule spec(r) is compatible with the morphism pg0, 2. existence of activity rules, i.e. for each m there are activity rules rm over p and 3. conformance of activity rules and team member nets, i.e. tm0 rm =⇒ tm1 is compatible with T0 r =⇒ T1. Proof.
    keywords: fig; layer; member; mobility; net; nets; team; team member; workflow
       cache: eceasst-269.pdf
  plain text: eceasst-269.txt

        item: #296 of 858
          id: eceasst-270
      author: Ehrig, Hartmut; Hermann, Frank; Sartorius, Christoph
       title: Completeness and Correctness of Model Transformations based on Triple Graph Grammars with Negative Application Conditions
        date: 2009-09-08
       words: 8405
      flesch: 69
     summary: If a forbidden structure is present around the selected match, the corresponding rule is not applicable and the match is invalid, i.e. NACs restrict the applicability of model transformation rules. Our new result can be used to check, whether a model transforma- tion performed by an algorithm using triple graph transformations with NACs such as [SK08] is correct (see Section 7).
    keywords: graph; model; nac; nacs; rules; source; transformation; � �
       cache: eceasst-270.pdf
  plain text: eceasst-270.txt

        item: #297 of 858
          id: eceasst-272
      author: Tveit, Merete Skjelten
       title: A Meta-Model-Based Approach for Specification of Graphical Representations
        date: 2009-09-08
       words: 5478
      flesch: 51
     summary: The focus in this paper is mainly on the conceptual parts of the approach, nevertheless, a prototype that can be used to define graphical languages and generate graphical editors based on the description is implemented on the GMF platform, and is outlined in Section 4. We consider a diagram expressed in a graphical language as a collection of graphical elements that are arranged in various ways.
    keywords: approach; diagram; elements; language; meta; model; representation; specification
       cache: eceasst-272.pdf
  plain text: eceasst-272.txt

        item: #298 of 858
          id: eceasst-273
      author: West, Scott; Kahl, Wolfram
       title: A Generic Graph Transformation, Visualisation, and Editing Framework in Haskell
        date: 2009-09-08
       words: 8160
      flesch: 52
     summary: Due to the differences between the Figure object web structure and the conceptual graph struc- ture it is intended to represent, programming graph transformations is therefore not well-served by the Figure-based model. Therefore we start graph transformations by adding a “pure view” to the object-oriented view of a drawing representing a graph.
    keywords: approach; dpo; framework; g n; graph; graph transformation; haskell; interface; label; level; monad; n e; node; object; programming; transformation; type
       cache: eceasst-273.pdf
  plain text: eceasst-273.txt

        item: #299 of 858
          id: eceasst-275
      author: Machado, Rodrigo; Foss, Luciana; Ribeiro, Leila
       title: Aspects for Graph Grammars
        date: 2009-09-16
       words: 5681
      flesch: 68
     summary: [HET08]. In this work we address the issue of crosscutting concerns in graph grammars, and propose the definition of graph aspects to modularize their treatment. , An] of graph aspects over G .
    keywords: aspect; definition; grammars; graph; log; productions; weaving
       cache: eceasst-275.pdf
  plain text: eceasst-275.txt

        item: #300 of 858
          id: eceasst-276
      author: Schimmel, Jochen; Gelhausen, Tom; Schaefer, Christoph
       title: Gene Expression with General Purpose Graph Rewriting Systems
        date: 2009-09-24
       words: 4265
      flesch: 57
     summary: The recently increased performance of graph rewriting systems suggests the applicability of this alternative. 4 Runtime Observations For a long time, graph rewriting systems have not been an option to simulate complex biological processes, though the benefits of the formal representation of biochemical reactions are widely accepted.
    keywords: dna; expression; gene; graph; polymerase; process; promoter; protein; rewriting; rna; simulation; systems
       cache: eceasst-276.pdf
  plain text: eceasst-276.txt

        item: #301 of 858
          id: eceasst-277
      author: Boronat, Artur; Heckel, Reiko
       title: Preface of the Post-proceedings of the 8th International Workshop on Graph Transformation and Visual Modeling Techniques
        date: 2009-09-24
       words: 618
      flesch: 30
     summary: Gabor Karsai (Vanderbilt University, US) � Jochen Küster (IBM Zürich Research) � Juan de Lara (University of Madrid, Spain) � Tihamér Levendovszky (TU Budapest, Hungary) � Mark Minas (Universität der Bundeswehr München, Germany) � Francesco Parisi-Presicce (University of Rome, Italy) � Arend Rensink (University of Twente, Netherlands) � Gabriele Taentzer (Univ. of Marburg, Germany) � Dániel Varró (TU Budapest, Hungary) � Ehrard Weinell (RWTH Aachen University) � Martin Wirsing (Ludwig-Maximilians-Universität München, Germany) � Albert Zündorf (University of Kassel, Germany) External Reviewers Bapodra, Mayur Horváth, Ákos Becker, Basil Jubeh, Ruben Biermann, Enrico Maier, Sonja Brieler, Florian Mazanek, Steffen Foss, Luciana Ráth, István Gadducci, Fabio Seibel, Andreas Gerth, Christian Soltenborn, Christian Guerra, Esther Varró-Gyapay, Szilvia Hildebrandt, Stephan GT-VMT 2009 3 / 3 Programme Chairs Artur Boronat (University of Leicester, UK)
    keywords: germany; university; workshop
       cache: eceasst-277.pdf
  plain text: eceasst-277.txt

        item: #302 of 858
          id: eceasst-279
      author: Shaikh, Siraj Ahmed; Cerone, Antonio
       title: Towards a metric for Open Source Software Quality
        date: 2009-11-26
       words: 4379
      flesch: 50
     summary: [HIRH07] emphasise the role good communication and management play in the production of good quality open source software. Towards a metric for Open Source Software Quality Siraj A. Shaikh and Antonio Cerone 11 pages Guest Editors: Luis Barbosa, Antonio Cerone, Siraj Shaikh Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Towards a metric for Open Source Software Quality Siraj A. Shaikh1 and Antonio Cerone2 1 s.shaikh@coventry.ac.uk Department of Computing and the Digital Environment Faculty of Engineering and Computing, Coventry University, Coventry, UK 2 antonio@iist.unu.edu, http://www.iist.unu.edu/∼antonio International Institute for Software Technology United Nations University, Macau SAR China Abstract: Software quality is more than just conformance to a set of requirements and represents many attributes related to each other that make up a piece of soft- ware.
    keywords: code; design; development; engineering; factors; metric; open; quality; software; source
       cache: eceasst-279.pdf
  plain text: eceasst-279.txt

        item: #303 of 858
          id: eceasst-280
      author: Rubanov, Vladimir
       title: Automatic Analysis of Applications for Portability Across Linux Distributions
        date: 2009-11-26
       words: 3855
      flesch: 37
     summary: This inhibits growth of Linux applications and the adoption of the platform itself as developers want to develop applications for Linux not just for RedHat or Suse. The second part of the database (also known as Linux Foundation Ecosystem Knowledge Base) is most interesting for the topic of this paper because it is this part that enabled creation of the Linux Application Checker tool for automated analysis of cross-distribution portability of Linux applications.
    keywords: application; distributions; interfaces; libraries; linux; lsb
       cache: eceasst-280.pdf
  plain text: eceasst-280.txt

        item: #304 of 858
          id: eceasst-281
      author: Ciobanu, Gabriel; Lucanu, Dorel
       title: Model-based Testing and Analysis of Coordinated Components
        date: 2009-11-26
       words: 5171
      flesch: 54
     summary: We specify the components via pre- and post-conditions on object methods, a coordination process via a CCS process algebra, and the wrapper as a mapping of (parameterized) pairs of actions to sequences of components methods. Coordination process and coordinated components are rather independent; the coordinator can be composed and replaced easily, some objects working under the same coordinator can be refined or modified.
    keywords: action; atm; bank; components; interaction; methods; model; process; specification; testing
       cache: eceasst-281.pdf
  plain text: eceasst-281.txt

        item: #305 of 858
          id: eceasst-282
      author: Levendovszky, Tihamer; Lengyel, László; Karsai, Gabor; Hardebolle, Cécile
       title: Preface
        date: 2009-11-26
       words: 759
      flesch: 34
     summary: Electronic Communications of the EASST Volume 21 (2009) Guest Editors: T. Levendovszky, L. Lengyel, G. Karsai, C. Hardebolle Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 Proceedings of the 3 rd International Workshop on Multi-Paradigm Modeling (MPM 2009) Preface Tihamér Levendovszky, László Lengyel, Gabor Karsai, and Cécile Hardebolle 4 Pages ECEASST 2 / 4 Volume 21 (2009) Preface Tihamér Levendovszky 1 , László Lengyel 2 , Gabor Karsai 1 , and Cécile Hardebolle 3 1 Vanderbilt University, USA, {tihamer,gabor}@isis.vanderbilt.edu, 2 Budapest University of Technology and Economics, Hungary, lengyel@aut.bme.hu, 3 Supélec, France, cecile.hardebolle@supelec.fr This volume of ECEASST presents the contributions of the Workshop on Multi-Paradigm Modeling 2009 held as a satellite event of MoDELS 2009 in Denver, CO, USA. In “Toward Automated Verification of Model Transformations: A Case Study of Analysis of Refactoring Business Process Models” Márk Asztalos et al show methods to validate model transformations.
    keywords: model; modeling; mpm; transformation; university
       cache: eceasst-282.pdf
  plain text: eceasst-282.txt

        item: #306 of 858
          id: eceasst-284
      author: Groothuis, Marcel; Frijns, Raymond; Voeten, Jeroen; Broenink, Jan
       title: Concurrent Design of Embedded Control Software
        date: 2009-11-26
       words: 5322
      flesch: 51
     summary: Abstract: Embedded software design for mechatronic systems is becoming an increasingly time-consuming and error-prone task. Furthermore, the code generation must preserve model behavior (e.g. preserving timing properties).
    keywords: behavior; code; control; design; ecs; event; integration; level; model; process; software; system; time
       cache: eceasst-284.pdf
  plain text: eceasst-284.txt

        item: #307 of 858
          id: eceasst-285
      author: Yie, Andres; Cassallas, Rubby; Deridder, Dirk; Wagelaar, Dennis
       title: A practical approach to multi-modeling views composition
        date: 2009-11-26
       words: 4710
      flesch: 51
     summary: A weaving model (correspondence model) is defined between the data model and the composition model, and an additional weaving is defined between the composition model and the navigation model. A practical approach to multi-modeling views composition Andres Yie, Rubby Casallas, Dirk Deridder and Dennis Wagelaar 10 pages Guest Editors: T. Levendovszky, L. Lengyel, G. Karsai, C. Hardebolle Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST A practical approach to multi-modeling views composition Andres Yie13∗, Rubby Casallas2, Dirk Deridder4† and Dennis Wagelaar5‡ 1 a-yie@uniandes.edu.co 2 rcasallas@uniandes.edu.co Grupo de Construcción de Software Universidad de los Andes, Bogota, Colombia 3 ayiegarz@vub.ac.be 4 dirk.deridder@vub.ac.be 5 dennis.wagelaar@vub.ac.be System and Software Engineering Lab (SSEL) Vrije Universiteit Brussel, Brussels, Belgium Abstract: The use of several view models to specify a complex system is a common practice to provide the most appropriate abstractions to model its diverse concerns.
    keywords: application; composition; correspondence; elements; language; level; level models; modeling; models
       cache: eceasst-285.pdf
  plain text: eceasst-285.txt

        item: #308 of 858
          id: eceasst-286
      author: Rajhans, Akshay; Cheng, Shang-Wen; Schmerl, Bradley; Garlan, David; Krogh, Bruce H.; Agbi, Clarence; Bhave, Ajinkya
       title: An Architectural Approach to the Design and Analysis of Cyber-Physical Systems
        date: 2009-11-26
       words: 3907
      flesch: 44
     summary: Abstract: This paper presents an extension of existing software architecture tools to model physical systems, their interconnections, and the interactions between physical and cyber components. This is because the components and connectors in software architectural styles are inadequate for representing the types of physical components found in CPS and their interactions with cyber entities.
    keywords: architecture; components; connectors; cyber; elements; furnace; physical; software; style; systems; temperature
       cache: eceasst-286.pdf
  plain text: eceasst-286.txt

        item: #309 of 858
          id: eceasst-287
      author: Asztalos, Márk; Lengyel, László; Levendovszky, Tihamér
       title: Toward Automated Verification of Model Transformations: A Case Study of Analysis of Refactoring Business Process Models
        date: 2009-11-26
       words: 2512
      flesch: 56
     summary: We have previously proposed a formalization to declar- atively describe model transformations and proposed an approach for the verifica- tion. Keywords: model transformations, automated verification, offline analysis 1 Introduction In Multi-Paradigm Modeling , model transformations are used to transform models between different paradigms (for example, synchronization), or for generating new models by compos- ing existing models (for example, generating source code using different models in different paradigms) .
    keywords: bpmnsequenceflow; model; transformation; type
       cache: eceasst-287.pdf
  plain text: eceasst-287.txt

        item: #310 of 858
          id: eceasst-289
      author: Schuster, Andreas; Sprinkle, Jonathan
       title: Synthesizing Executable Simulations from Structural Models of Component-Based Systems
        date: 2009-11-26
       words: 4546
      flesch: 43
     summary: In recent work a number of different projects for robotics and real-time systems have ad- dressed the issue of code duplication through the creation of software frameworks [BSK03, S+02, MBK06, Che07] Common in each of these frameworks is the goal to improve software reuse: those that are component-based define how interfaces should be specified (for the devel- opment of new components), as well as how components can be assembled (for the application of existing components). As we have pointed out, though, the effort to perform reconfiguration of such components can be nontrivial.
    keywords: approach; component; configuration; files; language; middleware; models; orca; robotics; simulation; software; systems
       cache: eceasst-289.pdf
  plain text: eceasst-289.txt

        item: #311 of 858
          id: eceasst-29
      author: Padberg, Julia; Margaria, Tiziana; Taentzer, Gabriele
       title: Editorial
        date: 2006-12-11
       words: 380
      flesch: 41
     summary: , we are very happy to present the first volume of the new peer-reviewed, scientific, and open access journal Electronic Communications of the EASST. In this way, ECEASST grants full-text access to all the papers and sup- ports the provision of fast and broad feedback to published work.
    keywords: journal
       cache: eceasst-29.pdf
  plain text: eceasst-29.txt

        item: #312 of 858
          id: eceasst-290
      author: Kühne, Thomas; Mezei, Gergely; Syriani, Eugene; Vangheluwe, Hans; Wimmer, Manuel
       title: Systematic Transformation Development
        date: 2009-11-26
       words: 4161
      flesch: 45
     summary: In particular, we explore and suggest ways to systemat- ically support developers in creating transformation languages by means of semi- automated metamodeling. This provides a systematic procedure for explicitly modeling transformation languages.
    keywords: figure; input; language; metamodels; modeling; output; pattern; specification; transformation
       cache: eceasst-290.pdf
  plain text: eceasst-290.txt

        item: #313 of 858
          id: eceasst-292
      author: Mészáros, Tamás; Levendovszky, Tihamér; Mezei, Gergely
       title: Code Generation with the Model Transformation of Visual Behavior Models
        date: 2009-11-26
       words: 4008
      flesch: 44
     summary: Recent solutions usually bind visualization properties to model properties, and achieve animation by manipulating model properties. Model properties are usually modified with model transformation or direct API calls.
    keywords: animation; animator; model; modeling; rule; state; transformation; vaf; vaf rule
       cache: eceasst-292.pdf
  plain text: eceasst-292.txt

        item: #314 of 858
          id: eceasst-300
      author: Systa, Tarja; Jiang, Juanjuan
       title: A Pattern-Based Approach to Manage Model References
        date: 2009-11-28
       words: 3780
      flesch: 44
     summary: This calls for an instantiation specification of model references. In this paper we propose a pattern-based approach for modeling, specifying, and finally applying model references.
    keywords: approach; collaboration; instantiation; model; pattern; references; role; tool
       cache: eceasst-300.pdf
  plain text: eceasst-300.txt

        item: #315 of 858
          id: eceasst-301
      author: Barroca, Bruno Fontes; Lucio, Levi Silva; Amaral, Vasco Moreira; Pedro, Luis Miguel; Buchs, Didier
       title: DSL Composition for model-based test generation
        date: 2009-12-06
       words: 4499
      flesch: 49
     summary: Another example of implicit composition of model based testing languages with another language is presented in SpecEx- plorer [CGN+05]. More precisely, test cases are generated by: expanding test intentions into intermediate formulas that solve recursion and test intention composition; finding substitutions for remaining variables in those formulas by solving conditions associated to the test intention; ”playing” the ground formulas (now test cases) against the operational semantics of the HALL model to check if that model satisfies the formulas — thus binding the oracle to each test case.
    keywords: composition; dsl; hall; language; model; rules; satel; semantics; test
       cache: eceasst-301.pdf
  plain text: eceasst-301.txt

        item: #316 of 858
          id: eceasst-302
      author: Gheorghe Iugan, Luiza; Nicolescu, Gabriela; O'Connor, Ian
       title: Modeling and Formal Verification of a Passive Optical Network on Chip Behavior
        date: 2009-12-06
       words: 4865
      flesch: 54
     summary: [Bri+07] Brière, M. et al.: “Towards the high level design of optical networks on chip. [Bri+04] Brière, M. et al.: “Design and behavioral modeling tools for optical network-on-chip”, Proc. of DATE’04.
    keywords: automata; chip; figure; initiator; modeling; network; router; time; verification; λλλλ4444
       cache: eceasst-302.pdf
  plain text: eceasst-302.txt

        item: #317 of 858
          id: eceasst-304
      author: Roggenbach, Markus
       title: Preface
        date: 2009-12-17
       words: 631
      flesch: 18
     summary: Swansea, December 2009 Markus Roggenbach AVOCS 2009 Program Committee David Aspinall University of Edinburgh, Scotland, UK Muffy Calder University of Glasgow, Scotland, UK Michael Goldsmith University of Warwick, UK Constance Heitmeyer Naval Research Laboratory, Washington DC, USA Gerald Luettgen University of Bamberg, Germany Eric Mercer Brigham Young University, Utah, USA Stephan Merz INRIA, Nancy, France Alice Miller University of Glasgow, Scotland, UK Paritosh Pandya IIT Mumbai, India Silvio Ranise University of Verona, Italy Markus Roggenbach (Chair) Swansea University, Wales, UK Bill Roscoe University of Oxford, UK Mark Ryan University of Birmingham, UK Helen Treharne University of Surrey, UK Markus Wenzel TU München, Germany Sergio Yovine Verimag, France AVOCS 2009 Reviewers Arnold Beckmann Swansea University, Wales, UK Ulrich Berger Swansea University, Wales, UK Jan Calta Humboldt University Berlin, Germany Jean-Christophe Filliatre Université Paris Sud, France Dominique Mery INRIA, Nancy, France Jan Tobias Muehlberg University of Bamberg, Germany Dirk Pattinson Imperial College London, UK Heiko Schmidt University of Bamberg, Germany Stefano Tonetta FBK-Irst, Italy Edward Turner University of Surrey, UK Dennis Walter Bremen University, Germany David Williams University of Surrey, UK Proc. I am grateful to the Department of Computer Science at Swansea University for hosting the event and thank IT Wales for sponsoring AVOCS 2009.
    keywords: avocs; university; verification
       cache: eceasst-304.pdf
  plain text: eceasst-304.txt

        item: #318 of 858
          id: eceasst-305
      author: Schiffelers, Ramon R.H.; Theunissen, Rolf J.M.; van Beek, Dirk A.; Rooda, Jacobus E.
       title: Model-Based Engineering of Supervisory Controllers using CIF
        date: 2010-02-09
       words: 5388
      flesch: 53
     summary: At a later stage in the design process, more detailed, e.g. timed or hybrid, plant models can be developed. Although Supervisory Control Theory ensures that the controller is proven correct by construction, it remains a non-trivial task (but easier than the development of the supervisory controller itself) to define the correct plant and requirement models, and errors or undesired behavior might still exist in the plant models and/or requirement models.
    keywords: cif; control; controller; design; engineering; hybrid; model; plant; requirements; simulation; supervisor; system
       cache: eceasst-305.pdf
  plain text: eceasst-305.txt

        item: #319 of 858
          id: eceasst-306
      author: André, Étienne; Sproston, Jeremy; Fribourg, Laurent
       title: An Extension of the Inverse Method to Probabilistic Timed Automata
        date: 2009-12-17
       words: 9394
      flesch: 67
     summary: Propk=3 Same as π0 π0 1 2 1 315 4 6 4 1 yes 1 0.183593 0.017032 - π1 1 2 1 150 4 6 4 1 yes 1 0.183593 0.017032 yes π2 1 2 1 6 4 6 4 1 yes 1 0.183593 0.017032 yes π3 1 2 1 315 10 12 4 1 yes 1 0.183593 0.017032 yes π4 1 2 1 12 10 12 4 1 yes 1 0.183593 0.017032 yes π5 2 4 2 630 8 12 8 2 yes 1 0.183593 0.017032 yes π6 2 4 2 315 8 10 7 2 yes 1 0.183593 0.017032 yes Table 3: Maximum probability of either station’s backoff counter reaching k 5 Final Remarks In this paper we have shown that the inverse method presented in [3] can be applied, not just to non-probabilistic parametric timed automata, but also to their probabilistic extension, for proving time-abstract properties. Markus Roggenbach Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST An Extension of the Inverse Method to Probabilistic Timed Automata Étienne André1, Laurent Fribourg1, Jeremy Sproston2 1 LSV – ENS de Cachan & CNRS, France 2 Dipartimento di Informatica, Università di Torino, Italy Abstract: Probabilistic timed automata can be used to model systems in which probabilistic and timing behavior coexist.
    keywords: automata; constraint; method; model; parameters; parametric; probabilistic; time; valuation; yes
       cache: eceasst-306.pdf
  plain text: eceasst-306.txt

        item: #320 of 858
          id: eceasst-307
      author: Palikareva, Hristina; Ouaknine, Joel; Roscoe, Bill
       title: Faster FDR Counterexample Generation Using SAT-Solving
        date: 2009-12-17
       words: 8132
      flesch: 66
     summary: SAT ] ] states FDR FDR PAT SymFDR SymFDR freq. checked -Div SAT Total 20 41 703 0 0 6.14 6.92 10.23 10 20 10.82 14.06 20 23 411 976 5 0 2.16 11.21 16.72 12 23 6.62 12.33 23 26 4 048 216 72 0 7.23 27.73 35.16 13 26 15.39 24.66 26 29 28 249 254 581 1 89.93 54.29 65.39 15 29 39.33 49.61 29 32 > 139 000 000 > 11 700 5 8.91 175.05 189.20 16 32 187 000 000∗ 2 640∗ 172.56 186.61 32 35 — — 1 485 399 529.88 548.80 18 35 291.59 309.94 35 38 — — 43 1773.19 1 047.01 1 071.59 19 38 41 — — 4 198.77 1 584.62 1 617.09 41 41 Table 2: Performance comparison – chess knight tour (] = N2 + 1) N FDR Time (sec.) SAT ] ] states FDR FDR PAT Direct SymFDR SymFDR freq. checked -Div
    keywords: boolean; checking; csp; encoding; fdr; model; process; processes; refinement; sat; set; states; symfdr; system
       cache: eceasst-307.pdf
  plain text: eceasst-307.txt

        item: #321 of 858
          id: eceasst-308
      author: Peralta, Julio C.; Gautier, Thierry
       title: Towards SMV Model Checking of Signal (multi-clocked) Specifications
        date: 2009-12-17
       words: 7683
      flesch: 63
     summary: 13 / 15 Volume 23 (2009) Model Checking SIGNAL Boolean SMV variables are used to model SIGNAL clocks. Delay See SMV translation in Figure 2(a).
    keywords: boolean; checking; clock; fifo; model; signal; smv; translation; value; variables
       cache: eceasst-308.pdf
  plain text: eceasst-308.txt

        item: #322 of 858
          id: eceasst-311
      author: Stappers, Frank; Reniers, Michel
       title: Verification of safety requirements for program code using data abstraction
        date: 2009-12-17
       words: 7989
      flesch: 57
     summary: In the translation the following actions are used • Starts(C) denotes a request for starting process C; • Startr(C) denotes acceptance of the request for starting process C (by process C); • Dones(C) denotes the return of process C (by C); • Doner(C) denotes notification of termination for a run of process C; • Suspends(C) denotes the suspension of process C. AVOCS 2009 4 / 17 ECEASST • Resumer(C) denotes the acceptance of the request to resume process C; • Resumes(C) denotes the request to resume process C that is suspended.
    keywords: abstraction; behaviour; code; data; mcrl2; model; process; processes; program; properties; requirements; safety; set; system; task; variables; verification
       cache: eceasst-311.pdf
  plain text: eceasst-311.txt

        item: #323 of 858
          id: eceasst-312
      author: Besnard, Loïc; Gautier, Thierry; Moy, Matthieu; Talpin, Jean-Pierre; Johnson, Kenneth; Maraninchi, Florence
       title: Automatic translation of C/C++ parallel code into synchronous formalism using an SSA intermediate form
        date: 2009-12-17
       words: 7957
      flesch: 64
     summary: 3.2.2 Addition of control signals In the C to SIGNAL translation, input and output signals of the SIGNAL process resulting from the translation of a C procedure correspond to the parameters of the procedure. The control flow is modeled with the notion of clock: a parallel assignment in SIGNAL has its clock activated when the corresponding piece of SSA code would be executed.
    keywords: c++; clock; code; control; parallel; scheduler; signal; ssa; systemc; translation
       cache: eceasst-312.pdf
  plain text: eceasst-312.txt

        item: #324 of 858
          id: eceasst-314
      author: Bowen, Judy; Reeves, Steve
       title: UI-Design Driven Model-Based Testing
        date: 2010-01-04
       words: 7276
      flesch: 52
     summary: Once we have corrected this problem all of the I Behaviour tests are passed. This is the full set of abstract tests we derive from the models for the SimpleCalendar application.
    keywords: behaviours; dayview; design; model; state; system; testing; tests; user
       cache: eceasst-314.pdf
  plain text: eceasst-314.txt

        item: #325 of 858
          id: eceasst-315
      author: Arapinis, Myrto; Calder, Muffy; Dennis, Louise; Fisher, Michael; Gray, Philip; Konur, Savas; Miller, Alice; Ritter, Eike; Ryan, Mark; Schewe, Sven; Unsworth, Chris; Yasmin, Rehana
       title: Towards the Verification of Pervasive Systems
        date: 2010-01-04
       words: 6699
      flesch: 60
     summary: Current state of the art formal methods appear incapable of coping with the verification de- mand introduced by pervasive systems, primarily because reasoning about such systems requires considering quantitative, continuous and stochastic behaviour. Current state of the art of formal methods appears incapable of coping with the verification demand introduced by pervasive systems, because reasoning about such systems requires com- binations of multiple dimensions such as quantitative, continuous and stochastic behaviour to be considered, and requires proving properties which are quite subtle to express.
    keywords: checking; computer; example; logic; match; model; patient; properties; property; safety; security; systems; time; tools; verification
       cache: eceasst-315.pdf
  plain text: eceasst-315.txt

        item: #326 of 858
          id: eceasst-316
      author: Affeldt, Reynald; Nowak, David; Yamada, Kiyoshi
       title: Certifying Assembly with Formal Cryptographic Proofs: the Case of BBS
        date: 2009-12-17
       words: 7229
      flesch: 62
     summary: In this paper, we address the issue of formal verification of cryptographic assembly code with cryptographic proofs. As pointed out above, formal verification of cryptographic assembly code and formal verification of cryptographic proofs are not the same matter, even though both deals with cryptography.
    keywords: assembly; bbs; code; cryptographic; logic; proofs; semantics; verification
       cache: eceasst-316.pdf
  plain text: eceasst-316.txt

        item: #327 of 858
          id: eceasst-317
      author: Anderson, Hugh; Ciobanu, Gabriel
       title: Markov Abstractions for Probabilistic Pi-Calculus
        date: 2010-01-04
       words: 7708
      flesch: 60
     summary: Markov processes are viewed as a set of random variables {Xt}, where the time index t runs through an ordered set. In addition, efficient libraries and procedures for calculating probabilities or rates have been developed over the long history of Markov processes, and we can obtain results using these efficient arithmetic techniques.
    keywords: -calculus; analysis; markov; matrix; process; processes; state; time; transition
       cache: eceasst-317.pdf
  plain text: eceasst-317.txt

        item: #328 of 858
          id: eceasst-318
      author: Charlton, Nathaniel; Reus, Bernhard
       title: A decidable class of verification conditions for programs with higher order store
        date: 2009-12-17
       words: 9175
      flesch: 77
     summary: Entailments in our class combine simple symbolic heaps, which are descriptions of the heap using a subset of separation logic, with (limited use of) nested Hoare triples to specify properties of higher order procedures. Several papers have investigated the theoretical aspects of adapting separation logic for use with higher order programs.
    keywords: 7→{|cnt; ctr; order; procedure; ssh; triples
       cache: eceasst-318.pdf
  plain text: eceasst-318.txt

        item: #329 of 858
          id: eceasst-319
      author: Gast, Holger; Trieflinger, Julia
       title: High-level Proofs about Low-level Programs
        date: 2009-12-17
       words: 7988
      flesch: 68
     summary: Its foremost feature is the explicit formalization of memory layouts and a flexible mechanism for automated reasoning about the disjointness of memory regions. [ORY01] capture both the memory content and the memory layout, and thus the disjointness of memory regions, at the same time.
    keywords: block; curr; level; list; logic; memory; separation; src; struct
       cache: eceasst-319.pdf
  plain text: eceasst-319.txt

        item: #330 of 858
          id: eceasst-320
      author: Calder, Muffy; Gray, Phil; Unsworth, Chris
       title: Tightly coupled verification of pervasive systems
        date: 2010-01-04
       words: 7379
      flesch: 56
     summary: Keywords: formal models, pervasive systems, model checking 1 Introduction Effective verification of interactive systems has been a significant challenge for both the verifi- cation and user interface communities for at least the last two decades [CH97, CRB07]. Pervasive systems are characterised by their ability to sense their physical environment and a use of data so gathered both as part of the core application functionality and as a way of mod- ifying system behaviour to reflect changes in the context of use.
    keywords: configuration; context; example; input; mam; message; model; process; rule; set; system; user; verification
       cache: eceasst-320.pdf
  plain text: eceasst-320.txt

        item: #331 of 858
          id: eceasst-321
      author: Bonnefon, Jean-François; Longin, Dominique; Nguyen, Manh Hung
       title: A Logical Framework for Trust-Related Emotions
        date: 2010-01-04
       words: 6672
      flesch: 65
     summary: Awarenessiϕ def = X−1¬Beli ϕ ∧Beli ϕ (DefAwarenessi ) The Beli operators satisfy the following principles of introspection: Beli ϕ ↔Beli Beli ϕ (4Beli ) ¬Beli ϕ ↔Beli ¬Beli ϕ (5Beli ) that means that agent i is conscious of its beliefs and of its disbeliefs.
    keywords: action; agent; beli; distrust; emotions; proposition; report; trust
       cache: eceasst-321.pdf
  plain text: eceasst-321.txt

        item: #332 of 858
          id: eceasst-322
      author: Lüth, Christoph
       title: User Interfaces for Theorem Provers: Necessary Nuisance or Unexplored Potential?
        date: 2009-12-17
       words: 3586
      flesch: 57
     summary: Markus Roggenbach Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST User Interfaces for Theorem Provers: Necessary Nuisance or Unexplored Potential? Christoph Lüth Deutsches Forschungszentrum für Künstliche Intelligenz, Bremen Abstract: This note considers the design of user interfaces for interactive theorem provers. Keywords: user interfaces, theorem provers, interactive theorem proving 1 Introduction Theorem provers need to be interactive, and interactive theorem provers need user interfaces.
    keywords: interaction; interfaces; proof; provers; proving; script; theorem; user
       cache: eceasst-322.pdf
  plain text: eceasst-322.txt

        item: #333 of 858
          id: eceasst-324
      author: Huth, Michael; Piterman, Nir; Wang, Huaxin
       title: A workbench for preprocessor design and evaluation: toward benchmarks for parity games
        date: 2009-12-17
       words: 6940
      flesch: 67
     summary: This workbench is aimed at facilitating two activities: to aid in the design, validation, and evaluation of preprocessors for parity game solvers; and to aid in the generation of benchmark parity games that are meaningful for a wide range of solvers. In this paper we argued the utility of a workbench that can generate and store parity games with two ends in mind: to aid in the design, validation, and evaluation of preprocessors for parity game solvers; and to aid in the generation of benchmark parity games that are meaningful for a wide range of solvers.
    keywords: games; nodes; parity; player; preprocessors; query; res(g; solvers; workbench
       cache: eceasst-324.pdf
  plain text: eceasst-324.txt

        item: #334 of 858
          id: eceasst-325
      author: Brown, Neil Christopher Charles
       title: Automatically Generating CSP Models for Communicating Haskell Processes
        date: 2010-01-05
       words: 4678
      flesch: 58
     summary: Communicating Haskell Processes (CHP) 1 / 12 Volume 23 (2009) mailto:neil@twistedsquare.com http://www.cs.kent.ac.uk/~nccb2/ Automatically Generating CSP Models for Communicating Haskell Processes 2 CHP Although Haskell is a functional programming language, it has support for imperative program- ming through the concept of monads: a monad captures a common pattern that can be used for imperative programming.
    keywords: channel; chp; csp; haskell; process; processes; program; skip
       cache: eceasst-325.pdf
  plain text: eceasst-325.txt

        item: #335 of 858
          id: eceasst-326
      author: Cariou, Eric; Belloir, Nicolas; Barbier, Franck; Djemam, Nidal
       title: OCL contracts for the verification of model transformations
        date: 2010-01-24
       words: 6602
      flesch: 52
     summary: In [CMSD04a, CMSD04b], we established conceptual bases of specifying transformations through model transformation contracts written in OCL (Object Constraint Language [OMG06]). Section 2 recalls the concept of model transformation contract.
    keywords: class; contract; mapping; model; ocl; source; source model; target; target model; transformation
       cache: eceasst-326.pdf
  plain text: eceasst-326.txt

        item: #336 of 858
          id: eceasst-327
      author: Chimiak-Opoka, Joanna Dobroslawa; Demuth, Birgit; Silingas, Darius; Rouquette, Nicolas F.
       title: Requirements Analysis for an Integrated OCL Development Environment
        date: 2010-01-04
       words: 6667
      flesch: 47
     summary: We based our selection on passive observation of improvement in OCL tool and IDE landscape as well as an active participation in OCL tool development. The results of our analysis and the long term vision of our work should be relevant to developers of OCL tools as well as to the OMG Request for Information regarding the UML Futures1.
    keywords: analysis; concepts; context; development; features; ide4ocl; language; metamodel; model; ocl; pragmatics; requirements; specification; statement; tool
       cache: eceasst-327.pdf
  plain text: eceasst-327.txt

        item: #337 of 858
          id: eceasst-329
      author: Clark, Tony
       title: A MOP Based DSL for Testing Java Programs using OCL
        date: 2010-01-04
       words: 5470
      flesch: 53
     summary: in if class = null then self.error(Cannot find Java class + descriptor.type()) Finally, XMF provides an interface to Java where compiled Java classes can be manipulated as ordinary XMF classes.
    keywords: class; end; implementation; java; language; mop; ocl; post; pre; testing; xmf
       cache: eceasst-329.pdf
  plain text: eceasst-329.txt

        item: #338 of 858
          id: eceasst-33
      author: Balland, Emilie; Moreau, Pierre-Etienne
       title: Optimizing Pattern Matching Compilation by Program Transformation
        date: 2007-02-20
       words: 5760
      flesch: 60
     summary: This paper shows that using program transformation rules to optimize pattern matching is an efficient solution, with respect to algorithms based on automata. In [BKM06], Tom programs are 1 http://tom.loria.fr 1 / 14 Volume 3 (2006) mailto:Emilie.Balland@loria.fr mailto:Pierre-Etienne.Moreau@loria.fr Optimizing Pattern Matching Compilation By Program Transformation Definition of the data-structure public class PeanoExample { ... Term plus(Term t1, Term t2) { %match(t1, t2) { x,zero -> { return x; } x,suc(y) -> { return suc(plus(x,y)); } } } void run() { System.out.println(plus(1,2) = + plus(suc(zero),suc(suc(zero)))); } } Parser Backend Output Program Compiler Optimizer Tom Compiler PIL PIL Input Program Figure 1: General architecture of Tom: the compiler generates an intermediate PIL program which is optimized before being pretty-printed by the back-end into the host-language.
    keywords: code; matching; pattern; program; rule; tom; transformation
       cache: eceasst-33.pdf
  plain text: eceasst-33.txt

        item: #339 of 858
          id: eceasst-331
      author: Berger, Ulrich; Lloyd, Sion
       title: A coinductive approach to verified exact real number computation
        date: 2009-12-17
       words: 6953
      flesch: 72
     summary: Keywords: Proof theory, program extraction, exact real number computation, coin- duction 1 Introduction In current implementations of main stream programming languages real numbers are represented in floating point format, and computation on real numbers is done with respect to this represen- tation. Such approaches are currently promoted under the slogan “computing with exact real numbers”.
    keywords: numbers; program
       cache: eceasst-331.pdf
  plain text: eceasst-331.txt

        item: #340 of 858
          id: eceasst-332
      author: Berger, Ulrich
       title: Proofs-as-Programs in Computable Analysis
        date: 2009-12-17
       words: 2080
      flesch: 58
     summary: We have extracted from constructive proofs programs that compute high iterations of the logistic map, integrals of continuous functions, the constant π , and functions defined power series. Markus Roggenbach Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Proofs-as-Programs in Computable Analysis (extended abstract) Ulrich Berger u.berger@swansea.ac.uk, http://cs.swan.ac.uk/∼csulrich/ University of Wales Swansea, Swansea, SA2 8PP, Wales UK Abstract: Since the work of Brouwer, Kolmogorov, Goedel, Kleene and many others we know that constructive proofs have computational meaning.
    keywords: analysis; berger; logic; programs; proofs; springer; theory
       cache: eceasst-332.pdf
  plain text: eceasst-332.txt

        item: #341 of 858
          id: eceasst-333
      author: Brüning, Jens; Wolff, Andreas
       title: Declarative Models for Business Processes and UI Generation using OCL
        date: 2010-01-12
       words: 5828
      flesch: 53
     summary: Bruening, Andreas.Wolff}@uni-rostock.de Abstract: This paper presents an approach to model business processes and associated user interfaces in a declarative way, relying on constraints. Problems of connecting the USE implementation of declarative process models to UI modeling and generation have been discussed.
    keywords: activities; business; declarative; interface; meta; model; ocl; process; uio; user; workflow
       cache: eceasst-333.pdf
  plain text: eceasst-333.txt

        item: #342 of 858
          id: eceasst-334
      author: Clavel, Manuel; Egea, Marina; García de Dios, Miguel Angel
       title: Checking Unsatisfiability for OCL Constraints
        date: 2010-01-04
       words: 4157
      flesch: 50
     summary: The work presented here belongs to the third category: it proposes a mapping from OCL to first-order logic, which is defined with the purpose of supporting (unbounded) unsatisfiability checks for OCL expressions using automated reasoning tools. Checking Unsatisfiability for OCL Constraints Electronic Communications of the EASST Volume 24 (2009) Proceedings of the Workshop The Pragmatics of OCL and Other Textual Specification Languages at MoDELS 2009 Checking Unsatisfiability for OCL Constraints Manuel Clavel, Marina Egea and Miguel A. Garcı́a de Dios 13 pages Guest Editors: J. Cabot, J. Chimiak-Opoka, F. Jouault, M. Gogolla, A. Knapp Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Checking Unsatisfiability for OCL Constraints Manuel Clavel1, Marina Egea2 and Miguel A. Garcı́a de Dios3∗ 1 manuel.clavel@imdea.org 3 miguelangel.garcia@imdea.org IMDEA Software Institute, Madrid, Spain Departamento de Sistemas Informáticos y Computación Universidad Complutense de Madrid, Spain 2 marinae@inf.ethz.ch Information Security / ZISC ETH Zürich, Switzerland Abstract: In this paper we propose a mapping from a subset of OCL into first- order logic (FOL) and use this mapping for checking the unsatisfiability of sets of OCL constraints.
    keywords: constraints; expressions; fol; formulas; function; mapping; ocl; unsatisfiability
       cache: eceasst-334.pdf
  plain text: eceasst-334.txt

        item: #343 of 858
          id: eceasst-335
      author: Padberg, Julia; Hoffmann, Kathrin
       title: Preface
        date: 2009-12-17
       words: 329
      flesch: 36
     summary: Preface Electronic Communications of the EASST Volume 12 (2008) Formal Modeling of Adaptive and Mobile Processes Preface Kathrin Hoffmann, Julia Padberg 1 pages Guest Editors: Julia Padberg, Kathrin Hoffmann Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Preface Kathrin Hoffmann1, Julia Padberg2 1Institute for Software Technology and Theoretical Computer Science Technical University Berlin, Germany 2University of Applied Sciences, Hamburg, Germany Combining diverse topics as adaptive and mobile processes with formal modeling leads to an interesting collection of contributions. Since mobility and adaptivity both induce strong challenges for dynamic systems, they both need new concepts for the formal modeling.
    keywords: modeling; nets
       cache: eceasst-335.pdf
  plain text: eceasst-335.txt

        item: #344 of 858
          id: eceasst-336
      author: Hoffmann, Kathrin; Ehrig, Hartmut; Padberg, Julia
       title: Flexible Modeling of Emergency Scenarios using Reconfigurable Systems
        date: 2009-12-17
       words: 6838
      flesch: 51
     summary: For rule based trans- formations of P/T systems we use the framework of net transformations [EEPT06, EHPP07] following the double pushout (DPO) approach of graph transformation systems In the following we review the behavior of AHO systems according to [HEM05].
    keywords: gas; pn1; process; processes; reconfigurable; systems; t system; team; transformation
       cache: eceasst-336.pdf
  plain text: eceasst-336.txt

        item: #345 of 858
          id: eceasst-338
      author: Vajar, Beeta; Schneider, Steve; Treharne, Helen
       title: Mobile CSP||B
        date: 2010-01-04
       words: 8154
      flesch: 64
     summary: CSP controllers use machine references as the link to interact with B machines. Mobile CSP‖B Beeta Vajar, Steve Schneider and Helen Treharne 17 pages Guest Editor: Markus Roggenbach Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Mobile CSP‖B Beeta Vajar1, Steve Schneider2 and Helen Treharne3 1b.vajar@surrey.ac.uk 2s.schneider@surrey.ac.uk 3h.treharne@surrey.ac.uk Department of Computing, University of Surrey, Guildford, Surrey, UK Abstract: CSP‖B is a combination of CSP and B in which CSP processes are used as control executives for B machines.
    keywords: agency; controller; csp; divergence; flight; machine; mobile; sell; system
       cache: eceasst-338.pdf
  plain text: eceasst-338.txt

        item: #346 of 858
          id: eceasst-339
      author: Hein, Christian; Engelhardt, Marcus; Ritter, Tom; Wagner, Michael
       title: Generation of Formal Model Metrics for MOF based Domain Specific Languages
        date: 2010-04-12
       words: 6091
      flesch: 51
     summary: The definition of model measures using OCL expressions has been done extensively for UML models as outlined in section 2. It is important to mention that the four phases do not necessarily have to be run through starting from the first – the rule management – phase since the user can load a existing rule model or measure model.
    keywords: approach; class; generation; measure; meta; metrics; model; ocl; rule; tool
       cache: eceasst-339.pdf
  plain text: eceasst-339.txt

        item: #347 of 858
          id: eceasst-34
      author: Biermann, Enrico; Ehrig, Karsten; Köhler, Christian; Kuhns, Günter; Taentzer, Gabriele; Weiss, Eduard
       title: EMF Model Refactoring based on Graph Transformation Concepts
        date: 2007-02-20
       words: 5933
      flesch: 50
     summary: The main reason for this design decision is the basic opportunity to validate EMF model transformations which is possible only if some form of consistency can be reached by the EMF transformation. 5.1 EMF-Related Approaches A rather simple approach to EMF model transformation is given by the Merlin Eclipse plug- in [Mer06] which can perform model-to-model and model-to-code transformations.
    keywords: approaches; attribute; class; consistency; emf; emf model; graph; model; objects; refactoring; rule; transformation
       cache: eceasst-34.pdf
  plain text: eceasst-34.txt

        item: #348 of 858
          id: eceasst-340
      author: Harrison, Michael; Massink, Mieke
       title: Preface
        date: 2010-01-08
       words: 818
      flesch: 31
     summary: Co-Chair 1 / 3 Volume 22 (2009) Organisation Programme Committee Chairs Michael Harrison Newcastle University, UK Mieke Massink National Research Council, CNR-ISTI, Italy Programme Committee Ann Blandford UCL Interaction Center, UK Judy Bowen University of Waikato, New Zealand Paul Cairns University of York, UK José Creissac Campos University of Minho, Portugal Antonio Cerone UNI-IIST, Macau SAR China Paul Curzon Queen Mary, University of London, UK Alan Dix Lancaster University, UK Gavin Doherty Trinity College, University of Dublin, Ireland David Duce Oxford Brookes University, Oxford, UK Stefania Gnesi CNR-ISTI, Pisa, Italy Michael Harrison Newcastle University, UK C. Michael Holloway NASA Langley Research Center, USA Chris Johnson University of Glasgow, UK Mieke Massink CNR-ISTI, Pisa, Italy Philippe Palanque University of Toulouse III, France Luca Simoncini University of Pisa, Italy Daniel Sinnig Concordia University, Canada Harold Thimbleby University of Wales Swansea, Wales External Referees Alessandro Fantechi University of Florence, Italy Proc. FMIS 2009 2 / 3 ECEASST Contents UI-Design Driven Model-Based Testing Judy Bowen and Steve Reeves Towards the Verification of Pervasive Systems Myrto Arapinis, Muffy Calder, Louise Dennis, Michael Fisher, Philip Gray, Savas Konur, Alice Miller, Eike Ritter, Mark Ryan, Sven Schewe, Chris Unsworth and Rehana Yasmin Tightly Coupled Verification of Pervasive Systems Muffy Calder, Phil Gray and Chris Unsworth Markov Abstractions for Probabilistic π -Calculus Hugh Anderson and Gabriel Ciobanu A Logical Framework for Trust-Related Emotions. December, 2009 Michael Harrison Mieke Massink Newcastle University CNR-ISTI FMIS09
    keywords: methods; systems; university; volume
       cache: eceasst-340.pdf
  plain text: eceasst-340.txt

        item: #349 of 858
          id: eceasst-341
      author: Killisperger, Peter; Stumptner, Markus; Peters, Georg; Stückl, Thomas
       title: Specifying OCL Constraints on Process Instantiations
        date: 2010-01-12
       words: 3005
      flesch: 57
     summary: Keywords: process instantiation, adaptation, reference process, correctness pre- serving 1 Introduction Explicitly defined software processes for the development of software are used by most large organizations. This will both provide a more flexible computational architecture for reasoning about process instantiation and a formal semantics for the OCL constraints in our domain instead of the carefully crafted but essentially ad hoc semantics built into the repair operators of the cur- rent implementation.
    keywords: n t; t e
       cache: eceasst-341.pdf
  plain text: eceasst-341.txt

        item: #350 of 858
          id: eceasst-342
      author: Cabot, Jordi; Chimiak-Opoka, Joanna; Gogolla, Martin; Jouault, Frederic; Knapp, Alexander
       title: Preface to Workshop The Pragmatics of OCL and Other Textual Specification Languages at MoDELS 2009
        date: 2010-02-01
       words: 641
      flesch: 27
     summary: Thomas Baar, Tech@Spree, Germany • Achim Brucker, SAP, Germany • Manuel Clavel, IMDEA Software Institute, Spain • Dan Chiorean, University of Cluj, Romania • Tony Clark, Thames Valley University, UK • Birgit Demuth, Technical University of Dresden, Germany • Remco Dijkman, Eindhoven University of Technology, The Netherlands • Robert France, University of Fort Collins, USA • Heinrich Hußmann, University of Munich, Germany • Tihamer Levendovszky, Vanderbilt University, USA • Richard Mitchell, Inferdata, UK • Richard Paige, University of York, UK • Mark Richters, Astrium Space Transportation, Germany • Shane Sendall, IBM, Switzerland • Pieter Van Gorp, University of Eindhoven, The Netherlands 1 / 2 Volume 24 (2009) Preface • Burkhart Wolff, LRI, University Paris–Sud, France • Steffen Zschaler, Lancaster University, UK During the workshop a broad spectrum of topics was discussed: syntax, semantics and pragmat- ics of the language, using formal or lightweight approaches, discussing core OCL aspects or its application in different domains and presented by a mixture of academic and industrial partici- pants. In this context, an initiative for a community–driven specification and development of a new user–friendly OCL tool was presented.
    keywords: ocl; university; workshop
       cache: eceasst-342.pdf
  plain text: eceasst-342.txt

        item: #351 of 858
          id: eceasst-343
      author: Bottoni, Paolo; Guerra, Esther; de Lara, Juan
       title: Preface of the Workshop on Visual Formalisms for Patterns, VFfP'09
        date: 2010-03-28
       words: 688
      flesch: 43
     summary: Jing Dong, University of Texas, Dallas. • Amnon H. Eden, University of Essex. • Gregor Engels, University of Paderborn.
    keywords: formalisms; pattern; university; workshop
       cache: eceasst-343.pdf
  plain text: eceasst-343.txt

        item: #352 of 858
          id: eceasst-344
      author: Laue, Ralf; Awad, Ahmed
       title: Visualization of Business Process Modeling Anti Patterns
        date: 2010-03-28
       words: 5193
      flesch: 71
     summary: Keywords: business process model, business process diagram, BPMN-Q, visual- ization 1 Introduction Patterns are used in software engineering to describe reusable solutions for common problems. In this article, we will formalize structural anti-patterns in business process models (BPM).
    keywords: bpmn; business; fig; graph; join; model; modeling; path; patterns; process; query; split
       cache: eceasst-344.pdf
  plain text: eceasst-344.txt

        item: #353 of 858
          id: eceasst-345
      author: Soltenborn, Christian; Engels, Gregor
       title: Towards Generalizing Visual Process Patterns
        date: 2010-03-28
       words: 6455
      flesch: 59
     summary: They have been developed for the sake of formu- lating and verifying requirements on business process models in a visual, intuitive way (with UML Activities being one possible description language). Example business process (adopted from [14, p. 312]) report order test quality ship <<complete>> a) Process constraint #1 <<all>> produce b)
    keywords: action; business; dmm; language; model; order; patterns; process; rules; vpp
       cache: eceasst-345.pdf
  plain text: eceasst-345.txt

        item: #354 of 858
          id: eceasst-347
      author: Mahr, Bernd
       title: On Judgements and Propositions
        date: 2010-03-28
       words: 10470
      flesch: 59
     summary: This reading is not only the basis of his system as an intuitionistic theory of types, but is also consistent with an intuitionistic interpretation of his approach as a whole: From a meta-level perspective the written forms of judgements symbolise propositions for which his system lays down what counts as a proof.19 This is the way how he explains semantically these forms of judgements. In his conception of the notion of judgement Aristoteles takes first of all a linguistic view, but combines it with a psychological and an ontological perspective.
    keywords: act; aristoteles; brentano; conception; existence; frege; german; interpretation; judgement; logic; martin; object; presentation; proposition; sense; theory; truth
       cache: eceasst-347.pdf
  plain text: eceasst-347.txt

        item: #355 of 858
          id: eceasst-348
      author: Vajk, Tamas; Meszaros, Tamas; Levendovszky, Tihamer
       title: Design Pattern Modeling with Constraint Relaxation
        date: 2010-03-28
       words: 4828
      flesch: 53
     summary: Design patterns can be considered UML-like best practice structural patterns, while model patterns are general purpose submodels that can be reused several times. Keywords: Design pattern, DSML, VMTS, OCL constraint, relaxation 1 Introduction Design patterns in software engineering describe a problem that recurs, and then describe the core of the solution to that problem, in a way that the solution can be used many times, without ever doing it the same way twice
    keywords: constraint; design; domain; elements; instance; model; modeling; pattern; relaxation; vmts
       cache: eceasst-348.pdf
  plain text: eceasst-348.txt

        item: #356 of 858
          id: eceasst-349
      author: Hoffmann, Berthold
       title: Conditional Adaptive Star Grammars
        date: 2010-03-28
       words: 8973
      flesch: 68
     summary: ReCell Cls M get V cts M set V backup M restore =⇒ fea3 C Fea Fea Fea M V M V M =⇒ ovrd C B Bdy Fea Fea M V M V M =⇒ var C B Bdy Fea M V M V M =⇒ meth0 C B B R.set restore Bdy Bdy M V cts M set V backup M B R.set Bdy V backup V cts M set V n =⇒ bdy2 B E E Exp Exp V M VV =⇒ ass B E E E Exp Exp V M VV =⇒ use B E E E Exp V M VV =⇒ call1 B E E E E Exp V M VV =⇒ use B E E E E V M VV Figure 8: Deriving the program graph of Figure 1b with PG R Any C Cell Cls C ReCell Cls M get V cts M set M restore V backup C Cell Cls M get V cts M set M restore =⇒ fea3 C Fea Fea Fea M V M M =⇒ meth0 C B Bdy Fea Fea M V M M =⇒ var C B Bdy Fea M V M M =⇒ meth1 C B B get C.set Bdy Bdy M V cts M M V n C
    keywords: adaptive; class; figure; grammars; graph; method; nodes; program; rules; star
       cache: eceasst-349.pdf
  plain text: eceasst-349.txt

        item: #357 of 858
          id: eceasst-35
      author: Heckel, Reiko; Favre, Jean-Marie; Mens, Tom
       title: Preface
        date: 2007-02-20
       words: 661
      flesch: 30
     summary: Papers present in these proceedings cover a range of artifacts and formalisms of transforma- tions, from program to model transformation and from XSLT to term and graph rewriting. Keywords: software evolution, model and program transformation, graph transfor- mation, term rewriting Since its birth as a discipline in the late 60ies Software Engineering had to cope with the breakdown of many of its original assumptions.
    keywords: evolution; model; software; transformation
       cache: eceasst-35.pdf
  plain text: eceasst-35.txt

        item: #358 of 858
          id: eceasst-351
      author: Maier, Sonja; Minas, Mark
       title: Pattern-Based Layout Specifications for Visual Language Editors
        date: 2010-03-28
       words: 4466
      flesch: 62
     summary: At this point, the combination of different layout patterns is done via the application control, a language-specific control program. For that purpose, we introduce the concept of layout patterns, which en- capsulates certain layout behavior.
    keywords: algorithms; figure; graph; language; layout; meta; model; pattern; rule
       cache: eceasst-351.pdf
  plain text: eceasst-351.txt

        item: #359 of 858
          id: eceasst-352
      author: Gulden, Jens
       title: Patterns as Abstractions of Spatial Axes
        date: 2010-03-28
       words: 4916
      flesch: 44
     summary: In the most simple case, a spatial mapping from semantic model elements to Euclidian coor- dinates is performed by a NumericAxis which reads a numeric value from a semantic element's attribute and, without further transformation, directly places this real number into one coordi- nate component of a view-space's coordinate. In order to utilize the results on conceptualizing model notations for novel kinds of modeling languages and tools, the proposed concepts for expressing notations are now to be incorporated into an overall formal notation meta-model.
    keywords: axes; axis; elements; model; notation; notion; patterns; semantics; space; view
       cache: eceasst-352.pdf
  plain text: eceasst-352.txt

        item: #360 of 858
          id: eceasst-353
      author: Biermann, Enrico; Ermel, Claudia; Taentzer, Gabriele
       title: Lifting Parallel Graph Transformation Concepts to Model Transformation based on the Eclipse Modeling Framework
        date: 2010-03-28
       words: 8148
      flesch: 64
     summary: Hence, in our previous paper [5], we identify a kind of model transformation rules which lead to consistent EMF model graphs (i.e. fulfilling the con- tainment constraints), if applied as normal graph transformation rules to consistent EMF model graphs. In the 17 / 19 Volume 26 (2010) Lifting Parallel Graph Transformation Concepts to EMF Model Transformation near future, the translation of EMF transformation rules to AGG shall be supported to open up the possibility for verification of transformations.
    keywords: amalgamated; containment; emf; graph; model; multi; object; parallel; rule; state; transformation
       cache: eceasst-353.pdf
  plain text: eceasst-353.txt

        item: #361 of 858
          id: eceasst-355
      author: Kuske, Sabine; Luderer, Melanie
       title: Autonomous Units for Solving the Capacitated Vehicle Routing Problem Based on Ant Colony Optimization
        date: 2010-03-28
       words: 11162
      flesch: 70
     summary: Si ◦S. 9 Control conditions can be used to define sequences of graphs (instead of sequences of graph pairs) because, as stated before, rules can be regarded as rule pairs with empty private component. Essentially, every autonomous unit is composed of a set of graph transformation rules, a con- trol condition, and a goal.
    keywords: ant; ants; class; colony; control; depot; graph; pheromone; rule; set; transformation; units
       cache: eceasst-355.pdf
  plain text: eceasst-355.txt

        item: #362 of 858
          id: eceasst-357
      author: Janssens, Dirk
       title: Assemblies as Graph Processes
        date: 2010-03-29
       words: 7991
      flesch: 61
     summary: In our approach this information is implicitly represented by the fact that building blocks are described by graph rewriting rules which have a designated left-hand side. Assemblies as Graph Processes Electronic Communications of the EASST Volume 26 (2010) Manipulation of Graphs, Algebras and Pictures Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday Assemblies as Graph Processes Dirk Janssens 18 pages Guest Editors: Frank Drewes, Annegret Habel, Berthold Hoffmann, Detlef Plump Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Assemblies as Graph Processes Dirk Janssens Department of Mathematics and Computer Science University of Antwerp, Belgium Abstract: This paper explores the potential of graph rewriting and graph processes as a tool for understanding natural computing, and in particular self-assembly.
    keywords: assemblies; assembly; components; figure; graph; hand; processes; rewriting; rule; set; surface
       cache: eceasst-357.pdf
  plain text: eceasst-357.txt

        item: #363 of 858
          id: eceasst-358
      author: Schulz, Christoph; Löwe, Michael; König, Harald
       title: Categorical Framework for the Transformation of Object-Oriented Systems: Operations and Methods
        date: 2010-04-04
       words: 9319
      flesch: 61
     summary: The composition of the three functors above results in the migration functor defined below: Definition 7 (Migration functor) Let t : S S # S′ be a transformation. Finally, a categorical framework is presented which allows to derive instance migrations from schema transformations in such a way that programs and processes to the old schema are correctly migrated into programs and processes to the new schema.
    keywords: data; dpo; instance; migration; object; rule; schema; systems; transformation; � �
       cache: eceasst-358.pdf
  plain text: eceasst-358.txt

        item: #364 of 858
          id: eceasst-359
      author: Padawitz, Peter
       title: Algebraic Model Checking
        date: 2010-03-29
       words: 8842
      flesch: 62
     summary: Festschrift H.-J. Kreowski 16 / 22 ECEASST -- MUTEXco specs: CTL preds: Idle Wait Crit enabled safe noSeq >> copreds: others constructs: c defuncts: request enter leave posi maxwait weight fovars: xs ys xs’ ys’ axioms: (st >> st’ <==> weight(st) > weight(st’)) & weight(xs,ys) == (length(xs)-posi(c)(xs++ys), maxwait-length(xs),length$ys) & posi(x)$x:s = 0 & (posi(x)$y:s = suc$posi(x)$s <=== x =/= y) & (st -> f$st <=== enabled(f)$st) & (enabled(request$x)(xs,ys) <=== Idle(x)(xs,ys) & maxwait > length$xs) & enabled(enter)(x:xs,[]) & enabled(leave)(xs,[x]) & request(x)(xs,ys) == (x:xs,ys) & enter(xs,ys) == (init$xs,[last$xs]) & leave(xs,ys) == (xs,[]) & (Wait(x)(xs,ys) <==> x ‘in‘ xs) & (Crit(x)(xs,ys) <==> x ‘in‘ ys) & (Idle(x)(xs,ys) <==> x ‘NOTin‘ xs & x ‘NOTin‘ ys) & safe(xs,[]) & safe(xs,[x]) & (noSeq$x <==> EF $ Crit(x) /\ (Crit(x) ‘EU‘ (not(Crit$x) /\ (others(not.Crit)(x) ‘EU‘ Crit$x)))) & (others(P)(x)$st ===> (x =/= y ==> P(y)$st)) conjects: (c ‘in‘ xs | c Here we apply it to modal logics by specifying modal and temporal operators in terms of co/Horn axioms: -- CTL preds: EX EF AF ‘EU‘ ‘AU‘ P Q predicates copreds: AX EG AG copredicates fovars: st st’ hovars: P Q axioms: (EX(P)$st <=== st -> st’ & P(st’)) & (AX(P)$st ===> (st -> st’ ==> P(st’))) & (EF(P)$st <=== P$st | EX(EF(P))$st) & (AF(P)$st <=== P$st | AX(AF(P))$st) & (EG(P)$st ===> P$st & EX(EG(P))$st) & (AG(P)$st ===> P$st & AX(AG(P))$st) & ((P‘EU‘Q)$st <=== Q$st | P$st & EX(P‘EU‘Q)$st) & ((P‘AU‘Q)$st <=== Q$st | P$st & AX(P‘AU‘Q)$st) -- LTL preds:
    keywords: = =; algebraic; checking; expander2; formula; induction; logic; model; operators; proof; rules; simplification; states
       cache: eceasst-359.pdf
  plain text: eceasst-359.txt

        item: #365 of 858
          id: eceasst-36
      author: Chiorean, Dan Ioan; Demuth, Birgit; Gogolla, Martin; Warmer, Jos
       title: Preface
        date: 2007-07-04
       words: 430
      flesch: 38
     summary: The workshop was organized as a part of MoDELS/UML 2006 Conference in Genova – Italy, continuing the series of OCL workshops held at previous UML/MoDELS conferences in: York (2000), Toronto (2001), San Francisco (2003), Lisbon (2004) and Montego Bay (2005). The advent of the MDA (Model Driven Architecture) vision and the rapid acceptance of MDE (Model Driven Engineering) approaches emphasize new application domains (like Semantic Web or Domain Specific Languages) and call for new OCL functionalities.
    keywords: demuth; ocl
       cache: eceasst-36.pdf
  plain text: eceasst-36.txt

        item: #366 of 858
          id: eceasst-360
      author: Drewes, Frank
       title: Towards the Tree Automata Workbench Marbles
        date: 2010-03-29
       words: 7951
      flesch: 61
     summary: In Section 3, some of the different types of trees, tree automata, and tree automata algorithms that should, in principle, be covered by MARBLES, are discussed. The goal is to design and implement an extensible system that facilitates experiments with virtually any kind of algorithm on tree automata.
    keywords: algorithms; attribute; automata; automaton; grammars; kreowski; marbles; system; transducers; tree; tree automata; tree grammars; treebag; type; user
       cache: eceasst-360.pdf
  plain text: eceasst-360.txt

        item: #367 of 858
          id: eceasst-363
      author: Ehrig, Hartmut; Habel, Annegret; Lambers, Leen
       title: Parallelism and Concurrency Theorems for Rules with Nested Application Conditions
        date: 2010-03-28
       words: 9169
      flesch: 69
     summary: Shift operations over parallel rules can be sequentialized into a sequence of shifts over induced rules. The proofs of the statements are based on the corresponding statements for rules without application conditions and two Shift-Lemmas, saying that nested application conditions can be shifted over morphisms and rules.
    keywords: acl; acs; application; application conditions; conditions; derivation; graph; morphisms; parallel; rule; � ordernr
       cache: eceasst-363.pdf
  plain text: eceasst-363.txt

        item: #368 of 858
          id: eceasst-364
      author: Ehrenfeucht, Andrzej; Rozenberg, Grzegorz
       title: Reaction Systems: a Formal Framework for Processes Based on Biochemical Interactions
        date: 2010-04-04
       words: 4886
      flesch: 59
     summary: Although reaction systems form the core of our framework, the framework is constructed in an “incremental” way: depending on a research issue the notion of reaction system can be modified so that the resulting model is well-suited for the investigation of the given research issue. A distinct technical feature of extended reaction systems is the existence of periodic elements – such elements cannot exist in reaction systems.
    keywords: processes; reaction; sequence; set; state; systems
       cache: eceasst-364.pdf
  plain text: eceasst-364.txt

        item: #369 of 858
          id: eceasst-366
      author: Levendovszky, Tihamer; Karsai, Gabor
       title: An Active Pattern Infrastructure for Domain-Specific Languages
        date: 2010-04-04
       words: 4079
      flesch: 52
     summary: DSMLs are meant to be used in arbitrary domains, thus, in accordance with [LLM09], DSML patterns are referred to as model patterns. These results constitute an excellent theoretical formalization of the tracing aspects for model patterns defined in the static aspect.
    keywords: design; domain; dsml; elements; insertion; metamodel; model; pattern; tool
       cache: eceasst-366.pdf
  plain text: eceasst-366.txt

        item: #370 of 858
          id: eceasst-367
      author: Plump, Detlef
       title: Checking Graph-Transformation Systems for Confluence
        date: 2010-04-04
       words: 6154
      flesch: 66
     summary: In Section 4 we review the role of critical pairs in establishing confluence. Section 5 introduces covers for critical pairs and coverable systems, discusses our main result and the associated de- cision procedure for confluence, and presents special cases where confluence is decidable.
    keywords: confluence; hypergraph; pair; systems; transformation
       cache: eceasst-367.pdf
  plain text: eceasst-367.txt

        item: #371 of 858
          id: eceasst-368
      author: Baldan, Paolo; Corradini, Andrea; Gadducci, Fabio; Montanari, Ugo
       title: From Petri Nets to Graph Transformation Systems
        date: 2010-04-04
       words: 8596
      flesch: 71
     summary: Festschrift H.-J. Kreowski 18 / 18 Introduction Algebraic approaches to graph transformation Graphs and graph morphisms Double-pushout rewriting Single-pushout rewriting Subgraph Transformation Systems Other kinds of stss Graph grammars Enriched Petri nets Place/Transition nets Elementary nets From enriched nets to graph transformation systems Encoding Petri nets as graph grammars Examples P/T Petri nets. We elaborate on this observation, dis- cussing how several different models of Petri nets can be encoded faithfully into Graph Transformation Systems.
    keywords: arcs; dpo; graph; nets; petri; rule; set; systems; transformation; transition
       cache: eceasst-368.pdf
  plain text: eceasst-368.txt

        item: #372 of 858
          id: eceasst-369
      author: Drewes, Frank; Habel, Annegret; Hoffmann, Berthold; Plump, Detlef
       title: Manipulation of Graphs, Algebras and Pictures. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday
        date: 2010-04-04
       words: 603
      flesch: 41
     summary: Graph grammars, in particular, have fascinated Hans-Jörg ever since, and he has made nu- merous important contributions to the field which nowadays is called graph transformation. Collectively we conclude once more by: Congratulations, Hans-Jörg!
    keywords: hans; jörg
       cache: eceasst-369.pdf
  plain text: eceasst-369.txt

        item: #373 of 858
          id: eceasst-371
      author: Wolff, Andreas; Forbrig, Peter
       title: Pattern Catalogs using the Pattern Language Meta Language
        date: 2010-04-11
       words: 3969
      flesch: 54
     summary: Some enhancements and corrections to it are proposed to make use of PLML in pattern catalogs. A number of pattern catalogs has been compiled by the HCI community.
    keywords: catalog; confidence; editor; figure; language; meta; model; pattern; plml; type
       cache: eceasst-371.pdf
  plain text: eceasst-371.txt

        item: #374 of 858
          id: eceasst-376
      author: Schaefer, Jan
       title: A Middleware for Self-Organising Distributed Ambient Assisted Living Applications
        date: 2010-04-11
       words: 5853
      flesch: 47
     summary: In addition to MUSIC, openAAL or OSAMI Commons might prove to be suitable building blocks for the implementation of the approach described in this paper, once the latter two become publicly available, as interoperability will likely become a major factor for acceptance and success of AAL service platforms. Although several AAL and smart home projects featuring service platforms have been de- veloped in recent years or are still under development, they do not focus on principles of self- organisation and coordinated distributed computing – especially self-management, adaptation and context-awareness.
    keywords: aal; applications; context; data; devices; information; osgi; platform; self; service; system; user
       cache: eceasst-376.pdf
  plain text: eceasst-376.txt

        item: #375 of 858
          id: eceasst-377
      author: Hoffmann, Axel; Hoffmann, Holger; Leimeister, Jan Marco
       title: Nutzerintegration in die Anforderungserhebung für Ubiquitous Computing Systeme
        date: 2010-04-18
       words: 2947
      flesch: 47
     summary: So sollten auch die Systeme des Ubiquitous Computing dafür ausgelegt sein, die Anforderungen der Nutzer zu erfüllen und ihnen eine bestmögliche Die Neuartigkeit ubiquitärer
    keywords: anforderungen; anforderungserhebung; computing; das; der; des; die; diese; durch; ein; eine; engineering; entwicklung; für; ist; können; mit; nicht; nutzer; systeme; und; von; werden
       cache: eceasst-377.pdf
  plain text: eceasst-377.txt

        item: #376 of 858
          id: eceasst-378
      author: Mossakowski, Till
       title: On Teaching Logic and Algebraic Specification
        date: 2010-04-11
       words: 8357
      flesch: 79
     summary: F | T | F | T | T || T | T | F | T | F | T | F | T | F || T | T | F | T |
    keywords: + +; + =; = +; = =; harry =; john =; m =; | |; | ||; || f; || t; || |
       cache: eceasst-378.pdf
  plain text: eceasst-378.txt

        item: #377 of 858
          id: eceasst-38
      author: Milanović, Milan; Gašević, Dragan; Giurca, Adrian; Wagner, Gerd; Devedžić, Vladan
       title: Towards Sharing Rules Between OWL/SWRL and UML/OCL
        date: 2007-07-04
       words: 7930
      flesch: 53
     summary: The final objective of this section is to explain the transformation of R2ML models (rules) into OCL models [OCL06]. The first one is to use the OCL Parser from the Dresden OCL Toolkit [DOT06] for parsing OCL code and creating OCL model from it.
    keywords: atl; concrete; figure; language; metamodel; object; ocl; owl; r2ml; rdm; rules; swrl; syntax; transformation; uml; xml
       cache: eceasst-38.pdf
  plain text: eceasst-38.txt

        item: #378 of 858
          id: eceasst-381
      author: Lau, Sian Lun; Klein, Niklas; Pirali, Andreas; Droegehorn, Olaf; David, Klaus
       title: Evaluation of the Technology Agnostic Service Creation Approach
        date: 2010-04-11
       words: 5402
      flesch: 59
     summary: An evaluation event was held to allow participants to test and evaluate our prototype tools and service creation approach. Service development is still mainly technical oriented, where service creation tools are meant for serving and assisting the professional developers.
    keywords: approach; creation; evaluation; participants; sbbs; service; service creation; tasc; technology; tools; users
       cache: eceasst-381.pdf
  plain text: eceasst-381.txt

        item: #379 of 858
          id: eceasst-382
      author: Wojciechowski, Manfred
       title: Building an Infrastructure Level Context Model in Ambient Assisted Living
        date: 2010-06-07
       words: 5758
      flesch: 38
     summary: In these phases different types of context models can be identified. Therefore context models play an important role for building applications that can react on real world events.
    keywords: aal; context; context model; element; environment; home; information; infrastructure; model; modeling; services
       cache: eceasst-382.pdf
  plain text: eceasst-382.txt

        item: #380 of 858
          id: eceasst-383
      author: Comes, Diana; Zapf, Michael; Geihs, Kurt
       title: QoS-based Self-Management for Business Processes
        date: 2010-04-11
       words: 5590
      flesch: 47
     summary: 2.3 Service Selection strategy One possible action as an instance of business process management is to replace a failing service; this entails the selection of an appropriate replacement. Features like the selection of services are generally required in business process management, and are thus shared between the approaches.
    keywords: bprules; business; business processes; management; process; processes; qos; selection; self; service; web
       cache: eceasst-383.pdf
  plain text: eceasst-383.txt

        item: #381 of 858
          id: eceasst-385
      author: Holzer, Richard; Wüchner, Patrick; de Meer, Hermann
       title: Modeling of Self-Organizing Systems: An Overview
        date: 2010-04-18
       words: 6383
      flesch: 61
     summary: Figure 1: Discrete- vs. continuous-time and discrete vs. continuous state space models. Bifurcation can also been observed in discrete systems.
    keywords: behavior; level; level modeling; macro; modeling; models; self; space; state; system; time
       cache: eceasst-385.pdf
  plain text: eceasst-385.txt

        item: #382 of 858
          id: eceasst-386
      author: Sudeikat, Jan Oliver
       title: Systemic Modeling of Agent Coaction: A Catalog of Decentralized Coordinating Processes
        date: 2010-04-18
       words: 5086
      flesch: 41
     summary: For the sake of brevity, 3 / 12 Volume 27 (2010) Systemic Modeling of Agent Coaction the integration of the pattern, using the outlined programming model is not demonstrated, but the systems objective and the rationale to integrate template processes are discussed. Future work, concerns guidelines for the systematic selection and combination of process templates.
    keywords: agent; configuration; coordination; environment; feedback; modeling; processes; self; structures; systemic; systems; template
       cache: eceasst-386.pdf
  plain text: eceasst-386.txt

        item: #383 of 858
          id: eceasst-387
      author: Ultsch, Alfred; Herrmann, Lutz
       title: Self Organized Swarms for cluster preserving Projections of high-dimensional Data
        date: 2010-06-07
       words: 4344
      flesch: 59
     summary: In order to grasp cluster structures in high dimensional data, it is a common approach to project the data onto a low dimensional space such that it can be visualized [Izenman 08]. A central claim for a mapping used for the visualization of high dimensional data is the preservation of cluster structures in the data.
    keywords: cca; cluster; data; mapping; projection; self; sop; space; swarm; ultsch
       cache: eceasst-387.pdf
  plain text: eceasst-387.txt

        item: #384 of 858
          id: eceasst-388
      author: Smith, Jason McColm
       title: The Pattern Instance Notation: A Simple Hierarchical Visual Notation for the Dynamic Visualization and Comprehension of Software Patterns
        date: 2010-04-18
       words: 4730
      flesch: 50
     summary: The Pattern Instance Notation: A Simple Hierarchical Visual Notation for the Dynamic Visualization and Comprehension of Software Patterns Electronic Communications of the EASST Volume 25 (2010) Proceedings of the Workshop Visual Formalisms for Patterns at VL/HCC 2009 The Pattern Instance Notation: A Simple Hierarchical Visual Notation for the Dynamic Visualization and Comprehension of Software Patterns Jason McC. Smith 12 pages Guest Editors: Paolo Bottoni, Esther Guerra, Juan de Lara Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST The Pattern Instance Notation: A Simple Hierarchical Visual Notation for the Dynamic Visualization and Comprehension of Software Patterns Jason McC. Smith1 1 jason.smith@tsri.com, TSRI, Inc, Kirkland, WA Abstract: Design patterns are a common tool for developers and architects to un- derstand and reason about a software system. The Pattern Instance Notation is a simple visualization technique for design patterns and other abstractions of software engineering suitable for the programmer or designer without a theoretical background.
    keywords: design; draw; figure; instance; notation; pattern; pin; role; software; uml
       cache: eceasst-388.pdf
  plain text: eceasst-388.txt

        item: #385 of 858
          id: eceasst-389
      author: Tiemann, Jens; Smirnov, Mikhail; Zseby, Tanja
       title: Assessment – Ein Ansatz zur Evaluierung selbstorganisierender Systeme
        date: 2010-04-18
       words: 3790
      flesch: 39
     summary: Dabei ist das Ergebnis eines Konformitätstests abhängig von der Spezifikation und der Implementierung, während eine Leistungsmessung zusätzlich von den aktuellen Betriebs- bedingungen abhängt, im Folgenden auch Situation genannt. [MMJ09][ZKH08]: Die Systeme basieren • auf einem kognitiven Zyklus (vergleichbar mit dem Sense-Think-Act Cycle als Ansatz der klassischen künstlichen Intelligenz), • auf der Verarbeitung einer Vielzahl von Umgebungsinformationen oder Kontext, • auf intern gesammeltem oder vorhandenem Wissen sowie • auf der Kooperation zwischen Systemen.
    keywords: algorithmen; als; assessment; auch; auf; aus; dabei; das; dem; der; des; die; dieser; eine; einsatz; für; ist; kann; mit; nicht; oder; sich; sind; sut; systeme; testen; und; von; werden; wie; wird; z.b; zum; zur; über
       cache: eceasst-389.pdf
  plain text: eceasst-389.txt

        item: #386 of 858
          id: eceasst-39
      author: Silva, Lyrene Fernandes; Sampaio do Prado Leite, Julio Cesar
       title: Generating Requirements Views: A Transformation-Driven Approach
        date: 2007-03-02
       words: 5603
      flesch: 51
     summary: 36.Y. Yu, J. Leite and J. Mylopoulos, “From goals to aspects: discovering aspects from requirements goal models”, Proceedings of IEEE International Symposium on Requirements Engineering (RE'04), Japan, 2004, pp. 38-47. An automatic mechanism to generate views can accelerate the modeling process because it decreases reworking and inconsistencies among different requirements models.
    keywords: approach; class; goal; graph; models; requirements; scenarios; software; transformation; views
       cache: eceasst-39.pdf
  plain text: eceasst-39.txt

        item: #387 of 858
          id: eceasst-390
      author: Becker, Jörg; Matzner, Martin; Voigt, Matthias
       title: Theory-based Analyses of Interorganisational Standards for Self-organising, Adaptive Value Creation Networks
        date: 2010-06-07
       words: 4809
      flesch: 37
     summary: Related work builds up on insights from technical grammar evaluation and is limited to independent mostly ontology- based analyses of IOS standards (cp. Green et al. 2005). According to Timmermans and Berg (1997) activity standardisation can be related to process standards, defining the coordination and execution of certain activities.
    keywords: coordination; creation; information; ios; management; networks; processes; req; standards; systems; value
       cache: eceasst-390.pdf
  plain text: eceasst-390.txt

        item: #388 of 858
          id: eceasst-392
      author: Paridel, Koosha; Bainomugisha, Engineer; Vanrompay, Yves; Berbers, Yolande; De Meuter, Wolfgang
       title: Middleware for the Internet of Things, Design Goals and Challenges
        date: 2010-06-03
       words: 3230
      flesch: 57
     summary: Interaction with thousands of wireless devices leads to a continuous and massive flow of events which are generated spontaneously. Keywords: Internet of Things, Middleware, Linguistic Abstractions 1 Introduction As a result of the rapid advances in wireless technology and the emergence of a new generation of wireless devices which are cheaper and smaller, many objects in our daily lives are becom- ing wirelessly interoperable by having tiny and low-powered or even passive wireless devices attached to them (e.g. Passive RFID tags).
    keywords: devices; events; internet; middleware; mobile; networks; number; things
       cache: eceasst-392.pdf
  plain text: eceasst-392.txt

        item: #389 of 858
          id: eceasst-393
      author: Mélisson, Rémi; Romero, Daniel; Rouvoy, Romain; Seinturier, Lionel
       title: Supporting Pervasive and Social Communications with FRASCATI
        date: 2010-06-03
       words: 6260
      flesch: 44
     summary: Furthermore, by integrating BINJIU as SCA pervasive bindings, we promote its usage in different kinds of applications, not only the mobile ones. STB- Alice Smartphone Client Application GUI Network Area Storage UPnP Frame Alice-digihome-system AV Control Point Constraint Manager AV Device RSS- based Frame Legend: P Wire (remote) P Reference with PB Service with PB PB Pervasive Binding 1P PP 2 3 4 P P P PP P Figure 2: Using FRASCATI with UPnP bindings.
    keywords: bindings; communications; component; discovery; event; frascati; home; integration; new; platform; sca; service; social; twitter; upnp
       cache: eceasst-393.pdf
  plain text: eceasst-393.txt

        item: #390 of 858
          id: eceasst-394
      author: Kakousis, Konstantinos; Paspallis, Nearchos; Papadopoulos, George Angelos; Ruiz, Pedro Antonio
       title: Testing self-adaptive applications with simulation of context events
        date: 2010-06-03
       words: 5036
      flesch: 49
     summary: The primary objective of 9 / 12 Volume 28 (2010) Testing self-adaptive applications with simulation of context events this work was to simulate the data produced from real sensors while in our case the focus is on simulating and monitoring the behavior of the applications and context middleware. Testing self-adaptive applications with simulation of context events Electronic Communications of the EASST Volume 28
    keywords: adaptation; adaptive; applications; context; engine; events; middleware; music; satmotion; self; simulation; testing; tool
       cache: eceasst-394.pdf
  plain text: eceasst-394.txt

        item: #391 of 858
          id: eceasst-395
      author: Nzekwa, Russel Aime; Rouvoy, Romain; Seinturier, Lionel
       title: Modelling Feedback Control Loops for Self-Adaptive Systems
        date: 2010-06-03
       words: 2658
      flesch: 48
     summary: Self-adaptive systems (or autonomic systems) are self-managing system that use Feedback Control Loops (FCLs) to monitor, analyse, plan, and act according to changes occurring in their environment. Modelling Feedback Control Loops for Self-Adaptive Systems Electronic Communications of the EASST Volume 28 (2010) Proceedings of the Third International DisCoTec Workshop on Context-Aware Adaptation Mechanisms for Pervasive and Ubiquitous Services (CAMPUS 2010) Modelling Feedback Control Loops for Self-Adaptive Systems Russel Nzekwa, Romain Rouvoy and Lionel Seinturier 6 pages Guest Editors: Sonia Ben Mokhtar, Romain Rouvoy, Michael Wagner Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Modelling Feedback Control Loops for Self-Adaptive Systems Russel Nzekwa, Romain Rouvoy and Lionel Seinturier ADAM Project-Team INRIA Lille – Nord Europe University of Lille 1, LIFL CNRS UMR 8022 F-59650 Villeneuve d’Ascq firstname.lastname@inria.fr Abstract: Feedback Control Loops (FCLs) are the heart of any self-adaptive sys- tem.
    keywords: adaptive; control; data; feedback; loops; model; report; self; systems; truck
       cache: eceasst-395.pdf
  plain text: eceasst-395.txt

        item: #392 of 858
          id: eceasst-396
      author: Hoyos, José Ramón; García-Molina, Jesús; Botía, Juan Antonio
       title: MLContext: A Context-Modeling Language for Context-Aware Systems
        date: 2010-06-03
       words: 6648
      flesch: 52
     summary: In this paper, we present MLContext, a textual Domain Specific Language (DSL) which is specially tailored for modeling context information and automatically generating software artefacts from context models. In this respect, in this paper we present a textual DSL, named MLContext, which has been specially tailored to model context information.
    keywords: applications; category; context; context information; dsl; entities; entity; information; language; mlcontext; model; modeling; source; systems
       cache: eceasst-396.pdf
  plain text: eceasst-396.txt

        item: #393 of 858
          id: eceasst-397
      author: Harnie, Dries; Scholliers, Christophe; De Meuter, Wolfgang
       title: Ambient Contracts
        date: 2010-06-03
       words: 2970
      flesch: 52
     summary: Before presenting our solution under the form of ambient contracts, we show current shortcomings and derive requirements for ambient multi-party interaction abstractions. ∗ Funded by the Prospective Research for Brussels program of IWOIB-IRSIB, Belgium † Funded by a doctoral scholarship of the IWT-Flanders, Belgium 1 / 6 Volume 28 (2010) mailto:dharnie@vub.ac.be mailto:cfscholl@vub.ac.be mailto:wdmeuter@vub.ac.be Ambient Contracts 2 Scenario In this section the issues present in multi-party interaction are shown by means of a smart home environment [HME+05]. To show how ambient contracts enable multi-party interaction, the implementation of the scenario from Section 2 using DEAL is shown in Figure 3. 1 def MuteWhenPhoneRings := contract: { 2 role: Phone supports: { ring () } 3 role: AudioDevice supports: { pause () } 4 5 def phone := required: one(Phone) 6 def devices := optional:
    keywords: ambient; contract; objects; party; state
       cache: eceasst-397.pdf
  plain text: eceasst-397.txt

        item: #394 of 858
          id: eceasst-398
      author: Straube, Christian; Schroeder, Andreas
       title: Architectural Constraints for Pervasive Adaptive Applications
        date: 2010-06-03
       words: 5951
      flesch: 60
     summary: It is easy to see that with hard-wired reconfiguration rules like nested if-then-else statements it is hardly possible to handle every pos- 1 / 12 Volume 28 (2010) Architectural Constraints for Pervasive Adaptive Applications Surrounding parameters Subset of possible combinations/changes System with different configurations accordant to changes Invariants concerning the architecture C 1 C 2 C 3 C 4 P 1 P 2 P 3 P 4 A 1 A 2 A 3 A 4 Figure 1: System evolution without architectural constraints. At this point, architectural constraints show their strength: with architectural constraints as safety net, it is easier to design reconfiguration rules which do not depend on a sequence of reconfigurations or changes in the surrounding.
    keywords: e s; e t; l e; n e; n t; s t
       cache: eceasst-398.pdf
  plain text: eceasst-398.txt

        item: #395 of 858
          id: eceasst-399
      author: Mokhtar, Sonia Ben; Rouvoy, Romain; Wagner, Michael
       title: Preface
        date: 2010-06-03
       words: 939
      flesch: 18
     summary: June, 2010 Sonia Ben Mokhtar Romain Rouvoy Michael Wagner 2 / 5 Volume 28 (2010) Preface Organization Steering Committee Frank Eliassen University of Oslo, Norway Kurt Geihs University of Kassel, Germany Svein Hallsteinsen SINTEF ICT, Norway Geir Horn SINTEF ICT, Norway Valérie Issarny INRIA, France Organizing Committee Program co-chair Sonia Ben Mokhtar CNRS, France Program co-chair Romain Rouvoy University of Lille 1, France & University of Oslo, Norway Publication chair Michael Wagner University of Kassel, Germany Program Committee Olivier Barais University de Rennes 1, France Benoit Baudry INRIA, France Sonia Ben Mokhtar CNRS, France Yolande Berbers K.U.Leuven, Belgium Gordon Blair Lancaster University, UK Licia Capra University College of London, UK Franck Chauvel Peking University, China Ruzanna Chitchyan Lancaster University, UK Denis Conan Institut Telecom, Telecom SudParis, France Geoff Coulson Lancaster University, UK Wolfgang De Meuter Vrije Universiteit Brussel, Belgium Schahram Dustdar Vienna University of Technology, Austria Frank Eliassen University of Oslo, Norway Kurt Geihs University of Kassel, Germany Geir Horn SINTEF ICT, Norway Joseph Loyall BBN Technologies, Massachusetts Ilaria Matteucci Istituto di Informatica e Telematica, Italy René Meier Trinty College Dublin, Ireland Nearchos Paspallis University of Cyprus, Cyprus Pascal Poizat University of Evry, France Hongyang Qu Oxford University, UK Romain Rouvoy University of Lille 1, France & University of Oslo, Norway Rachid Saadi INRIA, France Antonino Sabetta ISTY-CNR, Italy Ulrich Scholz European Media Laboratory GmbH, Germany Lionel Seinturier University of Lille 1, France Sotirios Terzis University of Strathclyde, UK Massimo Tivoli University of L'Aquila, Italy Roman Vitenberg University of Oslo, Norway Michael Wagner University of Kassel, Germany Proc. Thus, the CAMPUS workshop will focus on the promising approaches in the domain of context aware adaptation mechanisms supporting the dynamic evolution of the execution context (e.g., network/device/service failures).
    keywords: applications; context; france; norway; rouvoy; university; workshop
       cache: eceasst-399.pdf
  plain text: eceasst-399.txt

        item: #396 of 858
          id: eceasst-40
      author: Chiaradia, Juan Martin; Pons, Claudia F.
       title: Improving the OCL Semantics Definition by Applying Dynamic Meta Modeling and Design Patterns
        date: 2007-07-04
       words: 3894
      flesch: 51
     summary: The recently adopted OCL 2.0 specification provides a formal definition of the OCL semantics (see official OCL semantics, appendix A in [1]) following the denotational approach. Additionally, having into account the dynamic nature of semantics evaluation, it seems reasonable to think that dynamic meta-modeling techniques, rather than static meta-classes should be used to define the OCL semantics.
    keywords: definition; evaluation; expressions; figure; meta; ocl; semantics
       cache: eceasst-40.pdf
  plain text: eceasst-40.txt

        item: #397 of 858
          id: eceasst-400
      author: Benta, Kuderna-Iulian; Cremene, Marcel; Hoszu, Amalia
       title: Training the Behaviour Preferences on Context Changes
        date: 2010-06-03
       words: 5490
      flesch: 55
     summary: If the rules or the Bayesian approach would be used, a full description of the behaviour should be given (all combinations of context values and desired behaviour), a neural network can run with a few training examples if any, due to its generalization capability, and adjust online. Its main issue is that the prior probabilities need to be initially calculated by a human, which is difficult for a large number of context elements.
    keywords: behaviour; context; elements; learning; network; neural; number; preferences; system; time; training; user; values
       cache: eceasst-400.pdf
  plain text: eceasst-400.txt

        item: #398 of 858
          id: eceasst-401
      author: Zapf, Michael; David, Klaus
       title: Vorwort / Preface
        date: 2010-06-17
       words: 1018
      flesch: 41
     summary: This workshop continues the SAKS series, starting in 2006 at the University of Kassel, hosted by the KiVS conference in Bern in 2007, continuing at the University of Applied Sciences Rhein- Main in Wiesbaden in 2008, and being a workshop of the KiVS conference in 2009, again at the University of Kassel. University of Kassel, June 2010 Michael Zapf Klaus David SAKS 2010 2 / 3 ECEASST Organisation Klaus David Universität Kassel Michael Zapf Universität Kassel Programmkomitee / Program committee Matthias Bäcker Universität Mannheim Uwe Baumgarten Technische Universität München Christian Becker Universität Mannheim Markus Bick ESCP Europe Campus Berlin Walter Blocher Universität Kassel Thilo Böhmann International Business School of Service Management Hamburg Universität Kassel, Juni 2010 Michael Zapf Klaus David 1 / 3 Volume 27 (2010) Vorwort/Preface Preface
    keywords: der; die; kassel; klaus; können; systems; und; universität; wir
       cache: eceasst-401.pdf
  plain text: eceasst-401.txt

        item: #399 of 858
          id: eceasst-403
      author: Kreowski, Hans-Jörg; Kuske, Sabine; von Totth, Caroline
       title: Stepping from Graph Transformation Units to Model Transformation Units
        date: 2010-11-01
       words: 10610
      flesch: 66
     summary: In this paper, graph transformation units are generalized to model transformation units as rule- based devices for modeling model transformations in a compositional framework. Following the ideas of model-driven architecture (MDA; cf., e.g., [Fra03]), the aim of model transformation is to transform platform-independent models (PIMs), which allow to describe problems adequately, into platform-specific models (PSMs), which run properly and smoothly on a computer.
    keywords: actions; composition; finite; graph; graph transformation; input; model; model transformation; output; rule; set; state; transformation; transformation units; type; units
       cache: eceasst-403.pdf
  plain text: eceasst-403.txt

        item: #400 of 858
          id: eceasst-404
      author: Habel, Annegret; Radke, Hendrik
       title: Expressiveness of graph conditions with variables
        date: 2010-11-01
       words: 8265
      flesch: 72
     summary: Expressiveness of graph conditions with variables Electronic Communications of the EASST Volume 30 (2010) International Colloquium on Graph and Model Transformation On the occasion of the 65th birthday of Hartmut Ehrig (GraMoT 2010) Expressiveness of graph conditions with variables Annegret Habel and Hendrik Radke 18 pages Guest Editors: Claudia Ermel, Hartmut Ehrig, Fernando Orejas, Gabriele Taentzer Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Expressiveness of graph conditions with variables Annegret Habel1 and Hendrik Radke2∗ 1 habel@informatik.uni-oldenburg.de 2 radke@informatik.uni-oldenburg.de Carl von Ossietzky Universität Oldenburg, Germany Abstract: Graph conditions are very important for graph transformation systems and graph programs in a large variety of application areas. graph conditions, i.e., finite graph conditions with variables where the variables are place-holders for graphs generated by a hyperedge replacement system.
    keywords: conditions; finite; formulas; graph; graph conditions; hr+ conditions; morphism; mso; replacement; set; variables
       cache: eceasst-404.pdf
  plain text: eceasst-404.txt

        item: #401 of 858
          id: eceasst-405
      author: Orejas, Fernando; Lambers, Leen
       title: Symbolic Attributed Graphs for Attributed Graph Transformation
        date: 2010-11-01
       words: 11871
      flesch: 68
     summary: Actually, to compare the standard approach to attributed graph transformation, we define a semantics of symbolic graphs in terms of classes of attributed graphs and we show how attributed graphs can be identified with some specific kind of symbolic graphs, which we call grounded symbolic graphs. In addition to the expressive power, using symbolic attributed graphs has some other advantages.
    keywords: algebra; graph; graph transformation; rule; transformation; variables
       cache: eceasst-405.pdf
  plain text: eceasst-405.txt

        item: #402 of 858
          id: eceasst-406
      author: Rehak, Vojtech; Slovak, Petr; Strejcek, Jan; Helouet, Loic
       title: Decidable Race Condition and Open Coregions in HMSC
        date: 2010-07-22
       words: 6686
      flesch: 70
     summary: An execution induced by a BMSC M is a totally ordered set (E,⊂), where E is the set of events of M and ⊂ is a linear extension of the causal order � given by M. We modify each BMSC M in a state of H such that each process is covered with a coregion open on both sides, while BMSCs represented by the resulting HMSC remain the same as those represented by H: the same events on the same processes with the same visual and causal orders.
    keywords: bmsc; coregions; events; free; hmsc; order; race
       cache: eceasst-406.pdf
  plain text: eceasst-406.txt

        item: #403 of 858
          id: eceasst-407
      author: Syriani, Eugene; Vangheluwe, Hans
       title: De-/Re-constructing Model Transformation Languages
        date: 2010-07-22
       words: 6063
      flesch: 56
     summary: The de-construction process of model transformation languages enabled us to re- construct existing model transformation features by combining T-Core with, for example, an SBL language. De- constructing and then re-constructing model transformation languages by means of a unique set of most primitive constructs facilitates both.
    keywords: core; end; issuccess ←; languages; model; packet; primitives; return; transformation
       cache: eceasst-407.pdf
  plain text: eceasst-407.txt

        item: #404 of 858
          id: eceasst-408
      author: Blume, Christoph; Bruggink, Sander; König, Barbara
       title: Recognizable Graph Languages for Checking Invariants
        date: 2010-07-22
       words: 6927
      flesch: 68
     summary: In Section 3 we generalize the order-theoretic variant of the Myhill-Nerode theorem to (recog- nizable) graph languages; that is, we define the Myhill-Nerode quasi order on graph languages and characterize recognizable graph languages as the class of languages for which this order is a well quasi order. barbara koenig@uni-due.de Abstract: We generalize the order-theoretic variant of the Myhill-Nerode theorem to graph languages, and characterize the recognizable graph languages as the class of languages for which the Myhill-Nerode quasi order is a well quasi order.
    keywords: automaton; cospan; graph; languages; myhill; nerode; order; quasi; recognizable
       cache: eceasst-408.pdf
  plain text: eceasst-408.txt

        item: #405 of 858
          id: eceasst-409
      author: Strobl, Torsten; Minas, Mark
       title: Specifying and Generating Editing Environments for Interactive Animated Visual Models
        date: 2010-07-22
       words: 6191
      flesch: 62
     summary: In order to describe its behavior, it is a common approach to look on it as a discrete event system with specified events for the collision of marbles with switches, putting new marbles on the field, etc. The described abstract animation system is similar to timed event systems and, therefore, also to DEVS
    keywords: + +; animation; event; graph; marble; model; state; switch; time
       cache: eceasst-409.pdf
  plain text: eceasst-409.txt

        item: #406 of 858
          id: eceasst-41
      author: Stölzel, Mirko; Zschaler, Steffen; Geiger, Leif
       title: Integrating OCL and Model Transformations in Fujaba
        date: 2007-07-04
       words: 5358
      flesch: 57
     summary: When generating the context of OCL constraints in Fujaba’s story diagrams we have to con- sider some special characteristics of story diagrams: Those can always be referenced in OCL constraints.
    keywords: constraints; diagrams; dresden ocl; fujaba; method; model; ocl; ocl toolkit; story
       cache: eceasst-41.pdf
  plain text: eceasst-41.txt

        item: #407 of 858
          id: eceasst-410
      author: Bottoni, Paolo; Fish, Andrew; Parisi-Presicce, Francesco
       title: Preserving constraints in horizontal model transformations
        date: 2010-07-22
       words: 7376
      flesch: 67
     summary: We consider horizontal (or in-place) model transformations which destructively update a model expressed in a given language, for the case where the modeling language is expressed via a type graph and a set of graph conditions. [KKS97]. Given: 1) G the class of typed graphs; 2) R the class of DPO rules with NACs on G ; 3) =⇒ the DPO derivation relation; 4) E a class of graph expressions (here defined by type graphs and graph conditions), where the semantics of an expression e is a subclass sem(e)⊂G ;
    keywords: conditions; constraints; curve; graph; model; rules; set; spider; transformation; type; zones
       cache: eceasst-410.pdf
  plain text: eceasst-410.txt

        item: #408 of 858
          id: eceasst-411
      author: Hoffmann, Berthold; Minas, Mark
       title: Defining Models - Meta Models versus Graph Grammars
        date: 2010-07-22
       words: 6408
      flesch: 65
     summary: This is demonstrated by defining program graphs, a language-independent model of object-oriented programs, with a focus on shape (static structure) rather than behavior. Even the recently proposed adaptive star grammars [DHJ+06, DHJM10] fail for cer- tain more delicate properties of program graphs.
    keywords: class; context; figure; grammars; graph; method; models; nodes; program; rules; star
       cache: eceasst-411.pdf
  plain text: eceasst-411.txt

        item: #409 of 858
          id: eceasst-412
      author: Ribeiro, Leila; Dotti, Fernando Luis; da Costa, Simone André; Dillenburg, Fabiane Cristine
       title: Towards Theorem Proving Graph Grammars using Event-B
        date: 2010-11-01
       words: 6323
      flesch: 66
     summary: Definition 3 (Relational Graph Morphism) Let |G| = 〈VG ∪ EG,{vertG,incG}〉 and |H| = 〈VH ∪EH,{vertH,incH}〉 be relational graphs. 2010 4 / 16 ECEASST Definition 4 (Relational Typing Morphism) Let |G| and |T| be relational graphs.
    keywords: edges; event; grammars; graph; graph grammars; model; morphism; relational; rule; set; state; theorem; vertices
       cache: eceasst-412.pdf
  plain text: eceasst-412.txt

        item: #410 of 858
          id: eceasst-413
      author: Torrini, Paolo; Heckel, Reiko; Rath, Istvan; Bergmann, Gabor
       title: Stochastic Graph Transformation with Regions
        date: 2010-07-22
       words: 6605
      flesch: 63
     summary: A simple form of stochastic graph transformation can be obtained by associating rule names with exponential distributions [HLM06]. We intend to extend the definition of stochastic graph transformation in order to make it pos- sible to express the dependency of the probability distribution of an event e on other events, and more precisely on properties of the graph, such as the number of events of a certain type in a certain region associated to e, or the average scheduled delay for lower-level events of a certain type — e.g. the dependency of the cdf of Reconfiguration events on the number and the sched- uled delay of Add and SwitchOn events in the relevant distribution area, given in the running example.
    keywords: distribution; events; graph; level; matches; order; rule; set; simulation; stochastic; transformation
       cache: eceasst-413.pdf
  plain text: eceasst-413.txt

        item: #411 of 858
          id: eceasst-414
      author: Grohmann, Davide; Miculan, Marino
       title: Graph Algebras for Bigraphs
        date: 2010-07-22
       words: 10001
      flesch: 80
     summary: In fact, many variants of bigraphs have been proposed: the original pure bigraphs have been later generalized into binding bigraphs, allowing also for name scoping; other variants have been proposed, such as local bigraphs used for studying the λ -calculus. The category of local bigraphs (Lbg) is the full subcategory of binding bigraphs whose objects are of the form 〈n, (~X ),⋃~X〉 (often shorten as (~X )).
    keywords: agent; bigraphs; fn γ; names
       cache: eceasst-414.pdf
  plain text: eceasst-414.txt

        item: #412 of 858
          id: eceasst-415
      author: Hermann, Frank; Corradini, Andrea; Ehrig, Hartmut; König, Barbara
       title: Efficient Analysis of Permutation Equivalence of Graph Derivations Based on Petri Nets
        date: 2010-07-21
       words: 7184
      flesch: 61
     summary: In Millions Amount of Equivalent Sequences Logarithmic Scale 1,0E+00 1,0E+02 1,0E+04 1,0E+06 1,0E+08 1,0E+10 1,0E+12 1,0E+14 1,0E+16 4 6 8 10 12 14 16 18 20 Transformation Steps E q u iv a le n t S e q u e n c e s Switch Equivalence without NACs Permutation Equivalence Figure 8: Comparison of the Amount of Equivalent Sequences RG(DNet(d̃)) is given by: eff < 9 ·n, where n is n = 20 ·10! = 72.576.000, which is the num- ber of derivation steps in the set of all permutation-equivalent derivations. , qn ∈Q and di = Gi−1 = π(qi),mi ====⇒ Gi are direct derivations (respecting NACs) for i∈1, . . .
    keywords: derivation; equivalence; graph; nacs; net; permutation; person; task; transformation; workson
       cache: eceasst-415.pdf
  plain text: eceasst-415.txt

        item: #413 of 858
          id: eceasst-416
      author: Hassan, Abubakar; Mackie, Ian; Sato, Shinya
       title: A lightweight abstract machine for interaction nets
        date: 2010-07-22
       words: 5002
      flesch: 74
     summary: Configurations have the form: 〈 t̄ | ∆ 〉, where t̄ is a sequence of terms representing the interface of the net and ∆ is a sequence of equations. Theorem 2 Let 〈 t̄ | ∆ 〉 be a configuration.
    keywords: interaction; nets
       cache: eceasst-416.pdf
  plain text: eceasst-416.txt

        item: #414 of 858
          id: eceasst-417
      author: Mol, Maarten de; Rensink, Arend
       title: On A Graph Formalism for Ordered Edges
        date: 2010-07-22
       words: 5574
      flesch: 70
     summary: In order to justify the cost of a more complex formalism on the level of theory, we show that DPO graph rewriting is well-behaved in the resulting category of list graphs. We show the use of list graphs in Section 4.
    keywords: edges; event; figure; graph; list; morphisms; nodes; parts
       cache: eceasst-417.pdf
  plain text: eceasst-417.txt

        item: #415 of 858
          id: eceasst-418
      author: Bartels, Björn; Glesner, Sabine; Göthel, Thomas
       title: Model Transformations to Mitigate the Semantic Gap in Embedded Systems Verification
        date: 2010-11-01
       words: 7097
      flesch: 60
     summary: These mappings make the usage of the automatic verification tools FDR2 and UPPAAL available for the verification of Timed CSP processes. We showed that all the considered kinds of bisimulation (strong, weak and weak timed) fulfill the congruence property with respect to the structure of Timed CSP processes.
    keywords: approach; code; csp; hol; invariants; isabelle; level; llvm; model; network; process; processes; semantics; specification; systems; verification
       cache: eceasst-418.pdf
  plain text: eceasst-418.txt

        item: #416 of 858
          id: eceasst-419
      author: Bottoni, Paolo; Parisi Presicce, Francesco
       title: A Termination Criterion for Graph Transformations with Negative Application Conditions
        date: 2010-11-01
       words: 5223
      flesch: 65
     summary: If rule p is of type must terminate, then the application of asLongAsPossible p end on the starting graph G terminates after a finite number of steps. This is the case of a rule which should terminate simply, as there is a path which consumes the possibility of rule application on the original match, but does not terminate, as the number of matches for the rule increases at each application of p.
    keywords: application; figure; graph; matches; rule; termination
       cache: eceasst-419.pdf
  plain text: eceasst-419.txt

        item: #417 of 858
          id: eceasst-42
      author: Kolovos, Dimitrios S; Paige, Richard F; Polack, Fiona A.C
       title: Aligning OCL with Domain-Specific Languages to Support Instance-Level Model Queries
        date: 2007-07-04
       words: 4472
      flesch: 54
     summary: Due to the MOF-OCL alignment, OCL queries can be expressed at the metamodel level and evaluated at the model-level for all MOF-based 1 / 13 Volume 5 (2006) Currently, OCL queries can be expressed only in the context of MOF metamodels and UML models.
    keywords: eol; instance; level; model; ocl; operation; queries; semantics; support
       cache: eceasst-42.pdf
  plain text: eceasst-42.txt

        item: #418 of 858
          id: eceasst-420
      author: Schätz, Bernhard
       title: Verification of Model Transformations
        date: 2010-07-25
       words: 5491
      flesch: 41
     summary: Es- pecially for model transformation generally defined using abstract description tech- niques like graph transformations or declarative relational specifications, however, establishing the soundness of those transformations by test-based approaches is not straight-forward. 1 / 13 Volume 29 (2010) mailto:schaetz@fortiss.org Verification of Model Transformations 1.1 Related Approaches Verification of model transformations has been specifically investigated for graph-based trans- formation technquies (e.g., [GGL+06] and [Str08]).
    keywords: approach; class; group; link; model; proof; relation; subcomp; term; transformation; verification
       cache: eceasst-420.pdf
  plain text: eceasst-420.txt

        item: #419 of 858
          id: eceasst-422
      author: Küster, Jochen M.; Tuosto, Emilio
       title: Preface
        date: 2010-08-02
       words: 615
      flesch: 31
     summary: Claudia Ermel (TU Berlin, Germany) Gregor Engels (University of Paderborn, Germany) Reiko Heckel (University of Leicester, UK) Thomas Hildebrandt (IT University of Copenhagen, Denmark) Holger Giese (HPI Potsdam, Germany) Barbara König (University of Duisburg-Essen, Germany) Jochen Küster (IBM Research Zurich, Switzerland) Emilio Tuosto (University of Leicester, UK) Dániel Varró (TU Budapest, Hungary) Ehrard Weinell (RWTH Aachen University, Germany)
    keywords: germany; university; workshop
       cache: eceasst-422.pdf
  plain text: eceasst-422.txt

        item: #420 of 858
          id: eceasst-423
      author: Ermel, Claudia; Ehrig, Karsten
       title: Graph Modelling and Transformation: Theory meets Practice
        date: 2010-11-01
       words: 8442
      flesch: 56
     summary: Graph transformation systems provide concurrency concepts which are suitable to be applied in this area. Many verification results for graph transformation systems are based on critical pair analysis.
    keywords: analysis; case; domain; figure; graph; graph transformation; model; modelling; proc; properties; rule; software; study; syntax; system; tools; transformation; volume
       cache: eceasst-423.pdf
  plain text: eceasst-423.txt

        item: #421 of 858
          id: eceasst-424
      author: Hermann, Frank; Hülsbusch, Mathias; König, Barbara
       title: Specification and Verification of Model Transformations
        date: 2010-11-01
       words: 8396
      flesch: 58
     summary: In order to verify model transformations with respect to behavioural equivalence we apply well-studied techniques based on the double pushout approach with borrowed context, for which the model transforma- tions specified by triple graph transformation rules are flattened to plain (in-situ) graph transformation rules. Note also that in more complex scenarios the bisimulation R might contain additional pairs that are not model transformation rules (see [HKR+10a]).
    keywords: graph; language; model; model transformations; rules; source; specification; target; transformation
       cache: eceasst-424.pdf
  plain text: eceasst-424.txt

        item: #422 of 858
          id: eceasst-425
      author: Löwe, Michael
       title: Position Paper: Formal Methods in Agile Development
        date: 2010-11-01
       words: 2495
      flesch: 53
     summary: Therefore, suitable formal models must be able to specify system models together with system states. In the first area, formal methods, especially graph transformations, have provided precise se- mantics for model specifications and transformation concepts from abstract to concrete system descriptions including correctness notions for static as well as dynamic models (i. e. data struc- tures and process models respectively).
    keywords: development; graph; methods; model; software; state; system; transformation
       cache: eceasst-425.pdf
  plain text: eceasst-425.txt

        item: #423 of 858
          id: eceasst-426
      author: Modica, Tony; Hoffmann, Kathrin
       title: Formal Modeling of Communication Platforms using Reconfigurable Algebraic High-Level Nets
        date: 2010-11-02
       words: 10366
      flesch: 57
     summary: Thus, to achieve an adequate dynamic reconfiguration at runtime, not only the structure of an AHL net is manipulated by rule application but also its marking. Due to the dangling conditions for rule applications, a rule can not delete the environment of a transition that is not part of the match.
    keywords: ahli; client; communication; conference; fig; firing; modeling; nets; petri; place; rule; skype; token; transformation; transition
       cache: eceasst-426.pdf
  plain text: eceasst-426.txt

        item: #424 of 858
          id: eceasst-427
      author: Bruni, Roberto; Corradini, Andrea; Montanari, Ugo
       title: Modeling a Service and Session Calculus with Hierarchical Graph Transformation
        date: 2010-11-01
       words: 7874
      flesch: 60
     summary: In particular, as the CaSPiS reduction semantics allows for reactions in (static) contexts of arbitrary depth, the standard notion of graph transformation rule, which has a local effect only, is not sufficient to model it. Even if we did not work out the corresponding definitions, we identified a few graph trans- formation frameworks which can provide the means to turn such rule schemata into collections of graph rewrite rules, whose overall effect would be the expected one when applied to a graph representing a CaSPiS process.
    keywords: algebra; calculus; caspis; design; encoding; graph; nodes; process; rules; session; set; transformation
       cache: eceasst-427.pdf
  plain text: eceasst-427.txt

        item: #425 of 858
          id: eceasst-429
      author: Brijder, Robert; Ehrenfeucht, Andrzej; Rozenberg, Grzegorz
       title: A Note on Causalities in Reaction Systems
        date: 2010-11-01
       words: 4665
      flesch: 74
     summary: The influence graph of A , denoted by infA , is the digraph (S,E), where for x,y ∈ S, (x,y)∈ E if and only if x ∈ Ma and y ∈ Pa for some a ∈ A. Example 3 Let x ∈ S, and let n0 ≥ 0 be such that cdx,y ≤ n0 for all y ∈ S. Then |S|≤ ∑ n0 d=0 q d . Proof.
    keywords: reaction
       cache: eceasst-429.pdf
  plain text: eceasst-429.txt

        item: #426 of 858
          id: eceasst-43
      author: Löwe, Michael; König, Harald; Peters, Michael; Schulz, Christoph
       title: Refactoring Informations Systems
        date: 2007-02-20
       words: 7483
      flesch: 72
     summary: Thus, we can present our requirements for a category to provide the infrastructure for unique migrations and sequential compositions as follows: An abstract migration framework is a category C together with two subcategories T and R which have the same objects as C. The morphisms in T are called typings and the morphisms in R are called refactoring morphisms. We propose another approach, namely the generation of the necessary data migration directly from model refactoring, compare also [12].
    keywords: pullback; refactoring
       cache: eceasst-43.pdf
  plain text: eceasst-43.txt

        item: #427 of 858
          id: eceasst-430
      author: Ehrig, Hartmut
       title: From Separate Formal Specifications to Certified Integrated Visual Modelling Techniques and Environments - Position Statement
        date: 2010-11-01
       words: 2233
      flesch: 40
     summary: The TFS-group was especially involved in COMPASS, on algebraic specification techniques, and in COMPUGRAPH, GETGRATS, APPLIGRAPH, and SEGRAVIS on graph transformation techniques. In fact, graph transformation techniques are also most suitable for model transformations between visual and visual or textual modelling languages.
    keywords: graph; modelling; software; techniques; theory; transformation
       cache: eceasst-430.pdf
  plain text: eceasst-430.txt

        item: #428 of 858
          id: eceasst-431
      author: Bapodra, Mayur; Heckel, Reiko
       title: From Graph Transformations to Differential Equations
        date: 2010-11-01
       words: 9278
      flesch: 57
     summary: In this way, a fully defined set of concrete reactions between all reacting species is reduced to a smaller set of reaction rules that can be contextualised to fit possibly numerous specific pairs of reactants. This representation allows us to use tools such as AGG to analyse a system of reaction rules.
    keywords: analysis; ch3; chemical; figure; graph; matrix; nodes; pair; rate; reaction; rule; system; transformation
       cache: eceasst-431.pdf
  plain text: eceasst-431.txt

        item: #429 of 858
          id: eceasst-433
      author: Engels, Gregor; Soltenborn, Christian
       title: Test-driven Language Derivation with Graph Transformation-Based Dynamic Meta Modeling
        date: 2010-11-01
       words: 7776
      flesch: 55
     summary: For instance, DMM rules can explicitly invoke other DMM rules, which is not supported by common graph transformation tools. DMM rules are (annotated) UML object diagrams, i.e., instances of the language’s metamodel.
    keywords: behavior; case; dmm; example; execution; graph; language; model; rule; semantics; specification; test
       cache: eceasst-433.pdf
  plain text: eceasst-433.txt

        item: #430 of 858
          id: eceasst-436
      author: Ermel, Claudia; Ehrig, Hartmut; Orejas, Fernando; Taentzer, Gabriele
       title: International Colloquium on Graph and Model Transformation (GraMoT) 2010: Preface
        date: 2010-11-01
       words: 1909
      flesch: 37
     summary: Keywords: graph transformation, model transformation Scope and Objectives of the Colloquium Graphs are a general kind of models which have been used in various fields of computer science. Graphs can be manipulated by graph transformation in a rule-based manner.
    keywords: berlin; germany; graph; hartmut; model; transformation; universität
       cache: eceasst-436.pdf
  plain text: eceasst-436.txt

        item: #431 of 858
          id: eceasst-437
      author: Mahr, Bernd
       title: Position Statement: Models in Software and Systems Development
        date: 2010-11-08
       words: 4992
      flesch: 45
     summary: In the context of this pattern an object of type G is called model object and an object of type μ is called model. The class diagram (model object) is then developed to show these items (realization).
    keywords: development; model; model object; modelling; object; software; system; type
       cache: eceasst-437.pdf
  plain text: eceasst-437.txt

        item: #432 of 858
          id: eceasst-438
      author: Taentzer, Gabriele
       title: What Algebraic Graph Transformations Can Do For Model Transformations
        date: 2010-11-01
       words: 4436
      flesch: 51
     summary: This paper focusses on the use of alge- braic graph transformation concepts to specify and verify model transformations in MDD. Keywords: model transformation, graph transformation 1 Introduction Model transformations play a central role in model-driven software development. Thus, model transformations are defined based on both, the concrete and abstract syntax definition.
    keywords: 2010; algebraic; approaches; concepts; graph; graph transformation; model; model transformations; springer; transformation
       cache: eceasst-438.pdf
  plain text: eceasst-438.txt

        item: #433 of 858
          id: eceasst-439
      author: Margaria, Tiziana; Steffen, Bernhard; Topnik, Christian
       title: Second-Order Value Numbering
        date: 2010-11-08
       words: 4428
      flesch: 60
     summary: transformers - 1 6 As we expected, first order value numbering does not contribute significatively to perfor- mance: the sharing is at the level of subcircuit types, not of fully instanced values. We will illustrate the impact of this optimization in Section 5. 5 / 15 Volume 30 (2010) Second-Order Value Numbering Figure 4: 1st order value numbering applied to the jMosel formula F . 4 Second-Order Value Numbering While first-order value numbering is used to identify redundant computations and replacing them by previously computed results, the goal of second-order value numbering is to identify redun- dant transformations - the reason for the use of second-order here.
    keywords: formula; jmosel; numbering; order; second; semantics; set; value
       cache: eceasst-439.pdf
  plain text: eceasst-439.txt

        item: #434 of 858
          id: eceasst-44
      author: Wahler, Michael; Koehler, Jana; Brucker, Achim D.
       title: Model-Driven Constraint Engineering
        date: 2007-07-04
       words: 8444
      flesch: 55
     summary: Secondly, we intro- duce a library of constraint patterns, separate the patterns into atomic and composite patterns, and add a structure to them to enhance their expressiveness and usability. Secondly, we divide constraint patterns into atomic and composite patterns.
    keywords: approach; class; constraint; constraint patterns; engineering; example; instance; manager; model; n t; navigation; ocl; pattern; self; uml
       cache: eceasst-44.pdf
  plain text: eceasst-44.txt

        item: #435 of 858
          id: eceasst-440
      author: Hanysz, Martin; Hoppe, Tobias; Uhl, Axel; Seibel, Andreas; Giese, Holger; Berger, Philipp; Hildebrandt, Stephan
       title: Navigating Across Non-Navigable Ecore References via OCL
        date: 2010-11-29
       words: 2333
      flesch: 46
     summary: This is essential for certain approaches, e.g., incremental evaluation of OCL constraints on models shown by Altenhofen et al. In both cases, OCL constraints cannot be expressed against navigation direction.
    keywords: emf; meta; models; ocl; opposite; references
       cache: eceasst-440.pdf
  plain text: eceasst-440.txt

        item: #436 of 858
          id: eceasst-441
      author: Chiorean, Dan Ioan; Petrascu, Vladiela
       title: Towards a Conceptual Framework Supporting Model Compilability
        date: 2010-11-29
       words: 5727
      flesch: 43
     summary: In [BF09], the authors report on identifying “counter examples” of UML models (models breaking well-formedness rules) that were not catched by the ArgoUML tool. Validating UML models and OCL constraints.
    keywords: association; compilability; composition; context; language; model; ocl; semantics; specification; uml; wfrs
       cache: eceasst-441.pdf
  plain text: eceasst-441.txt

        item: #437 of 858
          id: eceasst-442
      author: Tounsi, Mohamed; Mosbah, Mohamed; Méry, Dominique
       title: Proving Distributed Algorithms by Combining Refinement and Local Computations
        date: 2011-08-08
       words: 10517
      flesch: 64
     summary: http://hal.archives-ouvertes.fr/hal-00361933/en/ 21 / 21 Volume 35 (2010) http://hal.inria.fr/inria-00336624/en/ http://hal.archives-ouvertes.fr/hal-00361933/en/ Introduction Overview The local computation model for deriving correct-by-construction distributed algorithms Patterns for proof-based developments Organization of the paper Modeling by Step-wise Refinement Local Computation Models Distributed computation of a spanning tree 3-coloring of a ring Formal definition of local computations A pattern for combining local computation models We propose in this work a framework combining local computations models and refinement to prove the correctness of a large class of distributed algorithms.
    keywords: algorithm; computation; edges; event; graph; model; nodes; proof; refinement; set; state
       cache: eceasst-442.pdf
  plain text: eceasst-442.txt

        item: #438 of 858
          id: eceasst-443
      author: Anjorin, Anthony; Lauder, Marius Paul; Schlereth, Michael; Schürr, Andy
       title: Support for Bidirectional Model-to-Text Transformations
        date: 2011-03-14
       words: 6451
      flesch: 54
     summary: Along similar lines, model transformations can be formalised using graph grammars [EGL+05]. For the text to model transformation, this code is passed on to the parser (Fig. 3::8) that decides which parts of the text are relevant and which not.
    keywords: case; code; fig; metamodel; model; rule; stl; text; textual; transformation
       cache: eceasst-443.pdf
  plain text: eceasst-443.txt

        item: #439 of 858
          id: eceasst-444
      author: Willink, Edward Daniel
       title: Re-engineering Eclipse MDT/OCL for Xtext
        date: 2011-03-13
       words: 5689
      flesch: 47
     summary: With the aid of Xtext and other modern tooling it may be practical to have OCL editor and parser tooling reusing the exposition of grammars and constraints in the OCL specification. Referring back to Figure 1, we have lexer and parser grammars, analysis and well-formedness rules defined in the OCL specification.
    keywords: asg; code; cst; eclipse; grammar; lpg; meta; model; ocl; parser; xtext
       cache: eceasst-444.pdf
  plain text: eceasst-444.txt

        item: #440 of 858
          id: eceasst-445
      author: Egea, Marina; Dania, Carolina; Clavel, Manuel
       title: MySQL4OCL: A Stored Procedure-Based MySQL Code Generator for OCL
        date: 2010-11-29
       words: 6224
      flesch: 51
     summary: Keywords: OCL, code generator, stored-procedures, MySQL 1 Introduction In this paper we introduce a MySQL code generator for a significant subset of OCL expressions which is based on the use of stored procedures for mapping OCL iterators. Abstract: In this paper we introduce a MySQL code generator for a significant sub- set of OCL expressions which is based on the use of stored procedures for mapping OCL iterators.
    keywords: class; code; code generator; codegen(expr1; expressions; generator; iterator; mapping; mysql; ocl; select; value
       cache: eceasst-445.pdf
  plain text: eceasst-445.txt

        item: #441 of 858
          id: eceasst-446
      author: Fairmichael, Fintan; Kiniry, Joseph
       title: Verified Visualisation of Textual Modelling Languages
        date: 2010-11-29
       words: 7003
      flesch: 56
     summary: EClass Abstraction Model StaticAbstraction Cluster BONClass StaticRelationship Feature IndexClause InheritanceClause FeatureArgument PreCondition PostCondition Invariant InheritanceRel ClientSupplierRel AggregationRel AssociationRel RelationshipType EEnum ImplementationStatus Figure 3: BON graphical model type hierarchy. BON model view ?
    keywords: bon; classes; cluster; definition; diff; function; graphical; model; modelling; pvs; system; textual; type; view
       cache: eceasst-446.pdf
  plain text: eceasst-446.txt

        item: #442 of 858
          id: eceasst-447
      author: Baar, Thomas
       title: On the Need of User-defined Libraries in OCL
        date: 2011-02-10
       words: 3652
      flesch: 60
     summary: We argue on the need of user-defined libraries and propose an architecture for OCL libraries. 4 A Proposal for OCL Libraries
    keywords: classes; java; language; libraries; library; ocl; uml; user
       cache: eceasst-447.pdf
  plain text: eceasst-447.txt

        item: #443 of 858
          id: eceasst-448
      author: Barbosa, Luis Soares; Cerone, Antonio; Shaikh, Siraj Ahmed
       title: Preface
        date: 2010-12-10
       words: 947
      flesch: 29
     summary: Luis S. Barbosa, Minho University, Portugal Antonio Cerone, United Nations University, Macau SAR China Siraj Ahmed Shaikh, Coventry University, United Kingdom Proc. Tomasz Janowski, UNU-IIST, United Nations University, Macau SAR China • Paddy Krishnan, Bond University, Australia • Paolo Milazzo, Dipartimento di Informatica, Universit di Pisa, Italy • José Miranda, MULTICERT, Portugal • John Noll, LERO, Ireland 3 / 4 Volume 33 (2010) Preface • Alexander K. Petrenko, ISP, Russian Academy of Science, Russian Federation • Simon Pickin, Universidad Carlos III de Madrid, Spain • Siraj Shaikh, Coventry University, UK (Co-chair) • Sulayman K. Sowe, UNU-MERIT, United Nations University, The Netherlands • Ralf Treinen, PPS, Universit Paris Diderot, France • Joost Visser, Software Improvement Group, The Netherlands • David von Oheimb, Siemens Corporate Technology, Germany • Tanja Vos, Universidad Politcnica de Valencia, Spain • Anthony Wasserman, Carnegie Mellon Silicon Valley, US Proc.
    keywords: certification; opencert; oss; software; united; university
       cache: eceasst-448.pdf
  plain text: eceasst-448.txt

        item: #444 of 858
          id: eceasst-449
      author: Kakarontzas, George; Katsaros, Panagiotis; Stamelos, Ioannis
       title: Component Certification as a Prerequisite forWidespread OSS Reuse
        date: 2010-12-10
       words: 8349
      flesch: 45
     summary: The OPEN-SME project emphasizes trustworthiness of software components through product-based approaches to quality because, as we already mentioned, process-based approaches are not suitable for OSS software reuse. This work addresses the main technical issues behind OSS component certification by formal and semifor- mal techniques, as well as the incentives that raised the need for the OPEN-SME European funded project.
    keywords: analysis; certification; code; component; domain; oss; oss reuse; oss software; process; project; quality; reuse; search; sme; software; source; system; tools
       cache: eceasst-449.pdf
  plain text: eceasst-449.txt

        item: #445 of 858
          id: eceasst-45
      author: Brucker, Achim D.; Doser, Jürgen; Wolff, Burkhart
       title: An MDA Framework Supporting OCL
        date: 2007-07-04
       words: 8203
      flesch: 63
     summary: For example, the target UML model has to support the specification of OCL constraints that talk about users and their roles. Also, every access controlled “action” in the SecureUML model has to be represented by an UML operation in the target UML model.
    keywords: e n; model; n t; ocl; r e; s s; t e; t r
       cache: eceasst-45.pdf
  plain text: eceasst-45.txt

        item: #446 of 858
          id: eceasst-450
      author: Fusani, Mario; Marchetti, Eda
       title: Damages and Benefits of Certification: A perspective from an Independent Assessment Body
        date: 2010-12-10
       words: 5302
      flesch: 51
     summary: Cust User Tester EUser CB is independent M M M M L H CB is accredited M H H L L M standard conformant CB processes M H M L L L Tests are severe M H M M H M Formal Methods used when possible H H M M M M Reverse Engineering used when possible M M L M M L Reference Standards easy to adopt H H H H H M Reference Standards easy to check conformance M M M M M M Traceable Product H H M M H M Evidence of product lifecycle is available M M M L M L Use of collaborative tools H H M M H M Automated process H H H H H M Independent development H H H H H M History of evolution H H H M H M they continuously evolve according to exigencies of individuals or companies, influencing there- fore the certification process. Damages and Benefits of Certification: A perspective from an Independent Assessment Body Electronic Communications of the EASST Volume 33 (2010) Proceedings of the Fourth International Workshop on Foundations and Techniques for Open Source Software Certification (OpenCert 2010) Damages and Benefits of Certification:
    keywords: certification; confidence; factors; oss; process; software
       cache: eceasst-450.pdf
  plain text: eceasst-450.txt

        item: #447 of 858
          id: eceasst-451
      author: Feuser, Johannes; Peleska, Jan
       title: Security in Open Model Software with Hardware Virtualisation – The Railway Control System Perspective
        date: 2010-12-10
       words: 5718
      flesch: 39
     summary: [Has09b, Has09a]. Reviewing evidence where security threats had been purposefully integrated into closed-source commercial software products, the author argued that open source software could be useful – perhaps even mandatory in the future – to ensure safety and security of railway control systems: even though the standards applicable for safety-critical systems software development in the railway domain [CEN01a, CEN99] require independent-party verification and validation, the complexity of the source code on the one hand and the limited budget available for V&V on the other hand can only mitigate the threat of safety and security vulnerabilities, but cannot guarantee to uncover all compromising code components inadvertently or purposefully injected into the code. Open Source (verified and validated) Open Meta Metamodel Open Metamodel instantiates Model 1 instantiates Model 2 instantiates Model 3 instantiates Model Implementation 1 generates Supplier Implementation 1 instantiates Supplier Implementation 2 (malicious) instantiates instantiates comunicates comunicates comunicatescompromises compromises Figure 2: Possible security threats in open model software combined with platform-specific adaptations.
    keywords: control; hardware; instantiates; model; open; operating; railway; safety; security; software; source; systems; virtualisation
       cache: eceasst-451.pdf
  plain text: eceasst-451.txt

        item: #448 of 858
          id: eceasst-452
      author: Charpentier, Robert; Debbabi, Mourad; Alhadidi, Dima; Mourad, Azzam; Belblidia, Nadia; Boukhtouta, Amine; Hanna, Aiman; Hadjidj, Rachid; Kaitouni, Hakim; Laverdière, Marc-André; Ling, Hai Zhou; Tlili, Syrine; Yang, Xiaochun; Yang, Zhenrong
       title: Security Evaluation and Hardening of Free and Open Source Software (FOSS)
        date: 2010-12-10
       words: 7181
      flesch: 53
     summary: The evaluation aims to automatically detect vul- nerabilities in FOSS that will be corrected by the systematic injection of security code thanks to dedicated aspect-oriented technologies. Security hardening practices are usually manually applied by injecting security code into software [Bis05, HL02, Sea05].
    keywords: analysis; approach; aspect; code; foss; gcc; gimple; hardening; language; model; pattern; program; rules; security; software; source; use; weaving
       cache: eceasst-452.pdf
  plain text: eceasst-452.txt

        item: #449 of 858
          id: eceasst-453
      author: Hashmi, Zulqarnain; Shaikh, Siraj Ahmed; Ikram, Naveed
       title: Methodologies and Tools for OSS: Current State of the Practice
        date: 2010-12-10
       words: 5226
      flesch: 55
     summary: OSS projects are also less likely to be supported by project management, metrics, estimation and scheduling tools as there is no need for strict deadlines and balancing budgets [RFL05, Rob02]. OSS projects have been criticised for lack of clear and open detail of development processes. Our effort is aimed at better understanding some of the development processes and behaviour within a set of OSS projects.
    keywords: code; community; developers; development; engineering; management; oss; projects; release; software; source; survey; testing; tools
       cache: eceasst-453.pdf
  plain text: eceasst-453.txt

        item: #450 of 858
          id: eceasst-454
      author: Sowe, Sulayman K; Cerone, Antonio
       title: Integrating Data from Multiple Repositories to Analyze Patterns of Contribution in FOSS Projects
        date: 2010-12-10
       words: 6833
      flesch: 63
     summary: This is because, while a developer has only one identification in SVN, his commit id, the same developer may use many email addresses when posting messages to developer mailing lists. From the messages people table, LIST developers “email address”, WHERE people.email address = messages people.email address.
    keywords: commits; contribution; data; developers; foss; lists; mailing; mailing lists; projects; software; source; svn
       cache: eceasst-454.pdf
  plain text: eceasst-454.txt

        item: #451 of 858
          id: eceasst-455
      author: Olesen, Mads Chr.; Hansen, Rene Rydhof; Lawall, Julia L.; Palix, Nicolas
       title: Clang and Coccinelle: Synergising program analysis tools for CERT C Secure Coding Standard certification
        date: 2010-12-10
       words: 8017
      flesch: 55
     summary: Synergising program analysis tools for CERT C Secure Coding Standard certification Electronic Communications of the EASST Volume 33 (2010) Proceedings of the Fourth International Workshop on Foundations and Techniques for Open Source Software Certification (OpenCert 2010) Clang and Coccinelle: In the following we will illustrate both uses as well as how we intend to make program analysis information available for use in semantic patches.
    keywords: analysis; ccscs; clang; coccinelle; information; line; patch; program; recommendations; rules; semantic; tool
       cache: eceasst-455.pdf
  plain text: eceasst-455.txt

        item: #452 of 858
          id: eceasst-456
      author: Breuer, Peter T; Pickin, Simon
       title: Open Source Verification under a Cloud
        date: 2010-12-10
       words: 9427
      flesch: 62
     summary: Section 4 describes an experiment performed on about a million lines of C source code. Firstly, repetition of modal ‘colouring’ operators has no effect: E p ⇔ E E p (24) for E any of N, R, B, Gl .
    keywords: analysis; cloud; code; computation; condition; database; logic; proc; software; source; time; verification; volunteer; work
       cache: eceasst-456.pdf
  plain text: eceasst-456.txt

        item: #453 of 858
          id: eceasst-457
      author: Cerone, Antonio; Sowe, Sulayman K
       title: Using Free/Libre Open Source Software Projects as E-learning Tools
        date: 2010-12-10
       words: 7765
      flesch: 43
     summary: 4 Impact on the Quality of FLOSS Products We have seen in Section 3 that students can successfully use FLOSS projects as e-Learning tools and gain effective learning of software engineering skills and concepts from participating in FLOSS project. This has encouraged tertiary educators to attempt the inclusion of participation in FLOSS projects as part of the requirements of Software Engineering courses, and pilot studies have been con- ducted to test the effectiveness of such an attempt.
    keywords: communities; development; education; engineering; floss; knowledge; learning; pilot; project; quality; software; source; students; tools
       cache: eceasst-457.pdf
  plain text: eceasst-457.txt

        item: #454 of 858
          id: eceasst-458
      author: Simões, Alberto; Carvalho, Nuno; Almeida, José João
       title: Testing as a Certification Approach
        date: 2010-12-10
       words: 5214
      flesch: 58
     summary: Three different aspects of Perl modules began to be tested (there are some other aspects that could be included here but that we decided to ignore them, as they can be considered part of one of the categories we present here): • tests started with simple code testing (section 3.1), just like any other programming language unit-testing framework; • then followed the addition of tests for documentation and documentation coverage (section 3.2), checking the syntax of the documentation and its completeness; • finally, tests for checking distribution contents (section 3.3) are arising, to ensure every file required is being shipped in the module tarball. Trying to overcome the usual problem of discussing who certifies certification agencies, or who controls persons responsible for controlling others, section 4 presents an approach to testing tests using the code that was written to pass those tests.
    keywords: approach; code; cpan; developer; documentation; module; perl; testing; tests; user
       cache: eceasst-458.pdf
  plain text: eceasst-458.txt

        item: #455 of 858
          id: eceasst-459
      author: Silva, Joao Carlos; Creissac, José; Saraiva, Joao
       title: GUI Inspection from Source Code Analysis
        date: 2010-12-10
       words: 7317
      flesch: 59
     summary: This work is an approach to bridging this gap by allowing us to reason about GUI models from source code. We described GUI models extracted automatically from the code, and presented a methodology to reason about the user interface model.
    keywords: analysis; application; code; event; graph; gui; interface; metrics; source; state; test; tool; user; vertices; window
       cache: eceasst-459.pdf
  plain text: eceasst-459.txt

        item: #456 of 858
          id: eceasst-46
      author: Brucker, Achim D.; Doser, Jürgen; Wolff, Burkhart
       title: Semantic Issues of OCL: Past, Present, and Future
        date: 2007-07-04
       words: 9214
      flesch: 58
     summary: The technical reason is a consequence of our design choice to use the typed meta-language in a particular way, namely by mapping OCL types injectively to HOL types in our presentation. an of OCL types T1, . . .
    keywords: definition; hol; language; object; ocl; omg03a; operation; semantics; set; specification; standard; type; uml
       cache: eceasst-46.pdf
  plain text: eceasst-46.txt

        item: #457 of 858
          id: eceasst-460
      author: Areias, Sergio; Cruz, Daniela Da; Henriques, Pedro Rangel; Pinto, Jorge Sousa
       title: Safe Integration of Annotated Components in Open Source Projects
        date: 2010-12-10
       words: 6421
      flesch: 57
     summary: In [CH96], Comuzzi et al present a variant of program slicing called p-slice or predicate slice, using Dijkstra’s weakest preconditions (wp) to determine which statements will affect a specific predicate. This type of program slicing is based on the following rule: “Statements are removed if they cannot lead to the satisfaction of the negation of the post condition, when executed in an initial state Proc.
    keywords: components; contract; graph; integration; node; program; slice; slicing; software; source; statements; system
       cache: eceasst-460.pdf
  plain text: eceasst-460.txt

        item: #458 of 858
          id: eceasst-461
      author: Barbosa, Manuel; Pinto, J.; Filliatre, J.-C.; Vieira, B.
       title: A Deductive Verification Platform for Cryptographic Software
        date: 2010-12-10
       words: 9044
      flesch: 59
     summary: Figure 2 presents the allowed cast (→) and coercion (⇒) operations between CAO types. Rings and finite fields pose an interesting problem, as they are not distinct CAO types.
    keywords: bits; cao; def; integer; jessie; language; logic; model; modn; operations; programs; proof; safety; tool; type; vector; verification
       cache: eceasst-461.pdf
  plain text: eceasst-461.txt

        item: #459 of 858
          id: eceasst-47
      author: Chimiak-Opoka, Joanna Dobroslawa; Lenz, Chris
       title: Use of OCL in a Model Assessment Framework: An experience report
        date: 2007-07-04
       words: 7560
      flesch: 69
     summary: OCL component provides an Application Programming Interface (API) for OCL expression syntax which can be used to implement OCL queries and constraints. We plan to carry out more case studies to determine more requirements for model assessments queries and define patterns for query definitions.
    keywords: e c; e t; l e; l l; l s; l t; o l; p l; s e; s t; t t; t u
       cache: eceasst-47.pdf
  plain text: eceasst-47.txt

        item: #460 of 858
          id: eceasst-48
      author: Mezei, Gergely; Levendovszky, Tihamér; Charaf, Hassan
       title: Restrictions For OCL Constraint Optimization Algorithms
        date: 2007-07-04
       words: 6987
      flesch: 52
     summary: VMTS uses OCL constraints in model validation as well as in the graph rewriting-based model transformation 2 Backgrounds and Related Work In general, the evaluation of OCL constraints consists of two steps: (i) selecting the object and its properties that we need to check against the constraint and (ii) executing the validation method.
    keywords: algorithm; case; constraint; context; expression; model; multiplicity; navigation; ocl; relocation
       cache: eceasst-48.pdf
  plain text: eceasst-48.txt

        item: #461 of 858
          id: eceasst-49
      author: Horváth, Ákos; Varró, Gergely; Varró, Dániel
       title: Generic Search Plans for Matching Advanced Graph Patterns
        date: 2007-06-07
       words: 5401
      flesch: 55
     summary: Keywords: graph pattern matching, search plan 1 Introduction While nowadays model-driven system development is being supported by a wide range of con- ceptually different model transformation tools, nearly all of these tools have to solve a common problem: the efficient query and manipulation of complex graph-like model structures. However, practical model transfor- mation problems rather have a regular and sparse graph structure, which drastically reduces the 1 / 12 Volume 6 (2007) mailto:ahorvath@mit.bme.hu mailto:varro@mit.bme.hu mailto:gervarro@cs.bme.hu Generic Search Plans for Matching Advanced Graph Patterns execution time of graph pattern matching.
    keywords: check; graph; instance; matching; model; nac; pattern; plans; search
       cache: eceasst-49.pdf
  plain text: eceasst-49.txt

        item: #462 of 858
          id: eceasst-5
      author: Prange, Ulrike
       title: Algebraic High-Level Nets as Weak Adhesive HLR Categories
        date: 2007-05-15
       words: 6365
      flesch: 67
     summary: In this paper, we show that algebraic high-level schemas and nets fit well into the context of weak adhesive HLR categories. Nevertheless, the framework of weak adhesive HLR categories is still sufficient to show under some additional assumptions (which are necessary also in the non-weak case) as 1 / 13 Volume 2 (2006) Algebraic High-Level Nets as Weak Adhesive HLR Categories main results the Local Church-Rosser Theorem, the Parallelism Theorem, the Concurrency The- orem, the Embedding and Extension Theorem and the Local Confluence Theorem, also called Critical Pair Lemma.
    keywords: ahl; categories; category; hlr; morphisms; nets; pullbacks; sets
       cache: eceasst-5.pdf
  plain text: eceasst-5.txt

        item: #463 of 858
          id: eceasst-50
      author: Wrobel, Gregor; Ebert, Ralf-Erik; Pleßow, Matthias
       title: Graph-Based Engineering Systems - A Family of Software Applications and their Underlying Framework
        date: 2007-06-07
       words: 4788
      flesch: 51
     summary: Figure 1: System architecture 2.1 Data Model One common characteristic of graph based engineering systems is the usage of an extended graph model. But for such engineering systems which can be represented by ELADO and which need to store besides the structure information a lot of application data, the described framework is more suitable.
    keywords: application; components; data; elado; energy; engineering; figure; framework; graph; layout; model; software; structure; systems
       cache: eceasst-50.pdf
  plain text: eceasst-50.txt

        item: #464 of 858
          id: eceasst-501
      author: Rensink, Arend; Zambon, Eduardo
       title: Neighbourhood Abstraction in GROOVE
        date: 2011-02-16
       words: 6076
      flesch: 62
     summary: The association of the equation system variables with edge multiplicities is shown in shape S2. First, as long as node and edge multiplicities stay within their bounds, the abstract graph transformation corresponds to the concrete one.
    keywords: abstraction; c n; graph; h n; l c; multiplicity; n n; n t; operation; shape
       cache: eceasst-501.pdf
  plain text: eceasst-501.txt

        item: #465 of 858
          id: eceasst-502
      author: Heinzemann, Christian; Suck, Julian; Eckardt, Tobias
       title: Reachability Analysis on Timed Graph Transformation Systems
        date: 2011-02-16
       words: 5689
      flesch: 54
     summary: 4.2 Modeling Rules Timed graph transformation rules are represented by the abstract class TransformationRule. The core idea is to represent the statecharts and their states as nodes of a graph and to provide graph transformation rules (Timed Story Di- agrams) specifying the state changes resulting from transitions.
    keywords: analysis; clock; framework; graph; reachability; rules; state; story; systems; time; transformation; tts; verification
       cache: eceasst-502.pdf
  plain text: eceasst-502.txt

        item: #466 of 858
          id: eceasst-508
      author: Mazanek, Steffen; Rutetzki, Christian; Minas, Mark
       title: Sketch-based Diagram Editors with User Assistance based on Graph Transformation and Graph Drawing Techniques
        date: 2011-03-13
       words: 6041
      flesch: 59
     summary: But also in the domain of conventional diagram editors, considerable improvements have been achieved. The recognizer transforms these strokes either on-line or on user’s request into a set of diagram components.
    keywords: activity; assistance; components; diagram; editors; event; flow; hypergraph; process; recognition; sketch; user
       cache: eceasst-508.pdf
  plain text: eceasst-508.txt

        item: #467 of 858
          id: eceasst-51
      author: Wörzberger, René; Heller, Markus; Häßler, Frank Walter
       title: Evaluating Workflow Definition Language Revisions with Graph-Based Tools
        date: 2007-06-22
       words: 4956
      flesch: 50
     summary: Therefore, its workflow definition language now has a less clear concep- tual design compared to other workflow definition languages which have been developed from scratch. In contrast to other workflow definition languages, workflow definitions of the WfMS have no dedicated model elements that mark the origin and end of the control flow.
    keywords: activity; definition; graph; language; model; p2a; p2p; wfms; workflow; workflow definition
       cache: eceasst-51.pdf
  plain text: eceasst-51.txt

        item: #468 of 858
          id: eceasst-510
      author: Hegedüs, Ábel; Ujhelyi, Zoltán; Ráth, István; Horváth, Ákos
       title: Visualization of Traceability Models with Domain-specific Layouting
        date: 2011-03-13
       words: 7272
      flesch: 38
     summary: The corresponding source, target and traceability model elements should be placed close to each other for emphasizing the relations between the model elements. Visualization of Traceability Models with Domain-specific Layouting Electronic Communications of the EASST Volume 32 (2010) Proceedings of the Fourth International Workshop on Graph-Based Tools (GraBaTs 2010) Visualization of Traceability Models with Domain-specific Layouting Ábel Hegedüs, Zoltán Ujhelyi, István Ráth and Ákos Horváth 14 pages Guest Editors: Juan de Lara, Daniel Varro Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Visualization of Traceability Models with Domain-specific Layouting Ábel Hegedüs, Zoltán Ujhelyi, István Ráth and Ákos Horváth ∗ (hegedusa,ujhelyiz,rath,ahorvath)@mit.bme.hu, http://www.inf.mit.bme.hu/en Department of Measurement and Information Systems (MIT) Budapest University of Technology and Economics (BME), Budapest, Hungary Abstract: Traceability models are often used to describe the correspondence between source and target models of model transformations.
    keywords: bpel; elements; identifier; identifier process; input; layout; model; s2id; scope2id; source; target; traceability; transformation; visualization
       cache: eceasst-510.pdf
  plain text: eceasst-510.txt

        item: #469 of 858
          id: eceasst-511
      author: Tran, Hanh Nhi; Percebois, Christian; Abou Dib, Ali; Féraud, Louis; Soloviev, Sergei
       title: Attribute Computations in the DPoPb Graph Transformation Engine
        date: 2011-03-16
       words: 6875
      flesch: 58
     summary: GraBaTs10 - V3 Electronic Communications of the EASST Volume 32 (2010) Guest Editors: Juan de Lara, Daniel Varro Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 Proceedings of the Fourth International Workshop on Graph-Based Tools (GraBaTs 2010) Attribute Computations in the DPoPb Graph Transformation Engine Hanh Nhi Tran, Christian Percebois, Ali Abou Dib, Louis Féraud, Sergei Soloviev IRIT, University of Toulouse 118 Route de Narbonne, F-31062 TOULOUSE CEDEX 9 {tran, percebois, aboudib, feraud, soloviev}@irit.fr 14 pages ECEASST 2 / 14 Volume 32 (2010) Attribute Computations in the DPoPb Graph Transformation Engine Hanh Nhi Tran, Christian Percebois, Ali Abou Dib, Louis Féraud, Sergei Soloviev IRIT, University of Toulouse 118 Route de Narbonne, F-31062 TOULOUSE CEDEX 9 {tran, percebois, aboudib, feraud, soloviev}@irit.fr Abstract: One of the challenges of attributed graph rewriting systems concerns the implementation of attribute computations. [11][12][13][3][8]) mostly based on the algebraic data types to implement attribute computations.
    keywords: approach; attribute; computations; dpopb; graph; language; nat; rewriting; system; transformation; type; value
       cache: eceasst-511.pdf
  plain text: eceasst-511.txt

        item: #470 of 858
          id: eceasst-515
      author: Strobl, Torsten; Minas, Mark; Pleuss, Andreas; Vitzthum, Arnd
       title: From the Behavior Model of an Animated Visual Language to its Editing Environment Based on Graph Transformation
        date: 2011-03-13
       words: 5833
      flesch: 53
     summary: Changes of the structure and animation state are the result of events, which may be triggered externally, e.g., by the user, or internally, e.g., when a running car must start breaking because of a red light. The most important AML-specific concepts are animation states which are a special kind of state.
    keywords: aml; animation; behavior; component; events; model; modeling; specification; state; time
       cache: eceasst-515.pdf
  plain text: eceasst-515.txt

        item: #471 of 858
          id: eceasst-517
      author: Hellbrück, Horst
       title: Vorwort
        date: 2011-02-26
       words: 3327
      flesch: 27
     summary: Thomas Sauer, rjm Business Solutions GmbH Ali Sunyaev, Universität zu Köln Ingo Timm, Universität Trier Barbara Weber, Universität Innsbruck Christian Zirpins, KIT (Karlsruhe) Workshop Effective and efficient management of business processes is a key topic of today’s enterprises. Ralf Irmer, Vodafone Group R&D, UK Karl Jonas, Fraunhofer FOKUS, Germany Frank-Peter Jost, Swisscom, Switzerland Wolfgang Kellerer, DOCOMO C. Labs Europe Axel Kuepper, Telekom, Germany Ralf Lehnert, TU Dresden, Germany Harald Orlamünder, ITG, Germany Norbert Niebert, Ericsson, Germany Cornel Pampu, Huawei, Germany Krishna Pandit, Qualcomm, Germany Erwin P. Rathgeb, Universität Duisburg-Essen Martin Sauter, Telekom, Germany Karsten Schröder, Telefonica/O2, Germany Dirk Staehle, University of Wuerzburg Andreas Timm-Giel, Universität Hamburg, G. Kurt Tutschku, Universität Wien, A. Christian Wietfeld, TU Dortmund, Germany Ingo Willimowski, Vodafone D2, Germany Workshop Der Trend hin zu All-IP in drahtgebundenen oder mobilen Next Generation Broadband Net- works, zusammen mit einem stetig wachsenden Interesse an einer effizienten Unterstützung multimedialer Dienste, verstärkt sich weltweit.
    keywords: andreas; beiträge; berlin; den; der; des; die; eceasst; für; germany; hamburg; kassel; kivs; lübeck; michael; mobile; networks; und; universität; university; volume; von; vorwort; werden; wie; wir; workshop; wowkivs
       cache: eceasst-517.pdf
  plain text: eceasst-517.txt

        item: #472 of 858
          id: eceasst-52
      author: Koehler, Christian; Lewin, Holger; Taentzer, Gabriele
       title: Ensuring Containment Constraints in Graph-based Model Transformation Approaches
        date: 2007-06-22
       words: 4811
      flesch: 58
     summary: As shown in Fig- ure 1, model graphs can have containment cycles, being the substates relation in this example. Definition 1 (Graph with containment edges)
    keywords: constraints; containment; edges; graph; model; pushout; state; transformation
       cache: eceasst-52.pdf
  plain text: eceasst-52.txt

        item: #473 of 858
          id: eceasst-520
      author: Ghamarian, AmirHossein; Jalali, Arash; Rensink, Arend
       title: Incremental Pattern Matching in Graph-Based State Space Exploration
        date: 2011-04-04
       words: 6389
      flesch: 64
     summary: Repotting the geraniums: on nested graph transformation rules. In addition to extending RETE to support some special features of GROOVE rules, in particular the quantified rules described in [Ren04a, RK09], the main contributions of this paper are as follows: •
    keywords: algorithm; exploration; graph; groove; matches; matching; network; rete; rule; space; state
       cache: eceasst-520.pdf
  plain text: eceasst-520.txt

        item: #474 of 858
          id: eceasst-521
      author: Blom, Stefan; Kant, Gijs; Rensink, Arend
       title: Distributed Graph-Based State Space Generation
        date: 2011-03-13
       words: 6071
      flesch: 66
     summary: State vectors are minimised to so-called index vectors (see [BLPW08]), which can be efficiently stored and transmitted. Distributed Graph-Based State Space Generation known on the side of the user module, since this is where the coding of state vectors to and from index vectors actually takes place.
    keywords: canonical; cores; graph; groove; isomorphism; ltsmin; nodes; number; set; space; state; vector
       cache: eceasst-521.pdf
  plain text: eceasst-521.txt

        item: #475 of 858
          id: eceasst-528
      author: Ermel, Claudia; Biermann, Enrico; Schmidt, Johann; Warning, Angeline
       title: Visual Modeling of Controlled EMF Model Transformation using HENSHIN
        date: 2011-03-13
       words: 4998
      flesch: 53
     summary: Applying EMF model transformation rules in HENSHIN changes a model in-place, i.e. the model is modified directly. Figure 3: Meta-model for the Personal Mobility Manager Basic PMM actions are modeled by EMF model transformation rules, shown in Figure 4. Rule ChooseDestination creates a Destination object where the name of the desti- nation is an input parameter; rules RequestRouteMap and ResponseRouteMap realize the creation of a route (modeled by a Route object) via a web service call.
    keywords: application; conditions; control; emf; figure; graph; henshin; model; modeling; rule; transformation; unit; view
       cache: eceasst-528.pdf
  plain text: eceasst-528.txt

        item: #476 of 858
          id: eceasst-529
      author: de Lara, Juan; Varro, Daniel
       title: Preface of the Fourth International Workshop on Graph-Based Tools, GraBaTs 2010
        date: 2011-03-18
       words: 637
      flesch: 25
     summary: Based upon mathematically solid underlying concepts, graphs are at the core of tools and techniques in various application areas, and dealing with practical concerns, like: tools for model-driven development, meta CASE tools or gen- erators, tools for Visual languages (UML, Domain-specific languages), model transformation and model management tools, visualization, animation and simulation tools, analysis of mod- els, transformations and programs (including verification and validation, static analysis, testing), data analysis and pattern recognition techniques, tool integration techniques, software engineer- ing tools, software evolution and efficient algorithms (pattern matching, handling of large graph models). Different tools, built around industry-driven frameworks (like Eclipse), are based on the notion of graph to perform different activities, most notably different model transformations, like animations, simulations, refactorings and model-to-model transformations.
    keywords: graph; model; tools; university
       cache: eceasst-529.pdf
  plain text: eceasst-529.txt

        item: #477 of 858
          id: eceasst-53
      author: Kraemer, Frank Alexander; Herrmann, Peter
       title: Transforming Collaborative Service Specifications into Efficiently Executable State Machines
        date: 2007-06-22
       words: 8539
      flesch: 60
     summary: A system formula consists of an initial condition describing the set of initial states, cTLA actions which are predicates on a pair of a current state and a next state and model a set of state transitions each, and liveness properties expressed by fairness assumptions on actions which enforce that actions are eventually executed when they are consistently enabled. The algorithm presented here transforms the activities directly into state machines, so that the step from collaborative service specifications to efficiently executable code is completely automated.
    keywords: activity; algorithm; input; machines; places; queue; service; signal; state; state machines; token; transition
       cache: eceasst-53.pdf
  plain text: eceasst-53.txt

        item: #478 of 858
          id: eceasst-536
      author: Chimiak-Opoka, Joanna Dobroslawa; Demuth, Birgit
       title: A Feature Model for an IDE4OCL
        date: 2011-03-13
       words: 7570
      flesch: 59
     summary: Debugging and Refactoring Support are in contrast features that are not yet imple- mented in OCL tools. After a discussion in the OCL workshop we want to publish the updated feature model as a reference model and additionally as a comparison framework for OCL tools of IDE flavor.
    keywords: e n; f e; features; ide4ocl; m e; model; ocl; s e; statement; support; survey; use
       cache: eceasst-536.pdf
  plain text: eceasst-536.txt

        item: #479 of 858
          id: eceasst-537
      author: Balaban, Mira; Kifer, Michael
       title: An Overview of F-OML: An F-Logic Based Object Modeling Language
        date: 2011-03-15
       words: 1815
      flesch: 56
     summary: Keywords: UML class diagrams, F-Logic, objects, constraints, types, model trans- formation, OCL, logic programming, model theory. Example 4 Find the classes related to class User, and their relevant roles. ?- ?
    keywords: class; modeling; object; oml; property
       cache: eceasst-537.pdf
  plain text: eceasst-537.txt

        item: #480 of 858
          id: eceasst-539
      author: Cabot, Jordi; Clark, Tony; Clavel, Manuel; Gogolla, Martin
       title: Proceedings of the Workshop on OCL and Textual Modelling (OCL 2010)
        date: 2011-03-15
       words: 1042
      flesch: 44
     summary: Tool Checking For OCL versions later than OCL 2.2, each chapter should be defined by a tool checked model. Functions OCL contains many features that are similar to functional languages such as ML and Scheme.
    keywords: languages; modelling; ocl; university; workshop
       cache: eceasst-539.pdf
  plain text: eceasst-539.txt

        item: #481 of 858
          id: eceasst-54
      author: de Lara, Juan; Guerra, Esther; Bottoni, Paolo
       title: Triple Patterns: Compact Specifications for the Generation of Operational Triple Graph Grammar Rules
        date: 2007-06-22
       words: 6731
      flesch: 64
     summary: The main idea is to model the synchronized evolution of the two graphs, as well as the correspondence graph relating both, by means of triple rules. Given a normal graph grammar modelling the possible editing actions in a modelling environment (i.e. working in the concrete syntax only), how can we obtain triple rules that update or build synchronously the semantic model?
    keywords: correspondence; elements; figure; graph; meta; model; patterns; rule; source; syntax; target; token; touches; triple
       cache: eceasst-54.pdf
  plain text: eceasst-54.txt

        item: #482 of 858
          id: eceasst-542
      author: Asztalos, Mark; Ekler, Péter; Lengyel, László; Levendovszky, Tihamér
       title: Verification of Model Transformations to Refactoring Mobile Social Networks
        date: 2011-04-04
       words: 5456
      flesch: 53
     summary: Keywords: model transformation, automated verification 1 Introduction In model-based software engineering, developers use programs to process models in a repeatable and automated way. In this work, we concentrate on the automated, formal verification of model transformations where only the definition of the transformation and the specification of the languages that de- 1 / 12 Volume 32 (2010) Verification of Model Transformations to Refactoring Mobile Social Networks scribe the models to be transformed are used during the analysis process.
    keywords: edges; formula; graph; mcdl; model; properties; rule; similarity; transformation; verification
       cache: eceasst-542.pdf
  plain text: eceasst-542.txt

        item: #483 of 858
          id: eceasst-543
      author: Alberti, Francesco; Ghilardi, Silvio; Pagani, Elena; Ranise, Silvio; Rossi, Gian Paolo
       title: Automated Support for the Design and Validation of Fault Tolerant Parameterized Systems: a case study
        date: 2011-04-14
       words: 7449
      flesch: 56
     summary: The tool implicitly adopts the CFM so that faulty processes are those that are crashed. = λ j.case of{( j = i1) : 2; ( j 6= i1) : 2}  , i.e. if the current round is one, process i1 has already received a request, it is the coordinator, and all processes have finished the execution of the round, then the shared variable round is set to two.
    keywords: algorithms; failure; fault; mcmt; model; processes; round; state; systems; transitions
       cache: eceasst-543.pdf
  plain text: eceasst-543.txt

        item: #484 of 858
          id: eceasst-544
      author: Adetoye, Adedayo Oyelakin; Papanikolaou, Nikolaos
       title: Static Analysis of Information Release in Interactive Programs
        date: 2011-04-14
       words: 8341
      flesch: 57
     summary: AVoCS 2010 2 / 15 ECEASST environment, a set of information release policies, a static analyser. Generically, we view information release policies such that, given a lattice of information, the policy sets upper bounds on the information transferred through a program to an observer.
    keywords: analysis; attacker; information; information release; knowledge; model; program; release
       cache: eceasst-544.pdf
  plain text: eceasst-544.txt

        item: #485 of 858
          id: eceasst-545
      author: Feliu, Marco A.; Joubert, Christophe; Tarin, Fernando
       title: Evaluation Strategies for Datalog-based Points-To Analysis
        date: 2011-04-14
       words: 8847
      flesch: 66
     summary: We can note that Datalog rules (3) and (4) are not in one of the three forms accepted by our formal derivation since their bodies have three hypotheses. In this paper, we will introduce novel evaluation strategies for solving Datalog programs and apply them to the problem of pointer analysis.
    keywords: analysis; bes; boolean; datalog; evaluation; example; ground; new; order; points; predicate; program; rules; structure; time; variables
       cache: eceasst-545.pdf
  plain text: eceasst-545.txt

        item: #486 of 858
          id: eceasst-546
      author: Evans, Neil
       title: Integrating Formal Methods with Informal Digital Hardware Development
        date: 2011-04-14
       words: 6215
      flesch: 69
     summary: The solution adopted in this paper is to merge process definitions to reduce the number of processes synchronising on dd and increase the number of arguments that individual processes contribute. In this way signal updates drive the execution of processes, and the execution of processes drive the signal updates.
    keywords: csp; end; process; processes; spec; state; vhdl; yel
       cache: eceasst-546.pdf
  plain text: eceasst-546.txt

        item: #487 of 858
          id: eceasst-547
      author: James, Phillip; Roggenbach, Markus
       title: Automatically Verifying Railway Interlockings using SAT-based Model Checking
        date: 2011-04-14
       words: 7245
      flesch: 65
     summary: In order to program our system, we use the following Boolean variables, distinguished into input, output, and state variables. Primed variables store the values of state variables after the process step.
    keywords: checking; formula; interlockings; ladder; logic; model; safety; sat; state; variables; verification
       cache: eceasst-547.pdf
  plain text: eceasst-547.txt

        item: #488 of 858
          id: eceasst-548
      author: Yilmaz, Emre; Hoang, Thai Son
       title: Development of Rabin’s Choice Coordination Algorithm in Event-B
        date: 2011-04-14
       words: 7874
      flesch: 64
     summary: 2.4 Our Contribution The earlier work in [HH07] does not address the refinement of probabilistic events. We first establish the full algorithm with several anticipated events, before converting them to convergent or probabilistic events (taking into account the above restriction on refinement).
    keywords: algorithm; event; outside; proof; refinement; tourist; variant
       cache: eceasst-548.pdf
  plain text: eceasst-548.txt

        item: #489 of 858
          id: eceasst-55
      author: Lindqvist, Johan; Lundkvist, Torbjörn; Porres, Ivan
       title: A Query Language With the Star Operator
        date: 2007-06-22
       words: 5566
      flesch: 59
     summary: This limitation only applies to star regions. We have extended the concept of multi-objects by defining star regions in the query graph, where all connections of the nodes within or at the border of the region are explicit.
    keywords: graph; language; matching; model; operator; pattern; query; region; star; target
       cache: eceasst-55.pdf
  plain text: eceasst-55.txt

        item: #490 of 858
          id: eceasst-550
      author: Bottoni, Paolo; Guerra, Esther; de Lara, Juan
       title: Preface of the Workshop on Visual Formalisms for Patterns, VFfP'10
        date: 2011-04-04
       words: 633
      flesch: 42
     summary: Several researchers have indicated the limitations of the current semi-formal devices for pat- tern definition – generally based on domain modelling languages, such as UML for design pat- terns, or Coloured Petri Nets for workflow – and research is active to propose rigorous for- malisms, methodologies and languages for pattern definition in specific domains, as well as to propose general models of patterns. The availability of formalisms will make common practices involving patterns, such as pattern discovery, pattern enforcement, pattern-based refactoring, etc., simpler and amenable to automa- tion, and open new perspectives for pattern composition and analysis of pattern consequences.
    keywords: formalisms; pattern; university; workshop
       cache: eceasst-550.pdf
  plain text: eceasst-550.txt

        item: #491 of 858
          id: eceasst-554
      author: Nizamani, Hyder Ali; Tuosto, Emilio
       title: Patterns of Federated Identity Management Systems as Architectural Reconfigurations
        date: 2011-05-03
       words: 6600
      flesch: 52
     summary: Noteworthy, productions pips and psps can be applied only once to generate/part all the terms belonging to FIMs patterns. Rule (6) is defined at basic level (terms without variables) to add a single IDP and rule (7) is defined at abstract level (terms with variables) to add a collection of IDPs to the configurations of FIMs patterns.
    keywords: adr; configuration; cot; federation; fims; graph; idp; patterns; productions; style; type
       cache: eceasst-554.pdf
  plain text: eceasst-554.txt

        item: #492 of 858
          id: eceasst-555
      author: Ripon, Shamim; Miller, Alice
       title: Verification of Symmetry Detection using PVS
        date: 2011-04-14
       words: 6521
      flesch: 69
     summary: { do 〈statement-list, `::'〉 od } 〈param〉 ::= 〈type〉 〈name〉 〈statement〉 ::= atomi { 〈guard〉 -> 〈update-list, `;'〉 } 〈init〉 ::= init { atomi 〈run-list, `;'〉 } 〈run〉 ::= run 〈name〉 ( 〈arg-list, `,'〉? ) ; 〈guard〉 ::= 〈expr〉 ⊲⊳ 〈expr〉(where ⊲⊳ ∈ {==, ! 〈expr-list, `,'〉 〈arg〉 ::= 〈name〉| 〈number〉| null 〈name〉 ::= an alpha-numeri string 〈number〉 ::= a positive integer Figure 1: Syntax of Promela-Lite.
    keywords: channel; detection; guard; language; lemma; lite; promela; proof; pvs; symmetry; theorem; type
       cache: eceasst-555.pdf
  plain text: eceasst-555.txt

        item: #493 of 858
          id: eceasst-558
      author: Maier, Sonja; Minas, Mark
       title: Combination of Different Layout Approaches
        date: 2011-05-03
       words: 4952
      flesch: 61
     summary: VFfP 2010 6 / 12 ECEASST Constraints We distinguish three different types of constraints: • Layout Constraints: These constraints “belong” to certain patterns and operate on pattern- specific variables. We distinguish three types of layout constraints, which encapsulate rule-based layout algorithms, constraint-based layout algorithms and graph drawing algorithms.
    keywords: algorithms; constraint; diagram; graph; layout; pattern; rule; user
       cache: eceasst-558.pdf
  plain text: eceasst-558.txt

        item: #494 of 858
          id: eceasst-56
      author: Guerra, Esther; de Lara, Juan
       title: Adding Recursion to Graph Transformation
        date: 2007-06-22
       words: 7537
      flesch: 71
     summary: In this paper we propose recursive rules, which enhance the expressive power of DPO rules in order to make the recursive processing of structures easier. Definition 3 is modified in a straightforward way, by allowing productions in set P to be either standard DPO rules, or DPO recursive rules.
    keywords: dpo; graph; match; parent; perm; recursion; role; rule; step; transformation
       cache: eceasst-56.pdf
  plain text: eceasst-56.txt

        item: #495 of 858
          id: eceasst-560
      author: Zambon, Eduardo; Rensink, Arend
       title: Using Graph Transformations and Graph Abstractions for Software Verification
        date: 2011-05-03
       words: 6054
      flesch: 66
     summary: Initial studies on graph abstraction techniques were proposed in [Ren04], [RD06] and [BBKR08]. Furthermore, such representation allows us to in- vestigate the use of graph abstractions, which can mitigate the combinatorial explo- sion inherent to model checking.
    keywords: abstraction; checking; execution; graph; java; model; program; software; state; transformation; verification
       cache: eceasst-560.pdf
  plain text: eceasst-560.txt

        item: #496 of 858
          id: eceasst-562
      author: Rosa, Cristian Daniel; Merz, Stephan; Quinson, Martin
       title: A Simple Model of Communication APIs – Application to Dynamic Partial-order Reduction
        date: 2011-05-03
       words: 6261
      flesch: 57
     summary: A Simple Model of Communication APIs – Application to Dynamic Partial-order Reduction Electronic Communications of the EASST Volume 35 (2010) Proceedings of the 10th International Workshop on Automated Verification of Critical Systems (AVoCS 2010) A Simple Model of Communication APIs – Application to Dynamic Partial-order Reduction Cristian Rosa, Stephan Merz and Martin Quinson 15 pages Guest Editors: Jens Bendisposto, Michael Leuschel, Markus Roggenbach Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST
    keywords: communication; model; order; primitives; proc; process; send; set; state; wait
       cache: eceasst-562.pdf
  plain text: eceasst-562.txt

        item: #497 of 858
          id: eceasst-566
      author: Kozyura, Vitaly; Roth, Andreas; Wieczorek, Sebastian; Wei, Wei
       title: Checking Consistency Between Message Choreographies And Their Implementation Models
        date: 2011-11-14
       words: 6041
      flesch: 57
     summary: As our previous work examines the adherence between global 13 / 15 Volume 35 (2010) Checking Consistency Between Choreographies And Implementation choreography models and local partner models, this paper shows how to check consis- tencies between local partner models and implementation models through automated translations into Event- In precursory work we have shown how consistency can be verified for two layers of message choreography models: between global choreo- graphy models and local partner models [6].
    keywords: consistency; event; example; implementation; item; models; node; root; set; state; translation
       cache: eceasst-566.pdf
  plain text: eceasst-566.txt

        item: #498 of 858
          id: eceasst-567
      author: Ujhelyi, Zoltán; Horváth, Ákos; Varró, Dániel
       title: Static Type Checking of Model Transformation Programs
        date: 2011-05-03
       words: 9630
      flesch: 52
     summary: Several different methods and frameworks are already available for the verification of model transformation programs, including testing strategies [LZG05, KGZ09], model check- ing However, there are many more formal techniques used to support the development and validation of traditional programming languages, and their application to model transformation programs can raise the maturity of the technology.
    keywords: analysis; checking; constraints; figure; graph; model; pattern; petrinet’; place; programs; rule; token; transformation; type
       cache: eceasst-567.pdf
  plain text: eceasst-567.txt

        item: #499 of 858
          id: eceasst-568
      author: Krause, Christian
       title: Distributed Port Automata
        date: 2011-05-16
       words: 6279
      flesch: 61
     summary: 5.3 Semantics of distributed port automata Distributed port automata capture the semantics of each primitive and the topology of the connec- tor. To deal with these problems, we introduce distributed port automata in this paper.
    keywords: automata; graph; model; port; port automata; reo; semantics; state
       cache: eceasst-568.pdf
  plain text: eceasst-568.txt

        item: #500 of 858
          id: eceasst-569
      author: Donyina, Adwoa; Heckel, Reiko
       title: Modelling Flexible Human Resource Allocation by Stochastic Graph Transformation
        date: 2011-05-03
       words: 6888
      flesch: 52
     summary: The assignment policy feature can be incorporated into assignment transformation rules. An assignment policy defines an additional condition to assignment rules, for instance if the assignment policy states that the least qualified available worker able to do the job should be assigned, then additional negative application conditions would be required.
    keywords: allocation; assignment; business; case; graph; modelling; pharmacy; prescription; process; role; rules; stochastic; time; transformation; use
       cache: eceasst-569.pdf
  plain text: eceasst-569.txt

        item: #501 of 858
          id: eceasst-57
      author: Bruni, Roberto; Melgratti, Hernan; Montanari, Ugo
       title: Event Structure Semantics for Dynamic Graph Grammars
        date: 2007-05-15
       words: 9278
      flesch: 75
     summary: Persistent graph grammars (PGGs) are a class of graph grammars that admits a fully satisfactory concurrent semantics thanks to the fact that all so-called asymmetric conflicts (between items that are read by some productions and consumed by other) are avoided. Then we are able to equip PDGGs with a nice event structure semantics by exploiting: (i) the encoding of DGG in ordinary graph grammars given in [BM06a] and (ii) the coreflective event structure semantics for persistent graph grammars (PGGs) given in [BMM06]).
    keywords: edges; encoding; event; figure; grammars; graph; node; persistent; production; type
       cache: eceasst-57.pdf
  plain text: eceasst-57.txt

        item: #502 of 858
          id: eceasst-571
      author: Hülsbusch, Mathias
       title: Application Conditions for Reactive Systems with Applications to Bisimulation Theory
        date: 2011-05-16
       words: 5720
      flesch: 70
     summary: This allows to adapt the borrowed context technique to reactive system rules with application conditions. c |= A
    keywords: application; conditions; gacs; rule; systems
       cache: eceasst-571.pdf
  plain text: eceasst-571.txt

        item: #503 of 858
          id: eceasst-572
      author: Blume, Christoph
       title: Efficient Implementation of Automaton Functors for the Verification of Graph Transformation Systems
        date: 2011-05-16
       words: 7490
      flesch: 62
     summary: The notion of regularity has been straightforwardly generalized to regular graph languages – which are also called recognizable graph languages – in different ways [2, 10, 7, 8], but all leading to the same notion of recognizability. Keywords: graph transformation, recognizable graph languages, invariants, imple- mentation of automaton functors, binary decision diagrams 1 Introduction
    keywords: automaton; cospan; functor; graph; interface; languages; nodes; recognizable; set; state; subgraph
       cache: eceasst-572.pdf
  plain text: eceasst-572.txt

        item: #504 of 858
          id: eceasst-573
      author: Gogolla, Martin; Hamann, Lars; Xu, Jie; Zhang, Jun
       title: Exploring (Meta-)Model Snapshots by Combining Visual and Textual Techniques
        date: 2011-05-16
       words: 3601
      flesch: 59
     summary: As shown in the object diagrams 3a-3c in Figure 2, the three choices work as follows: (3a) ‘crop’ displays exactly the object collection determined by the OCL expression independent of the visi- bility in original object diagram, (3b) ‘show’ adds the object collection fixed by the OCL expression as visible objects, and (3c) ‘hide’ removes the object collection characterized by the OCL expression from the visible objects. Exploring (Meta-)Model Snapshots USE allows the developer (among other modeling features) to work with class diagrams and object diagrams.
    keywords: class; diagram; expression; figure; graph; object; ocl; selection
       cache: eceasst-573.pdf
  plain text: eceasst-573.txt

        item: #505 of 858
          id: eceasst-574
      author: Iacob, Claudia; Mussio, Piero; Zhu, Li; Barricelli, Barbara Rita
       title: Towards a Pattern Language for the Design of Collaborative Interactive Systems
        date: 2011-05-16
       words: 5527
      flesch: 51
     summary: Borchers evolves Alexander’s notions of design pattern and design pattern language while recognizing the HCI design as a complex process. Alexander did not propose any formal definition of design patterns and design pattern languages but only informal guidelines for their development.
    keywords: collaboration; design; domain; end; knowledge; language; pattern; systems; users
       cache: eceasst-574.pdf
  plain text: eceasst-574.txt

        item: #506 of 858
          id: eceasst-575
      author: Fish, Andrew Gavin; Hamie, Ali; Howse, John
       title: Visual Specification Patterns
        date: 2011-05-16
       words: 5670
      flesch: 55
     summary: The no- tion of constraint patterns is further elaborated in [AT06, ABB+05], where a small number of simple constraint patterns is presented along with OCL templates. This problem has been addressed by numerous publications some of which use the idea of constraint patterns in order to capture recurring domain constraints and make it reusable.
    keywords: constraint; diagrammatic; diagrams; element; figure; ocl; patterns; set; software; specification
       cache: eceasst-575.pdf
  plain text: eceasst-575.txt

        item: #507 of 858
          id: eceasst-576
      author: Lamo, Yngve; Rutle, Adrian; Mantz, Florian
       title: Enforcement of Patterns by Constraint-Aware Model Transformations
        date: 2011-05-16
       words: 4781
      flesch: 59
     summary: Moreover, the seminal book [GHJV94] on design patterns published in 1994 by the so-called “Gang of Four” had a great influence on software development practise. Design patterns are usually used as a solution strategy for a common problem, e.g. facade, decorator, singleton, etc, and often describe a solution for a part of a bigger system.
    keywords: constraint; model; pattern; software; specification; transformation
       cache: eceasst-576.pdf
  plain text: eceasst-576.txt

        item: #508 of 858
          id: eceasst-577
      author: Qayum, Fawad; Heckel, Reiko
       title: Search-Based Refactoring using Unfolding of Graph Transformation Systems
        date: 2011-05-16
       words: 4898
      flesch: 58
     summary: In this paper, we use a representation of object-oriented designs as graphs and refac- toring operations as graph transformation rules We use graphs to represent object-oriented software architectures at the class level and graph transformations to describe their refactoring operations.
    keywords: ant; class; graph; refactoring; rules; search; steps; transformation; transitions; unfolding
       cache: eceasst-577.pdf
  plain text: eceasst-577.txt

        item: #509 of 858
          id: eceasst-579
      author: Bottoni, Paolo; Fish, Andrew
       title: A visual language for temporal specifications based on Spider diagrams
        date: 2011-05-16
       words: 7495
      flesch: 64
     summary: 4 Timed Spider Diagrams We introduce timed SDs as associations of SDs with specifications of admissible time intervals for elements in a diagram and with constraints on variables appearing in the specifications. We introduce concepts related to intervals and interval specifications in Section 3, and introduce timed-SDs in Section 4, providing a notion of SD-stories and semantics of timed-SDs in terms of SD-stories.
    keywords: diagrams; instance; interval; model; sds; sequence; set; specification; spider; time
       cache: eceasst-579.pdf
  plain text: eceasst-579.txt

        item: #510 of 858
          id: eceasst-58
      author: Baldan, Paolo; Ehrig, Hartmut; Padberg, Julia; Rozenberg, Grzegorz
       title: Foreword
        date: 2007-05-15
       words: 1411
      flesch: 58
     summary: Several approaches to the concurrent semantics of graph transformation systems have been strongly influenced by the corresponding theories and constructions for Petri nets (see, e.g., [10]). As mentioned above, the theory of rewriting over categories of Petri nets falls into the realm of high-level replacement systems, which is an extension of graph transformation systems to general categories, the so-called called HLR categories
    keywords: graph; nets; petri; systems; transformation
       cache: eceasst-58.pdf
  plain text: eceasst-58.txt

        item: #511 of 858
          id: eceasst-580
      author: Bruggink, H. J. Sander; Hülsbusch, Mathias
       title: Decidability and Expressiveness of Finitely Representable Recognizable Graph Languages
        date: 2011-05-16
       words: 5495
      flesch: 63
     summary: L. Proc. GTVMT 2011 8 / 12 ECEASST 4 Bounded Recognizable Graph Languages Bounded recognizable graph languages are accepted by bounded automaton functors, automaton functors for graph cospans which are only defined on interfaces of bounded size. (ii) A language L of graph cospans is k-bounded recognizable, if there exists a k-bounded automaton functor A such that L = L(A).
    keywords: atomic; automaton; cospans; functor; graph; languages; recognizable
       cache: eceasst-580.pdf
  plain text: eceasst-580.txt

        item: #512 of 858
          id: eceasst-581
      author: Ehrig, Hartmut; Hermann, Frank; Schölzel, Hanna; Brandt, Christoph
       title: Propagation of Constraints along Model Transformations Based on Triple Graph Grammars
        date: 2011-05-16
       words: 7080
      flesch: 63
     summary: A BC-model transformation sequence (GS, Ĝ0 = tr∗F=⇒BC Ĝn, GT ) consists of a source con- sistent BC-forward transformation Ĝ0 = tr∗F=⇒BC Ĝn via T RF with source model GS = Ĝ S n and target model GT = ĜTn . But up to now, it is an open problem how domain specific properties that are valid for a source model can be preserved along model transformations such that the transformed properties are valid for the derived target model.
    keywords: + +; constraint; graph; model; public; source; target; transformation
       cache: eceasst-581.pdf
  plain text: eceasst-581.txt

        item: #513 of 858
          id: eceasst-583
      author: Hegedüs, Ábel; Horváth, Ákos; Varró, Dániel
       title: Towards Guided Trajectory Exploration of Graph Transformation Systems
        date: 2011-05-16
       words: 8802
      flesch: 55
     summary: 4 Definition and Usage of the Dependency Graph In this section we first describe the notion of graph transformation rule dependency and define the dependency graph that is constructed for GTS (Subsection 4.1). The ongoing example is captured by a set of graph transformation rules in Figure 4.
    keywords: application; criteria; cut; dependency; exploration; figure; graph; gts; nodes; rule; selection; state; systems; trajectory; transformation
       cache: eceasst-583.pdf
  plain text: eceasst-583.txt

        item: #514 of 858
          id: eceasst-584
      author: Hermosillo, Gabriel; Nzekwa, Russel; Wagner, Michael
       title: Preface
        date: 2011-06-09
       words: 839
      flesch: 26
     summary: Rennes 1 & INRIA, France Franck Chauvel Peking University, China Ruzanna Chitchyan Lancaster University, UK Diana Comes University of Kassel, Germany Denis Conan Institut Telecom, France Geoff Coulson Lancaster University, UK Wolfgang De Meuter Vrije Universiteit Brussel, June, 2011 Gabriel Hermosillo Russel Nzekwa Michael Wagner 1 / 4 Volume 43 (2011) Preface Organization Steering Committee Sonia Ben Mokhtar CNRS, France Frank Eliassen University of Oslo, Norway Kurt Geihs University of Kassel, Germany Svein Hallsteinsen SINTEF ICT, Norway Geir Horn SINTEF ICT, Norway Valérie Issarny INRIA, France Romain Rouvoy University Lille 1, France Lionel Seinturier University Lille 1, France Organisation Committee Program chair Gabriel Hermosillo INRIA Lille Nord Europe, France Publicity chair Russel Nzekwa INRIA Lille Nord Europe, France Publication chair Michael Wagner University of Kassel, Germany Proc.
    keywords: context; france; lille; university; workshop
       cache: eceasst-584.pdf
  plain text: eceasst-584.txt

        item: #515 of 858
          id: eceasst-585
      author: Harnie, Dies; Gonzalex Boix, Elisa; Lombide Carreton, Andoni; Scholliers, Christophe; De Meuter, Wolfgang
       title: Volatile Sets: Event-driven Collections for Mobile Ad-Hoc Applications
        date: 2011-06-09
       words: 5589
      flesch: 51
     summary: 3 Volatile Sets In this section, we explain volatile sets and how they address the problems when maintaining and composing groups of volatile objects. Volatile sets provide mathematical set operators to compose volatile sets.
    keywords: applications; changes; collections; event; mobile; objects; remote; sets; synchronizing; time
       cache: eceasst-585.pdf
  plain text: eceasst-585.txt

        item: #516 of 858
          id: eceasst-587
      author: Paspallis, Nearchos; Panis, Gabriel
       title: Context awareness: Challenges and opportunities in modern smartphone use
        date: 2011-10-27
       words: 3002
      flesch: 49
     summary: In this position paper we argue that context aware applications can be the key to overcoming them. Finally, an extensive demo was organized by the MUSIC consortium to illustrate the viability of context aware applications, particularly as assis- tants to passengers and personnel of the Paris metro (an extensive coverage was also documented by euronews1).
    keywords: applications; awareness; context; information; location; phone; smart; user
       cache: eceasst-587.pdf
  plain text: eceasst-587.txt

        item: #517 of 858
          id: eceasst-588
      author: Seidl, Martina; Clarke, Peter J.
       title: Preface
        date: 2011-06-09
       words: 1089
      flesch: 40
     summary: The field of software modeling continues to change rapidly. In the forefront of the symposium, an online survey1 has been conducted to gain an impression about the current situation concerning modeling tools in education.
    keywords: education; modeling; software; symposium; university
       cache: eceasst-588.pdf
  plain text: eceasst-588.txt

        item: #518 of 858
          id: eceasst-589
      author: Rauhamäki, Jari; Laitinen, Outi; Sierla, Seppo; Kuikka, Seppo
       title: The Role of User Guidance in the Industrial Adoption of MDE Approach
        date: 2011-06-09
       words: 5996
      flesch: 51
     summary: The category consists of three subcategories: domain-specific tasks, UML for process control engineers, and task-specific challenges. The subcategory of task-specific challenges represents design tasks which are especially challenging for process control engineers.
    keywords: adoption; approach; aukoton; control; development; guidance; mde; model; process; table; tool; uml; user
       cache: eceasst-589.pdf
  plain text: eceasst-589.txt

        item: #519 of 858
          id: eceasst-59
      author: Sobocinski, Pawel
       title: Reversing graph transformations
        date: 2007-05-15
       words: 2842
      flesch: 60
     summary: In a graph transformation system this would mean that a state is no longer a particular graph but rather a concurrent computation made up of applications of reversible productions. We briefly outline this solution below, instantiated with the example of graph transformation systems.
    keywords: fork; graph; philosopher; table; thinking
       cache: eceasst-59.pdf
  plain text: eceasst-59.txt

        item: #520 of 858
          id: eceasst-590
      author: Sien, Ven Yu
       title: Teaching Object-Oriented Modelling using Concept Maps
        date: 2011-06-09
       words: 4910
      flesch: 54
     summary: We have successfully adopted concept maps as stepping-stones to assist students in constructing class and sequence diagrams. In this paper, we present a framework for teaching object-oriented (OO) modelling using concept maps.
    keywords: class; concept; diagrams; map; maps; sequence; students; study
       cache: eceasst-590.pdf
  plain text: eceasst-590.txt

        item: #521 of 858
          id: eceasst-591
      author: Gjøsæter, Terje; Prinz, Andreas
       title: Teaching Model Driven Language Handling
        date: 2011-06-09
       words: 4021
      flesch: 53
     summary: Part 1 - Introduction: Compilers, languages, language aspects, grammars, NFA and DFA au- tomata, T-diagrams. An im- portant aspect of MDD is to provide the language designer with support for rapid development and automatic prototyping of language support tools, and allow for working on a high level of abstraction.
    keywords: handling; language; meta; model; semantics; structure; teaching; technologies; tools
       cache: eceasst-591.pdf
  plain text: eceasst-591.txt

        item: #522 of 858
          id: eceasst-592
      author: Chimiak-Opoka, Joanna; Demuth, Birgit
       title: Teaching OCL Standard Library: First Part of an OCL 2.x Course
        date: 2011-06-09
       words: 5730
      flesch: 59
     summary: This part provides model independent ex- amples to teach OCL types and their operations. Keywords: teaching material, OCL types, model independent OCL expressions 1 Introduction The Object Constraint Language (OCL) is crucial in precise modeling
    keywords: course; expressions; invalid; invalid invalid; language; model; ocl; operations; section; standard; teaching; type
       cache: eceasst-592.pdf
  plain text: eceasst-592.txt

        item: #523 of 858
          id: eceasst-593
      author: Brosch, Petra; Randak, Andrea
       title: Position Paper: m2n—A Tool for Translating Models to Natural Language Descriptions
        date: 2011-06-09
       words: 3943
      flesch: 67
     summary: When the student is done with the identification of model elements, (s)he adds the relationships between the model elements. Given a textual specification, the students shall identify model elements like classes, associations, ag- gregations etc. which have to be arranged as described in the specification.
    keywords: e l; e n; n t; t e
       cache: eceasst-593.pdf
  plain text: eceasst-593.txt

        item: #524 of 858
          id: eceasst-594
      author: Provenvesi, Lucas; Eliassen, Frank
       title: Towards a Flexible and Evolvable Framework for Self-Adaptation
        date: 2011-06-09
       words: 2943
      flesch: 44
     summary: Those systems are structured as closed- loops (often called adaptation loop or adaptation engine), which consist of a set of control tasks sharing a knowledge base and interacting to achieve the goal of the self-* properties. Towards a Flexible and Evolvable Framework for Self-Adaptation To meet the requirement FR-2, at any development iteration, the self-adaptive behavior and methodology can be changed, by respectively modifying the knowledge used by the tasks and redesigning the ALS with new control tasks and knowledge types.
    keywords: adaptation; adaptive; control; framework; knowledge; self; tasks
       cache: eceasst-594.pdf
  plain text: eceasst-594.txt

        item: #525 of 858
          id: eceasst-595
      author: Brandsteidl, Marion; Wieland, Konrad; Huemer, Christian
       title: New Media in Teaching UML in the Large — an Experience Report
        date: 2011-06-09
       words: 5499
      flesch: 62
     summary: According to the survey, students prefer lecture videos to traditional lectures held in a lecture hall, but even more students like a combination of both. EduSymp 2010 10 / 12 ECEASST want an additional traditional lecture — it should be noted that the quantity of students that want traditional lectures is significantly higher than the quantity of students that actually visited the traditional lectures.
    keywords: camera; document; learning; lecture; modeling; students; teaching; uml; votes
       cache: eceasst-595.pdf
  plain text: eceasst-595.txt

        item: #526 of 858
          id: eceasst-596
      author: Alipour, Ghafour
       title: Role Allocation and Scheme in Software Engineering Course Projects
        date: 2011-06-09
       words: 4216
      flesch: 60
     summary: 4 Measures and role activities We present data and analysis which students developed in teams of 10–12 students and how role activities were used as a measurement tool. Role Management Measure (RMM) RTM measures the ratio between the times invested in development tasks relative to the time invested in role activities.
    keywords: activity; development; project; role; scheme; software; students; team
       cache: eceasst-596.pdf
  plain text: eceasst-596.txt

        item: #527 of 858
          id: eceasst-597
      author: Li, Karen; Hosking, John; Grundy, John
       title: A Generic Technique for Domain-Specific Visual Language Model Refactoring to Patterns
        date: 2011-06-16
       words: 5016
      flesch: 39
     summary: Keywords: Meta-tools, domain-specific visual languages, graph transformation, design patterns, model refactoring, model-driven engineering 1 Introduction As the popularity of DSVLs grows, concerns have arisen over the quality of both DSVL designs and the domain models created by novice users using them [Moo09, LB05]. 2 Common DSVL Model Refactorings To better illustrate our intent, we describe several pairs of model refactorings and their generic aspects for reuse potential.
    keywords: domain; dsvl; element; language; meta; model; pattern; refactoring; relationship; specifications; transformation; uml
       cache: eceasst-597.pdf
  plain text: eceasst-597.txt

        item: #528 of 858
          id: eceasst-598
      author: Li, Karen; Hosking, John; Grundy, John; Ly, Tony; Webb, Brian
       title: Augmenting DSVL Meta-Tools with Pattern Specification, Instantiation and Reuse
        date: 2011-06-16
       words: 4689
      flesch: 37
     summary: We want a family of modelling notations and tools for DSVL pattern specification, visualisation, instantiation and execution. This paper describes a generic but configurable meta-model level visual language and tool support for DSVL design pattern (both structural and behavioural) specification, application and reuse.
    keywords: design; domain; dsvl; elements; figure; instantiation; language; meta; model; pattern; reuse; specification
       cache: eceasst-598.pdf
  plain text: eceasst-598.txt

        item: #529 of 858
          id: eceasst-6
      author: Ranger, Ulrike; Lüstraeten, Mathias
       title: Search Trees for Distributed Graph Transformation Systems
        date: 2006-12-11
       words: 5858
      flesch: 56
     summary: A distributed query requires remote operations, like remote check operations and remote search operations. Search operations may have different runtime costs, which can be estimated by exploiting e.g. the cardinalities of the graph schema.
    keywords: edge; graph; node; operations; remote; search; transformation; tree
       cache: eceasst-6.pdf
  plain text: eceasst-6.txt

        item: #530 of 858
          id: eceasst-60
      author: de Lara, Juan; Velasco, Pedro Pablo Perez
       title: Petri Nets and Matrix Graph Grammars: Reachability
        date: 2007-05-15
       words: 6738
      flesch: 67
     summary: Besides, it is possible as well to get a better insight and understanding of matters by applying matrix graph grammars techniques (as those in [VL06a, VL06b] and the present paper) to Petri nets. Thus, Petri nets can be considered a proper subset of graph grammars with two important properties: 1.
    keywords: edges; equation; grammars; graph; matrix; nodes; petri; production; state
       cache: eceasst-60.pdf
  plain text: eceasst-60.txt

        item: #531 of 858
          id: eceasst-601
      author: Van Der Straeten, Ragnhild
       title: Towards a Methodology for Semantics Specification of Domain-specific Models through Properties
        date: 2011-12-12
       words: 4882
      flesch: 49
     summary: Domain specific modeling, Editorial. The application domain expert has knowledge about the application while the solution domain expert has knowledge about modelling languages and semantic domains.
    keywords: action; activity; approach; domain; language; methodology; models; properties; property; semantics
       cache: eceasst-601.pdf
  plain text: eceasst-601.txt

        item: #532 of 858
          id: eceasst-603
      author: Asztalos, Mark; Ekler, Péter; Lengyel, László; Levendovszky, Tihamér; Mezei, Gergely; Mészáros, Tamás
       title: Automated Verification by Declarative Description of Graph Rewriting-Based Model Transformations
        date: 2011-07-21
       words: 6965
      flesch: 57
     summary: C cl = ~~ = cr c �� L m �� (1) K k �� loo (2) r // R n �� G D l′oo r ′ // H In the following, we present the definition of control flow graphs to formally describe the control structure of model transformations. For these purposes, model transformations need to be formalized in a way that their verification could be performed by automated methods.
    keywords: attribute; constraints; definition; edge; flow; graph; model; rewriting; rule; transformation; verification
       cache: eceasst-603.pdf
  plain text: eceasst-603.txt

        item: #533 of 858
          id: eceasst-604
      author: Mészáros, Tamás; Levendovszky, Tihamér; Mezei, Gergely
       title: Active Model Patterns with Interactive Model Transformation
        date: 2011-12-12
       words: 5869
      flesch: 49
     summary: As Domain-Specific Modeling Languages (DSMLs) are meant to be used in arbitrary domains, thus, in accordance with [LLM09], DSML patterns are referred to as model patterns. In the following, we shortly illustrate an example domain and model patterns to realize (Sec- tion 3.1), then we collect the features that we expect an interactive model transformation envi- ronment to support AMPs (Section 3.1).
    keywords: domain; elements; figure; graph; model; model patterns; model transformation; patterns; rewriting; rule; state; transformation
       cache: eceasst-604.pdf
  plain text: eceasst-604.txt

        item: #534 of 858
          id: eceasst-605
      author: Kuehne, Thomas
       title: A Visual Notation for Declarative Behaviour Specification
        date: 2011-12-12
       words: 3759
      flesch: 56
     summary: Visual notations, such as activity diagrams and interaction diagrams, are regarded as con- straining potential behaviour, but no attempt is made to completely specify the behaviour. 2. Visual notations, such as state diagrams and the above, are extended with action languages.
    keywords: behaviour; clause; declarative; figure; notation; prolog; route; specification
       cache: eceasst-605.pdf
  plain text: eceasst-605.txt

        item: #535 of 858
          id: eceasst-608
      author: Meyers, Bart; Wimmer, Manuel; Cicchetti, Antonio; Sprinkle, Jonathan
       title: A generic in-place transformation-based approach to structured model co-evolution
        date: 2012-04-03
       words: 6297
      flesch: 53
     summary: Moreover, the approach will be extended to support the co-evolution of not only instance models, but also transformation models. The creation of migration transformation is closely related to the changes on the metamodel however.
    keywords: approach; difference; evolution; figure; metamodel; migration; model; operations; place; transformation
       cache: eceasst-608.pdf
  plain text: eceasst-608.txt

        item: #536 of 858
          id: eceasst-61
      author: Varro-Gyapay, Szilvia; Varro, Daniel
       title: Optimization in Graph Transformation Systems Using Petri Net Based Techniques
        date: 2007-05-15
       words: 7797
      flesch: 64
     summary: They use (an ad hoc) SPIN encoding for the analysis of graph transition systems. In the current paper, we show how this problem can be formalized when the evolution of the system is captured by graph transformation systems (GTS) with a cost parameter attached to each graph transformation rule denoting the cost of firing the rule.
    keywords: cost; graph; graph transformation; net; problem; rule; service; solution; space; state; transformation; transition
       cache: eceasst-61.pdf
  plain text: eceasst-61.txt

        item: #537 of 858
          id: eceasst-610
      author: Syriani, Eugene; Asztalos, Mark; Wimmer, Manuel; Kessentini, Marouane
       title: Towards Transformation Rule Composition
        date: 2011-07-21
       words: 6311
      flesch: 57
     summary: For example, platform-specific models (PSM) are often gener- ated from platform-independent models (PIM) by chains of model transformations. This operation is applied in the context of a chain of model transformations as defined below.
    keywords: composition; ejb; elements; graph; model; procedure; rules; transformation
       cache: eceasst-610.pdf
  plain text: eceasst-610.txt

        item: #538 of 858
          id: eceasst-612
      author: Duval, Dominique; Echahed, Rachid; Prost, Frederic
       title: Categorical Abstract Rewriting Systems and Functoriality of Graph Transformation
        date: 2011-10-20
       words: 7859
      flesch: 71
     summary: A direct arrows-based span is used in Sections 3.1 and 3.2 for sin- gle pushout and heterogeneous pushout rewriting systems. In this paper we focus on categorical rewriting systems, that is to say rewriting systems defined by means of category theory, and we define them in an abstract manner.
    keywords: graph; rewriting; system; � �
       cache: eceasst-612.pdf
  plain text: eceasst-612.txt

        item: #539 of 858
          id: eceasst-613
      author: Kerzhner, Aleksandr; Paredis, Christiaan
       title: Combining SysML and Model Transformations to Support Systems Engineering Analysis
        date: 2011-07-21
       words: 5180
      flesch: 41
     summary: This set of analysis models is subsequently transformed into exe- cutable simulations, which are used to guide the search for suitable system alterna- tives. This paper proposes a method for automatically generating analysis models for systems en- gineering problem models.
    keywords: analysis; design; engineering; figure; model; modeling; problem; relationships; requirements; stereotype; sysml; system
       cache: eceasst-613.pdf
  plain text: eceasst-613.txt

        item: #540 of 858
          id: eceasst-619
      author: Brüning, Jens; Hamann, Lars; Wolff, Andreas
       title: Extending ASSL: Making UML Metamodel-based Workflows executable
        date: 2011-07-21
       words: 4063
      flesch: 55
     summary: Engels, G., Soltenborn, C., Wehrheim, H.: Analysis of UML Activities Using Dynamic Meta Modeling. Executable workflow models, driven by ASSL procedures, are introduced in detail to present the usage of ASSL and our extensions.
    keywords: activities; activity; assl; metamodel; ocl; procedure; uml; use; workflow
       cache: eceasst-619.pdf
  plain text: eceasst-619.txt

        item: #541 of 858
          id: eceasst-62
      author: Boneva, Iovka; Hermann, Frank; Kastenberg, Harmen; Rensink, Arend
       title: Simulating Multigraph Transformations Using Simple Graphs
        date: 2007-06-22
       words: 6283
      flesch: 67
     summary: � Definition 2 (simple graph, simple graph morphism) Let Lab be a finite set of labels. SG(L) is the category whose objects are simple graphs over the set of labels L and whose arrows are simple graph morphisms.
    keywords: = =; dpo; graph; morphisms; multigraphs; object; sim; spo; transformations
       cache: eceasst-62.pdf
  plain text: eceasst-62.txt

        item: #542 of 858
          id: eceasst-620
      author: Braatz, Benjamin; Brandt, Christoph
       title: Rule-Based Integration of Domain-Specific Modelling Languages
        date: 2011-07-21
       words: 5248
      flesch: 54
     summary: “http” 1 “80” “ssh” 2 “22” “dns” 3 “53” “db” 4 “5432” in t:p ro t int:port in t:p ro t int:port in t:p ro t int:port in t:p ro t int:port Figure 6: Mapping between protocols and ports For integrating several DSMLs, we define some sets of RDF graph transformation rules. 7 Summary and Future Work In this paper, we have shown how graph transformation rules can be used to integrate domain- specific models that overlap on certain aspects.
    keywords: dsmls; fwcl; graph; if1; if2; integration; itml; language; port; rdf; rule; transformation
       cache: eceasst-620.pdf
  plain text: eceasst-620.txt

        item: #543 of 858
          id: eceasst-625
      author: Roldan, Manuel; Durán, Francisco
       title: Dynamic Validation of OCL Constraints with mOdCL
        date: 2011-09-20
       words: 7782
      flesch: 58
     summary: 7 Conclusions and future work We have presented the mOdCL system, which can both evaluate OCL expressions on given sys- tem configurations and validate OCL constraints on the execution of Maude system prototypes. de Lenguajes y Ciencias de la Computación Universidad de Málaga, España Abstract: This paper presents mOdCL, a Maude based evaluator of OCL expres- sions and validator of OCL constraints.
    keywords: class; constraints; context; execution; maude; method; modcl; object; ocl; session; system; term; uml
       cache: eceasst-625.pdf
  plain text: eceasst-625.txt

        item: #544 of 858
          id: eceasst-627
      author: Ermel, Claudia; Shareef, Sarkaft; Fischer, Winzent
       title: RONs Revisited: General Approach to Model Reconfigurable Object Nets based on Algebraic High-Level Nets
        date: 2011-08-04
       words: 7711
      flesch: 63
     summary: For moving object nets and rules through the system net, composing them by disjoint union and splitting a disjoint union into component nets, we need some auxiliary operations: coproductA builds the disjoint union of two given object nets, operation emptyA checks whether a given set of object nets is empty, the isomorphicA operation checks whether two given object nets are iso- morphic to each other, operation insertA adds an object net to a sum of object nets, operation makeA generates a sum of object nets containing exactly one given object net, splittableA checks whether an object net is the disjoint union of more than one component of object nets, and finally, the splitA operation generates from an object net with n components a sum of n object nets. In order to control the firing and reconfiguration of P/T nets, a high-level net (system net) is defined, where P/T nets (object nets) and P/T net transformation rules are used as tokens.
    keywords: ahli; ahli nets; algebraic; jectnet; nets; object; object nets; rons; rule; tokens; transformation; transition
       cache: eceasst-627.pdf
  plain text: eceasst-627.txt

        item: #545 of 858
          id: eceasst-628
      author: Maximova, Maria; Ehrig, Hartmut; Ermel, Claudia
       title: Formal Relationship between Petri Net and Graph Transformation Systems based on Functors between M-adhesive Categories
        date: 2011-08-04
       words: 7385
      flesch: 65
     summary: F (ρ2),F (m2) =⇒ F (H2) in AS2 implies parallel independence of H1 ρ1,m1⇐= G ρ2,m2 =⇒ H2 in AS1. For Theorem 2 we need in addition, that F creates M -morphisms, i.e., for each (m′ : F (L) → F (G))
    keywords: categories; graph; morphisms; net; nets; petri; systems; transformations; translation
       cache: eceasst-628.pdf
  plain text: eceasst-628.txt

        item: #546 of 858
          id: eceasst-629
      author: Modica, Tony; Gabriel, Karsten; Hoffmann, Kathrin
       title: Formalization of Petri Nets with Individual Tokens as Basis for DPO Net Transformations
        date: 2011-08-04
       words: 9887
      flesch: 66
     summary: For this purpose, we introduce the new notion of place/transition nets with individual tokens (PTI nets), their firing behavior, and application of PTI transformation rules. The encoding of PTI transition rules and the correspondence between the firing of PTI nets and the application of transition rules stated in the theorem above are very close to those presented in [Kre81].
    keywords: = =; firing; individual; morphisms; nets; petri; pti; rule; step; systems; tokens; transformation; transition
       cache: eceasst-629.pdf
  plain text: eceasst-629.txt

        item: #547 of 858
          id: eceasst-630
      author: Trollmann, Frank; Kern, Maximilian; Albayrak, Sahin
       title: Modelling Emergency Scenarios using Algebraic High Level Net Transformation Systems with Net Patterns
        date: 2011-08-04
       words: 10665
      flesch: 63
     summary: Especially the set of task types is way larger. The reason for this is the fact that the design of transformation rules and net structure are interrelated.
    keywords: ahl; case; figure; net; patterns; rule; study; task; transformation; transformation rule
       cache: eceasst-630.pdf
  plain text: eceasst-630.txt

        item: #548 of 858
          id: eceasst-631
      author: Golas, Ulrike; Hoffmann, Kathrin; Ehrig, Hartmut; Rein, Alexander; Padberg, Julia
       title: Functorial Analysis of Algebraic Higher-Order Net Systems with Applications to Mobile Ad-Hoc Networks
        date: 2011-08-04
       words: 8978
      flesch: 68
     summary: Moreover, we have analyzed the skeleton functor FSkel : AHONAHL → AHONPT relating AHO net systems based on AHL net systems to AHO net systems based on P/T nets. In Section 3, we define AHO net systems with AHL net systems and rules as tokens as well as their firing behavior and transformations.
    keywords: ahl; ahlnetsys; aho; aho net; apt; level; net; net systems; rules; systems; tok; tokens
       cache: eceasst-631.pdf
  plain text: eceasst-631.txt

        item: #549 of 858
          id: eceasst-632
      author: Ermel, Claudia; Hoffmann, Kathrin
       title: Preface
        date: 2011-08-04
       words: 523
      flesch: 34
     summary: Graph transformation systems are also used for the develop- ment, the simulation, or animation of various types of Petri nets, e.g., via the the definition of visual languages and environments. The workshop continues the research on reconfigurable Petri nets, and the selected papers published in this ECEASST volume estab- lish interesting connections between Petri nets and graph transformation systems and tools, as well as between different classes of algebraic higher order systems.
    keywords: germany; petri; systems
       cache: eceasst-632.pdf
  plain text: eceasst-632.txt

        item: #550 of 858
          id: eceasst-634
      author: Bowen, Judy; Hinze, Annika
       title: Supporting Mobile Application Development with Model-Driven Emulation
        date: 2011-09-20
       words: 1965
      flesch: 49
     summary: An editor for presentation models and presentation interaction models. We already have a defined XML DTD for presentation models but will need to extend the PIMed tool to export models in this format (currently it only exports tests in XML).
    keywords: gui; model; parser; presentation
       cache: eceasst-634.pdf
  plain text: eceasst-634.txt

        item: #551 of 858
          id: eceasst-637
      author: Jiresch, Eugen
       title: Realizing Impure Functions in Interaction Nets
        date: 2011-09-07
       words: 6751
      flesch: 68
     summary: Interaction rules preserve the interface of the net: no auxiliary ports are added or removed. The correspondence of interaction rules and original definition of the Maybe monad is indi- cated by the rule labels.
    keywords: cons; functions; interaction; monad; nets; rules
       cache: eceasst-637.pdf
  plain text: eceasst-637.txt

        item: #552 of 858
          id: eceasst-638
      author: Corradini, Andrea
       title: Preface
        date: 2011-09-07
       words: 659
      flesch: 39
     summary: Doctoral Symposium ICGT 2010 2 / 3 ECEASST Program Committee Paolo Baldan Padova (Italy) Luciano Baresi Milano (Italy) Michel Bauderon Bordeaux (France) Andrea Corradini (chair) Christoph Blume, Efficient Implementation of Automaton Functors for the Verification of Graph Transformation Systems 3.
    keywords: 2010; graph; icgt; transformation
       cache: eceasst-638.pdf
  plain text: eceasst-638.txt

        item: #553 of 858
          id: eceasst-639
      author: Biermann, Enrico
       title: Local Confluence Analysis of Consistent EMF Transformations
        date: 2011-09-07
       words: 6075
      flesch: 59
     summary: We have to show, that (1) If K is not EMF graph then G1 r1,o1⇐= K r2,o2 =⇒ G2 is not a critical pair for EMF graphs: Since K is not an EMF graph, it must violate one of the conditions given in Definition 3. – (at most one container) : In this paper we aim to make use of those techniques by providing a formal foundation of consistent EMF transforma- tions to analyze critical pairs between EMF transformation rules as well as extending the notion of local confluence to EMF transformation systems.
    keywords: analysis; containment; definition; edges; emf; graph; model; rule; transformation; type
       cache: eceasst-639.pdf
  plain text: eceasst-639.txt

        item: #554 of 858
          id: eceasst-640
      author: Vandin, Andrea; Lafuente, Alberto Lluch
       title: Towards a Maude Tool for Model Checking Temporal Graph Properties
        date: 2011-09-20
       words: 7136
      flesch: 56
     summary: These logics fit at the right level of abstraction for graph transformation systems: if state systems are graphs, and state components are thus graph items, one is not only interested in the topological structure of each reachable graph alone, but on its evolution as well. Graph rewrite rules To compositionally specify concurrent systems, we offer an object ori- ented language, based on an implementation of the double pushout approach (DPO) to graph rewriting: our systems can be hence seen as graph transformation systems specified by an initial state and a set of term rewrite rules given in DPO style.
    keywords: counterpart; graph; maude; model; object; semantics; set; state; systems; tool
       cache: eceasst-640.pdf
  plain text: eceasst-640.txt

        item: #555 of 858
          id: eceasst-641
      author: Campos, Jose Creissac; Harrison, Michael
       title: Modelling and analysing the interactive behaviour of an infusion pump
        date: 2011-09-20
       words: 6771
      flesch: 57
     summary: The relevance of the rigorous assessments proposed here prior to procurement are heightened by well documented concerns about safety of infusion devices in general (see for example The work described here is part of the ongoing analysis of a range of infusion devices with the aim of reducing these costs.
    keywords: analysis; device; infusion; layer; line; model; process; properties; pump; rate; state; volume; vtbi
       cache: eceasst-641.pdf
  plain text: eceasst-641.txt

        item: #556 of 858
          id: eceasst-642
      author: Thimbleby, Harold; Gimblett, Andy
       title: Dependable keyed data entry for interactive systems
        date: 2011-09-20
       words: 9530
      flesch: 61
     summary: For example, pressing � � OK� �when the display shows 1000 could cause the device to act on 500 if this is the largest allowed value. Pressing � �OK� �never changes the display (unless it changes from blue to green).
    keywords: approach; data; del �; digit; display; entry; error; example; input; key; n �; number; user; � �
       cache: eceasst-642.pdf
  plain text: eceasst-642.txt

        item: #557 of 858
          id: eceasst-643
      author: Blume, Christoph; Bruggink, H. J. Sander; Friedrich, Martin; König, Barbara
       title: Treewidth, Pathwidth and Cospan Decompositions
        date: 2011-09-20
       words: 5946
      flesch: 68
     summary: Keywords: cospans, graph decompositions, pathwidth, treewidth 1 Introduction In graph rewriting the notion of cospan plays a major role: cospans can be seen as graphs equipped with an inner and an outer interface and they can be used as (atomic) building blocks for constructing or decomposing larger graphs. In this paper we show that, when seen from the right angle, graph decompositions based on cospans are in fact very similar to path and tree decompositions.
    keywords: atomic; bag; cospan; decomposition; graph; interface; path; star; tree; treewidth
       cache: eceasst-643.pdf
  plain text: eceasst-643.txt

        item: #558 of 858
          id: eceasst-644
      author: Boronat, Artur; Meseguer, José
       title: Automated Model Synchronization: A Case Study on UML with Maude
        date: 2011-09-20
       words: 7054
      flesch: 55
     summary: An approach for generating complex repair plans for resolving model inconsistencies in an automated way is presented in [SMBB10]. 5 Conclusions In this paper, we have presented search strategies for identifying model inconsistencies in het- erogeneous MOF-specifications and for automating inconsistency resolution using Maude, and have illustrated them with a UML case study.
    keywords: approach; choices; class; domain; inconsistency; model; repair; specification; state
       cache: eceasst-644.pdf
  plain text: eceasst-644.txt

        item: #559 of 858
          id: eceasst-645
      author: Golas, Ulrike; Biermann, Enrico; Ehrig, Hartmut; Ermel, Claudia
       title: A Visual Interpreter Semantics for Statecharts Based on Amalgamated Graph Transformation
        date: 2011-09-20
       words: 10580
      flesch: 59
     summary: His intention is to separate syntactical and static semantic concepts (like conflicts, priorities etc.) of statecharts from their dynamic operational semantics, which is specified by graph transformation rules. We build on an extension of the existing theory of amalgamation from binary to multi-amalgamation including nested application conditions to control rule applications for automatic simulation.
    keywords: application; current; event; figure; graph; interaction; interpreter; isinitial; kernel; rule; scheme; semantics; statecharts; states; step; transformation
       cache: eceasst-645.pdf
  plain text: eceasst-645.txt

        item: #560 of 858
          id: eceasst-646
      author: Golas, Ulrike; Ehrig, Hartmut; Herrmann, Frank
       title: Formal Specification of Model Transformations by Triple Graph Grammars with Application Conditions
        date: 2011-09-20
       words: 11798
      flesch: 64
     summary: Moreover, a backward model transformation sequence (GT ,G′0 = tr∗B =⇒ G′n,GS) is based on a target consistent backward transformation G′0 = tr∗B =⇒ G′n with G′0 = (∅ ∅←−∅ ∅−→ GT ) and G′n,S = GS. 4.1 Results for Model Transformations with Application Conditions Based on Theorem 1 we can show correctness, completeness, backward information preserva- tion, and termination of model transformations. S 2:S S-P S-P L7 R S 2:S R 1:S S-P S-P L7 R 1:S S R2:S S-P S-P newTransitionNewExit L8,S L8,C
    keywords: = =; = ⇒; application; application conditions; conditions; figure; forward; graph; model; p s; petri; rules; s s; sequence; source; state; target; transformation; transition; triple
       cache: eceasst-646.pdf
  plain text: eceasst-646.txt

        item: #561 of 858
          id: eceasst-647
      author: Heumüller, Marvin; Joshi, Salil; König, Barbara; Stückrath, Jan
       title: Construction of Pushout Complements in the Category of Hypergraphs
        date: 2011-09-20
       words: 8792
      flesch: 73
     summary: The Stirling numbers satisfy the following recursive equation: Sn,k = Sn−1,k−1 + k ·Sn−1,k, which is based on a case distinction according to the element n: either n is in an 4 http://www.research.att.com/˜njas/sequences/ 13 / 20 Volume 39 (2011) Construction of Pushout Complements in the Category of Hypergraphs equivalence class of its own and the remaining n−1 elements have to be grouped in k−1 equiv- alence classes; or the remaining n−1 elements have to be grouped in k equivalence classes and there are k possibilities to assign n to one of these classes. There is a well-known construction of pushouts [5] in the category of hypergraphs, where pushouts are obtained by taking the disjoint union of B and C and factoring through an equiva- lence obtained from the morphisms f ,n. Proposition 1 (Pushout via equivalence classes)
    keywords: complements; construction; equivalence; nodes; pushout
       cache: eceasst-647.pdf
  plain text: eceasst-647.txt

        item: #562 of 858
          id: eceasst-649
      author: Picard, Celia; Matthes, Ralph
       title: Coinductive Graph Representation: the Problem of Embedded Lists
        date: 2011-09-20
       words: 9934
      flesch: 70
     summary: The graph of Figure 1 can be represented as a term of type Graph with the following co-recursive definition: Finite_Graph := mk_Graph 0 If we note 〈...,...〉 the con- structor for elements of type Σx : A.B(x), then an element l of type ilist T can be “reconstructed” as 〈lgti l, fcti l〉.
    keywords: definition; elements; example; graph; ilist; representation; type
       cache: eceasst-649.pdf
  plain text: eceasst-649.txt

        item: #563 of 858
          id: eceasst-65
      author: Fuß, Christian; Mosler, Christof; Ranger, Ulrike; Schultchen, Erhard
       title: The Jury is still out: A Comparison of AGG, Fujaba, and PROGRES
        date: 2007-06-22
       words: 6717
      flesch: 57
     summary: The approach allows formal and easy to understand proofs of properties on graphs and on graph transformation rules, e.g. the amalgama- tion of graph transformation rules. The approach allows more expressiveness within graph transformation rules, e.g. embedding rules, which enable user-defined embedding of a rewritten sub-graph in its context graph.
    keywords: agg; approach; attributes; edges; fujaba; graph; graph transformation; language; nodes; progres; rules; transformation; truck; types
       cache: eceasst-65.pdf
  plain text: eceasst-65.txt

        item: #564 of 858
          id: eceasst-650
      author: Hoffmann, Berthold; Minas, Mark
       title: Generating Instance Graphs from Class Diagrams with Adaptive Star Grammars
        date: 2011-09-20
       words: 9291
      flesch: 66
     summary: The following set of rules rC̄k , u 6 k 6 v, adds a bundle of c edges from the node visited by the x-edge to the k nodes visited by the y-edges. This rule must be dropped if the multiplicity of association c is 1..1 instead of 0..1 at the composite end-point.
    keywords: adaptive; association; class; diagram; edges; graph; instance; node; star
       cache: eceasst-650.pdf
  plain text: eceasst-650.txt

        item: #565 of 858
          id: eceasst-651
      author: Bottoni, Paolo; Fish, Andrew; Parisi Presicce, Francesco
       title: Incremental update of constraint-compliant policy rules
        date: 2011-09-20
       words: 9283
      flesch: 68
     summary: 2 Related work In [KMP05], a security policy framework is defined by giving a type graph, a set of (named) graph transformation rules, and two sets of simple positive and negative constraints, expressed as morphisms from a premise to a conclusion. Update of policy rules where each rule is guaranteed to preserve the constraint.
    keywords: constraint; doc; figure; graph; lv1; lv2; mgr; policy; rules
       cache: eceasst-651.pdf
  plain text: eceasst-651.txt

        item: #566 of 858
          id: eceasst-652
      author: Echahed, Rachid; Habel, Annegret; Mosbah, Mohamed
       title: Graph Computation Models
        date: 2011-09-20
       words: 323
      flesch: 33
     summary: The topics of the different articles range over a wide spectrum, including theoretical aspects of graph transformations, proof methods, semantics as well as application issues of graph computation models. Graph computation models (GCM) constitute a class of very high level models where graphs are first-class citizens.
    keywords: computation; models
       cache: eceasst-652.pdf
  plain text: eceasst-652.txt

        item: #567 of 858
          id: eceasst-653
      author: Masci, Paolo; Curzon, Paul; Blandford, Ann; Furniss, Dominic
       title: Modelling Distributed Cognition Systems in PVS
        date: 2011-09-20
       words: 7456
      flesch: 52
     summary: In PVS, system states can be conveniently specified with structured data-types. Activities can be carried out ei- ther by humans, devices, or collections of humans and devices, and they are specified as transition functions over system states.
    keywords: = =; activities; activity; ambulance; dicot; flow; incident; information; model; pvs; specification; state; system; type; work
       cache: eceasst-653.pdf
  plain text: eceasst-653.txt

        item: #568 of 858
          id: eceasst-654
      author: Masci, Paolo; Ruksenas, Rimvydas; Oladimeji, Patrick; Cauchi, Abigail; Gimblett, Andy; Li, Yunqiu; Curzon, Paul; Thimbleby, Harold
       title: On formalising interactive number entry on infusion pumps
        date: 2011-09-20
       words: 7076
      flesch: 56
     summary: The specifica- tion is given in higher-order logic: we model information relevant to the display of the device as device states, and we specify device functionality using transition functions over device states. In the present paper, we focus on number entry user interfaces for drug infusion pumps, an example of “simple” systems that need to be carefully designed in order to avoid unnecessary hazards that may lead to harm, in this case possibly to patient harm, even death, potentially following user error.
    keywords: button; device; digit; display; number; predictability; specification; state; system; user; value
       cache: eceasst-654.pdf
  plain text: eceasst-654.txt

        item: #569 of 858
          id: eceasst-655
      author: Rukšėnas, Rimvydas; Curzon, Paul
       title: Abstract Models and Cognitive Mismatch in Formal Verification
        date: 2011-09-20
       words: 2447
      flesch: 52
     summary: Keywords: User models, cognitive mismatch, model checking, number entry 1 Introduction In HCI, models of human cognition are used in different ways and for various purposes. Including such assumptions into user models also makes their inspection and validation less tractable.
    keywords: infusion; mismatch; model; rate; user
       cache: eceasst-655.pdf
  plain text: eceasst-655.txt

        item: #570 of 858
          id: eceasst-656
      author: Huang, Huayi; Ruksenas, Rimvydas; Ament, Maartje; Curzon, Paul; Cox, Anna; Blandford, Ann; Brumby, Duncan
       title: Capturing the distinction between task and device errors in a formal model of user behaviour
        date: 2011-10-15
       words: 8420
      flesch: 54
     summary: A simple approach to the modelling of plausible user behaviours involves writing both a formal specification of the device and task models for that device, to support reasoning about the behaviour of the interactive system [MD95, Fie01]. Task models, however, describe only a small fraction of real user behaviour - in particular they do not really deal with human fallibility.
    keywords: actions; device; errors; initialisation; load; model; step; task; user
       cache: eceasst-656.pdf
  plain text: eceasst-656.txt

        item: #571 of 858
          id: eceasst-657
      author: Cerone, Antonio
       title: Closure and Attention Activation in Human Automatic Behaviour: A Framework for the Formal Analysis of Interactive Systems
        date: 2011-09-20
       words: 7405
      flesch: 54
     summary: Process algebraic model of attentional capture and human electrophysiology in interactive systems. In general, there will be several nestings of contention processes with the toplevel having Proc = Prock and defining the auto- maticity rule.
    keywords: action; analysis; automaticity; behaviour; card; cash; leave; model; process; set; user
       cache: eceasst-657.pdf
  plain text: eceasst-657.txt

        item: #572 of 858
          id: eceasst-658
      author: Plump, Detlef; Suri, Robin; Singh, Ambuj
       title: Minimizing Finite Automata with Graph Programs
        date: 2011-09-20
       words: 5640
      flesch: 71
     summary: This algorithm first computes the indistinguishability relation among states, called state equivalence, and then merges equivalent states to obtain a minimal automaton that is equiv- alent to the input automaton. While state equivalence is usually com- puted by a table-filling algorithm, in our case we directly connect equivalent states with special edges.
    keywords: automaton; graph; rule; states
       cache: eceasst-658.pdf
  plain text: eceasst-658.txt

        item: #573 of 858
          id: eceasst-659
      author: Bass, Ellen J; Feigh, Karen M; Gunter, Elsa; Rushby, John M
       title: Formal Modeling and Analysis for Interactive Hybrid Systems
        date: 2011-10-15
       words: 8299
      flesch: 53
     summary: An aircraft may operate in different “modes” (e.g., flaps retracted or extended), and there will be different sets of differential equations for each mode: aircraft models are therefore hybrid systems (i.e., they combine discrete and continuous elements) and these pose challenges for analysis, especially when composed with models for the other actors. FMIS 2011 2 / 16 ECEASST not concern air traffic operations, it does employ similar components: human mental models, automated systems, and aircraft dynamics.
    keywords: aircraft; airspeed; altitude; automation; fcu; flaps; fpa; hybrid; model; pitch; state; systems
       cache: eceasst-659.pdf
  plain text: eceasst-659.txt

        item: #574 of 858
          id: eceasst-66
      author: Mackie, Ian; Sousa Pinto, Jorge; Vilaca, Miguel
       title: Visual Programming with Recursion Patterns in Interaction Nets
        date: 2007-06-22
       words: 5343
      flesch: 58
     summary: We consider the use of recursion patterns as a pro- gramming idiom, and introduce a suitable archetype/instantiation mechanism for interaction agents, which allows one to define agents whose behaviour is based on recursion patterns. We claim that this style is a good choice for defining and executing visual functional programs.
    keywords: agent; cons; function; interaction; nets; patterns; programming; recursion
       cache: eceasst-66.pdf
  plain text: eceasst-66.txt

        item: #575 of 858
          id: eceasst-660
      author: Bhandal, Colm; Bouroche, Melanie; Hughes, Arthur
       title: A Process Algebraic Description of a Temporal Wireless Network Protocol
        date: 2011-09-21
       words: 7551
      flesch: 63
     summary: The model may also be used as an aid in the design of such systems. Ignore(e,i,s,e′, j,s′) asserts whether a listener e in mode i and position s can ignore a message sent by e′ in mode j and position s′. rangeOK(i,r) asserts whether the range r of a message sent by an entity in mode i is sufficient.
    keywords: comhordú; coverage; def; description; entities; entity; message; model; process; protocol; system; time
       cache: eceasst-660.pdf
  plain text: eceasst-660.txt

        item: #576 of 858
          id: eceasst-662
      author: Krieger, Matthias P.; Brucker, Achim D.
       title: Extending OCL Operation Contracts with Objective Functions
        date: 2011-10-15
       words: 8073
      flesch: 55
     summary: • Closest pair among a set of points • Minimum spanning tree of a graph • Shortest path in a graph • Maximum network flow • Maximum matching of a graph • Regression: Least Squares • Knapsack problem • Linear programming Figure 1: Optimization algorithms covered in a classical algorithms textbook [Sed88] Objective functions strictly increase the expressiveness of OCL operation contracts. In this section we show how tool support for animation can be accomplished for OCL operation contracts that include objective functions.
    keywords: contracts; functions; l u; o l; objective; ocl; operation; s o
       cache: eceasst-662.pdf
  plain text: eceasst-662.txt

        item: #577 of 858
          id: eceasst-663
      author: Willink, Edward Daniel
       title: Modeling the OCL Standard Library
        date: 2011-10-15
       words: 6544
      flesch: 49
     summary: This paper provides early community visibility of pro- posed solutions to a variety of issues that arose while developing a model for the OCL Standard Library that forms the core of the OCL specification. However even changes in the specification need not impact com- patibility, since with substantial parts of the OCL semantics migrating to the library model, it may be possible to encapsulate the semantics of a particular OCL tool version in a correspond- ing OCL Standard Library model and so preserve precisely those semantics for those users that require them.
    keywords: bag; collection; figure; library; model; modeling; object; ocl; operation; specification; type; uml
       cache: eceasst-663.pdf
  plain text: eceasst-663.txt

        item: #578 of 858
          id: eceasst-664
      author: Willink, Edward Daniel
       title: Aligning OCL with UML
        date: 2011-10-15
       words: 7033
      flesch: 49
     summary: Aligning OCL with UML Figure 11: OCL Pivot and OCL Value Usage. 3.1 Complete OCL Problems A Complete OCL document can complement a model and add features to it so that they can be used as if they were part of the complemented model.
    keywords: class; clause; definition; emof; figure; meta; model; object; ocl; pivot; specification; uml
       cache: eceasst-664.pdf
  plain text: eceasst-664.txt

        item: #579 of 858
          id: eceasst-665
      author: Chimiak-Opoka, Joanna Dobroslawa; Demuth, Birgit; Awenius, Andreas; Chiorean, Dan; Gabel, Sebastien; Hamann, Lars; Willink, Edward
       title: OCL Tools Report based on the IDE4OCL Feature Model
        date: 2011-10-15
       words: 7424
      flesch: 52
     summary: Keywords: OCL, IDE4OCL, feature model, OCL tool 1 Introduction For almost 15 years the Object Constraint Language (OCL) has been extensively discussed and used in multiple contexts. We tried to select a representative collection of OCL tools best fitting to the idea of IDE4OCL (Table 1).
    keywords: data; development; dresden; eclipse; editor; evaluation; feature; ide4ocl; model; ocl; project; report; squam; support; tools; uml; use; user
       cache: eceasst-665.pdf
  plain text: eceasst-665.txt

        item: #580 of 858
          id: eceasst-666
      author: Cabot, Jordi; Clarisó, Robert; Gogolla, Martin; Wolff, Burkhart
       title: Preface (OCL 2011 Proceedings)
        date: 2011-10-15
       words: 1010
      flesch: 35
     summary: The debate focused mainly on two topics: • strategies for improving interoperability among OCL tools; Proc. Community and discussion: The workshop concluded with a presentation on the status of OCL tool support among several toolkits and a discussion session.
    keywords: modelling; ocl; textual; university; workshop
       cache: eceasst-666.pdf
  plain text: eceasst-666.txt

        item: #581 of 858
          id: eceasst-667
      author: Heckel, Reiko; Khan, Tamim Ahmed; Machado, Rodrigo
       title: Towards Test Coverage Criteria for Visual Contracts
        date: 2011-10-20
       words: 5118
      flesch: 65
     summary: Specifying interfaces by graph transformation rules, so-called visual contracts, we define model-based cov- erage criteria exploiting the well-known relations of causal dependency and conflict on transformation rules. Specifying the provided operations by visual contracts, formally typed attributed graph transformation rules, we analyse their potential conflicts and dependen- cies [EEPT06].
    keywords: coverage; criteria; dependency; graph; labels; rule; set; test; testing; transformation
       cache: eceasst-667.pdf
  plain text: eceasst-667.txt

        item: #582 of 858
          id: eceasst-668
      author: Savaton, Guillaume; Béchennec, Jean-Luc; Briday, Mikaël; Kassem, Rola
       title: An Architecture Description Language for Embedded Hardware Platforms
        date: 2011-10-20
       words: 6198
      flesch: 59
     summary: There is a need for a third kind of languages: hardware architecture description languages, or rather hardware platform description languages, that would explicitly capture the software execution mechanisms, in terms of low-level programming interface (processor instruction set), resources (processing elements, memory and peripheral devices) and elementary services (arith- metic and logic operations, bus transactions). An Architecture Description Language for Embedded Hardware Platforms a common “abstract syntax” for processor instructions, from which the assembly language and machine language are just two possible concrete forms.
    keywords: e d; e g; e s; g r; n s; r e; r n; r u; s s; s t; t e; t r
       cache: eceasst-668.pdf
  plain text: eceasst-668.txt

        item: #583 of 858
          id: eceasst-669
      author: Wilke, Claas; Demuth, Birgit
       title: UML is still inconsistent! How to improve OCL Constraints in the UML 2.3 Superstructure
        date: 2011-10-20
       words: 6850
      flesch: 56
     summary: Total number of found OCL errors 320 Figure 1: General WFR statistics. How to improve OCL Constraints in the UML 2.3 Superstructure Electronic Communications of the EASST Volume 44 (2011) Proceedings of the Workshop on OCL and Textual Modelling (OCL 2011)
    keywords: 2.3; clause; constraints; errors; listing; metamodel; ocl; rules; specification; superstructure; uml; wfrs
       cache: eceasst-669.pdf
  plain text: eceasst-669.txt

        item: #584 of 858
          id: eceasst-67
      author: Paun, Gheorghe
       title: Membrane computing [and graph transformation]
        date: 2007-06-22
       words: 656
      flesch: 53
     summary: Keywords: Natural computing, membrane computing, P system, Turing com- putability Membrane computing is a branch of natural computing initiated in [5] which abstracts comput- ing models from the organization and the functioning of the living cell and from the cooperation of cells in tissues, organs (brain included) or other higher order structures. The talk is intended to be a general introduction to membrane computing, starting by placing it in natural computing, presenting the basic ideas and main types of results and applications, and pointing whenever necessary the interplay with graph theory and graph transformation (graph theory provides ideas/tools for studying P systems, while P systems can be used for handling graphs, e.g., as objects in membranes, or indirectly, as graphs describing membrane structures).
    keywords: computing; graph; membrane
       cache: eceasst-67.pdf
  plain text: eceasst-67.txt

        item: #585 of 858
          id: eceasst-670
      author: Uhl, Axel; Goldschmidt, Thomas; Holzleitner, Manuel
       title: Using an OCL Impact Analysis Algorithm for View-Based Textual Modelling
        date: 2011-10-20
       words: 8542
      flesch: 52
     summary: Techniques to reduce this effort have been presented in previous work but do not cover the full range of OCL expressions, in particular calls to oper- ations defined in OCL, including recursive operations. In this paper, we present an approach that is applicable to the full range of OCL expressions.
    keywords: analysis; change; context; department; evaluation; expression; impact; model; ocl; operation; self; textual; traceback; value
       cache: eceasst-670.pdf
  plain text: eceasst-670.txt

        item: #586 of 858
          id: eceasst-671
      author: Gadducci, Fabio; Mariani, Leonardo
       title: Preface
        date: 2011-10-27
       words: 1036
      flesch: 28
     summary: GTVMT 2011 ECEASST The Programme Committee, chaired by Fabio Gadducci and Leonardo Mariani, consisted of Paolo Baldan, University of Padova Artur Boronat, University of Leicester Andrea Corradini, University of Pisa Claudia Ermel, TU Berlin Fabio Gadducci, University of Pisa Holger Giese, HPI Potsdam Ekkart Kindler, TU Denmark Barbara König, University of Duisburg-Essen Fabrice Kordon, Université Pierre et Marie Curie Jochen Küster, IBM Research Zurich Juan de Lara, Universidad Autónoma de Madrid Leonardo Mariani, University of Milan Bicocca Alberto Lluch Lafuente, IMT Institute for Advanced Studies Lucca Mark Minas, Universität der Bundeswehr München Henry Muccini, University of L’Aquila Flavio Oquendo, Université de Bretagne Sud Francesco Parisi-Presicce, University of Rome Arend Rensink, University of Twente Gabriele Täntzer, University of Marburg Emilio Tuosto, University of Leicester Dániel Varró, TU Budapest For their excellent work in reviewing and selecting the submitted papers, we are grateful to the Programme Committee members as well as to the external referees. The rationale of the series of workshops is that successful applications of visual modeling notations depend on the ability • to provide tool support beyond graphical editors including facilities for code generation, simulation or verification, and consistency management; • to adapt and specialize languages, methods, and tools to the needs of specific application domains, enterprises, or projects.
    keywords: systems; techniques; university; verification; workshop
       cache: eceasst-671.pdf
  plain text: eceasst-671.txt

        item: #587 of 858
          id: eceasst-673
      author: Bendisposto, Jens; Leuschel, Michael; Roggenbach, Markus
       title: Avocs2010 Preface
        date: 2011-11-14
       words: 366
      flesch: 37
     summary: Previ- ous AVoCS workshops were held at the University of Oxford (2001 and 2007), the University of Birmingham (2002), the University of Southampton (2003), the Royal Society in London (2004), the University of Warwick (2005), LORIA, Nancy (2006), the University of Glasgow (2008), and Swansea University (2009). The aim of AVoCS 2010 was to contribute to the interaction and exchange of ideas among members of the international research community on tools and techniques for the verification of critical systems.
    keywords: university; workshop
       cache: eceasst-673.pdf
  plain text: eceasst-673.txt

        item: #588 of 858
          id: eceasst-674
      author: Bowen, Judy; Reeves, Steve
       title: Preface for FMIS 2011
        date: 2011-12-06
       words: 547
      flesch: 37
     summary: Other papers present a validation study of an existing generic model of user behaviour (H. Huang et al.), the scalable and systematic analysis of interactive systems (using the infusion pump as an example; Campos and Harrison), a formalization of DiCoT, an informal structured approach for analysing complex work systems, as distributed cognition systems (Masci et al.), abstract modelling of hybrid systems and their automated analysis as supported by an SMT solver (Bass et al.), a process algebraic framework to formalise a model of automatic behaviour (Cerone), a process algebraic description of a model of coordination (Bhandal et al.), a sys- tematic approach to dealing with the unavoidable errors in data entry (Thimbleby and Gimblett), formalising predictability of a user interface (Masci et al.), work on accommodating fine-grained analysis of cognitive mismatch in interactive systems via model checking (Rukšėnas and Cur- zon) and an approach for supporting mobile application development by using models as inputs to an emulator (Bowen and Hinze). Electronic Communications of the EASST Volume 45 (2011) Proceedings of the Forth International Workshop on Formal Methods for Interactive Systems (FMIS 2011)
    keywords: fmis; systems
       cache: eceasst-674.pdf
  plain text: eceasst-674.txt

        item: #589 of 858
          id: eceasst-675
      author: Amaral, Vasco; Vangheluwe, Hans; Hardebolle, Cecile; Laszlo, Lengyel
       title: MPM 2010 Preface
        date: 2011-12-21
       words: 1212
      flesch: 39
     summary: Antonio Vallecillo, Universidad de Málaga • Bernhard Westfechtel, University of Bayreuth • Bruno Barroca, Universidade Nova de Lisboa • Cécile Hardebolle, Supélec • Chris Paredis, Georgia Tech • Christophe Jacquet, Supélec • Didier Buchs,University of Geneva • Dirk Deridder, Free University of Brussels • Esther Guerra, Universidad Carlos III de Madrid • Eugene Syriani, McGill University • Franck Fleurey, SINTEF • Frdric Boulanger, Supélec • Gabriela Nicolescu, Polytechnique Montral • Gergely Mezei, Budapest University of Technology and Economics • Hans Vangheluwe, McGill University and University of Antuerp • Hessam Sarjoughian, Arizona State University • Holger Giese, Hasso-Plattner-Institut • Jeff Gray, University of Alabama • Jeroen Voeten, Eindhoven University of Technology • Jonathan Sprinkle, University of Arizona • Jos Luis Martı́n, Universidad Complutense de Madrid • Juan de Lara, Universidad Autonoma de Madrid • Laurent Safa, Silver Egg Technology • László Lengyel, Budapest University of Technology and Economics • Levi Lúcio, University of Luxembourg • Luı́s Pedro, DAuriol Assets • Mamadou K. Traoré, FR Sciences et Technologies • Manuel Wimmer, Vienna University of Technology • Mark Minas, University of the Federal Armed Forces • Martin Toerngren, KTH Royal Institute of Technology • Matteo Risoldi, University of Geneva • Mirko Conrad, The MathWorks • Peter Bunus, Linkoping University 3 / 4 Volume 42 (2011) Preface • Pieter van Gorp, Eindhoven University of Technology • Reiko Heckel, University of Leicester • Stefan Van Baelen, K.U. Leuven • Steve Hostettler, University of Geneva • Thomas Feng, Oracle • Thomas Kühne, Victoria University of Wellington • Vasco Amaral, Universidade Nova de Lisboa Proc.
    keywords: model; mpm; technology; transformations; university; workshop
       cache: eceasst-675.pdf
  plain text: eceasst-675.txt

        item: #590 of 858
          id: eceasst-677
      author: Aranega, Vincent; Etien, Anne; Dekeyser, Jean-Luc
       title: Using an Alternative Trace for QVT
        date: 2011-12-21
       words: 5169
      flesch: 57
     summary: Furthermore, based on the QVT language elements, we highlight model transformation concepts that would require consideration. The case study has shown the limit of this policy; other QVT language elements require attention.
    keywords: elements; input; instance; metamodel; model; qvt; qvt trace; trace; traceability; transformation
       cache: eceasst-677.pdf
  plain text: eceasst-677.txt

        item: #591 of 858
          id: eceasst-678
      author: Herold, Sebastian
       title: Compliance between Architecture and Design Models of Component-Based Systems
        date: 2011-12-21
       words: 5206
      flesch: 45
     summary: If ϕ is simply a conjunction of predicates, like statements of UML design models (see Sec. 2.3.1), there is a unique minimal structure. If the trans- formation rules are correct, compliance between architecture model and design model or the implementation is ensured.
    keywords: architecture; checking; compliance; component; design; example; layer; models; software; structure; systems; uml
       cache: eceasst-678.pdf
  plain text: eceasst-678.txt

        item: #592 of 858
          id: eceasst-679
      author: Johnson, Chris
       title: Using Assurance Cases and Boolean Logic Driven Markov Processes to Formalise Cyber Security Concerns for Safety-Critical Interaction with Global Navigation Satellite Systems
        date: 2011-12-21
       words: 7453
      flesch: 45
     summary: This approach raises a number of concerns in particular, it is difficult to show that some security evidence has implications for systems safety and vice versa. This approach suffers from a range of practical problems for example, it is possible to identify potential safety concerns with every threat or vulnerability.
    keywords: applications; attack; bdmp; cases; concerns; failure; figure; gnss; infrastructures; navigation; safety; satellite; sbas; security; systems
       cache: eceasst-679.pdf
  plain text: eceasst-679.txt

        item: #593 of 858
          id: eceasst-68
      author: Sheehan, Brendan; Gaudin, Benoit; Quigley, Aaron
       title: Imposing Hierarchy on a Graph
        date: 2007-06-22
       words: 6849
      flesch: 67
     summary: Theorem 3 offers a way to impose a k-partite graph structure on each associated graph. As an example, for all vertices n of graph G given in Figure 1, the value of dG,r (n) is written down on the left side of Figure 1. 0
    keywords: graph; hierarchy; merge; protein; tree; vertex; vertices
       cache: eceasst-68.pdf
  plain text: eceasst-68.txt

        item: #594 of 858
          id: eceasst-680
      author: Barnes, Janet Elizabeth
       title: Experiences in the Industrial use of Formal Methods
        date: 2011-12-21
       words: 7247
      flesch: 43
     summary: Interestingly, many of the benefits of formal notations do not come from the application of verification techniques, tool supported or otherwise, but from the additional attention to detail imposed on the author when applying the techniques. [RL98] using the CbyC approach ap- plied using formal notations at every stage of the development lifecycle.
    keywords: design; development; methods; notation; proof; properties; security; software; specification; system; tis; use
       cache: eceasst-680.pdf
  plain text: eceasst-680.txt

        item: #595 of 858
          id: eceasst-681
      author: Gan, Xiang; Dubrovin, Jori; Heljanko, Keijo
       title: A Symbolic Model Checking Approach to Verifying Satellite Onboard Software
        date: 2011-12-21
       words: 8279
      flesch: 67
     summary: There are three types of possible errors that are handled by the system: mode transition errors, attitude errors and unit errors. In Figure 1(b), the bold arrows demonstrate the handling of mode transition errors in AOCS by the FDIR manager.
    keywords: aocs; checking; code; error; ltl; model; nusmv; properties; state; system; transition; unit
       cache: eceasst-681.pdf
  plain text: eceasst-681.txt

        item: #596 of 858
          id: eceasst-682
      author: Philippaerts, Pieter; Vogels, Frédéric; Smans, Jan; Jacobs, Bart; Piessens, Frank
       title: The Belgian Electronic Identity Card: a Verification Case Study
        date: 2011-12-21
       words: 6268
      flesch: 59
     summary: This paper will assess the applicability of verification of Java Card applets using the VeriFast approach. Java Card applets use two types of memory to store data and intermediate results.
    keywords: applet; card; case; class; code; java; java card; method; predicate; verifast; verification
       cache: eceasst-682.pdf
  plain text: eceasst-682.txt

        item: #597 of 858
          id: eceasst-684
      author: Dongol, Brijesh; Hayes, Ian J.
       title: Approximating Idealised Real-Time Specifications Using Time Bands
        date: 2011-12-21
       words: 7291
      flesch: 69
     summary: M 2 Lemma 7 For a continuous variable m in time band P, and constant K, ←−−−− m ≤ K ∧ ` < ρ. For a state predicate c, interval ∆ and stream s, we define: −→c .∆.s
    keywords: band; interval; program; pump; safety; teleo; time
       cache: eceasst-684.pdf
  plain text: eceasst-684.txt

        item: #598 of 858
          id: eceasst-685
      author: Jastram, Michael; Hallerstede, Stefan; Ladenberger, Lukas
       title: Mixing Formal and Informal Model Elements for Tracing Requirements
        date: 2012-01-13
       words: 6646
      flesch: 56
     summary: 4.4 Adding Requirements with Refinement Another application of refinement is the gradual inclusion of formal requirements into subse- quent refinements, as hinted at in (9). This can make it very difficult to verify any interesting property but also to compute a sufficiently small set of formal artefacts that are used to verify specific formal requirements Rfn.
    keywords: approach; elements; event; model; refinement; requirements; specification; state; system; tracing
       cache: eceasst-685.pdf
  plain text: eceasst-685.txt

        item: #599 of 858
          id: eceasst-686
      author: Chausse, Nicolas; Xu, Helen; Dingel, Juergen; Rudie, Karen
       title: Combining Model Checking and Discrete-Event Supervisor Synthesis
        date: 2012-01-13
       words: 8684
      flesch: 73
     summary: e t e r m g e t D e
    keywords: e e; e n; l e; l l; n t; o l; r e; s e; s t; t e; t o; t r; t t; t u
       cache: eceasst-686.pdf
  plain text: eceasst-686.txt

        item: #600 of 858
          id: eceasst-688
      author: Hoang, Thai Son; Iliasov, Alexei; Silva, Renato A; Wei, Wei
       title: A Survey on Event-B Decomposition
        date: 2011-12-21
       words: 6653
      flesch: 56
     summary: Event model decomposition. Developments of Sub-models.
    keywords: decomposition; event; model; request; server; stage; sub; system; update; user; variables
       cache: eceasst-688.pdf
  plain text: eceasst-688.txt

        item: #601 of 858
          id: eceasst-691
      author: Weitl, Franz; Nakajima, Shin
       title: Integrated Model Checking of Static Structure and Dynamic Behavior using Temporal Description Logics
        date: 2012-03-01
       words: 7204
      flesch: 62
     summary: In a first step, LTLDL models and formulae are transformed for a certain bound k into a non-temporal SMT(DL) formula which is a Boolean formula over a restricted theory of finite sets and relations. Hence TM,s0,2∧¬ f2 is satisfied and we conclude M,s0 6|= f . 4.2 SMT(DL) As illustrated by Example 3, we transform LTLDL models and formulae into formulae that con- tain set-type variables and operations corresponding to the semantics of DL connectives.
    keywords: checking; description; figure; formulae; logic; ltldl; model; order; sake; set; smt; smt(dl; state; transition
       cache: eceasst-691.pdf
  plain text: eceasst-691.txt

        item: #602 of 858
          id: eceasst-695
      author: Yeganefard, Sanaz; Butler, Michael
       title: Structuring Functional Requirements of Control Systems to Facilitate Refinement-based Formalisation
        date: 2012-02-02
       words: 6731
      flesch: 57
     summary: We suggest to handle these requirements similarly to the revision step in Stage 1, where phenomena of new requirements are identified and based on them requirements are added to the corresponding MCC sections of the structured RD. In order to deal with the complexity of a control system, our aim is to use refinement to introduce system requirements in a step-wise manner.
    keywords: control; lane; ldws; level; model; modelling; phenomena; requirements; system; warning
       cache: eceasst-695.pdf
  plain text: eceasst-695.txt

        item: #603 of 858
          id: eceasst-697
      author: Bozzano, Marco; Cimatti, Alessandro; Lisagor, Oleg; Mattarei, Cristian; Mover, Sergio; Roveri, Marco; Tonetta, Stefano
       title: Symbolic Model Checking and Safety Assessment of Altarica models
        date: 2012-02-27
       words: 7025
      flesch: 58
     summary: In this paper we present a novel approach to the analysis of Altarica models, based on a translation into an extended version of NuSMV. Based on the semantics, we have implemented a translator to convert Altarica models into NuSMV.
    keywords: altarica; assessment; events; hydi; l u; model; nusmv; ocas; safety; u t
       cache: eceasst-697.pdf
  plain text: eceasst-697.txt

        item: #604 of 858
          id: eceasst-7
      author: Baresi, Luciano; Maurino, Andrea; Modafferi, Stefano
       title: Towards Distributed BPEL Orchestrations
        date: 2007-02-20
       words: 5494
      flesch: 53
     summary: Towards distributed workflow process management. It also provides support for dynamic workflow processes, error and exception handling, recovery, and QoS management.
    keywords: approach; bpel; execution; model; nodes; orchestrators; partitioning; process; railroad; rules; signal; workflow
       cache: eceasst-7.pdf
  plain text: eceasst-7.txt

        item: #605 of 858
          id: eceasst-70
      author: Rangel, Guilherme; König, Barbara; Ehrig, Hartmut
       title: Bisimulation Verification for the DPO Approach with Borrowed Contexts
        date: 2007-06-22
       words: 6662
      flesch: 68
     summary: A GTS specifies model transformation by defining graph transformation rules to translate one model into another. We define model refactoring by graph transformation rules in the Double Pushout Approach (DPO)
    keywords: algorithm; bisimulation; graph; labels; w w
       cache: eceasst-70.pdf
  plain text: eceasst-70.txt

        item: #606 of 858
          id: eceasst-700
      author: Romanovsky, Alexander; Jones, Cliff; Bendiposto, Jens; Leuschel, Michael
       title: Preface
        date: 2012-03-01
       words: 530
      flesch: 39
     summary: Guest Editors: Jens Bendisposto, Cliff Jones, Michael Leuschel, Alexander Romanovsky Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 Proceedings of the 11th International Workshop on Automated Verification of Critical Systems (AVoCS 2011) Preface Alexander Romanovsky, Cliff Jones, Jens Bendisposto, Michael Leuschel 3 Pages ECEASST 2 / 3 Volume 46 (2011) Preface Alexander Romanovsky, Cliff Jones, Jens Bendisposto, Michael Leuschel Newcastle University 1 Preface AVOCS, the workshop on Automated Verification of Critical Systems, is an annual meeting that brings together researchers and practitioners to exchange new results on tools and techniques relating to the verification of critical systems. PC Co-Chairs: Alexander Romanovsky, Cliff Jones (Newcastle University)
    keywords: avocs; university; verification
       cache: eceasst-700.pdf
  plain text: eceasst-700.txt

        item: #607 of 858
          id: eceasst-701
      author: Sarshogh, Mohammad Reza; Butler, Michael
       title: Specification and refinement of discrete timing properties in Event-B
        date: 2012-03-01
       words: 7028
      flesch: 67
     summary: This behavior of urgent event is the same as deadline events when current time is equal to the deadline and none of the deadline events have occurred yet. [Alu99] verifiers use, like guarding state transitions (system events) or forcing timing properties to the global clock of the model.
    keywords: = t; deadline; event; t ru; time; timing
       cache: eceasst-701.pdf
  plain text: eceasst-701.txt

        item: #608 of 858
          id: eceasst-702
      author: Zellag, Kamal; Vangheluwe, Hans
       title: Modelling- and Simulation-Based Design of Multi-tier Systems
        date: 2012-03-20
       words: 4540
      flesch: 61
     summary: Proceedings of the 4th International Workshop on Multi-Paradigm Modeling (MPM 2010) Modelling- and Simulation-Based Design of Multi-tier Systems Kamal Zellag and Hans Vangheluwe 14 pages Guest Editors: Vasco Amaral, Hans Vangheluwe, Cécile Hardebolle, Lazlo Lengyel Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Modelling- and Simulation-Based Design of Multi-tier Systems 1Kamal Zellag and 1 2Hans Vangheluwe 1McGill University, Montréal, Canada 2University of Antwerp, Belgium Abstract: This paper introduces a domain-specific language for modelling and simulation- based design of multi-tier systems. Multi-tier systems are complex and very few general models have been developed.
    keywords: application; figure; model; multi; petri; qpn; server; simulation; systems; tier
       cache: eceasst-702.pdf
  plain text: eceasst-702.txt

        item: #609 of 858
          id: eceasst-703
      author: Bender, Marc; Maibaum, Tom; Lawford, Mark; Wassyng, Alan
       title: Positioning Verfification in the Context of Software/System Certification
        date: 2012-03-21
       words: 7619
      flesch: 44
     summary: Keywords: Software certification, System certification, Formal specification, Veri- fication, Critical systems, Safety, Assurance cases, Safety cases 1 Introduction “Beware of bugs in the above code; I have only proved it correct, not tried it.” – Donald Knuth Formal (mathematical) verification has been an important and dominating focus in Computer Science and Software Engineering since the days of Turing [Tur49]. Before we present our position on what software certification should be, let us look at what software comprises.
    keywords: assurance; certification; confidence; context; engineering; evidence; framework; proof; safety; shao; software; system
       cache: eceasst-703.pdf
  plain text: eceasst-703.txt

        item: #610 of 858
          id: eceasst-704
      author: Hebig, Regina; Seibel, Andreas; Giese, Holger
       title: On the Unification of Megamodels
        date: 2012-05-11
       words: 6031
      flesch: 52
     summary: A high-level traceability model shows thereby relations between models whereas a low-level traceability model shows relations between element of different models. However, conceptually a UML model may contain different models, e.g, class diagrams, sequence diagrams, etc.
    keywords: approaches; bézivin; definition; favre; megamodel; model; relations; seibel; system
       cache: eceasst-704.pdf
  plain text: eceasst-704.txt

        item: #611 of 858
          id: eceasst-706
      author: Lambers, Leen; Hildebrandt, Stephan; Giese, Holger; Orejas, Fernando
       title: Attribute Handling for Bidirectional Model Transformations: The Triple Graph Grammar Case
        date: 2012-07-12
       words: 8297
      flesch: 54
     summary: Consequently, the way we propose attribute handling for TGGs in this 6 For simplicity, we say attribute formula, instead of attribute formulas, since a set of formulas can be joined to one formula using the conjunction operator. Section 3 then introduces attribute formulas for TGG rules using the symbolic graph transformation approach.
    keywords: + +; attribute; computation; elements; formula; graph; model; relational; rule; tgg; transformation
       cache: eceasst-706.pdf
  plain text: eceasst-706.txt

        item: #612 of 858
          id: eceasst-707
      author: Anjorin, Anthony; Varró, Gergely; Schürr, Andy
       title: Complex Attribute Manipulation in TGGs with Constraint-Based Programming Techniques
        date: 2012-07-12
       words: 7714
      flesch: 56
     summary: The language L (TGG) is the set of all triple graphs that can be derived from G /0, the empty triple graph, by applying a finite sequence of triple graph rules in P. Example: Figure 3 depicts the triple graph rule CardToEntry for our example4. Although TGGs provide adequate support for structural aspects via object patterns in TGG rules, support for handling complex relationships between different attributes is still missing in current imple- mentations.
    keywords: algebra; approach; attribute; box; complex; constraints; graph; manipulation; model; proc; rules; source; tgg; tggs; transformation; triple
       cache: eceasst-707.pdf
  plain text: eceasst-707.txt

        item: #613 of 858
          id: eceasst-708
      author: Zaytsev, Vadim
       title: Language Evolution, Metasyntactically
        date: 2012-07-12
       words: 7666
      flesch: 41
     summary: We have generalised the transformers and generators from prior work to mutations of gram- mars, which are conceptually deeply different from grammar transformations. However, XBGF is not completely bidirectional by design, so we defined a language for bidirectional grammar transformation on top of it, and called it ΞBGF2.
    keywords: adaptation; changes; convergence; evolution; grammar; language; lämmel; metasymbol; mutation; need; notation; paper; specification; transformation; xbgf; ξbgf
       cache: eceasst-708.pdf
  plain text: eceasst-708.txt

        item: #614 of 858
          id: eceasst-71
      author: Bisztray, Dánes; Heckel, Reiko
       title: Rule-Level Verification of Business Process Transformations using CSP
        date: 2007-06-22
       words: 4134
      flesch: 57
     summary: To define process transformations, we formalise the abstract syntax of activity diagrams in terms of typed graphs, where a type graph T G plays the role of a metamodel for the language and instance graphs G typed over T G represent individual diagrams. We can indeed observe that, after hiding the processJoin action, the traces of PROCL are included in those of PROCR, and from general results about CSP trace refinement [Hoa85] it follows that this relation is closed under the embedding of CSP processes into context.
    keywords: business; csp; figure; graph; mapping; process; processes; rule; transformation
       cache: eceasst-71.pdf
  plain text: eceasst-71.txt

        item: #615 of 858
          id: eceasst-710
      author: Barroca, Bruno Fontes; Amaral, Vasco Moreira
       title: Asserting the Correctness of Software Language Translations
        date: 2012-07-12
       words: 5262
      flesch: 49
     summary: Finally, we discuss about the validity of our assertions in w.r.t. language translations in general. In Section 5, we discuss the results of the experiment, and we elaborate on how this approach can be used to assert the correctness about language translations in general.
    keywords: correctness; language; machine; model; petri; semantics; sentence; source; state; translation
       cache: eceasst-710.pdf
  plain text: eceasst-710.txt

        item: #616 of 858
          id: eceasst-711
      author: Denil, Joachim; Cicchetti, Antonio; Biehl, Matthias; De Meulenaere, Paul; Eramo, Romina; Demeyer, Serge; Vangheluwe, Hans
       title: Automatic Deployment Space Exploration Using Refinement Transformations
        date: 2012-07-12
       words: 5249
      flesch: 51
     summary: This paper investigates the use of model transformation during the design process, with the goal of (semi-)automatic deployment space exploration. In addition to the above performance analysis methods and deployment space exploration tech- niques there are some other automatic methods for local optimization.
    keywords: abstraction; autosar; deployment; design; exploration; model; platform; simulation; software; space; systems; time; transformation; window
       cache: eceasst-711.pdf
  plain text: eceasst-711.txt

        item: #617 of 858
          id: eceasst-713
      author: Pacheco, Hugo; Cunha, Alcino; Hu, Zhenjiang
       title: Delta Lenses over Inductive Types
        date: 2012-07-12
       words: 9654
      flesch: 64
     summary: [DXC11] formulated an abstract delta lens framework that encompasses an explicit alignment operation (that computes view deltas), and where put is an update-based transformation that propagates view deltas into source deltas. In this paper, we formalize delta lenses over inductive types using dependent type theory and develop a point-free delta lens language with an explicit separation of shape and data.
    keywords: alignment; data; delta; elements; lens; lenses; list; shape; source; tree; type; view
       cache: eceasst-713.pdf
  plain text: eceasst-713.txt

        item: #618 of 858
          id: eceasst-714
      author: Stevens, Perdita
       title: Observations relating to the equivalences induced on model sets by bidirectional transformations
        date: 2012-07-12
       words: 7952
      flesch: 66
     summary: Definition 7 M is full with respect to bidirectional transformation R if for any m1, m2 ∈ M there exists m Using them we give the implication relationships between various properties of bidirectional transformations.
    keywords: model
       cache: eceasst-714.pdf
  plain text: eceasst-714.txt

        item: #619 of 858
          id: eceasst-715
      author: Fish, Andrew; Lambers, Leen
       title: Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques
        date: 2012-07-12
       words: 1067
      flesch: 28
     summary: Preface Electronic Communications of the EASST Volume 47 (2012) Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GTVMT 2012) Preface Andrew Fish, Leen Lambers III pages Guest Editors: Andrew Fish, Leen Lambers Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Preface Andrew Fish1, Leen Lambers2 1 University of Brighton, UK 2 Hasso Plattner Institute, University of Potsdam, Germany This volume contains the post-proceedings of the International Workshop on Graph Transfor- mation and Visual Modeling Techniques (GT-VMT ’12), held in Tallinn, Estonia on 24th-25th March 2012, as part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2012). Andrew Fish and Leen Lambers June 2012 Program Chairs Andrew Fish, University of Brighton (UK)
    keywords: germany; graph; model; modeling; university; workshop
       cache: eceasst-715.pdf
  plain text: eceasst-715.txt

        item: #620 of 858
          id: eceasst-716
      author: Natschläger, Christine; Schewe, Klaus-Dieter
       title: A Flattening Approach for Attributed Type Graphs with Inheritance in Algebraic Graph Transformation
        date: 2012-07-12
       words: 5623
      flesch: 55
     summary: 7 Conclusion In this paper, we presented a flattening approach for attributed type graphs with inheritance. The type graph of DeonticBpmnGTS comprises five abstract node types (Node, Gateway, DeonticTask, BpmnTask, and Event), several concrete node types (e.g., O(Task) (obligatory task), P(Task) (permissible task), X(Task) (alternative task), ...), and inheritance relationships defined Proc. GTVMT 2012 2 / 14 ECEASST between them.
    keywords: abstract; flattening; graph; inheritance; nac; node; transformation; type
       cache: eceasst-716.pdf
  plain text: eceasst-716.txt

        item: #621 of 858
          id: eceasst-717
      author: Han, Fenglin; Herrmann, Peter
       title: Remedy of Mixed Initiative Conflicts in Model-based System Engineering
        date: 2012-07-12
       words: 6846
      flesch: 59
     summary: Since M1 and M3 show communication from component 1 to component 2 and M2 the other way around, one can see that the states 3 and 11 of the state graph refer to mixed initiative states according to the definition of Floch. We exemplify the approach by envisaging the detection and rem- edy of mixed initiatives, a quite common cause for faulty behavior in event-driven systems that often is overlooked in system development.
    keywords: activity; arctis; block; button; edges; graph; initiative; mixed; model; pin; state; system; transformation
       cache: eceasst-717.pdf
  plain text: eceasst-717.txt

        item: #622 of 858
          id: eceasst-718
      author: Arifulina, Svetlana; Soltenborn, Christian; Engels, Gregor
       title: Coverage Criteria for Testing DMM Specifications
        date: 2012-07-12
       words: 7076
      flesch: 57
     summary: Having chosen rules as coverage item, the first family of coverage criteria, called rule coverage criteria, is explained in this section. However, rule coverage criteria would require testing only one path from these to cover the necessary node.
    keywords: coverage; criteria; dmm; graph; invocation; model; quality; rule; specification; test; testing
       cache: eceasst-718.pdf
  plain text: eceasst-718.txt

        item: #623 of 858
          id: eceasst-719
      author: Gabriel, Karsten; Lingnau, Pascal; Ermel, Claudia
       title: Algebraic Approach to Timed Petri Nets
        date: 2012-07-12
       words: 6783
      flesch: 71
     summary: Given a timed P/T state (T N,M0,τ0) with timed P/T net T N = (P,T, pre, post), marking M0 of TN, global clock value τ0, and ti ∈ T enabled under (Si,τi) for i ∈{0,...,n−1} and Si ≤ Mi. A timed P/T system or TPT system is a tuple (T N,M) with timed P/T net TN and a marking M of TN which is an element M ∈ (P×R)⊕. 3.
    keywords: algebraic; approach; clock; figure; firing; nets; petri; t nets; time; transition
       cache: eceasst-719.pdf
  plain text: eceasst-719.txt

        item: #624 of 858
          id: eceasst-72
      author: Balasubramanian, Daniel; Narayanan, Anantha; Neema, Sandeep; Shi, Feng; Thibodeaux, Ryan; Karsai, Gabor
       title: A Subgraph Operator for Graph Transformation Languages
        date: 2007-06-22
       words: 5077
      flesch: 58
     summary: 2 Background The GReAT toolkit is an integrated environment for the specification and execution of model transformations using graph transformation rules. 7 Summary and Future Work We have introduced a technique for specifying arbitrary subgraphs in graph transformation rules that allows the handling of such subgraphs as a unit to be moved, copied, and deleted.
    keywords: elements; graph; group; matches; pattern; rule; subgroups; transformation
       cache: eceasst-72.pdf
  plain text: eceasst-72.txt

        item: #625 of 858
          id: eceasst-721
      author: de Lara, Juan; Guerra, Esther
       title: Inter-Modelling with Graphical Constraints: Foundations and Applications
        date: 2012-07-12
       words: 8218
      flesch: 58
     summary: The second one uses PAMOMO as a means to specify contracts for model transformations, and their application for automated testing. In addition to model transformations, another interesting inter-modelling activity is to estab- lish traceability between models [PDK+11, WP10].
    keywords: class; figure; graph; inter; model; modelling; pattern; specification; transformation
       cache: eceasst-721.pdf
  plain text: eceasst-721.txt

        item: #626 of 858
          id: eceasst-722
      author: Wimmer, Manuel; Kusel, Angelika; Retschitzegger, Werner; Schönböck, Johannes; Schwinger, Wieland; Sánchez Cuadrado, Jesús; Guerra, Esther; de Lara, Juan
       title: Reusing Model Transformations across Heterogeneous Metamodels
        date: 2012-07-12
       words: 6476
      flesch: 44
     summary: f t t l l t th 1 Adapt the generic model  transformation by (1) rewriting class 2 Concept MM Binding  Adapter  Templates features to calculate the heterogeneity model transformation by (1) rewriting class names and (2) adding adapters Specific ModelSpecific Model Templates Hetero‐ Specific Model  Transformation Heterogeneity  Specific Source MM geneity Model Transformation g y Reasoning AdaptationGeneric Model  Transformation Figure 5: Overview of Reasoning Process Listing 1: Exemplary ATL Rule of Generic Model Transformation 1 -- Extract of generic transformation 2 r u l e Package2ERModel { 3 from s: UML!Package 4 t o t: ER!ERModel ( entities <- s.ownedClasses ) 5 } Listing 2: Exemplary ATL Rule of Specific Model Transformation 1 -- Extract of specific transformation -> [CGL11, LG10]), where – inspired from generic programming – we proposed generic model transformations.
    keywords: binding; concept; difference; fig; generic; heterogeneities; mms; model; source; specific; transformation
       cache: eceasst-722.pdf
  plain text: eceasst-722.txt

        item: #627 of 858
          id: eceasst-723
      author: Ghamarian, Amir Hossein; Rensink, Arend
       title: Graph Passing in Graph Transformation
        date: 2012-07-12
       words: 6751
      flesch: 64
     summary: 5 Conclusion We have defined a notion of composition for graphs and graph transformation rules which allows passing subgraphs between components. This is a paradigm in which graph transformation rules (more specifically, hyperedge replacement rules) can be synchronised based one the adjacency of their occurrences within a graph; see [HM01, FHL+06].
    keywords: composition; graph; idle; ready; rule; system; transformation
       cache: eceasst-723.pdf
  plain text: eceasst-723.txt

        item: #628 of 858
          id: eceasst-724
      author: Anjorin, Anthony; Oster, Sebastian; Zoric, Ivan; Schürr, Andy
       title: Optimizing Model-Based Software Product Line Testing with Graph Transformations
        date: 2012-07-12
       words: 6186
      flesch: 50
     summary: [F+00] operates on typed graphs (models) in abstract syntax, we need to represent feature models as graphs typed according to a type graph (metamodel). [ALPS11] and Fig. 2 depicts our metamodel for feature models which is of course neither unique nor optimal, but has proven to be suitable for our needs.
    keywords: constraints; csp; feature; graph; locking; model; optimization; product; require; software; system; testing; transformation
       cache: eceasst-724.pdf
  plain text: eceasst-724.txt

        item: #629 of 858
          id: eceasst-725
      author: Heußner, Alexander
       title: Model Checking Communicating Processes: Run Graphs, Graph Grammars, and MSO
        date: 2012-07-12
       words: 7612
      flesch: 69
     summary: This allows to directly derive positive decidability results for MSO model checking (seen as partial order logic on run graphs) based on a context-freeness argument for restricted classes run graphs. Next, we recall some notions on MSO interpreted on graphs, and hyperedge replacement gram- mars, before introducing run graphs.
    keywords: bounded; cps; finite; graphs; mso; order; proc; processes; rcps; run; set
       cache: eceasst-725.pdf
  plain text: eceasst-725.txt

        item: #630 of 858
          id: eceasst-726
      author: Gibbons, Jeremy; Johnson, Michael
       title: Relating Algebraic and Coalgebraic Descriptions of Lenses
        date: 2012-07-12
       words: 6983
      flesch: 61
     summary: The diagram below illustrates the situation: 9 / 16 Volume 49 (2012) Relating Algebraic and Coalgebraic Descriptions of Lenses V ⇒ (V ⇒ S) V ⇒ S V⇒`xx Sp oo p // V ⇒ S η && V ⇒ DS V⇒π0 11 V⇒π1 ++ V ⇒ DS V⇒π0 mm V⇒π1ss V ⇒ V The π0 projections in the square have been promoted towards the upper left, using π0 ·D` ·` = (V ⇒)`·p and π0 ·δ ·` = η ·p. S → (V ⇒ V) -- put–get (V ⇒)p·p = const0 ·p : S → (V ⇒ (V ⇒ S)) -- put–put It turns out that these laws precisely coincide with the statement that ` : S → DS is a coalgebra for the comonad D. To justify this claim, we show that ` makes the diagrams in Section 3.1 for counit and coassociativity of a coalgebra commute iff it is a very well-behaved lens.
    keywords: arrow; category; law; lenses; view
       cache: eceasst-726.pdf
  plain text: eceasst-726.txt

        item: #631 of 858
          id: eceasst-727
      author: Taentzer, Gabriele
       title: Instance Generation from Type Graphs with Arbitrary Multiplicities
        date: 2012-07-12
       words: 6237
      flesch: 64
     summary: The main ingredients of graph grammars are graph rules which will be defined in Def. 8. In this paper, we formalize a restricted form of meta-models by type graphs with multiplicities and introduce instance-generating graph grammars for creating instance graphs representing the abstract syntax structures of models.
    keywords: generation; grammar; graph; instance; meta; model; multiplicities; rules; type
       cache: eceasst-727.pdf
  plain text: eceasst-727.txt

        item: #632 of 858
          id: eceasst-728
      author: Khan, Tamim Ahmed; Runge, Olga; Heckel, Reiko
       title: Visual Contracts as Test Oracle in AGG 2.0
        date: 2012-07-12
       words: 5197
      flesch: 58
     summary: While comparing model and implementation responses, such a case should not be reported as a failed test, but as a warning, providing sufficient details so that the developer can decide the correct interpretation. The paper discusses the basic idea, illustrates it by an example, describes the chal- lenges and solutions of its implementation and draws conclusions for the use of graph transformation and AGG in test oracles.
    keywords: = =; agg; cases; contracts; failure; implementation; model; oracle; rule; test
       cache: eceasst-728.pdf
  plain text: eceasst-728.txt

        item: #633 of 858
          id: eceasst-729
      author: Johnson, Michael; Rosebrugh, Robert
       title: Lens put-put laws: monotonic and mixed
        date: 2012-07-12
       words: 6241
      flesch: 66
     summary: In other words, in a very well-behaved lens iterated puts can be achieved by simply putting the last view state. Of course, however detailed the state space of views, if we do not know what transition was used to move from one view to another we cannot use the transition as a component of the domain of put.
    keywords: law; laws; lens; monotonic; state
       cache: eceasst-729.pdf
  plain text: eceasst-729.txt

        item: #634 of 858
          id: eceasst-73
      author: Zündorf, Albert; Varró, Dániel
       title: Preface
        date: 2007-08-27
       words: 765
      flesch: 32
     summary: Two short contri- butions are invited papers written by developers of popular graph transformation tools. Authors were encouraged to submit tool papers which report on new features of existing tools or completely novel tools having graph-based founda- tions.
    keywords: graph; tools; workshop
       cache: eceasst-73.pdf
  plain text: eceasst-73.txt

        item: #635 of 858
          id: eceasst-731
      author: Boulanger, Frédéric; Dogui, Ayman; Hardebolle, Cécile; Jacquet, Christophe; Marcadet, Dominique; Prodan, Iuliana
       title: Semantic Adaptation using CCSL Clock Constraints
        date: 2012-07-12
       words: 5848
      flesch: 55
     summary: Heterogeneous modeling, or multi-paradigm modeling, is the research domain which aims at handling heterogeneous models. ModHel’X [BHJM11] is an experimental framework developed at Supélec in order to test new ideas about the executable semantics of heterogeneous models.
    keywords: adaptation; ccsl; clock; control; figure; model; semantic; state; tfsm; time
       cache: eceasst-731.pdf
  plain text: eceasst-731.txt

        item: #636 of 858
          id: eceasst-732
      author: Maier, Sonja; Minas, Mark
       title: Layout Improvement in Diagram Editors by Automatic Ad-hoc Layout
        date: 2012-07-12
       words: 6103
      flesch: 57
     summary: Our pattern-based layout approach allows for automatic and user-controlled layout at the same time: The diagram editor may au- tomatically apply layout patterns to diagram parts based on syntactic rules provided by the editor developer, but editor users may also select diagram parts and then ap- ply layout patterns to them. The layout of a diagram is defined by applying layout patterns to selected sub-diagrams.
    keywords: components; diagram; editor; instances; lal; layout; pattern; user
       cache: eceasst-732.pdf
  plain text: eceasst-732.txt

        item: #637 of 858
          id: eceasst-733
      author: Hermann, Frank; Voigtländer, Janis
       title: First International Workshop on Bidirectional Transformations (BX 2012): Preface
        date: 2012-07-12
       words: 1447
      flesch: 36
     summary: In this way, models (in contrast to programs) are the core assets, and model transformations become first-class citizens. Still, most current transformation languages are directed to the implementation of model transformations, and little effort is currently devoted to support other phases of the transformation development, like require- ments specification or testing.
    keywords: database; model; schema; transformations; university
       cache: eceasst-733.pdf
  plain text: eceasst-733.txt

        item: #638 of 858
          id: eceasst-734
      author: Bruggink, H.J. Sander; Hülsbusch, Mathias; König, Barbara
       title: Towards Alternating Automata for Graph Languages
        date: 2012-07-12
       words: 6915
      flesch: 68
     summary: We study some of their closure properties and compare them, with respect to expressiveness, to other methods for describing graph languages. Specifically, we give examples in Subsection 4.2, study their membership problem in Subsection 4.3 and compare their expressive power to other mechanism for describing graph languages in Section 5.
    keywords: alternating; automata; automaton; cospan; graph; languages; state
       cache: eceasst-734.pdf
  plain text: eceasst-734.txt

        item: #639 of 858
          id: eceasst-735
      author: Bottoni, Paolo; Parisi-Presicce, Francesco
       title: Modeling context with graph annotations
        date: 2012-07-31
       words: 5493
      flesch: 59
     summary: The most important construction for adapting domain rules p : L r→ R to (atomic, positive) contextual constraints c : P → C is shown in Figure 10. We use control expressions over identifiers of rules to govern rule application for transactional processes.
    keywords: annotations; application; case; conditions; constraints; content; domain; figure; graph; rule
       cache: eceasst-735.pdf
  plain text: eceasst-735.txt

        item: #640 of 858
          id: eceasst-736
      author: Jalali, Arash; Rensink, Arend; Ghamarian, Amir Hossein
       title: Incremental Pattern Matching for Regular Expressions
        date: 2012-07-31
       words: 5618
      flesch: 67
     summary: To meet these criteria, we introduce an algebra of path matches: m ::= 〈v0〉 | 〈e〉 | inv(m) | dot(m1,m2) | close(m1,m2) Here, v0 ∈ Vertex and e ∈ Edge; the other operators are syntactic constructors that give rise to a tree-like structure of path matches.
    keywords: expression; graph; matches; matching; path; rete
       cache: eceasst-736.pdf
  plain text: eceasst-736.txt

        item: #641 of 858
          id: eceasst-737
      author: Arijo, Niaz; Heckel, Reiko
       title: View-based Modelling and State-Space Generation for Graph Transformation Systems
        date: 2012-07-31
       words: 7022
      flesch: 68
     summary: The functor can be used to define the projection of graph transformation rules and application conditions to a subgraph of their current type graph. After discussing related work below and recalling the basic definitions of typed attributed graph transformation in Sect. 3, Sect. 4 introduces the signatures equipped to derive labelled transition systems from graph transformation systems.
    keywords: approach; composition; graph; projection; rule; systems; transformation; transition; type; view
       cache: eceasst-737.pdf
  plain text: eceasst-737.txt

        item: #642 of 858
          id: eceasst-738
      author: Cicchetti, Antonio; Ciccozzi, Federico; Leveque, Thomas
       title: A hybrid approach for multi-view modeling
        date: 2012-07-31
       words: 5513
      flesch: 44
     summary: Eventually, through a model-to-text transformation, an Eclipse plugin is generated and provides an editor to manipulate view models; it also includes the needed synchronization mechanisms. Moreover, different kinds of models are automatically generated: (i) difference metamodels, to be used for modification representation, (ii) model comparison transformations, to produce the difference models, (iii) in-place model transformations which apply difference models, (iv) model-to-model transformations which convert modifications of one view to corresponding modifications on the original model for synchronization purposes, and (v) Eclipse editor model, needed for automatically generate an Eclipse editor for view models.
    keywords: consistency; creation; difference; eclass; editing; elements; metamodel; model; modeling; set; view
       cache: eceasst-738.pdf
  plain text: eceasst-738.txt

        item: #643 of 858
          id: eceasst-739
      author: Lucio, Levi; Zhang, Qin; Sousa, Vasco; Le Traon, Yves
       title: Verifying Access Control in Statecharts
        date: 2012-09-02
       words: 5235
      flesch: 46
     summary: This pa- per tackles the issue of verifying access control policies in statecharts. The approach is based on the transformation of a statechart into an Algebraic Petri net to enable checking access control policies and identifying potential inconsistencies with an OrBAC set of access control policies.
    keywords: access; access control; apn; control; model; policies; statechart; transformation; transition
       cache: eceasst-739.pdf
  plain text: eceasst-739.txt

        item: #644 of 858
          id: eceasst-74
      author: Amelunxen, Carsten; Rötschke, Tobias
       title: Creating Well-Structured Specifications in MOFLON
        date: 2007-07-02
       words: 4601
      flesch: 53
     summary: FUJABA [Zün01] offers a rather limited mechanism to reduce the complexity of large specifi- cations: The main structuring mechanism consists of diagrams, which are categorized into their different kinds (class-, activity-, package diagrams, etc.). The new con- cept of package merge allows to reuse and refine existing models without modifying the original.
    keywords: association; code; fig; fujaba; graph; import; model; moflon; package; specifications; transformation
       cache: eceasst-74.pdf
  plain text: eceasst-74.txt

        item: #645 of 858
          id: eceasst-740
      author: Amaral, Vasco; Hardebolle, Cécile; Vangheluwe, Hans; Lengyel, László; Bunus, Peter
       title: Recent Advances in Multi-Paradigm Modeling
        date: 2012-09-02
       words: 4519
      flesch: 47
     summary: The first presentation session of this workshop has gathered approaches in the category of model composition. Another kind of situation where model composition is necessary is when one needs to rep- resent different and potentially overlapping aspects of one component of the system (or of the system itself).
    keywords: approach; computation; execution; group; languages; meta; model; modeling; mpm; multi; semantics
       cache: eceasst-740.pdf
  plain text: eceasst-740.txt

        item: #646 of 858
          id: eceasst-741
      author: Barisic, Ankica; Amaral, Vasco; Goulao, Miguel; Barroca, Bruno
       title: How to reach a usable DSL? Moving toward a Systematic Evaluation
        date: 2012-09-02
       words: 5487
      flesch: 48
     summary: Section 3 presents usability evaluation in general. Section 4 gives us an overview on how usability evaluation of programming languages is done.
    keywords: context; development; domain; dsl; dsls; evaluation; languages; quality; software; usability; use; user
       cache: eceasst-741.pdf
  plain text: eceasst-741.txt

        item: #647 of 858
          id: eceasst-742
      author: Diallo, Papa Issa
       title: Model-Based Engineering for the support of Models of Computation: The Cometa Approach
        date: 2013-02-11
       words: 4814
      flesch: 48
     summary: Among existing approaches aiming to pro- vide a unified framework for heterogeneous specification, the Ptolemy project [EJL+03] is the first to provide a complete component-based framework for heterogeneous systems design and analysis. Consequently, the heterogeneous appearance of such systems creates a need to manage their growing complexity mainly due to the difficulty to interconnect the different parts compos- ing them.
    keywords: approach; cometa; communication; components; data; level; modeling; models; semantics; system; time
       cache: eceasst-742.pdf
  plain text: eceasst-742.txt

        item: #648 of 858
          id: eceasst-748
      author: Chiorean, Dan Ioan; Ober, Ileana; Petrascu, Vladiela
       title: Avoiding OCL specification pitfalls
        date: 2012-10-02
       words: 5099
      flesch: 44
     summary: Several OCL examples posted on web include hasty specifications, that are often dissuasive with respect to complementing models with OCL specification. Keywords: rigorous modeling, OCL specifications, meaningful specifications, effi- cient specifications, model understanding 1 Introduction OCL is a language whose spread has not confirmed the optimistic expectations expressed since its inclusion as part of UML 1.1, and then as part of all OMG MOF-based modeling languages.
    keywords: case; constraints; context; figure; library; model; ocl; parents; requirements; specification; user
       cache: eceasst-748.pdf
  plain text: eceasst-748.txt

        item: #649 of 858
          id: eceasst-749
      author: Combemale, Benoit; Cregut, Xavier; Dieumegard, Arnaud; Pantel, Marc; Zalila, Faiez
       title: Teaching MDE through the Formal Verification of Process Models
        date: 2012-11-17
       words: 5242
      flesch: 54
     summary: This course relies on model checking1 based on Temporal Petri nets to verify behavioral cor- rectness of development process models. Only its semantics (encoded by the translation from process models to Petri nets) changes as an activity may be suspended that leads to new possible scenarios to ensure the process finishes.
    keywords: concrete; course; mde; metamodel; model; process; students; syntax; verification; work
       cache: eceasst-749.pdf
  plain text: eceasst-749.txt

        item: #650 of 858
          id: eceasst-757
      author: Varró-Gyapay, Szilvia
       title: Optimization in Graph Transformation Systems with Time Using Petri Net Based Techniques
        date: 2012-11-21
       words: 6355
      flesch: 63
     summary: The P/T net construction ensures that whenever a GT rule is applied in time instance l, the corresponding transition in the P/T net can be also fired in time instance l. Let token[i][l] denote the number of tokens at place pi in time instance l, and let σ[ j][l] denote the number of transitions t j that start to fire concurrently in time instance l.
    keywords: graph; graph transformation; instance; net; rule; sequence; test; time; transformation; transition
       cache: eceasst-757.pdf
  plain text: eceasst-757.txt

        item: #651 of 858
          id: eceasst-758
      author: Maximova, Maria; Ehrig, Hartmut; Ermel, Claudia
       title: Transfer of Local Confluence and Termination between Petri Net and Graph Transformation Systems Based on M-Functors
        date: 2012-11-21
       words: 6078
      flesch: 58
     summary: F (ρ1),F (m1)⇐= F (G) F (ρ2),F (m2) =⇒ F (H2). 2. (Creation): Assume local confluence of F (H1) F (ρ1),F (m1)⇐= F (G) F (ρ2),F (m2) =⇒ F (H2) in AS2.
    keywords: confluence; graph; net; petri; place; systems; token; transformation
       cache: eceasst-758.pdf
  plain text: eceasst-758.txt

        item: #652 of 858
          id: eceasst-759
      author: Kuzniarz, Ludwik; Börstler, Jürgen
       title: Teaching Modeling - An Initial Classification of Related Issues
        date: 2012-10-27
       words: 3532
      flesch: 46
     summary: This suggest that teaching modeling should be done as an independent course prior to other courses and be a sort of a prerequisite for all other courses. A general problem of teaching models and modeling is the lack of a commonly accepted def- inition of model quality.
    keywords: classification; development; education; issues; modeling; models; perspective; software; teaching
       cache: eceasst-759.pdf
  plain text: eceasst-759.txt

        item: #653 of 858
          id: eceasst-76
      author: Jucknath-John, Susanne; Graf, Dennis; Taentzer, Gabriele
       title: Evolutionary Layout of Graph Transformation Sequences
        date: 2007-07-02
       words: 5123
      flesch: 61
     summary: Keywords: graphs, graph layout, graph transformation 1 Introduction The motivation for this work arose in two different areas. The offline graph drawing problem has been solved for complete sequences of graphs by foresighted graph layout [14].
    keywords: agg; algorithm; graph; layout; node; requirements; sequences; transformation
       cache: eceasst-76.pdf
  plain text: eceasst-76.txt

        item: #654 of 858
          id: eceasst-760
      author: Winter, Andreas; Brandsteidl, Marion
       title: EduSymp 2011 - Preface
        date: 2012-10-27
       words: 736
      flesch: 25
     summary: The list of the International Program Committee is shown below: • Colin Atkinson, University of Mannheim, Germany • Jordi Cabot, University of Nantes, France • Peter J. Clarke, Florida International University, USA • Ira Diethelm, Carl von Ossietzky University, Germany • Jean-Marie Favre, OneTree Technologies, Luxembourg • Robert France, Colorado State University, USA • Michael Godfrey, University of Waterloo, Canada • Martin Gogolla, University of Bremen, Germany • Øhystein Haugen, SINTEF, Norway • Gerti Kappel, Vienna University of Technology, Austria • Ludwik Kuzniarz, Blekinge Institute of Technology, Sweden • Jochen Ludewig, University of Stuttgart, Germany • Karl Reed, La Trobe University, Australia • Jean-Paul Rigault, University of Nice, France • Patricia Roberts, University of Brighton, UK Proc. Traditionally collocated with the ACM/IEEE International Conference on Model-Driven Engineering Languages and Systems (MODELS), it offers the op- portunity for teachers from both academia and industry to present and discuss new ideas and challenges concerning software modeling education.
    keywords: educators; modeling; software; university
       cache: eceasst-760.pdf
  plain text: eceasst-760.txt

        item: #655 of 858
          id: eceasst-762
      author: Gabriel, Karsten
       title: Process Evolution based on Transformation of Algebraic High-Level Nets with Applications to Communication Platforms
        date: 2012-11-21
       words: 6736
      flesch: 62
     summary: In the following definition of AHL-process nets, in contrast to occurrence nets, we omit the requirement that the causal relation has to be finitary, because this is not a meaningful requirement for our application domain. In this case, mp′ is called process evolution of mp based on action evolution AN ρ,m =⇒ AN′ with pattern ρ∗. Construction and proof sketch.
    keywords: action; ahl; communication; evolution; level; nets; platform; process; processes; transformation; user; wave
       cache: eceasst-762.pdf
  plain text: eceasst-762.txt

        item: #656 of 858
          id: eceasst-763
      author: Sien, Ven Yu; Chong, David Weng Kwai
       title: Threshold Concepts in Object-Oriented Modelling
        date: 2012-11-17
       words: 4634
      flesch: 50
     summary: However students in higher education generally experience considerable difficulty in understanding OO concepts and acquiring the necessary skills in object-oriented analysis and design. Despite claims made by advocates of the OO approach [ADS+00], [SBG06] novices in OO techniques in general have difficulties understanding OO concepts.
    keywords: class; concepts; diagrams; modelling; objects; proc; students; threshold
       cache: eceasst-763.pdf
  plain text: eceasst-763.txt

        item: #657 of 858
          id: eceasst-764
      author: France, Robert
       title: Teaching Programming Students how to Model: Challenges & Opportunities
        date: 2012-11-17
       words: 1039
      flesch: 38
     summary: In this talk I discuss some of the factors that contribute to this situation and propose a learning process in which the abstraction gap between models and implementations is gradually widened as student modeling skills are developed Keywords: model-driven development, modeling-in-the-small, modeling-in-the- large, teaching software modeling concepts 1 Overview of Talk The focus on programming abstractions in early programming courses may be a contributing factor to the difficulty some programming students have with mastering software modeling con- cepts. Formal empirical studies that test this and other similar hypotheses are needed if we are to effectively develop student modeling skills.
    keywords: modeling; programming; students
       cache: eceasst-764.pdf
  plain text: eceasst-764.txt

        item: #658 of 858
          id: eceasst-766
      author: Merz, Stephan; Vanzetto, Hernán
       title: Harnessing SMT Solvers for TLA+ Proofs
        date: 2012-11-17
       words: 6966
      flesch: 64
     summary: We recently developed a backend that relies on a typing discipline to encode (untyped) TLA+ formulas into multi-sorted first-order logic for SMT solvers. For example, Sledgehammer [BBP11] makes different automatic theorem provers, including SMT solvers, usable from the higher-order logic of Isabelle/HOL. Déharbe et al.
    keywords: arithmetic; encoding; expressions; operators; proof; set; smt; solvers; tla+
       cache: eceasst-766.pdf
  plain text: eceasst-766.txt

        item: #659 of 858
          id: eceasst-767
      author: Krause, Christian; Westfechtel, Bernhard
       title: 7th International Workshop on Graph Based Tools (GraBaTs 2012): Preface
        date: 2012-11-21
       words: 802
      flesch: 41
     summary: Most of the accepted papers deal with different aspects of model transformations such as graph pattern matching, code generation, domain-specific model transformations, and triple graph grammars. EMorF – A tool for model transformations Lilija Klassen and Robert Wagner 1 / 3 Volume 54 (2012) GraBaTs 2012 • ReConNet – A Tool for Modeling and Simulating with Reconfigurable Place/Transition Nets Marvin Ede, Kathrin Hoffmann, Gerhard Oelker, Julia Padberg • Rooted Graph Programs Christopher Bak and Detlef Plump
    keywords: 2012; grabats; graph; tools; workshop
       cache: eceasst-767.pdf
  plain text: eceasst-767.txt

        item: #660 of 858
          id: eceasst-768
      author: Klassen, Lilija; Wagner, Robert
       title: EMorF - A tool for model transformations
        date: 2012-11-21
       words: 2457
      flesch: 49
     summary: EMorF - A tool for model transformations Electronic Communications of the EASST Volume 54 (2012) Proceedings of the 7th International Workshop on Graph Based Tools (GraBaTs 2012) EMorF - A tool for model transformations Lilija Klassen and Robert Wagner 6 pages Guest Editors: Christian Krause, Bernhard Westfechtel Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST EMorF - A tool for model transformations Lilija Klassen1 and Robert Wagner2 1 klassen@solunar.de, 2 wagner@solunar.de, http://www.solunar.de/ Solunar GmbH, Germany Abstract: In this paper, we focus on the provided tool support for the development and execution of model transformations.
    keywords: emorf; graph; model; rule; tool; transformation
       cache: eceasst-768.pdf
  plain text: eceasst-768.txt

        item: #661 of 858
          id: eceasst-769
      author: Winetzhammer, Sabine
       title: ModGraph - Generating Executable EMF Models
        date: 2012-11-21
       words: 4133
      flesch: 57
     summary: Hence the modeler may use graph transformations whenever they are helpful to describe complex operations on EMF model instances in a declarative and graphical way. For efficient execution of operations on model instances code generators play an important role.
    keywords: code; emf; event; figure; model; modgraph; nodes; object; rule
       cache: eceasst-769.pdf
  plain text: eceasst-769.txt

        item: #662 of 858
          id: eceasst-77
      author: Rensink, Arend
       title: Isomorphism Checking in GROOVE
        date: 2007-09-07
       words: 4842
      flesch: 64
     summary: The downside of this idea, obviously, is that graph isomorphism is a hard problem, believed not to be polynomial (see, e.g., [14]). [9], but this is due to our own background; in terms of the literature on graph isomorphism, what we are about to define corresponds to the notion of an equitable partition (see McKay [6]).
    keywords: certificate; checking; graph; groove; int; isomorphism
       cache: eceasst-77.pdf
  plain text: eceasst-77.txt

        item: #663 of 858
          id: eceasst-770
      author: Hildebrandt, Stephan; Lambers, Leen; Becker, Basil; Giese, Holger
       title: Integration of Triple Graph Grammars and Constraints
        date: 2012-11-21
       words: 6329
      flesch: 58
     summary: We have implemented a framework based on TGGs for model transformation and synchro- nization, as well as for conformance testing of TGG model transformations. In this paper, we describe how the integration with source and target constraints can be achieved for the special case of model transformations defined by Triple Graph Grammars (TGGs).
    keywords: + +; constraints; figure; graph; invariant; model; source; target; tgg; transformation; valid
       cache: eceasst-770.pdf
  plain text: eceasst-770.txt

        item: #664 of 858
          id: eceasst-771
      author: Ermel, Claudia; Hermann, Frank; Gall, Jürgen; Binanzer, Daniel
       title: Visual Modeling and Analysis of EMF Model Transformations Based on Triple Graph Grammars
        date: 2012-12-06
       words: 4942
      flesch: 59
     summary: Internally, triple graph rules are represented as HENSHIN rules and can be simulated using the HENSHIN EMF model transforma- tion engine. (LS trS �� L LC sLoo trC �� tL // LT ) trT �� (RSR tr �� RCsR oo tR // RT ) L m �� tr // R n��(PO) G t // H Figure 4: Triple rule (left) and triple transformation step (right)
    keywords: emf; forward; graph; model; rules; source; transformation; translation; triple
       cache: eceasst-771.pdf
  plain text: eceasst-771.txt

        item: #665 of 858
          id: eceasst-772
      author: Wieber, Martin; Schürr, Andy
       title: Gray Box Coverage Criteria for Testing Graph Pattern Matching
        date: 2012-11-22
       words: 6102
      flesch: 61
     summary: test bottom, pos. top) Figure 4: Test models for different coverage criteria Comparison with Code Coverage Deriving imperative code from a MT specification gener- ally enables us to compare our coverage concept to well-accepted code coverage approaches. (4) 4.1 PMC0 We now define the simplest of our coverage criteria, called PMC0, whereby PMC stands for pattern matching coverage.
    keywords: box; code; coverage; graph; match; matching; model; pattern; testing; transformation; variables
       cache: eceasst-772.pdf
  plain text: eceasst-772.txt

        item: #666 of 858
          id: eceasst-773
      author: Dijk, Tom van; Laarman, Alfons; Pol, Jaco van de
       title: Multi-core and/or Symbolic Model Checking
        date: 2012-11-22
       words: 3466
      flesch: 62
     summary: Keywords: multi-core model checking, symbolic model checking, scalability, hash- table, Binary Decision Diagrams, parallel algorithms 1 Introduction 5 Sylvan: Multi-core BDDs for Parallel Symbolic Model Checking Recently, we built a multi-core BDD package, called Sylvan [vD12, DLP12].
    keywords: checking; core; hash; model; multi; reachability; state; table; van
       cache: eceasst-773.pdf
  plain text: eceasst-773.txt

        item: #667 of 858
          id: eceasst-774
      author: Padberg, Julia; Ede, Marvin; Oelker, Gerhard; Hoffmann, Kathrin
       title: ReConNet: A Tool for Modeling and Simulating with Reconfigurable Place/Transition Nets
        date: 2012-11-22
       words: 5142
      flesch: 68
     summary: Proc. GraBaTs 2012 4 / 11 ECEASST A reconfigurable place/transition net RN = ((N,M),R) is given by • a decorated place/transition net N = (P,T, pre, post, pname,tname,cap,tlb,rnw) and its marking M and • a set of rules R, where rules rule are given in the cospan approach rule = (L,ML)→ (K,MK)← (R,MR). In contrast to our approach they are high-level nets with two types of token: object nets (place/transition nets) and net transformation rules (a dedicated type of graph transformation rules).
    keywords: approach; cospan; nets; place; reconfigurable; rule; transformation; transition
       cache: eceasst-774.pdf
  plain text: eceasst-774.txt

        item: #668 of 858
          id: eceasst-776
      author: Koenig, Barbara
       title: Conditions in Reactive Systems and in Graph Rewriting
        date: 2012-11-21
       words: 428
      flesch: 45
     summary: They provide a general cat- egorical setting for modelling abstract rewriting: graph transformation systems, process calculi and also Petri nets can be seen as special cases of reactive systems. Keywords: reactive systems, graph rewriting, application conditions Reactive Systems were introduced by Leifer and Milner
    keywords: graph; systems
       cache: eceasst-776.pdf
  plain text: eceasst-776.txt

        item: #669 of 858
          id: eceasst-778
      author: Gottmann, Susann; Nachtigall, Nico; Hoffmann, Kathrin
       title: On Modelling Communication in Ubiquitous Computing Systems using Algebraic Higher Order Nets
        date: 2012-11-21
       words: 6366
      flesch: 54
     summary: Synchronous Communication: The main characteristic of synchronous communication is the simultaneous sending and receiving of a message (c.f. Sec. 2), which is fulfiled by our model, and satisfies requirement (4) (c.f. Sec. 1). Our approach for modelling communication is contained in the model of the system behaviour of the Living Place case study as developed in [GN12].
    keywords: ahli; ahoi; communication; data; devices; level; modelling; nets; rule; system; tokens; transformation
       cache: eceasst-778.pdf
  plain text: eceasst-778.txt

        item: #670 of 858
          id: eceasst-779
      author: Padberg, Julia; Hoffmann, Kathrin
       title: Preface
        date: 2012-11-21
       words: 694
      flesch: 35
     summary: It serves as a forum for all researchers and practi- tioners interested in an exchange of ideas, notions, techniques between the fields of Petri nets, graph transformation and other specification formalisms of concurrent and distributed systems. The traditional topic – the mutual influence of Petri nets and graph transformations – remains in the workshop’s focus.
    keywords: graph; systems; transformation
       cache: eceasst-779.pdf
  plain text: eceasst-779.txt

        item: #671 of 858
          id: eceasst-78
      author: Köllmann, Carsten; Goedicke, Michael
       title: Automation of Java Code Analysis for Programming Exercises
        date: 2007-07-02
       words: 4661
      flesch: 62
     summary: [EEKR99] based Java code analysis tool for the automatic check of Java applications for “standard errors” specific to a given exercise, so the manual correction later on can focus on more individual problems. d e Figure 2: Workflow implemented on server back-end • Java2ggx: Our tool transforms Java source code into a graph structure and stores it in the graph description format ggx used by AGG.
    keywords: check; code; element; graph; java; rules; transformation
       cache: eceasst-78.pdf
  plain text: eceasst-78.txt

        item: #672 of 858
          id: eceasst-780
      author: Plump, Detlef; Bak, Christopher
       title: Rooted Graph Programs
        date: 2012-11-22
       words: 6472
      flesch: 70
     summary: 7 Conclusion We have presented an approach for programming with graph transformation rules in which the bottleneck of graph transformation—the inefficiency of graph matching—is circumvented by using rooted rules which only match in the neighbourhood of host graph roots. Rooted Graph Programs Christopher Bak and Detlef Plump 12 pages Guest Editors: Christian Krause, Bernhard Westfechtel Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Rooted Graph Programs Christopher Bak and Detlef Plump The University of York, UK Abstract: We present an approach for programming with graph transformation rules in which programs can be as efficient as programs in imperative languages.
    keywords: edge; graph; host; list; node; programs; roots; rule; schemata; time
       cache: eceasst-780.pdf
  plain text: eceasst-780.txt

        item: #673 of 858
          id: eceasst-781
      author: Van Mierlo, Simon; Vangheluwe, Hans
       title: Adding Rule-Based Model Transformation to Modelling Languages in MetaEdit+
        date: 2012-11-22
       words: 5416
      flesch: 57
     summary: In our approach, transformation rules are visually created in MetaEdit+. One of the most common and intuitive approaches is to use transformation rules.
    keywords: core; graph; language; lhs; metaedit+; model; modelling; rule; transformation
       cache: eceasst-781.pdf
  plain text: eceasst-781.txt

        item: #674 of 858
          id: eceasst-782
      author: Maraee, Azzam; Balaban, Mira; Strum, Arnon; Ashrov, Adiel
       title: Model Correctness Patterns as an Educational Instrument
        date: 2012-11-22
       words: 4334
      flesch: 49
     summary: In this paper we observe the role of class diagram correctness patterns as an educational instrument for improving class diagram modeling. [BGU10] present a catalog of correctness patterns, that sort out different templates of interac- Proc.
    keywords: catalog; class; correctness; design; figure; model; multiplicity; patterns; problems; quality; specification
       cache: eceasst-782.pdf
  plain text: eceasst-782.txt

        item: #675 of 858
          id: eceasst-783
      author: Hatefi, Hassan; Hermanns, Holger
       title: Model Checking Algorithms for Markov Automata
        date: 2012-12-06
       words: 7947
      flesch: 67
     summary: In an 11 / 15 Volume 53 (2012) Model Checking Algorithms for Markov Automata m-phase, reachability probabilities from Markov states are updated, while an i∗-phase updates reachability probabilities from interactive states. In an i∗-phase, we maximise the reachability probabilities starting from interactive states to Markov states by taking arbitrary many interactive transitions.
    keywords: automata; interval; markov; model; paths; probability; reachability; set; states; step; time
       cache: eceasst-783.pdf
  plain text: eceasst-783.txt

        item: #676 of 858
          id: eceasst-785
      author: Murali, Rajiv; Ireland, Andrew
       title: E-SPARK: Automated Generation of Provably Correct Code from Formally Verified Designs
        date: 2012-12-06
       words: 6035
      flesch: 60
     summary: Without the reuse of invariants, that E-SPARK facilitates, none of partial correctness verifications would succeed. 13 / 15 Volume 53 (2012) E-SPARK: Automated Generation of Provably Correct Code from Formally Verified Designs Event-B Model No. of SPARK Constructs SPARK VCs if-then if-then-else loop PC VCs EF VCs Array Partition 1 1 1 3 13 Array Reversing 1 0 1 3 7 Division Algorithm 0 0 1 The implementation details of E-SPARK are outlined in Section 4 and the results are discussed in Section 5.
    keywords: code; end; event; level; spark; translation
       cache: eceasst-785.pdf
  plain text: eceasst-785.txt

        item: #677 of 858
          id: eceasst-786
      author: Lüttgen, Gerald; Merz, Stephan
       title: Preface
        date: 2012-12-06
       words: 677
      flesch: 26
     summary: Masaryk University Brno, CZ Ferenc Bujtor University of Augsburg, D Gianfranco Ciardo University of California, Riverside, US Marielle Doche-Petit Systerel, Aix-en-Provence, F Jori Dubrovin Aalto University, FI Christian Eisentraut Saarland University, D Arnd Hartmanns Saarland University, D Clément Houtmann Systerel, Aix-en-Provence, F Phillip James Swansea University, UK Kenneth Johnson University of York, UK Jan Kretinsky TU Munich, D Jussi Lahtinen Technical Research Centre of Finland, FI Tuomas Launiainen Aalto University, FI Hugo Daniel Macedo University of Minho, P Andrew Miner Iowa State University, Ames, IA, US Jan Tobias Mühlberg KU Leuven, B René Neumann TU Munich, D Hoang Nga Nguyen Swansea University, UK Petr Rockai Masaryk University Brno, CZ Wendelin Serwe Inria Rhône-Alpes, F Antti Siirtola Aalto University, FI Radu Siminiceanu National Institute in Aerospace, Hampton, VA, US Fu Song LIAFA, Paris, F Jana Tumova Masaryk University Brno, CZ Siert Wieringa Aalto University, FI Proc. Barnat Masaryk University Brno, CZ Radu Calinescu University of York, UK Javier Esparza TU Munich, D Michael Goldsmith University of Oxford, UK Constance Heitmeyer Naval Research Laboratory, Washington, DC, US Keijo Heljanko Aalto University, FI Holger Hermanns Saarland University, D Cliff Jones Newcastle University, UK Gerald Lüttgen University of Bamberg, D, Co-Chair Stephan
    keywords: avocs; university; workshop
       cache: eceasst-786.pdf
  plain text: eceasst-786.txt

        item: #678 of 858
          id: eceasst-787
      author: Zhao, Yang; Rozier, Kristin Yvonne
       title: Formal Specification and Verification of a Coordination Protocol for an Automated Air Traffic Control System
        date: 2012-12-06
       words: 8062
      flesch: 52
     summary: We extract model validation specifications from the operational concept and construct model verification specifications by codifying the expectations of system designers, extracted via con- versation, in temporal logic; all models and specifications are available online. 4.2 Specifications We write two sets of specifications: model validation specifications to ensure the model follows the system design description, and verification specifications capture the emergent behaviors that should be avoided in the AAC system.
    keywords: aac; aircraft; alert; autoresolver; checking; conflict; controller; model; resolution; specification; system; time; tsafe; verification
       cache: eceasst-787.pdf
  plain text: eceasst-787.txt

        item: #679 of 858
          id: eceasst-788
      author: Gast, Holger
       title: Semi-automatic Proofs about Object Graphs in Separation Logic
        date: 2012-12-06
       words: 8120
      flesch: 63
     summary: Since t is always the pointer that is overwritten in object p, the original pointer structure can be restored [MN05, §8.2]. This paper shows that the approach of symbolic execution in separation logic, as first devel- oped by Smallfoot, also encompasses reasoning about object graphs given by the reachability of objects.
    keywords: execution; graph; heap; logic; objects; proofs; reachable; separation; set; verification
       cache: eceasst-788.pdf
  plain text: eceasst-788.txt

        item: #680 of 858
          id: eceasst-789
      author: Pockrandt, Marcel; Herber, Paula; Gross, Holger; Glesner, Sabine
       title: Optimized Transformation and Verification of SystemC Methods
        date: 2012-12-13
       words: 7174
      flesch: 62
     summary: Furthermore, as 5 / 15 Volume 53 (2012) Optimized Transformation and Verification of SystemC Methods delay delta update request Primitive Channels update start update end Scheduler wait notify Processes Events deactivate activate advance time methods Figure 2: Representation of SystemC Designs in UPPAAL model checking suffers from the state space explosion problem, our approach is best-suited for abstract models, where only simple data types are used. Furthermore, they form the basis for our automatic transformation of SystemC designs into UPPAAL timed automata. Transformation of SystemC Designs
    keywords: automata; design; e m; e n; e t; methods; model; systemc; transformation; uppaal; verification
       cache: eceasst-789.pdf
  plain text: eceasst-789.txt

        item: #681 of 858
          id: eceasst-79
      author: Ranger, Ulrike; Schultchen, Erhard; Mosler, Christof
       title: Specifying Distributed Graph Transformation Systems
        date: 2007-07-02
       words: 5775
      flesch: 52
     summary: 2 Distributed Graph Transformation Systems In this section, we present our concepts for specifying distributed graph transformation systems in a visual way. To couple these applications, we use distributed graph transformations, which affect several appli- cations simultaneously.
    keywords: applications; coupling; edge; graph; node; resource; runtime; specification; systems; transformation
       cache: eceasst-79.pdf
  plain text: eceasst-79.txt

        item: #682 of 858
          id: eceasst-790
      author: Siminiceanu, Radu I.; Ahmed, Ijaz; Catano, Nestor
       title: Automated Verification of Specifications with Typestates and Access Permissions
        date: 2012-12-13
       words: 7709
      flesch: 66
     summary: 1 Introduction The idea of model checking specifications has been around for more than two decades [HJL96, Jac94]. 5.3 Inheritance and Class Fields Visibility Although our model-checking approach only analyzes method specifications and not their im- plementation, we can model aspects related to program implementation such as inheritance and class fields visibility.
    keywords: access; e n; e s; l l; model; n s; permissions; plural; r e; s =; s t; s u; specifications; t e; u l
       cache: eceasst-790.pdf
  plain text: eceasst-790.txt

        item: #683 of 858
          id: eceasst-791
      author: Roggenbach, Markus; Moller, Faron; Schneider, Steve; Treharne, Helen; Nguyen, Hoang Nga
       title: Railway modelling in CSP||B: the double junction case study
        date: 2012-12-16
       words: 7022
      flesch: 64
     summary: 8 Conclusion Through our association with Invensys Rail, we are working towards deriving railway models which are formal and analysable by current verification technologies, yet are fully faithful; we do not want to hide the engineering understandings held by our industrial partners in clever abstract encodings. A formal approach for the construction and verification of railway control systems.
    keywords: control; csp||b; figure; interlocking; junction; machine; modelling; railway; route; safety; signal; track; train; verification
       cache: eceasst-791.pdf
  plain text: eceasst-791.txt

        item: #684 of 858
          id: eceasst-792
      author: Dongol, Brijesh; Derrick, John; Hayes, Ian J.
       title: Fractional Permissions and Non-Deterministic Evaluators in Interval Temporal Logic
        date: 2013-01-28
       words: 7610
      flesch: 63
     summary: In Section 2 we present the theory of interval predicates and methods for non-deterministically evaluating state predicates over an interval. A set of variables V is stable in ∆ (denoted stable.
    keywords: interval; permissions; process; state; variable
       cache: eceasst-792.pdf
  plain text: eceasst-792.txt

        item: #685 of 858
          id: eceasst-793
      author: Keiren, Jeroen J. A.; Klabbers, Martijn D.
       title: Modelling and verifying IEEE Std 11073-20601 session setup using mCRL2
        date: 2013-01-28
       words: 7648
      flesch: 55
     summary: Protocol standards are susceptible to inconsistencies and incompleteness. The translation of the session setup is discussed in detail in Section 3. State machines We assume some familiarity with UML state machines.
    keywords: agent; data; ieee; manager; mcrl2; message; model; process; protocol; session; setup; standard; state; version
       cache: eceasst-793.pdf
  plain text: eceasst-793.txt

        item: #686 of 858
          id: eceasst-795
      author: Travkin, Oleg; Wehrheim, Heike; Schellhorn, Gerhard
       title: Proving Linearizability of Multiset with Local Proof Obligations
        date: 2013-01-28
       words: 7654
      flesch: 63
     summary: In our previous work, we introduced local proof obligations, which, by showing a refinement between an abstract specification and its implementation, imply lineariz- ability of the implementation. In Section 4, we give an explanation of how local proof obligations can be used to overcome this problem.
    keywords: case; linearizability; multiset; obligations; operation; process; proof; slot; state; status
       cache: eceasst-795.pdf
  plain text: eceasst-795.txt

        item: #687 of 858
          id: eceasst-796
      author: Radjenovic, Alek; Paige, Richard F
       title: An Approach for Model Querying-by-Example Applied to Multi- Paradigm Models
        date: 2013-02-05
       words: 5322
      flesch: 62
     summary: Keywords: trees, tree queries, tree patterns, model analysis, model querying-by- example, multi-paradigm modelling 1 Introduction A majority of software specifications that are written using programming or modelling languages can be represented as trees. Sarkar’s work on tree pattern matching in source code [SSB01] aims to produce an optimized compiler that performs retargetable object code generation.
    keywords: approach; example; figure; model; nodes; pattern; queries; query; querying; results; tree; xml
       cache: eceasst-796.pdf
  plain text: eceasst-796.txt

        item: #688 of 858
          id: eceasst-797
      author: Bazan Eixarch, Ezequiel; Betarte, Gustavo; Luna, Carlos Daniel
       title: A Formal Specification of the DNSSEC Model
        date: 2013-03-17
       words: 7864
      flesch: 57
     summary: A Formal Specification of the DNSSEC Model 3.2.6 Delegations A delegation describes a father-child relationship between DNSSEC servers. Table 2: Error messages Server ZSK rollover srv rrzsk ¬ isServer s srv server not exists ¬ isZSK rrzsk invalid zsk Receive Response srv from srv to m ¬ isServer s srv f rom∨ ¬ isServer s srv to server not exists ¬ m.Hdr ∈ s.PendingQueries srv to query not asked RR TimeOut srv i rr ¬ isServer s srv server not exists rr /∈
    keywords: def=; dns; dnssec; event; key; model; process; resource; security; server; specification; srv; state; system; type; zone
       cache: eceasst-797.pdf
  plain text: eceasst-797.txt

        item: #689 of 858
          id: eceasst-798
      author: Boender, Jaap
       title: Formal verification of a theory of packages
        date: 2013-04-01
       words: 3625
      flesch: 61
     summary: All theorems about sets that are part of MSet are now defined for package sets. In [ADBZ09], we introduced the notion of strong dependencies; a package p strongly depends on another package q if every installation of p also contains q.
    keywords: dependencies; dependency; packages
       cache: eceasst-798.pdf
  plain text: eceasst-798.txt

        item: #690 of 858
          id: eceasst-799
      author: Regedor, Miguel; da Cruz, Daniela; Henriques, Pedro
       title: The Role of Best Practices to Appraise Open Source Software
        date: 2013-04-07
       words: 7427
      flesch: 60
     summary: Defining open source software project suc- cess. Since 1999 (year that SourceForge was launched), many open source project hosting websites (OSPHWs) were created to host open source projects.
    keywords: best; code; development; github; metrics; number; practices; project; quality; rails; results; ruby; software; source; source software; use; way
       cache: eceasst-799.pdf
  plain text: eceasst-799.txt

        item: #691 of 858
          id: eceasst-8
      author: Boronat, Artur
       title: Exogenous Model Merging by means of Model Management Operators
        date: 2007-02-20
       words: 5777
      flesch: 49
     summary: The structure of the paper is as follows: Section 2 presents the exogenous model merging problem; Section 3 introduces the ModelGen operator for model transformation; Section 4 in- troduces the Merge operator for model merging; Section 5 provides the solution for the example in Section 2; Section 6 provides some related works. The MOMENT framework is a model management framework that provides operators to ma- nipulate models on top of a MOF architecture, such as Merge for model merging and ModelGen for model transformations.
    keywords: domain; elements; management; merging; metamodel; model; model merging; operator; qvt; relation; transformation
       cache: eceasst-8.pdf
  plain text: eceasst-8.txt

        item: #692 of 858
          id: eceasst-80
      author: Fuss, Christian; Mosler, Christof; Pettau, Marcel
       title: RePLEX: A Model-Based Reengineering Tool for PLEX Telecommunication Systems
        date: 2007-07-02
       words: 5046
      flesch: 54
     summary: The new prototype focuses on the forward portion of the reengineering pro- cess offering features for typical re-design tasks on PLEX code, whereas the old one focused on the reverse portion with abstracting from source code level and a plentitude of analyses. The tool supports the reverse engineering and restructuring process by recovering the actual architecture and propagating the modifications from the architecture level back to PLEX source code.
    keywords: code; design; fujaba; graph; model; plex; reengineering; replex; software; source; structure; tool
       cache: eceasst-80.pdf
  plain text: eceasst-80.txt

        item: #693 of 858
          id: eceasst-801
      author: Cerone, Antonio; Fong, Simon; Shaikh, Siraj Ahmed
       title: Analysis of Collaboration Effectiveness and Individuals’ Contribution in FLOSS Communities
        date: 2013-03-17
       words: 5941
      flesch: 45
     summary: The ultimate purpose of this effort is to develop quantitative metrics for these indicators and merge such metrics into a global metric for FLOSS software quality to be used in a certification process. In our future work, as the final objective of the work presented in this paper, we intend to merge all metrics defined for specific quality indicators into a comprehensive framework to determine a global metric for FLOSS software quality to be used in a certification process.
    keywords: activities; collaboration; community; contribution; effectiveness; floss; individual; model; open; quality; reputation; software; source; trust
       cache: eceasst-801.pdf
  plain text: eceasst-801.txt

        item: #694 of 858
          id: eceasst-802
      author: Cerone, Antonio; Settas, Dimitrios
       title: Using antipatterns to improve the quality of FLOSS development
        date: 2013-03-17
       words: 6267
      flesch: 39
     summary: FLOSS community antipatterns describe therefore dysfunctions that negatively affect the quality of the FLOSS product Community antipatterns can help developers overcome problematic FLOSS practices, such as participation and motivation problems, which are crucial to FLOSS development.
    keywords: antipattern; certification; code; community; development; floss; identification; process; project; quality; software
       cache: eceasst-802.pdf
  plain text: eceasst-802.txt

        item: #695 of 858
          id: eceasst-803
      author: Cerone, Antonio
       title: Learning and Activity Patterns in OSS Communities and their Impact on Software Quality
        date: 2013-03-17
       words: 8920
      flesch: 46
     summary: In this wider context, productivity is intended in terms of community activities rather than individuals’ contribution. Therefore, the learning stage can be seen as a weight to associate with productivity in the evaluation of the quality of individuals’ contribution and community activities.
    keywords: activities; activity; code; community; data; development; individual; knowledge; learning; open; oss; patterns; process; project; quality; software; source
       cache: eceasst-803.pdf
  plain text: eceasst-803.txt

        item: #696 of 858
          id: eceasst-807
      author: Kniewel, Romy; Evers, Christoph; Schmidt, Ludger; Geihs, Kurt
       title: Challenging the Need for Transparency, Controllability, and Consistency in Usable Adaptation Design
        date: 2013-04-01
       words: 5995
      flesch: 49
     summary: In contrast to guidelines, user interface design patterns have been favored as design tools because they are less abstract and easier to interpret which makes them easier to apply for design. The possible usability shortcomings of software that changes its user interface during run-time have been discussed in the field of adaptive user interfaces (AUI).
    keywords: adaptation; adaptive; application; design; meet; notification; transparency; usability; user; variation
       cache: eceasst-807.pdf
  plain text: eceasst-807.txt

        item: #697 of 858
          id: eceasst-808
      author: Preisler, Thomas; Vilenica, Ante; Renz, Wolfgang
       title: Decentralized Coordination in Self-Organizing Systems based on Peer-to-Peer Coordination Spaces
        date: 2013-04-07
       words: 5467
      flesch: 40
     summary: These endpoints can be equipped with different mechanisms to distribute coordination information among multiple coordination media and therefore connect them to a distributed coordination medium. On a technical level the distribution of coordination information can be realized with different approaches.
    keywords: agent; application; approach; architecture; coordination; coordination spaces; information; mas; medium; peer; spaces; systems
       cache: eceasst-808.pdf
  plain text: eceasst-808.txt

        item: #698 of 858
          id: eceasst-809
      author: Haubeck, Christopher; Wior, Ireneus; Braubach, Lars; Pokahr, Alexander; Ladiges, Jan; Fay, Alexander; Lamersdorf, Winfried
       title: Keeping Pace with Changes - Towards Supporting Continuous Improvements and Extensive Updates in Manufacturing Automation Software
        date: 2013-04-01
       words: 5849
      flesch: 42
     summary: Since then, various research fields have been developed providing suitable programming concepts for the evolution of software systems and system architectures, and the exchange of components in complex software systems The first scenario describes continuous improvements in which software systems are adapted at runtime.
    keywords: aging; behaviour; cases; changes; cycle; evolution; production; requirements; software; system; test
       cache: eceasst-809.pdf
  plain text: eceasst-809.txt

        item: #699 of 858
          id: eceasst-81
      author: Déharbe, David; Moreira, Anamaria Martins; Sena, Demóstenes
       title: Agraphs: Definition, implementation and tools
        date: 2007-07-02
       words: 5196
      flesch: 54
     summary: For example, nodes representing nets will have a hyperedge towards the list of places in the net: 1 To avoid confusion between AGraph node attributes and XML element attributes, we call the latter XML- attributes. The common characteristics of these first three instances were then formal- ized and led to the definition of an AGraph schema language, and to the development of AGraph instance generators for C and JAVA.
    keywords: agraph; attribute; data; definition; edge; format; implementation; language; net; node; representation; tools
       cache: eceasst-81.pdf
  plain text: eceasst-81.txt

        item: #700 of 858
          id: eceasst-810
      author: Barbosa, Luis; Settas, Dimitrios
       title: Preface
        date: 2013-03-17
       words: 607
      flesch: 41
     summary: Perface Electronic Communications of the EASST Volume 48 (2011) Proceedings of the Fifth International Workshop on Foundations and Techniques for Open source Software Certification (OpernCert 2011) This volume contains the post-proceedings of the 5th International Workshop on Foundations and Techniques for Open Source Software Certification (OpenCert 2011) held on 15 November 2011, in Montevideo, Uruguay, as a satellite event of SEFM’2011, the 9th International Con- ference on Software Engineering and Formal Methods.
    keywords: floss; opencert; software
       cache: eceasst-810.pdf
  plain text: eceasst-810.txt

        item: #701 of 858
          id: eceasst-811
      author: Begerow, Peggy; Schellenberg, Sebastian; Seitz, Jochen; Finke, Thomas; Schroeder, Juergen
       title: Reliable Multicast in Heterogeneous Mobile Ad-hoc Networks
        date: 2013-03-17
       words: 4155
      flesch: 57
     summary: It can immediately check its Host Address Mapping (HAM) table and the routing table to find group member nodes and to instantly send out the group messages. The first one is the group management module which is responsible for creating and terminating groups as well as for controlling the joining and leaving of group members.
    keywords: clusterhead; group; hoc; manets; message; multicast; networks; protocol; routing
       cache: eceasst-811.pdf
  plain text: eceasst-811.txt

        item: #702 of 858
          id: eceasst-812
      author: Blum, Christian; Hafner, Verena Vanessa
       title: Robust Exploration Strategies for a Robot exploring a Wireless Network
        date: 2013-03-17
       words: 4850
      flesch: 56
     summary: 1.2 Related Work Localization of network nodes is a topic which has been extensively studied in the past for wireless (sensor) networks [PAK+05]. Spatial gradients in RSSI measurements can be extracted using odometry in order to get directions to network nodes
    keywords: algorithm; communication; direction; measurements; network; nodes; noise; robot; rssi; wireless
       cache: eceasst-812.pdf
  plain text: eceasst-812.txt

        item: #703 of 858
          id: eceasst-813
      author: Raffelsberger, Christian; Hellwagner, Hermann
       title: Overview of Hybrid MANET-DTN Networking and its Potential for Emergency Response Operations
        date: 2013-03-17
       words: 6370
      flesch: 60
     summary: DTN overlay networks that use the bundle protocol to deliver data can utilize MANET protocols to find DTN-capable nodes. Design of new routing protocols for diverse networks: There are also approaches that do not combine or integrate existing MANET or DTN protocols but are especially developed to support a broad range of networks with diverse connectivity characteristics.
    keywords: approaches; bundle; communication; dtn; end; hybrid; manet; network; nodes; path; protocol; routing
       cache: eceasst-813.pdf
  plain text: eceasst-813.txt

        item: #704 of 858
          id: eceasst-814
      author: Zapf, Michael; Evers, Florian
       title: Preface
        date: 2013-03-17
       words: 715
      flesch: 25
     summary: Michael Zapf Florian Evers March 2013 1 / 2 Volume 56 (2013) Preface Organization Klaus David SACS Kassel University Florian Evers SoCoDiS Technische Universität Ilmenau Kurt Geihs SACS Kassel University Michael Zapf SACS G.S. Ohm University of Appl. Research goals comprise developing mechanisms for the au- tonomous, dynamic, and distributed coordination (self-organization) of mobile communication systems, for instance, for communication systems based on UAVs (unmanned aerial vehicles) than can be brought into the scene easily.
    keywords: sacs; self; systems; universität; university
       cache: eceasst-814.pdf
  plain text: eceasst-814.txt

        item: #705 of 858
          id: eceasst-815
      author: Schau, Volkmar; Erfurth, Christian; Rossak, Wilhelm
       title: Evaluation of self-organizing communication mechanisms within a communication platform for disaster management
        date: 2013-03-17
       words: 4138
      flesch: 53
     summary: 3 The Simulation For the simulation a set of rescue force actions has been arranged like in a storyboard. Trainings for rescue forces are good to be prepared but real situations are more challenging.
    keywords: action; area; communication; data; figure; forces; layer; mobile; patient; rescue; simulation
       cache: eceasst-815.pdf
  plain text: eceasst-815.txt

        item: #706 of 858
          id: eceasst-816
      author: Fernandes, Sara Santos
       title: Quality, Success, Communication and Contribution in Open Source Software
        date: 2013-04-01
       words: 4529
      flesch: 48
     summary: However, OSS projects and IS also differ in significant ways. In this paper, we propose to apply a version of DeLone’s model, modified to accommodate what distinguishes OSS projects from IS, to predict the success of OSS projects.
    keywords: communication; contribution; development; oss; projects; quality; software; success
       cache: eceasst-816.pdf
  plain text: eceasst-816.txt

        item: #707 of 858
          id: eceasst-817
      author: Fabbrini, Fabrizio; Fusani, Mario; Marchetti, Eda
       title: Process Scenarios in Open Source Software Certification
        date: 2013-04-01
       words: 6121
      flesch: 41
     summary: Table 1: Comparison of CSS and OSS certification process Certification process prop- erties, practices and tech- niques CSS certification process OSS certification process Certification process com- pliant to standards (like ISO/IEC 17000) Achieved through formal CB accreditation Achieved through formal CB accreditation Analysis and verification of life-cycle process doc- uments, different from source code, such as: Re- quirements, architecture, verification, testing, design reviews, Quite feasible and opportune for certification Usually not available Analysis and verification of life-cycle process documents different from source code such as: field information, forums, blogs, Usually not provided and if so, unimportant with respect to traditional lifecycle work products Mostly available and useful. As noticed, OSS certification is often related to the use of FM [KM08] in transforming requirements into code and code into requirements, as it is the case of safety and security related properties
    keywords: certification; developers; oss; process; product; requirements; scenario; section; software; source
       cache: eceasst-817.pdf
  plain text: eceasst-817.txt

        item: #708 of 858
          id: eceasst-819
      author: Sáenz-Pérez, Fernando
       title: Tabling with Support for Relational Features in a Deductive Database
        date: 2013-05-06
       words: 8100
      flesch: 61
     summary: So, following [Die87], we could implement query solving in the definition of Datalog predicates and queries. For instance, there is no need to find a fixpoint for extensional database predicates.
    keywords: answers; database; datalog; duplicates; extension; join; outer; predicate; program; query; rule; system; table; tabling
       cache: eceasst-819.pdf
  plain text: eceasst-819.txt

        item: #709 of 858
          id: eceasst-82
      author: Azab, Karl; Habel, Annegret; Pennemann, Karl-Heinz; Zuckschwerdt, Christian
       title: ENFORCe: A System for Ensuring Formal Correctness of High-level Programs
        date: 2007-07-02
       words: 5223
      flesch: 53
     summary: In context of rising standards for trustworthy systems, there is a growing need for the verifica- tion of graph transformation systems. There exist several tools specifically concerned with graph transformation: Engines for plain transformation, e.g., [Bus04, GBG+06, MP06], general purpose tools with visual editors and debuggers for transformation systems like [Tae04, SWZ99, BGN+04], and tools concerned with model checking or analysis of transformation systems properties, e.g., [Tae04, KK06, SV03, KR06, BBG+06].
    keywords: application; conditions; correctness; enforce; graph; level; programs; structures; system; tools; transformation
       cache: eceasst-82.pdf
  plain text: eceasst-82.txt

        item: #710 of 858
          id: eceasst-820
      author: Moreno, Gines; Morcillo, Pedro J.; Penabad, Jaime; Vazquez, Carlos
       title: String-based Multi-adjoint Lattices for Tracing Fuzzy Logic Computations
        date: 2013-05-02
       words: 6883
      flesch: 64
     summary: Keywords: Cartesian Product of Multi-adjoint Lattices; Fuzzy (Multi-adjoint) Logic Programming; Declarative Debugging 1 Introduction In essence, the notion of multi-adjoint lattice considers a carrier set L (whose elements ver- ify a concrete ordering ≤) equipped with a set of connectives like implications, conjunctions, disjunctions and other hybrid operators (not always belonging to an standard taxonomy) with the particularity that for each implication symbol there exists its adjoint conjunction used for modeling the modus ponens inference rule in a fuzzy logic setting. In this setting, the mathematical concept of multi-adjoint lattice has been successfully exploited into the so-called Multi-adjoint Logic Programming approach, MALP in brief, for modeling flexible notions of truth-degrees beyond the simpler case of true and false.
    keywords: fuzzy; lattice; logic; product; program; prolog; string; truth
       cache: eceasst-820.pdf
  plain text: eceasst-820.txt

        item: #711 of 858
          id: eceasst-822
      author: Gallardo, María-del-Mar
       title: Preface of Prole 2012
        date: 2013-05-06
       words: 449
      flesch: 28
     summary: In the 2012 meeting, 21 papers were accepted in three different categories: original research papers, research papers in progress, and high level papers previously published in outstanding conferences or journals. A non-exhaustive list of the areas of interest covered by PROLE includes logic/functional/logic-functional programming and applications, program semantics, program transformation, Databases, constraint logic program- ming, formal aspects of software engineering and model checking.
    keywords: papers; programming
       cache: eceasst-822.pdf
  plain text: eceasst-822.txt

        item: #712 of 858
          id: eceasst-823
      author: Caballero, Rafael; Luzon-Martin, José; Tenorio-Fornes, Antonio
       title: Test-Case Generation for SQL Nested Queries with Existential Conditions
        date: 2013-05-06
       words: 6711
      flesch: 71
     summary: Spain Abstract: This paper presents a test-case generator for SQL queries. The soundness and correctness of the technique with respect to a simple operational semantics for SQL queries without aggregates is proven.
    keywords: case; database; instance; key; sql; table; test
       cache: eceasst-823.pdf
  plain text: eceasst-823.txt

        item: #713 of 858
          id: eceasst-826
      author: Echahed, Rachid; Habel, Annegret; Mosbah, Mohamed
       title: Graph Computation Models 2012
        date: 2013-06-26
       words: 318
      flesch: 33
     summary: The topics of the different articles range over a wide spectrum, including theoretical aspects of graph transformations, proof methods, formal languages as well as application issues of graph computation models. Graph computation models (GCM) constitute a class of very high level models where graphs are first-class citizens.
    keywords: computation; models
       cache: eceasst-826.pdf
  plain text: eceasst-826.txt

        item: #714 of 858
          id: eceasst-827
      author: Poskitt, Christopher M.; Plump, Detlef
       title: Verifying Total Correctness of Graph Programs
        date: 2013-06-25
       words: 9482
      flesch: 67
     summary: G → H between graphs G,H in G (C⊥) consists of two functions gV : VG → VH and gE : EG → EH that preserve sources, targets and labels; that is, sH ◦ gE Rule schemata generalise graph transformation rules, in that labels contain (sequences of) expressions and relabelling is supported.
    keywords: correctness; graph; programs; proof; rule; termination
       cache: eceasst-827.pdf
  plain text: eceasst-827.txt

        item: #715 of 858
          id: eceasst-828
      author: Hoffmann, Berthold
       title: Graph Rewriting with Contextual Refinement
        date: 2013-06-25
       words: 10521
      flesch: 71
     summary: 6 Conclusions In this paper we have defined how schemata of plain graph rewriting rules can be refined with contextual meta-rules. Then we relate rule schemata to other kinds of graph rewrite rules, in Sect. 4.
    keywords: context; graph; meta; nodes; refinement; replacement; rewriting; rules; schema; variable
       cache: eceasst-828.pdf
  plain text: eceasst-828.txt

        item: #716 of 858
          id: eceasst-829
      author: Flick, Nils Erik
       title: Derivation Languages of Graph Grammars
        date: 2013-06-25
       words: 10527
      flesch: 69
     summary: G̃(i j) + 1,2,3 Rest %1 4 + 4,5,6,7 idControl′′ =============⇒ H̃(i j) + 1,2,3 Rest %′′′ ==⇒ H̃(kl) Rest %′,g′8,0 =====⇒ H̃(i j) +1,2,3 Rest by Lemma 4 (2), where %′ is obtained from rule % as in Construction 3, and g′ is the en- largement of the match (as in Lemma 4) by the graph Control′, glued in along 8. G̃(i j)
    keywords: = =; derivation; edges; grammar; graph; languages; lemma; node; rest; rule; step
       cache: eceasst-829.pdf
  plain text: eceasst-829.txt

        item: #717 of 858
          id: eceasst-83
      author: Minas, Mark
       title: Generating Meta-Model-Based Freehand Editors
        date: 2007-07-02
       words: 5609
      flesch: 55
     summary: In this paper, we are considering diagram editors that allow visually creating and modifying such ob- ject structures. Based on this information, feedback to the user is provided as described in section 3.1. 4 DIAMETA Environment This section completes the description of DIAMETA and outlines its environment supporting specification and code generation of diagram editors that are tailored to specific diagram lan- guages.
    keywords: classes; diagram; diameta; editing; editor; emf; graph; language; model; syntax
       cache: eceasst-83.pdf
  plain text: eceasst-83.txt

        item: #718 of 858
          id: eceasst-830
      author: Smoleňová, Katarína; Kurth, Winfried; Cournède, Paul-Henry
       title: Parallel Graph Grammars with Instantiation Rules Allow Efficient Structural Factorization of Virtual Vegetation
        date: 2013-06-25
       words: 7097
      flesch: 61
     summary: “Instantiation rules” as a special sort of graph transformation rules have not been formally defined in [Kni08], although they have been described as part of the language XL there and have been used in various examples. This is not possible for the results of instantiation rule application.
    keywords: age; edge; factorization; figure; graph; growth; instantiation; node; plant; rgg; rules; time; type
       cache: eceasst-830.pdf
  plain text: eceasst-830.txt

        item: #719 of 858
          id: eceasst-831
      author: Radke, Hendrik
       title: HR* Graph Conditions Between Counting Monadic Second-Order and Second-Order Graph Formulas
        date: 2013-06-26
       words: 9551
      flesch: 73
     summary: Keywords: graph transformation, graph conditions, hyperedge replacement, monadic second-order logic, second-order logic 1 Introduction Formal methods play an important role for the development of trustworthy systems. Structural properties of the system are described by graph conditions.
    keywords: conditions; edges; formulas; graph; hr∗; hyperedge; nodes; order; replacement; variables; |=a
       cache: eceasst-831.pdf
  plain text: eceasst-831.txt

        item: #720 of 858
          id: eceasst-832
      author: Ermler, Marcus; Kuske, Sabine; Luderer, Melanie; von Totth, Caroline
       title: A Graph Transformational View on Reductions in NP
        date: 2013-06-25
       words: 8301
      flesch: 67
     summary: Finally, the initial and terminal graph class expressions of graph transformation units allow to specify the input and output types of the algorithms. To underline the usefulness of this result, we model in this paper the problems of finding a clique, an independent set, a vertex cover and a Hamiltonian cycle as graph transformation units.
    keywords: clique; control; correctness; derivation; graph; polynomial; reductions; rule; transformation; unit
       cache: eceasst-832.pdf
  plain text: eceasst-832.txt

        item: #721 of 858
          id: eceasst-833
      author: Mantz, Florian; Taentzer, Gabriele; Lamo, Yngve
       title: Co-Transformation of Type and Instance Graphs Supporting Merging of Types and Retyping
        date: 2013-06-25
       words: 11505
      flesch: 65
     summary: The relation between meta-model changes ∗ This work was partially funded by NFR project 194521 (FORMGRID) 1 / 24 Volume 61 (GCM 2012) mailto:fma@hib.no mailto:yla@hib.no mailto:taentzer@informatik.uni-marburg.de Co-Transformation of Type and Instance Graphs Supporting Merging of Types �� ��Meta-model evolution // �� ��Meta-model′ �� ��Model conforms to OO migration +3________ ________ �� ��Model′ conforms to OO �� Figure 1: Meta-model evolution and model migration and model migrations has been studied little on a formal level. Model migration rules for unchanged types are not required to be defined explicitly, elements of such types are automatically copied.
    keywords: elements; evolution; face; figure; graph; instance; merging; meta; migration; model; rule; transformation; type
       cache: eceasst-833.pdf
  plain text: eceasst-833.txt

        item: #722 of 858
          id: eceasst-834
      author: Kniemeyer, Ole; Kurth, Winfried
       title: XL4C4D - Adding the Graph Transformation Language XL to CINEMA 4D
        date: 2013-06-25
       words: 4818
      flesch: 65
     summary: • There is a new scene graph object XL Object. In order to instantiate the SPO approach for RGG graphs, we have to define a corresponding category RGGGraph of graphs and their homomorphisms.
    keywords: cinema; graph; node; object; rgg; rule; y �
       cache: eceasst-834.pdf
  plain text: eceasst-834.txt

        item: #723 of 858
          id: eceasst-835
      author: Faithfull, Alexander John; Perrone, Gian; Hildebrandt, Thomas T.
       title: Big Red: A Development Environment for Bigraphs
        date: 2013-06-25
       words: 3896
      flesch: 57
     summary: Although Big Red is reliant upon layout information, the user interface can also load model objects that lack it; in these cases, automatically-generated layout information will be assigned. Big Red: A Development Environment for Bigraphs Electronic Communications of the EASST Volume 61 (2013) Selected Revised Papers from the 4th International Workshop on Graph Computation Models (GCM 2012) Big Red: A Development Environment for Bigraphs Alexander Faithfull, Gian Perrone, Thomas T. Hildebrandt 10 pages Guest Editors: Rachid Echahed, Annegret Habel, Mohamed Mosbah Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Big Red: A Development Environment for Bigraphs Alexander Faithfull1, Gian Perrone2, Thomas T. Hildebrandt3 1 alef@itu.dk 2 gdpe@itu.dk 3 hilde@itu.dk IT University of Copenhagen Copenhagen,
    keywords: bigraph; eclipse; editor; example; model; red; rule; user
       cache: eceasst-835.pdf
  plain text: eceasst-835.txt

        item: #724 of 858
          id: eceasst-836
      author: Tichy, Matthias; Ribeiro, Leila
       title: Preface
        date: 2013-07-19
       words: 685
      flesch: 32
     summary: Harrie Jan Sander Bruggink, University of Duisburg-Essen (Germany) • Juan De Lara, Universidad Autónoma de Madrid (Spain) • Gregor Engels, University of Paderborn (Germany) • Claudia Ermel, TU Berlin (Germany) • Lars Grunske, University of Stuttgart (Germany) • Reiko Heckel, University of Leicester (UK) • Ekkart Kindler, Technical University of Denmark (Denmark) • Christian Krause, HPI, University of Potsdam (Germany) • Jochen Küster, IBM Research Zurich (Switzerland) • Barbara König, University of Duisburg-Essen (Germany) • Rodrigo Machado, Federal University of Pampa (Brazil) • Mark Minas, Universität der Bundeswehr München (Germany) • István Ráth, TU Budapest (Hungary) • Arend Rensink, University of Twente (Netherlands) • Matthias Tichy, Chalmers University of Technology and University of Gothenburg (Sweden) Program Committee: • Paolo Baldan, University of Padova (Italy) • Steffen Becker, University of Paderborn (Germany) •
    keywords: germany; graph; university; workshop
       cache: eceasst-836.pdf
  plain text: eceasst-836.txt

        item: #725 of 858
          id: eceasst-837
      author: Corradini, Andrea
       title: Invited Talk: On the Concurrent Semantics of Transformation Systems with Negative Application Conditions
        date: 2013-07-19
       words: 803
      flesch: 46
     summary: We start discussing the definition of sequential independence for direct derivations with NACs [LEOP08], showing that unlike the plain case, it does not enjoy the fun- damental property of being stable under switching of derivations. The consequence is that sequential independence does not induce a well-defined causal partial order- ing on direct derivations, unless NACs are incremental.
    keywords: nacs; semantics; systems
       cache: eceasst-837.pdf
  plain text: eceasst-837.txt

        item: #726 of 858
          id: eceasst-838
      author: Winetzhammer, Sabine; Westfechtel, Bernhard
       title: ModGraph meets Xcore: Combining Rule-Based and Procedural Behavioral Modeling for EMF
        date: 2013-07-19
       words: 4339
      flesch: 54
     summary: The bug tracker was developed the classical way, starting with an Ecore class diagram, shown in Figure 3, refined by ModGraph graph transformation rules and then converted into an Xcore model to model the procedural part. The whole information is stored in Xcore models.
    keywords: code; emf; model; modeling; modgraph; rules; software; transformation; xcore
       cache: eceasst-838.pdf
  plain text: eceasst-838.txt

        item: #727 of 858
          id: eceasst-839
      author: Colombo, Christian; Pace, Gordon J
       title: Monitor-Oriented Compensation Programming Through Compensating Automata
        date: 2013-07-19
       words: 5391
      flesch: 49
     summary: 1 / 12 Volume 58 (2013) mailto:christian.colombo@um.edu.mt mailto:gordon.pace@um.edu.mt Monitor-Oriented Compensation Programming Since compensations enable the logical reversal of past actions and are, by their nature, history-based, while typical recovery is usually programmed statically (e.g., try-catch-block), compensation programming has to be programmed dynamically to take into consideration the current execution path (which is to be reversed). Programming compensations statically is pos- sible but limits their expressivity [LVF10].
    keywords: automata; automaton; compensation; configuration; goods; monitor; programming; stack; state; system
       cache: eceasst-839.pdf
  plain text: eceasst-839.txt

        item: #728 of 858
          id: eceasst-84
      author: Geiger, Leif; Zündorf, Albert
       title: eDOBS - Graphical Debugging for Eclipse
        date: 2007-09-06
       words: 1344
      flesch: 56
     summary: When exploring object structures in eDOBS, the way back to the Eclipse or Fujaba4Eclipse artifact is offered for all elements. 3 / 4 Volume 1 (2006) eDOBS 4 Conclusion eDOBS is a browser, editor and transformation rule application tool for object structures / typed instance graphs.
    keywords: edobs; graph; java; object
       cache: eceasst-84.pdf
  plain text: eceasst-84.txt

        item: #729 of 858
          id: eceasst-841
      author: Maximova, Maria; Ehrig, Hartmut; Ermel, Claudia
       title: Analysis of Hypergraph Transformation Systems in AGG based on M-Functors
        date: 2013-07-19
       words: 6062
      flesch: 60
     summary: Altogether, this allows us to apply Theorem 3 with F = FHG. This formal relationship is based on the general theory of M -functors between different M -adhesive transformation systems.
    keywords: -adhesive; analysis; fhg; graph; hypergraph; pair; systems; transformation
       cache: eceasst-841.pdf
  plain text: eceasst-841.txt

        item: #730 of 858
          id: eceasst-842
      author: Mantz, Florian; Taentzer, Gabriele; Lamo, Yngve
       title: Well-formed Model Co-evolution with Customizable Model Migration
        date: 2013-07-19
       words: 6938
      flesch: 67
     summary: Furthermore, we develop a strategy for deriving model migration schemes that are not only working for pre-defined migration operations but allow user-defined meta-model evolution rules with deduced migration schemes. In the future, we want to extend this work on model migration schemes to more powerful forms of graphs and rules taking especially node type inheritance, application conditions and constraints into account.
    keywords: evolution; graph; meta; migration; model; multi; rule; scheme; transformation
       cache: eceasst-842.pdf
  plain text: eceasst-842.txt

        item: #731 of 858
          id: eceasst-843
      author: Teusner, Ralf; Gabrysiak, Gregor; Richter, Stefan; Kleff, Stefan
       title: Interactive Strategy-Based Validation of Behavioral Models
        date: 2013-07-19
       words: 4858
      flesch: 53
     summary: Figure 6: Number of states for different look ahead values – with and without state merging Figure 7: Runtime of random rule execution compared to a strategy-based execution for different look ahead values – with and without state merging On a MacBook Pro (Mac OS 10.6) with a 2.4 GHz Core2Duo processor and 8 GB RAM (JVM 1.6, Eclipse 3.6.1), the computation of the look ahead illustrated in Figure 8 took 0.135 seconds, its visualization needed 1.1 seconds.2 Even the computation of a look ahead with a depth of 12, which includes 67 states, took only 0.374 seconds. As can be seen, state merging effectively delays the exponential growth of states.
    keywords: ahead; graph; look; requirements; simulation; space; stakeholders; state; strategy
       cache: eceasst-843.pdf
  plain text: eceasst-843.txt

        item: #732 of 858
          id: eceasst-844
      author: Bottoni, Paolo; Parisi Presicce, Francesco
       title: Annotations on Complex Patterns
        date: 2013-07-19
       words: 6320
      flesch: 60
     summary: Modeling context with graph annotations. The notion of domain is induced from the notion of type graph, as per Definition 3. Figure 6: The extended metamodel for complex annotations.
    keywords: annotations; area; boxes; domain; elements; figure; graph; level; member; rule; secann; team
       cache: eceasst-844.pdf
  plain text: eceasst-844.txt

        item: #733 of 858
          id: eceasst-845
      author: Fors, Niklas; Hedin, Görel
       title: Reusing Semantics in Visual Editors: A Case for Reference Attribute Grammars
        date: 2013-07-19
       words: 5851
      flesch: 61
     summary: Reusing Semantics in Visual Editors 7 Related Work We focus in this paper on using reference attribute grammars to declaratively specify semantics, and to reuse these specifications to provide semantic feedback in visual editors. A common way of programming them is to use visual function block diagrams (FBDs) like those defined in the IEC 61131-3 standard.
    keywords: attribute; block; editors; execution; figure; grammars; order; semantics; syntax; textual; tree
       cache: eceasst-845.pdf
  plain text: eceasst-845.txt

        item: #734 of 858
          id: eceasst-847
      author: Runge, Olga; Khan, Tamim Ahmed; Heckel, Reiko
       title: Test Case Generation Using Visual Contracts
        date: 2013-07-29
       words: 5053
      flesch: 60
     summary: As might be expected, the growth of the number of test cases per number of rules is well above linear, but the time taken to generate them is 0.17 seconds per test case for the Hotel example vs. 0.15 seconds per test case for the Bug Tracker. Keywords: graph transformation, services, visual contracts, test case generation 1 Introduction Testing involves a variety of activities, including test case generation to create a test suite, cover- age analysis to assess its quality, and oracles to predict expected results.
    keywords: approach; case; contracts; coverage; dependencies; dependency; generation; graph; model; rule; test
       cache: eceasst-847.pdf
  plain text: eceasst-847.txt

        item: #735 of 858
          id: eceasst-848
      author: Alshanqiti, Abdullah M.; Heckel, Reiko; Khan, Tamim
       title: Learning Minimal and Maximal Rules from Observations of Graph Transformations
        date: 2013-07-29
       words: 5159
      flesch: 59
     summary: From such positive and negative examples, minimal rules are extracted, to be extended by context that is present in all positive examples and missing in at least one negative example. The results, reported in Table 1 and visualised in Figure 6, show that significant time is spent in loading the graphs into the database, calculating distances and minimal rules, while the more sophisticated computations of maximal and required rules are less significant.
    keywords: context; examples; figure; graph; learning; mar; model; node; rule; set; transformations
       cache: eceasst-848.pdf
  plain text: eceasst-848.txt

        item: #736 of 858
          id: eceasst-849
      author: Maier, Sonja; Minas, Mark
       title: A Pattern-based Approach for Initial Diagram Layout
        date: 2013-07-29
       words: 6369
      flesch: 57
     summary: Keywords: layout, diagram editor, freehand & structured editing, diagram import 1 Introduction A layout engine usually runs continuously within diagram editors and improves the layout in response to user interaction in real-time. Rule-based (layout) al- gorithms were introduced in [Mai12], and are specifically tailored to the interactive nature of diagram editors.
    keywords: approach; diagram; editing; layout; lps; model; pattern
       cache: eceasst-849.pdf
  plain text: eceasst-849.txt

        item: #737 of 858
          id: eceasst-85
      author: Meinl, Thorsten; Wörlein, Marc; Urzova, Olga; Fischer, Ingrid; Philippsen, Michael
       title: The ParMol Package for Frequent Subgraph Mining
        date: 2007-07-02
       words: 5659
      flesch: 64
     summary: Summing up, graph mining algorithms need a search strategy through the subgraph lattice, must generate new subgraphs and calculate their frequency while avoiding duplicates. Searching for frequent subgraphs in a graph database is also called graph mining.
    keywords: database; figure; fragments; graphs; mining; molecules; node; parmol; subgraph
       cache: eceasst-85.pdf
  plain text: eceasst-85.txt

        item: #738 of 858
          id: eceasst-850
      author: Bouwers, Eric; Yu, Yijun
       title: Preface
        date: 2013-07-29
       words: 927
      flesch: 43
     summary: Why? Software release engineering is the discipline of integrating, building, testing, packaging and delivering qualitative software releases to the end user. Continuing the debate of Is software quality in the eye of the beholder?
    keywords: netherlands; quality; release; software; university
       cache: eceasst-850.pdf
  plain text: eceasst-850.txt

        item: #739 of 858
          id: eceasst-851
      author: Goeb, Andreas
       title: A Meta Model for Software Architecture Conformance and Quality Assessment
        date: 2013-07-29
       words: 8488
      flesch: 46
     summary: In summary, software quality models help in de- veloping a common understanding of software quality. More information on how to use benchmarking approaches for the calibration of software quality models can be found in [Loc12].
    keywords: approach; architecture; assessment; conformance; design; factors; goals; measures; meta; model; order; quality; quality model; software; software architecture; software quality; system
       cache: eceasst-851.pdf
  plain text: eceasst-851.txt

        item: #740 of 858
          id: eceasst-852
      author: Hegedűs, Péter; Bakota, Tibor; Ladányi, Gergely; Faragó, Csaba; Ferenc, Rudolf
       title: A Drill-Down Approach for Measuring Maintainability at Source Code Element Level
        date: 2013-07-29
       words: 9329
      flesch: 55
     summary: Besides expressing source code maintainability in terms of numerical values, these models are also expected to provide explicable results, i.e. to give a detailed list of source code fragments that should be improved by the programmers in order to reach higher overall quality. First, we briefly introduce our probabilistic software quality model, which can be used for measuring source code maintainability at system level.
    keywords: approach; code element; correlation; goodness; level; maintainability; methods; model; number; quality; software; source code; students; system; values
       cache: eceasst-852.pdf
  plain text: eceasst-852.txt

        item: #741 of 858
          id: eceasst-853
      author: Poehlmann, Martin; Juergens, Elmar
       title: Revealing Missing Bug-Fixes in Code Clones in Large-Scale Code Bases
        date: 2013-07-29
       words: 7464
      flesch: 62
     summary: [KPW06] S. Kim, K. Pan, E. E. Whitehead Jr. Memories of bug fixes. The search is based on code clone detection, but is limited to searching for code fragments similar to a search term.
    keywords: approach; bug; clones; code; code clones; detection; evolution; fixes; precision; results; revision; software; system
       cache: eceasst-853.pdf
  plain text: eceasst-853.txt

        item: #742 of 858
          id: eceasst-854
      author: Küpper, Sebastian; König, Barbara; Bruggink, H.J. Sander
       title: Concatenation and other Closure Properties of Recognizable Languages in Adhesive Categories
        date: 2013-08-15
       words: 6484
      flesch: 70
     summary: Here we focus on the closure of recognizable graph languages under concatenation. Concatenation for recognizable graph languages was already studied by Courcelle in [Cou94], but for a different setting where graphs have only one interface and are glued over their joint interface.
    keywords: automata; automaton; closure; concatenation; cospan; graph; languages; recognizable
       cache: eceasst-854.pdf
  plain text: eceasst-854.txt

        item: #743 of 858
          id: eceasst-855
      author: Reichardt, Max; Föhst, Tobias; Berns, Karsten
       title: On Software Quality-motivated Design of a Real-time Framework for Complex Robot Control Systems
        date: 2013-08-15
       words: 8556
      flesch: 52
     summary: Framework design and policies have significant influence on this issue. We propose systematic framework design aiming at high levels of support for all quality attributes that are relevant in the robotics domain.
    keywords: application; code; components; control; core; data; design; development; finroc; framework; implementation; lock; quality; robotics; runtime; software; support; systems; time
       cache: eceasst-855.pdf
  plain text: eceasst-855.txt

        item: #744 of 858
          id: eceasst-856
      author: Greenyer, Joel; Brenner, Christian; Panzica La Manna, Valerio
       title: The ScenarioTools Play-Out of Modal Sequence Diagram Specifications with Environment Assumptions
        date: 2013-08-15
       words: 6985
      flesch: 55
     summary: The algorithm will repeat sending system messages until no active MSDs with active system messages remain. This is because, as described in Sect. 2.2, the system must always immediately send active system messages without waiting for the environment.
    keywords: active; assumptions; environment; event; message; msd; msds; play; railcab; system
       cache: eceasst-856.pdf
  plain text: eceasst-856.txt

        item: #745 of 858
          id: eceasst-857
      author: Giese, Holger
       title: Invited Talk: Extensions of Graph Transformation Systems for Timed, Continuous, and Probabilistic Behavior
        date: 2013-08-23
       words: 247
      flesch: 12
     summary: Proceedings of the 12th International Workshop on Graph Transformation and Visual Modeling Techniques (GTVMT 2013) Invited Talk: Extensions of Graph Transformation Systems for Timed, Continuous, and Probabilistic Behavior Holger Giese 1 pages Guest Editors: Matthias Tichy, Leila Ribeiro Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Invited Talk: Referring to the de- velopment of related extensions for automata, we will discuss how these results have been transferred to graph transformation systems.
    keywords: behavior
       cache: eceasst-857.pdf
  plain text: eceasst-857.txt

        item: #746 of 858
          id: eceasst-859
      author: Mossakowski, Till; Codescu, Mihai; Maeder, Christian; Langenstein, Bruno
       title: The VSE Refinement Method in Hets
        date: 2013-09-15
       words: 13732
      flesch: 58
     summary: Thus the proof manage- ment formalism provided by HETS can be applied for VSE specifications without modification of the logic independent layers of HETS. The difference is that now they are built using abstract (i.e. loose) procedure names and actual implementations are to be later plugged in by means of a view which corresponds to the VSE mapping, with the exception that instead of pairing export specification symbols with implementations, the view rather pairs abstract procedures with implementations.
    keywords: bin; casl; comorphism; hets; logic; model; nats; procedure; proof; refinement; signature; sort; specification; symbols; translation; vse; zero
       cache: eceasst-859.pdf
  plain text: eceasst-859.txt

        item: #747 of 858
          id: eceasst-86
      author: Ermel, Claudia; Ehrig, Karsten; Taentzer, Gabriele; Weiss, Eduard
       title: Object Oriented and Rule-based Design of Visual Languages using Tiger
        date: 2007-07-02
       words: 4491
      flesch: 49
     summary: Keywords: visual languages, editor generation, visual editor, graph transformation, Eclipse 1 Introduction Domain specific modeling languages are of growing importance for software and system de- velopment. Generation of Visual Editors as Eclipse Plug-ins.
    keywords: eclipse; editor; figure; graph; language; rule; syntax; tiger; transformation
       cache: eceasst-86.pdf
  plain text: eceasst-86.txt

        item: #748 of 858
          id: eceasst-860
      author: Grosse, Daniel; Fey, Goerschwin; Drechsler, Rolf
       title: Enhanced Formal Verification Flow for Circuits Integrating Debugging and Coverage Analysis
        date: 2013-09-15
       words: 5469
      flesch: 65
     summary: Still the verification gap remains due to low productivity, and intensive training of verification engi- neers is required to apply property checking in practice. But techniques automating debugging in the context of property checking have been presented [FSBD08] to speed up the work flow.
    keywords: checking; circuit; coverage; debugging; design; property; sat; time; verification
       cache: eceasst-860.pdf
  plain text: eceasst-860.txt

        item: #749 of 858
          id: eceasst-861
      author: Kreowski, Hans-Jörg; Kuske, Sabine
       title: Graph Tuple Transformation
        date: 2013-09-15
       words: 11080
      flesch: 67
     summary: Given a set of graph transformation rules and a set of graphs, one gets a graph transformation system in its simplest form. The semantics can be defined as a binary relation on graphs where the first component of every pair is some start graph G and the second component is a graph derived from G by applying Festschrift Bernd Krieg-Brückner 2 / 23 ECEASST a sequence of graph transformation rules.
    keywords: class; control; graph; graph transformation; graph tuple; rule; set; state; string; transformation; transformation units; tuple; tuple transformation; unit
       cache: eceasst-861.pdf
  plain text: eceasst-861.txt

        item: #750 of 858
          id: eceasst-865
      author: Hildebrandt, Stephan; Lambers, Leen; Giese, Holger; Rieke, Jan; Greenyer, Joel; Schäfer, Wilhelm; Lauder, Marius; Anjorin, Anthony; Schürr, Andy
       title: A Survey of Triple Graph Grammar Tools
        date: 2013-09-15
       words: 7716
      flesch: 55
     summary: TGG rules have been extended formally to handle attributes in the related models Although TGG rules can be used to produce source and target models simultaneously, the real potential of TGGs lies in the automatic derivation of operational forward and backward transfor- mation rules.
    keywords: class; elements; emoflon; graph; interpreter; model; mote; proc; rules; tgg; tggs; tools; transformation; triple
       cache: eceasst-865.pdf
  plain text: eceasst-865.txt

        item: #751 of 858
          id: eceasst-866
      author: Wilson-Kanamori, John Roger; Hidaka, Soichiro
       title: A Bidirectional Collaboration Framework for Bio-Model Development
        date: 2013-09-16
       words: 7593
      flesch: 45
     summary: These include queries to select pertinent information from the model as a whole (Subsubsection 4.2.1), in-place refinement of model data (Subsubsection 4.2.2), and insertion (Subsubsection 4.2.3) and deletion (Subsubsection 4.2.4) of model entities and relations. Recent approaches [BS11] define such models in terms of ‘high-level’ graph data struc- tures such as port graphs [AK07] and site graphs [DL04], rendered stochastically simulable via 1 / 18 Volume 57 (2013) mailto:j.r.wilson-kanamori@sms.ed.ac.uk mailto:hidaka@nii.ac.jp A Bidirectional Collaboration Framework for Bio-Model Development suitably adapted graph rewriting algorithms.
    keywords: agent; data; example; framework; graph; kappa; knowledge; level; model; representations; structure; transformations; user
       cache: eceasst-866.pdf
  plain text: eceasst-866.txt

        item: #752 of 858
          id: eceasst-868
      author: Macedo, Nuno; Pacheco, Hugo; Cunha, Alcino; Oliveira, José Nuno
       title: Composing Least-change Lenses
        date: 2013-09-16
       words: 9014
      flesch: 63
     summary: However, we have the restriction that, for example, when y @get f s z then y −1 ≺s z−1, forcing the pre-images of targets at different distances from get f s to also be at different distances from s (respecting the relative orders). This “principle of least change” has in fact already been proposed by Meertens [Mee98] for the BX framework of constraint maintainers.
    keywords: change; distance; f s; lenses; nondeterministic; source; view
       cache: eceasst-868.pdf
  plain text: eceasst-868.txt

        item: #753 of 858
          id: eceasst-870
      author: Kohlhase, Andrea; Kohlhase, Michael
       title: Spreadsheets with a Semantic Layer
        date: 2013-09-15
       words: 8965
      flesch: 54
     summary: For example, spreadsheet users often are concerned with questions like “Is it good or bad for my business if this cell has value 0.992?” We will make this view the basis of our treatment of assessment in SACHS: We extend the background ontology by a set of assessment theories that judge the intended functions in the functional blocks of the spreadsheet on their functional properties.
    keywords: assessment; background; cell; data; figure; graph; help; knowledge; layer; sachs; semantic; spreadsheet; system; theories; theory; user
       cache: eceasst-870.pdf
  plain text: eceasst-870.txt

        item: #754 of 858
          id: eceasst-871
      author: Orejas, Fernando; Boronat, Artur; Ehrig, Hartmut; Hermann, Frank; Schölzel, Hanna
       title: On Propagation-Based Concurrent Model Synchronization
        date: 2013-09-16
       words: 10162
      flesch: 63
     summary: In Section 3, we introduce the basic theoretical framework used in the paper, first our notion of model update and, then, our assumptions about update propagation operations. In this sense, first, we present our assumptions about the given model framework and, then, we present a generic notion of model update or modification, and study some properties of this notion.
    keywords: conflict; employee; model; propagation; properties; synchronization; target; update
       cache: eceasst-871.pdf
  plain text: eceasst-871.txt

        item: #755 of 858
          id: eceasst-872
      author: Hofmann, Martin; Pierce, Benjamin; Wagner, Daniel
       title: Edit languages for information trees
        date: 2013-09-16
       words: 6260
      flesch: 70
     summary: This allows us to view sheaves automata and subsets of tree edits as edit languages in the sense of [HPW12]. insert(t′)·t = t ∪t′ if dom(t)∩dom(t′) = /0 hoist(m,n)·t = t[m 7→ t(m)\n,n 7→ t(m)(n)] if t(m)(n)↓∧ t(n)↑ delete(n)·t = t \n if t(n) ={||}2 rename(n,n′)·t = (t \n)[n′ 7→ t(n)] if t(n)↓∧ t(n′)↑ at(n,e)·t = t[n 7→ e·t(n)] if t(n)↓ e·t =⊥ in all other cases Tree edits are sequences of atomic edits.
    keywords: automata; automaton; edit; languages; sheaves; tree
       cache: eceasst-872.pdf
  plain text: eceasst-872.txt

        item: #756 of 858
          id: eceasst-873
      author: Gimblett, Andy; Kahsai, Temesghen; O'Reilly, Liam; Roggenbach, Markus
       title: On the whereabouts of CSP-CASL – A survey
        date: 2013-09-16
       words: 8546
      flesch: 62
     summary: For a denotational CSP model with domain D, the semantic domain of CSP-CASL consists of families of process denotations dM ∈ D over some index set I, (dM)M∈I where I is a class of CASL models over the same signature. Syntactically, a CSP-CASL specification with name N consists of a data part Sp, which is a structured CASL specification, an (optional) channel part Ch to declare channels, which are typed according to the data part, and a process part P written in CSP, within which CASL terms are used as communications, CASL sorts denote sets of communications, relational renaming is described by a binary CASL predicate, and the CSP conditional construct uses CASL formulae as conditions: ccspec N = data Sp channel Ch process P end See below for concrete instances of this scheme.
    keywords: acl; casl; csp; data; deadlock; ep2; init; level; process; prover; refinement; semantics; specification; support; system; test; testing; tool
       cache: eceasst-873.pdf
  plain text: eceasst-873.txt

        item: #757 of 858
          id: eceasst-874
      author: Mossakowski, Till; Roggenbach, Markus; Schröder, Lutz
       title: Preface
        date: 2013-09-16
       words: 1078
      flesch: 42
     summary: Preface Electronic Communications of the EASST Volume 62 (2013) Specification, Transformation, Navigation Special Issue dedicated to Bernd Krieg-Brückner on the Occasion of his 60th Birthday Preface 2 pages Guest Editors: Till Mossakowski, Markus Roggenbach, Lutz Schröder Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Preface Bernd Krieg Brückner studied electrical engineering at the universities of Hannover and Er- langen. Its aim is to bridge the gap between formal specifications and real programs.
    keywords: bernd; brückner; krieg; specification
       cache: eceasst-874.pdf
  plain text: eceasst-874.txt

        item: #758 of 858
          id: eceasst-875
      author: Johnson, Michael; Rosebrugh, Robert
       title: Delta Lenses and Opfibrations
        date: 2013-10-22
       words: 8945
      flesch: 73
     summary: We had been exploring category theoretic approaches to lenses, and had studied lenses in the category cat so that the system and view states S and V would be categories — the objects of those categories would be the states, and the arrows in those categories would be the transitions between states. There is an important advantage to having morphisms between states: an update of a specific single state to another state may be represented by a morphism in the category of database states or in the category of view states.
    keywords: lenses; state; view
       cache: eceasst-875.pdf
  plain text: eceasst-875.txt

        item: #759 of 858
          id: eceasst-876
      author: Stevens, Perdita; Terwilliger, James F
       title: Preface
        date: 2013-10-22
       words: 1286
      flesch: 52
     summary: Frank Hermann (University of Luxembourg, Luxembourg) • Soichiro Hidaka (National Institute of Informatics, Japan) • Mike Johnson (Macquarie University, Australia) • Fernando Orejas (Technical University of Catalonia, Spain) • Jorge Perez (Universidad de Chile, Chile) • Benjamin Pierce (University of Pennsylvania, USA) • Dan Suciu (University of Washington, USA) • Janis Voigtländer (University of Bonn, Germany) and the chairs were ourselves, Perdita Stevens (University of Edinburgh, UK) and James Terwilliger (Microsoft, USA). The Bx series of events is guided by the Bx steering committee; for more information, see the Bx community wiki at http://bx-community.wikidot.com/. In 2013, the programme committee was: • Benjamin Braatz (University of Luxembourg, Luxembourg) • Anthony Cleve (University of Namur, Belgium)
    keywords: transformations; university; workshop
       cache: eceasst-876.pdf
  plain text: eceasst-876.txt

        item: #760 of 858
          id: eceasst-879
      author: Rajkumar, Raghu; Foster, Nate; Lindley, Sam; Cheney, James
       title: Lenses for Web Data
        date: 2014-01-21
       words: 8323
      flesch: 66
     summary: As a first step, we show that Formlenses are lens functors: instance LFunctor Formlens where lmap lns f = Formlens (λ v i → let (html,c,i′) = f (fmap (get l) v) i in (html,fmap (put l v)◦c,i′) We show that formlenses can be viewed as monoidal functors over lenses, analogously to formlets, which are applicative functors.
    keywords: data; formlens; functors; haskell; html; iso; lenses; monoidal; type; value; web
       cache: eceasst-879.pdf
  plain text: eceasst-879.txt

        item: #761 of 858
          id: eceasst-88
      author: Berkenkötter, Kirsten
       title: Design of a Railway Domain Profile and its OCL-based Validation
        date: 2007-07-05
       words: 7553
      flesch: 50
     summary: One effect of this general tendency is the increasing number of UML profiles. Design- ing a new modeling language from scratch is obviously time-consuming and costly, therefore UML profiles have become a popular mechanism to tailor the UML to specific domains.
    keywords: constraints; domain; elements; figure; level; metamodel; model; ocl; profile; railway; rcsd; stereotype; subsets; uml; validation
       cache: eceasst-88.pdf
  plain text: eceasst-88.txt

        item: #762 of 858
          id: eceasst-882
      author: Lüttgen, Gerald; Vogler, Walter
       title: Richer Interface Automata with Optimistic and Pessimistic Compatibility
        date: 2014-02-10
       words: 7227
      flesch: 62
     summary: One way to deal with this situation is to extend the alphabets of the con- juncts in some P∧Q to a common alphabet by adding a may-loop p a 99K p to all states p ∈ P and for all actions a ∈ AQ \AP, and similarly for Q; such loops would express that P, Q behave neutral regarding actions that are not in their resp. For Relaxed MIAs P, Q with p ∈ P, q ∈ Q, IP ⊇ IQ and OP ⊇ OQ, we define p @a ′ q if p @ a [q]IP\IQ, OP\OQ .
    keywords: 99k; interface; mia; mias; relaxed
       cache: eceasst-882.pdf
  plain text: eceasst-882.txt

        item: #763 of 858
          id: eceasst-883
      author: Moran, Murat; Heather, James
       title: Automated Analysis of Voting Systems with Dolev-Yao Intruder Model
        date: 2014-02-22
       words: 8211
      flesch: 63
     summary: First, we adapt the lazy spy intruder model to voting system analysis, as it is very efficient in terms of cutting down unnecessary states as well as being flexible for usage with other privacy-related properties. The adaptation of the intruder model to voting systems analysis has been made by introducing different channel types, introduced in this section, and the CSP definition of the lazy spy intruder model is kept intact.
    keywords: analysis; ballot; candidate; channels; intruder; list; messages; model; s s; system; voter; voting; vvote
       cache: eceasst-883.pdf
  plain text: eceasst-883.txt

        item: #764 of 858
          id: eceasst-884
      author: Bersani, Marcello Maria; Rossi, Matteo G.; San Pietro, Pierluigi
       title: On the Satisfiability of Metric Temporal Logics over the Reals
        date: 2014-02-10
       words: 7563
      flesch: 70
     summary: CLTL-oc variables behaving as clocks represent time progress, while discrete posi- tions in CLTL-oc models represent, for each subformula occurring in QTL formula φ , whether a change of truth value (an “event”) occurs or not for the subformula at that point. In every (discrete) position CLTL-oc models embed, through suitable fresh propositional letters (q and �), the information defining the truth value of all the subformulae occurring in QTL formula φ and, through clock variables, the informa- tion about the time progress between two consecutive changing points.
    keywords: cltl; formula; qtl; time
       cache: eceasst-884.pdf
  plain text: eceasst-884.txt

        item: #765 of 858
          id: eceasst-885
      author: Tofan, Bogdan; Schellhorn, Gerhard; Ernst, Gidon; Pfahler, Jörg; Reif, Wolfgang
       title: Compositional Verification of a Lock-Free Stack with RGITL
        date: 2014-02-10
       words: 7650
      flesch: 58
     summary: Our soundness proofs of RG decomposition rules are simpler, since they are based on a compositional temporal logic, where intervals are already part of the semantics. , the rule decomposes a global RG assertion about the interleaved system, to the fol- lowing local RG assertion for one process p, executing COP once.
    keywords: data; decomposition; freedom; heap; linearizability; lock; logic; ownership; process; stack; state; verification
       cache: eceasst-885.pdf
  plain text: eceasst-885.txt

        item: #766 of 858
          id: eceasst-887
      author: Patcas, Lucian M.; Lawford, Mark; Maibaum, Tom
       title: From System Requirements to Software Requirements in the Four-Variable Model
        date: 2014-02-10
       words: 7555
      flesch: 59
     summary: The demonic composition of relations P ⊆ A×B and Q ⊆ B×C is defined as: P2Q = P . Assuming two relations R ⊆ A×C and Q ⊆ B×C, the left residual of R by Q, denoted R/Q, is the largest solution of the inequality X ., Q ⊆ R, where X ⊆ A×B is the unknown: X ., Q ⊆ R ⇐⇒ X ⊆ R/Q The value of the left residual of R by Q is: R/Q = R ., Q` ={(a,b)∈ A×B | ∀c ∈C. Q b c
    keywords: demonic; implementation; model; requirements; software; system
       cache: eceasst-887.pdf
  plain text: eceasst-887.txt

        item: #767 of 858
          id: eceasst-888
      author: Daw, Zamira; Cleaveland, Rance; Vetter, Marcus
       title: Integrating model checking and UML based model-driven development for embedded systems
        date: 2014-02-10
       words: 7303
      flesch: 55
     summary: Section 2 discusses related work for verification of UML models using model checking, while Section 3 reviews the DMOSES method. The M2M step translates UML models into DMOSES models that are then transformed into source code in the M2T step.
    keywords: activity; checking; diagrams; dmoses; execution; flow; model; nusmv; state; system; time; uml; uppaal; verification
       cache: eceasst-888.pdf
  plain text: eceasst-888.txt

        item: #768 of 858
          id: eceasst-889
      author: Dongol, Brijesh; Derrick, John
       title: Simplifying proofs of linearisability using layers of abstraction
        date: 2014-02-10
       words: 8319
      flesch: 62
     summary: 5. evalp,Z.c “= �p c ∧ behp,Z.Idle updatep,Z(va,k) “= ®behp,Z\{va}.Idle ∧¬empty ∧�(va = k ∧ Wp.va) if va ∈ Varbehp,Z\{va}.Idle ∧¬empty ∧�((∗va) = k ∧ Wp.va) if va ∈ Addr To enable compositional reasoning, for interval predicates r and g, and command C, we intro- duce two additional constructs RELY r • C and ENF g• C, which denote a command C with a rely condition r and an enforced condition g, respectively [DDH12]. Note that unlike Jones [Jon83], who assumes rely conditions are two-state relations, rely conditions in our framework are interval predicates that are able to refer to an arbitrary number of states because the size of the interval is not fixed.
    keywords: abstraction; behaviour; behp; execution; interval; linearisability; operation; process; rely; set; state
       cache: eceasst-889.pdf
  plain text: eceasst-889.txt

        item: #769 of 858
          id: eceasst-89
      author: Balasubramanian, Daniel; Narayanan, Anantha; van Buskirk, Christopher; Karsai, Gabor
       title: The Graph Rewriting and Transformation Language: GReAT
        date: 2007-09-06
       words: 3068
      flesch: 56
     summary: Since graph transformations are grounded in mathematical concepts, we can use them to formally specify the intended behavior of model transformations. GReAT transformations can be translated into C++ code, but this is mainly done to increase the performance of the transformation.
    keywords: graph; great; input; language; model; rule; transformation
       cache: eceasst-89.pdf
  plain text: eceasst-89.txt

        item: #770 of 858
          id: eceasst-890
      author: sharifi, zeinab; Mosaffa, Mahdi; Mohammadi, Siamak; Sirjani, Marjan
       title: Functional and Performance Analysis of Network-on-Chips Using Actor-based Modeling and Formal Verification
        date: 2014-02-10
       words: 7526
      flesch: 57
     summary: Also, it is needed to check whether all packets in the network were sent through counting the number of sent packets. It will become ”true” if the number of sent packets is equal to the number of existing packets in the NoC.
    keywords: buffer; end; latency; message; method; model; modeling; noc; packet; performance; rebeca; results; verification
       cache: eceasst-890.pdf
  plain text: eceasst-890.txt

        item: #771 of 858
          id: eceasst-891
      author: Dghaym, Dana; Butler, Michael; Fathabadi, Asieh Salehi
       title: Evaluation of Graphical Control Flow Management Approaches for Event-B Modelling
        date: 2014-02-10
       words: 6638
      flesch: 55
     summary: In our overall diagram we use notes to help in clarifying the details needed for events, like the local pre and post conditions used in the refinement of Resource Allocation in Figure 6, where preconditions become event guards and postconditions become event actions. In Figure 7(a), the root node of the tree represents the process name of the system, and it is dis- 7 / 15 Volume 66 (2013) Evaluation of Graphical Control Flow Management Approaches for Event-B Modelling tinguished from other event nodes by being connected to the abstract level events using dashed lines only.
    keywords: actd; case; construct; decomposition; event; figure; model; refinement; system; uml
       cache: eceasst-891.pdf
  plain text: eceasst-891.txt

        item: #772 of 858
          id: eceasst-893
      author: David, Alexandre; Larsen, Kim G.; Legay, Axel; Poulsen, Danny Bøgsted
       title: Statistical Model Checking of Dynamic Networks of Stochastic Hybrid Automata
        date: 2014-02-10
       words: 6969
      flesch: 66
     summary: The set of states ST are tuples (M1,...,Mn) with M j ∈ M (S j) describing the multiset of states comprising the currently active instances of template T j. Alternatively, a desired transition s a−→ j P s ′, where a is an input of template T j, may be encoded as a sequence s a−→ j sa o−→ j P, with o being a new output action for T j and s a being a new intermediate state that can only output o while spawning P. Remark 2 For simplicity our theoretical construction does not allow for parameterising tem- plates.
    keywords: automata; checking; hybrid; model; networks; probability; stochastic; systems; template; time; train
       cache: eceasst-893.pdf
  plain text: eceasst-893.txt

        item: #773 of 858
          id: eceasst-894
      author: Alkhammash, Eman; Fathabadi, Asieh Salehi; Butler, Michael; Cirstea, Corina
       title: Building Traceable Event-B Models from Requirements
        date: 2014-02-10
       words: 7027
      flesch: 59
     summary: WRSPM is a model used for the formal- isation of system requirements. Representing requirements using semi-formal artifacts is reasonably simple, and at the same time the movement from the semi-formal artifacts to the Event-B is straightforward.
    keywords: approach; b models; diagrams; event; figure; models; refinement; requirements; uml
       cache: eceasst-894.pdf
  plain text: eceasst-894.txt

        item: #774 of 858
          id: eceasst-895
      author: Hashemi, Vahid; Hermanss, Holger; Turrini, Andrea
       title: On the Efficiency of Deciding Probabilistic Automata Weak Bisimulation
        date: 2014-02-10
       words: 8111
      flesch: 61
     summary: The equivalence of LP problem and weak transition is formalised by Theorem 8 and Corol- lary 9(1) of [HT12]: Proposition 1 One possible way to represent LP problems with real data is to use a model of computation that can perform any elementary arithmetic operation in constant time, regardless of the type of the operand.
    keywords: algorithm; automata; bisimulation; efficiency; flow; network; number; polynomial; probabilistic; problem; transition
       cache: eceasst-895.pdf
  plain text: eceasst-895.txt

        item: #775 of 858
          id: eceasst-896
      author: Stathakidis, Efstathios; Williams, David Moreton; Heather, James
       title: Verifying a Mix Net in CSP
        date: 2014-02-10
       words: 8400
      flesch: 67
     summary: Here we verify that the Mix Net is guaranteed to terminate, outputting a provably valid mix agreed upon by a majority of mix servers, under the assumption that a majority of them act according to the protocol. Usu- ally, a Mix Net consists of a number of mix servers that collectively execute a protocol; most recent Mix Nets rely on a public-key encryption scheme, such as ElGamal [Gam85], that allows re-encryption of ciphertexts.
    keywords: chain; csp; intruder; messages; mix; mix net; mix servers; mixes; mixing; net; process; protocol; servers
       cache: eceasst-896.pdf
  plain text: eceasst-896.txt

        item: #776 of 858
          id: eceasst-897
      author: Morbé, Georges; Scholl, Christoph
       title: Fully Symbolic TCTL Model Checking for Incomplete Timed Systems
        date: 2014-02-10
       words: 9777
      flesch: 65
     summary: Urgent transitions are called eager transi- tions in [BST97], non-urgent transitions are called lazy transitions. In many definitions for TAs found in the literature (e.g. [LPY97]) locations are connected with so-called invariants as an alternative to urgent transitions and urgent actions.
    keywords: checking; discrete; model; set; state; systems; tctl; time; transitions; variables
       cache: eceasst-897.pdf
  plain text: eceasst-897.txt

        item: #777 of 858
          id: eceasst-9
      author: Mezei, Gergely; Lengyel, László; Levendovszky, Tihamér; Charaf, Hassan
       title: A Model Transformation for Automated Concrete Syntax Definitions of Metamodeled Visual Languages
        date: 2006-12-11
       words: 5020
      flesch: 51
     summary: [VMTS] is an n-layer metamodeling environment that unifies the metamodeling techniques used by the common modeling tools, and employs model transformation applying graph rewriting as the underlying mechanism. Although the concept of GMF is straightforward, it has some weaknesses: (i) the generation is not based on model transformation.
    keywords: code; concrete; definitions; model; model transformation; presentation; syntax; transformation; vmts
       cache: eceasst-9.pdf
  plain text: eceasst-9.txt

        item: #778 of 858
          id: eceasst-90
      author: Fish, Andrew; Knapp, Alexander; Störrle, Harald
       title: Proceedings of the Workshop on the Layout of (Software) Engineering Diagrams (LED 2007) - Preface
        date: 2007-09-30
       words: 515
      flesch: 38
     summary: Andrew Fish, Alexander Knapp, and Harald Störrle September 2007 1 / 2 Volume 7 (2007) Programme Committee Ruth Breu, University of Innsbruck Phil Cox, Dalhousie University Holger Eichelberger, University of Hildesheim Wolfgang Glock, mgm technology partners GmbH, Munich John Grundy, University of Auckland Florian Hacklinger, University of Munich John Hosking, University of Auckland Nora Koch, FAST GmbH, Munich Mark Minas, Armed Forces University of Munich Barbara Paech, University of Heidelberg Helen Purchase, University of Glasgow Peter Rodgers, University of Kent Barbara Weber, University of Innsbruck Proc. LED 2007 2 / 2 Addi- tionally, the programme included an invited talk given by John Hosking (University of Aukland, New Zealand) about diagram layout support in meta-modelling tools.
    keywords: diagrams; engineering; university
       cache: eceasst-90.pdf
  plain text: eceasst-90.txt

        item: #779 of 858
          id: eceasst-901
      author: Bergmans, Lodewijk; Mens, Tom; Raemaekers, Steven
       title: Preface of SQM 2014 Proceedings - 8th International Workshop on Software Quality and Maintainability
        date: 2014-02-22
       words: 1073
      flesch: 43
     summary: The quality of software has lots of impact on the involved users, developers and their organisations in several respects: on one hand the correct and consistent behaviour of software systems, and on the other hand the time-to-market, agility and cost-effectiveness of production, maintenance, and opera- tion of the software systems. SQM focuses on the boundaries between theory and practice of software quality.
    keywords: model; quality; software; sqm; workshop
       cache: eceasst-901.pdf
  plain text: eceasst-901.txt

        item: #780 of 858
          id: eceasst-902
      author: De Roover, Coen; Scholliers, Christophe; Jonckers, Viviane; Pérez, Javier; Murgia, Alessandro; Demeyer, Serge
       title: The Implementation of the CHA-Q Meta-Model: A Comprehensive, Change-Centric Software Representation
        date: 2014-02-22
       words: 5920
      flesch: 58
     summary: Changes are modeled as first-class objects that can be analyzed, repeated and reverted (cf. Change). SQM 2014 10 / 15 ECEASST 7.2 Applying Changes In the previous section, we have shown how to implement a custom EntityState.
    keywords: cha; change; class; entity; implementation; meta; model; q meta; representation; software; system
       cache: eceasst-902.pdf
  plain text: eceasst-902.txt

        item: #781 of 858
          id: eceasst-903
      author: Zaytsev, Vadim
       title: Software Language Engineering by Intentional Rewriting
        date: 2014-02-22
       words: 9330
      flesch: 50
     summary: [Zay11] or grammar mutations [Zay12b], cautiously proposing one or two as the practical side dictated. In this paper, we are determined to construct a full-fledged language for large scale gram- mar programming, which would implement grammar mutations.
    keywords: engineering; generalisation; grammar; language; mutations; nonterminal; operator; perform; production; rewriting; rules; software; symbols; transformation; type; xbgf
       cache: eceasst-903.pdf
  plain text: eceasst-903.txt

        item: #782 of 858
          id: eceasst-904
      author: Müller, Klaus; Rumpe, Bernhard
       title: A Model-Based Approach to Impact Analysis Using Model Differencing
        date: 2014-02-22
       words: 7487
      flesch: 58
     summary: A graph traceability approach for software change impact analysis. A review of software change impact analysis.
    keywords: = =; analysis; approach; changes; checklist; class; impact; model; rule; software
       cache: eceasst-904.pdf
  plain text: eceasst-904.txt

        item: #783 of 858
          id: eceasst-905
      author: Wiese, Igor Scaliante; Junior, Douglas Nassif; Ré, Reginaldo; Steinmacher, Igor Fabio; Gerosa, Marco Aurelio
       title: Comparing communication and development networks for predicting file change proneness: An exploratory study considering process and social metrics
        date: 2014-02-22
       words: 7531
      flesch: 59
     summary: To calculate file network metrics, we listed all distinct developers who changed or commented on the file, and calculated the maximum and average value for each developer metric over the semester. An exploratory study considering process and social metrics Moser et al.[MPS08], for example, used code change metrics such as code churn, number of developers, and number of past changes to build prediction models.
    keywords: analysis; changes; communication; development; file; metrics; model; network; number; social; vif
       cache: eceasst-905.pdf
  plain text: eceasst-905.txt

        item: #784 of 858
          id: eceasst-906
      author: Bruntink, Magiel
       title: An Initial Quality Analysis of the Ohloh Software Evolution Data
        date: 2014-02-22
       words: 6398
      flesch: 65
     summary: Our goal is that other researchers, practitioners, and parties responsible for data sets such as Ohloh, use the outcomes of the validation and cleansing steps to improve quality of data sets in the public domain. First, since analysing one data set in isola- tion is limited to internal plausibility and consistency checks, further steps should be made by triangulating, or cross-validating, findings between data sets.
    keywords: cases; cleansing; comments; data; evolution; month; ohloh; project; quality; set; software; source; values
       cache: eceasst-906.pdf
  plain text: eceasst-906.txt

        item: #785 of 858
          id: eceasst-907
      author: Vanderose, Benoît; Ayed, Hajer; Habra, Naji
       title: Implementing a model-driven and iterative quality assessment life-cycle: a case study
        date: 2014-02-22
       words: 6773
      flesch: 43
     summary: However the function of goal-driven measure- ment models may be pushed further by using quality assessment models designed to provide useful information to the different members involved in the development team as a reference regarding quality goals and related efforts. SQM 2014 2 / 15 ECEASST As for goal-driven measurement models, the main objective of quality assessment models is to assist the quality assurance team in the planning and execution of the quality assessment process for a specific development context [Van12].
    keywords: assessment cycle; assessment process; cycle; iterative; mocqa; model; process; quality assessment; quality assurance; software; stakeholders
       cache: eceasst-907.pdf
  plain text: eceasst-907.txt

        item: #786 of 858
          id: eceasst-908
      author: Gonzalez-Barahona, Jesus M.; Izquierdo-Cortazar, Daniel; Robles, Gregorio; del Castillo, Alvaro
       title: Analyzing Gerrit Code Review Parameters with Bicho
        date: 2014-03-01
       words: 4666
      flesch: 60
     summary: This theoretical model has been used to extend the functionality of Bicho, a tool to retrieve information about tickers from issue tracking systems, to retrieve information about code review processes from Gerrit, one of the most popular tools to assist in code review in FLOSS projects. SQM 2014 10 / 12 ECEASST 7 Conclusions and further work In this paper we have shown how systems supporting code review processes can be modeled as a specialized kind of issue tracking systems.
    keywords: bicho; changes; code; gerrit; information; patchset; process; review; time
       cache: eceasst-908.pdf
  plain text: eceasst-908.txt

        item: #787 of 858
          id: eceasst-91
      author: Hosking, John
       title: Confessions of a Meta-Modeller
        date: 2007-09-30
       words: 385
      flesch: 30
     summary: I will then discuss some directions we have been taking to enhance diagram layout capability in our own meta-tool work before examining broader is- sues regarding software tool layout support. His more recent work has concentrated in the area of meta-tools for speci- fying and generating domain specific software tools.
    keywords: meta; tool
       cache: eceasst-91.pdf
  plain text: eceasst-91.txt

        item: #788 of 858
          id: eceasst-910
      author: Koschke, Rainer; Riemann, Ole Jan Lars
       title: Robust Parsing of Cloned Token Sequences
        date: 2014-03-01
       words: 10113
      flesch: 68
     summary: Let E be the set of syntax trees extracted by applying a certain strategy S. Then precision of S is defined as the fraction of derived syntax trees derived by applying S that are correct: |O∩E|/|E|. For this reason, several techniques are based on syntax trees instead.
    keywords: clone; code; input; item; panic; parser; parsing; set; suffix; syntax; token; tree
       cache: eceasst-910.pdf
  plain text: eceasst-910.txt

        item: #789 of 858
          id: eceasst-911
      author: Koschke, Rainer; Göde, Nils; Higo, Yoshiki
       title: Preface to the Proceedings of the Eighth International Workshop on Software Clones
        date: 2014-03-01
       words: 886
      flesch: 30
     summary: Rainer Koschke, Nils Göde, Yoshiki Higo IWSC 2014 Organizing Committee Organizing Committee General Chair Rainer Koschke University of Bremen, Germany PC Co-Chairs Nils Göde CQSE GmbH, Munich, Germany Yoshiki Higo Osaka University, Japan Steering Committee James R. Cordy Queens University, Kingston, Canada Katsuro Inoue Osaka University, Japan Rainer Koschke University of Bremen, Germany Publicity and Web Chair Saman Bazrafshan University of Bremen, Germany Program Committee Hamid Abdul Basit Lahore University of Management Sciences James R. Cordy School of Computing, Queen’s University Mike Godfrey University of Waterloo Nils Göde CQSE GmbH Yoshiki Higo Graduate School of Information Science and Technology, Osaka University Katsuro Inoue Osaka University Elmar Juergens Technische Universität München Toshihiro Kamiya Future University Hakodate Iman Keivanloo Concordia University Rainer Koschke University of Bremen Jens Krinke University College London Thierry Lavoie Ecole Polytechnique de Montreal Angela Lozano Université catholique de Louvain Ettore Merlo Ecole Polytechnique de Montreal Proc. As in previous years, we aimed at a combination of full research papers and position papers.
    keywords: clones; papers; research; software; university
       cache: eceasst-911.pdf
  plain text: eceasst-911.txt

        item: #790 of 858
          id: eceasst-913
      author: Mondal, Manishankar; Roy, Chanchal K.; Schneider, Kevin A.
       title: Late Propagation in Near-Miss Clones: An Empirical Study
        date: 2014-03-01
       words: 7005
      flesch: 65
     summary: While pairs of clone fragments in a particular class might experience late propagation, the whole class might not. 3 Detection of Late Propagation At the very beginning, we assume a global list of clone pairs each of which has the potential of experiencing late propagation. We determined two percentages - (i) the percentage of the clone pairs having clone fragments from different source code files and (ii) the percentage of clone pairs consisting of clone fragments from the same file.
    keywords: clone; clone fragments; code; fragments; method; pair; propagation; study; type
       cache: eceasst-913.pdf
  plain text: eceasst-913.txt

        item: #791 of 858
          id: eceasst-915
      author: Wang, Wei; Godfrey, Michael W.
       title: Investigating Intentional Clone Refactoring
        date: 2014-03-01
       words: 2044
      flesch: 51
     summary: In this position paper, we introduce a dataset of intentional clone refactoring, which is produced by keywords matching in commit messages within the version control system of Linux kernel. -1454,30 +1454,7 @@ out: Figure 1: A commit which indicates intentional clone refactoring in Linux kernel.
    keywords: clone; code; evolution; linux; management; refactoring
       cache: eceasst-915.pdf
  plain text: eceasst-915.txt

        item: #792 of 858
          id: eceasst-916
      author: Hui Mui, Hsiao; Zaidman, Andy; Pinzger, Martin
       title: Studying Late Propagations in Code Clone Evolution Using Software Repository Mining
        date: 2014-04-15
       words: 4964
      flesch: 65
     summary: Keywords: code clone evolution, late propagation, software repository mining, bugs 1 Introduction Research in the area of code clones has shown that 7% to 23% of the code in large software systems contains duplicated source code fragments [1, 2]. Research has long focused on techniques for (a) finding and (b) subsequently refactoring code clones [5], how- ever, more recently, the code clone evolution research community has taken interest in managing code clones, rather than refactoring them [6, 7].
    keywords: changes; clone; code; distance; evolution; late; propagation; software; study
       cache: eceasst-916.pdf
  plain text: eceasst-916.txt

        item: #793 of 858
          id: eceasst-917
      author: Khan, Mohammad Asif A.; Schneider, Kevin A; Roy, Chanchal K
       title: Active Clones: Source Code Clones at Runtime
        date: 2014-03-01
       words: 8343
      flesch: 66
     summary: However, our intention of this study is to only focus on test specific clones during the maintenance of that related functionality, and it is obvious that there will be a reduction of active clones (hence the reduction of active clone classes) for maintenance as evident by our results. Active Clones: Source Code Clones at Runtime Electronic Communications of the EASST Volume 63 (2014) Proceedings of the Eighth International Workshop on Software Clones (IWSC 2014) Active Clones: Source Code Clones at Runtime Mohammad Asif A. Khan, Chanchal K. Roy and Kevin A. Schneider 18 pages Guest Editors: Nils Göde, Yoshiki Higo, Rainer Koschke Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN
    keywords: analysis; clones; code; execution; files; maintenance; metrics; number; proc; runtime; software; system; test; trace; use
       cache: eceasst-917.pdf
  plain text: eceasst-917.txt

        item: #794 of 858
          id: eceasst-92
      author: Stapleton, Gem; Rodgers, Peter; Howse, John; Taylor, John
       title: Properties of Euler Diagrams
        date: 2007-09-30
       words: 6538
      flesch: 67
     summary: UK Abstract: Euler diagrams have numerous application areas, with a large variety of languages based on them. In all of these ap- plication areas, it is desirable to provide tools to layout Euler diagrams, ideally in a nice way.
    keywords: curves; definition; diagram; euler; euler diagrams; figure; interior; point; properties; property; set
       cache: eceasst-92.pdf
  plain text: eceasst-92.txt

        item: #795 of 858
          id: eceasst-920
      author: Dean, Thomas Roy; Chen, Jian; Alalfi, Manar H
       title: Clone Detection in Matlab Stateflow Models
        date: 2014-03-24
       words: 3936
      flesch: 60
     summary: In previous model clone types categorization by our research group [ACD+12a], three types of model clones are defined: • Type 1 (exact) model clones are identical model fragments, ignoring variations in visual presentation, layout, and formatting. 3 Related Work While code clone detection was extensively researched [RCK09], research on model clones iden- tification has received less attention [DHJ+10].
    keywords: attributes; clone; detection; figure; model; simulink; state; stateflow
       cache: eceasst-920.pdf
  plain text: eceasst-920.txt

        item: #796 of 858
          id: eceasst-921
      author: Yoshida, Norihiro; Choi, Eunjong; Yamanaka, Yuki; Inoue, Katsuro
       title: How We Know the Practical Impact of Clone Analysis
        date: 2014-03-01
       words: 1985
      flesch: 53
     summary: How We Know the Practical Impact of Clone Analysis Norihiro Yoshida1, Eunjong Choi 2, Yuki Yamanaka 2, Katsuro Inoue 2 1 yoshida@is.naist.jp Graduate School of Information Science Nara Institute of Science and Technology, Japan 2 ejchoi, y-yuuki, inoue@ist.osaka-u.ac.jp Graduate School of Information Science and Technology Osaka University, Japan Abstract: In order to develop and improve clone analysis techniques for industrial application, it is necessary to know about how those techniques provide impacts on clone management in industry. The clone research community has provided a greater number of industrial case studies on clone analysis techniques compared to other analytics research fields [JDHW09, HG13, YHKI12].
    keywords: analysis; clone; code; sets; software; techniques
       cache: eceasst-921.pdf
  plain text: eceasst-921.txt

        item: #797 of 858
          id: eceasst-922
      author: Hotta, Keisuke; Yang, Jiachen; Higo, Yoshiki; Kusumoto, Shinji
       title: How Accurate Is Coarse-grained Clone Detection?: Comparision with Fine-grained Detectors
        date: 2014-03-01
       words: 7612
      flesch: 71
     summary: As a result, a variety of clone detectors have been developed and used [RBS13, RC07, Bak95, BYLB98, KKI02, MLM96, DRD99, HJHC10, RC08, JMSG07]. [GK11]. 2.3 Comparison between Clone Detectors One of the benchmarks on clone detectors is the one conducted by Bellon and his colleagues [BKA+07].
    keywords: analysis; clone; clone detection; coarse; code; detection; detector; precision; projects; results; software; study
       cache: eceasst-922.pdf
  plain text: eceasst-922.txt

        item: #798 of 858
          id: eceasst-923
      author: Lavoie, Thierry; Merlo, Ettore
       title: About Metrics for Clone Detection
        date: 2014-07-26
       words: 2048
      flesch: 67
     summary: Moreover, metrics lead to known opportunity of optimizations in search spaces that arbitrary distances do not offer [CPZ97]. For a comprehensive survey of many distances and metrics, the reader is invited to read [CC10].
    keywords: distance
       cache: eceasst-923.pdf
  plain text: eceasst-923.txt

        item: #799 of 858
          id: eceasst-924
      author: Moriwaki, Takuya; Igaki, Hiroshi; Yamanaka, Yuki; Yoshida, Norihiro; Kusumoto, Shinji; Inoue, Katsuro
       title: Towards an Analysis of Who Creates Clone and Who Reuses it
        date: 2014-03-01
       words: 2019
      flesch: 53
     summary: In this paper, we propose a method for code reuse analysis which takes particular note of the differences among individuals. Keywords: source code reuse, code clone, clone evolution, code reuse analysis 1 Introduction In the software industry and OSS(Open Source Software) projects, it is said that adequate code reuse could improve productivity and reliability of software development, and reduce devel- opment time[Lim94].
    keywords: analysis; clone; code; developers; reuse; source
       cache: eceasst-924.pdf
  plain text: eceasst-924.txt

        item: #800 of 858
          id: eceasst-926
      author: Kanda, Tetsuya; German, Daniel Morales; Ishio, Takashi; Inoue, Katsuro
       title: Measuring Copying of Java Archives
        date: 2014-03-13
       words: 2551
      flesch: 63
     summary: 3.3 Detecting Duplication To find the two types of duplication inside jar files, we checked inner jar files using the following method: Yes, 10% of jar files which have inner jar files contains duplicated jar files.
    keywords: duplication; files; jar; libraries; library; software
       cache: eceasst-926.pdf
  plain text: eceasst-926.txt

        item: #801 of 858
          id: eceasst-928
      author: Abebe, Surafel Lemma; Arnaoudova, Venera; Eshkevari, Laleh; Sabane, Aminata; Wu, Wei
       title: Special Issue of PPAP 2013: Preface
        date: 2014-07-01
       words: 1230
      flesch: 46
     summary: We researchers must observe more; new patterns/anti-patterns must be defined based on the good/poor practices of practitioners rather than only to promote/prevent existing patterns/anti-patterns. His talk was about the effect of design patterns on software maintainability: Title: Myth or Reality?
    keywords: anti; design; patterns; ppap; software
       cache: eceasst-928.pdf
  plain text: eceasst-928.txt

        item: #802 of 858
          id: eceasst-929
      author: Basit, Hamid Abdul; Dajsuren, Yanja
       title: Handling Clone Mutations in Simulink Models with VCL
        date: 2014-03-13
       words: 2861
      flesch: 53
     summary: Model clones can also occur across multiple layers [1]. IWSC 2014 3 / 8 challenge is to unify all types of possible differences between model clones with a single variability management technique.
    keywords: clone; management; model; simulink; software; variability; variants; vcl
       cache: eceasst-929.pdf
  plain text: eceasst-929.txt

        item: #803 of 858
          id: eceasst-93
      author: von Pilgrim, Jens
       title: Mental Map and Model Driven Development
        date: 2007-09-30
       words: 7287
      flesch: 70
     summary: We have four models: source domain model (the use case model), target domain model (the class model), source notation model, and trace model (created by the transformation as well). 1 / 16 Volume 7 (2007) Mental Map and MDD is stored in an extra model, called notation model.
    keywords: e r; e t; l e; model; s e; s t; u s
       cache: eceasst-93.pdf
  plain text: eceasst-93.txt

        item: #804 of 858
          id: eceasst-930
      author: Jaafar, Fehmi; Guéhéneuc, Yann-Gaël; Hamel, Sylvie; khomh, foutse
       title: Analysing Anti-patterns Static Relationships with Design Patterns
        date: 2014-04-15
       words: 11062
      flesch: 58
     summary: [BSW+03] ex- plored whether the relative stability of design pattern classes compared to other classes were being empirically realized. The proportion of classes changed at least once between two releases is not different between design pattern classes participating or not in a static relationship with at least one anti-pattern.
    keywords: anti; argouml; change; classes; code; design patterns; detection; fault; patterns; proneness; relationships; smells; software; study; systems; use; version; xercesj
       cache: eceasst-930.pdf
  plain text: eceasst-930.txt

        item: #805 of 858
          id: eceasst-932
      author: Kamiya, Toshihiro
       title: Toward a Code-Clone Search through the Entire Lifecycle of a Software Product
        date: 2014-03-24
       words: 2109
      flesch: 72
     summary: This tool is useful as a code-clone search through the entire lifecycle of a software product; The tool searches code examples and analyzes of code clones in both preventive and postmortem ways[LRHK10]. The tool will support searching a similar code at each stage of the entire lifecycle of a software product, that is, (1) a code example search will be executed even when no (or a very small volume of) code of a product has been written, (2) preventively (or instant)[LRHK10], i.e., in an automatic code-clone search to encourage code reuse by searching code fragments similar to the code written by a developer, and (3) postmortem[LRHK10]; i.e., in the code-clone search for a refactoring[BYM+98][HKKI04][ZR11] or a consistent code modification[Kri07].
    keywords: clone; code; detection; proc; product; search; tool
       cache: eceasst-932.pdf
  plain text: eceasst-932.txt

        item: #806 of 858
          id: eceasst-933
      author: Lozano, Angela; Jaafar, Fehmi; Mens, Kim; Guéhéneuc, Yann Gaël
       title: Clones and Macro co-changes
        date: 2014-04-15
       words: 6341
      flesch: 73
     summary: 4.4 Co-changes, Clones, and Bugs Although a high percentage of cloned files change during bug-fixes, a small percentage of these files also macro co-change during bug-fixes, 25% being the highest value for approximate macro co-changes in JFreeChart and 1% the lowest value for approximate macro co-changes in OpenSER. However, the formula2 proposed to express co-change relations in function of cloning relations was not statistically significant [GFGP06].
    keywords: bug; changes; clones; code; files; fragments; macro; proc; time
       cache: eceasst-933.pdf
  plain text: eceasst-933.txt

        item: #807 of 858
          id: eceasst-938
      author: Zambon, Eduardo; Rensink, Arend
       title: Solving the N-Queens Problem with GROOVE - Towards a Compendium of Best Practices
        date: 2014-08-18
       words: 6387
      flesch: 63
     summary: Of course, for isomorphism checks to be effective, state graphs need to contain a certain degree of symmetry. Solving the N-Queens Problem with GROOVE – Towards a Compendium of Best Practices Eduardo Zambon and Arend Rensink 13 pages Guest Editors: Frank Hermann, Stefan Sauer Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Solving the N-Queens Problem with GROOVE – Towards a Compendium of Best Practices Eduardo Zambon1 and Arend Rensink2 1zambon@inf.ufes.br Department of Computer Science and Electronics (DCEL/CEUNES) Federal University of Espirito Santo (UFES), Brazil 2arend.rensink@utwente.nl Formal Methods and Tools Group Department of Computer Science University of Twente, The Netherlands Abstract: We present a detailed solution to the N-queens puzzle using GROOVE, a graph transformation tool especially designed for state space exploration and anal- ysis.
    keywords: board; edges; graph; groove; node; problem; queens; rule; solution; space; state; tool
       cache: eceasst-938.pdf
  plain text: eceasst-938.txt

        item: #808 of 858
          id: eceasst-939
      author: Leblebici, Erhan; Anjorin, Anthony; Schürr, Andy; Hildebrandt, Stephan; Rieke, Jan; Greenyer, Joel
       title: A Comparison of Incremental Triple Graph Grammar Tools
        date: 2014-08-18
       words: 7295
      flesch: 51
     summary: Section 4 provides our cri- teria for a qualitative assessment of incremental TGG tools. We encourage TGG researchers to extend our comparison with new incremental TGG tools in the future.
    keywords: + +; algorithm; comparison; elements; graph; model; mote; rule; target; tgg; tools; triple; update
       cache: eceasst-939.pdf
  plain text: eceasst-939.txt

        item: #809 of 858
          id: eceasst-94
      author: Rayside, Derek; Chang, Felix; Dennis, Greg; Seater, Robert; Jackson, Daniel
       title: Automatic Visualization of Relational Logic Models
        date: 2007-09-30
       words: 6128
      flesch: 56
     summary: Since Alloy models do not have an intrinsic notion of time, models involving state changes are often represented using higher-order relations. 3 Properties As illustrated in the above example, solutions to Alloy models are rendered visually as a directed graph, where each node represents an element in a set, and edge is a tuple in a relation.
    keywords: alloy; default; expert; model; nodes; relations; set; state; theme; user; visualization
       cache: eceasst-94.pdf
  plain text: eceasst-94.txt

        item: #810 of 858
          id: eceasst-941
      author: Stückrath, Jan; Weyers, Benjamin
       title: Lattice-extended Coloured Petri Net Rewriting for Adaptable User Interface Models
        date: 2014-08-18
       words: 6495
      flesch: 63
     summary: The minimal pushout complement us- ing the lattice shown in Figure 3c {a,b} {a} ∅ (c) Hasse diagram of a lattice Figure 3: A preservation-focused rule application using two different (distributive) lattices In general a preservation-focused rewriting step generates a set of rewritten nets, but we can state the following uniqueness criterion. Lattice-extended Coloured Petri Net Rewriting for Adapt- able User Interface Models.
    keywords: figure; inscriptions; lattice; net; petri; pushout; rewriting; rule; user
       cache: eceasst-941.pdf
  plain text: eceasst-941.txt

        item: #811 of 858
          id: eceasst-943
      author: Wang, Xiaoliang; Büttner, Fabian; Lamo, Yngve
       title: Verification of Graph-based Model Transformations Using Alloy
        date: 2014-08-18
       words: 6472
      flesch: 60
     summary: Such model trans- formations are usually executed by applying model transformation rules on models. Each component, metamodel (including structure and constraints) and model transformation rules, can be encoded in relational logic.
    keywords: alloy; approach; condition; constraints; elements; graph; model; model transformation; rule; source; system; target; transformation; verification
       cache: eceasst-943.pdf
  plain text: eceasst-943.txt

        item: #812 of 858
          id: eceasst-945
      author: Deckwerth, Frederik; Varró, Gergely
       title: Generating Preconditions from Graph Constraints by Higher Order Graph Transformation
        date: 2014-08-18
       words: 6671
      flesch: 60
     summary: , if for any arbitrary model M and all possible applications M r⇒M′ of rule r holds: If M is consistent then M′ is also consistent. A postcondition NAC N. of the RHS pattern R of rule r and the negative constraint NC, is discarded if either of the following conditions is fulfilled: (i) Preserving Condition.
    keywords: application; graph; nacs; order; pattern; postcondition; rhs; rule; transformation
       cache: eceasst-945.pdf
  plain text: eceasst-945.txt

        item: #813 of 858
          id: eceasst-948
      author: Brenner, Christian; Greenyer, Joel; Holtmann, Jörg; Liebel, Grischa; Stieglbauer, Gerald; Tichy, Matthias
       title: ScenarioTools Real-Time Play-Out for Test Sequence Validation in an Automotive Case Study
        date: 2014-08-18
       words: 7126
      flesch: 60
     summary: The algorithm will repeat sending system messages until no active MSDs with active system messages remain. Here we consider only synchronous messages where the sending and the receiving of the message together form a single event, which we call message event or simply event.
    keywords: clock; conditions; cut; gear; message; msd; msds; play; requirements; scenariotools; sequence; state; time
       cache: eceasst-948.pdf
  plain text: eceasst-948.txt

        item: #814 of 858
          id: eceasst-949
      author: Hermann, Frank; Sauer, Stefan
       title: 13th International Workshop on Graph Transformation and Visual Modeling Techniques (GTVMT 2014): Preface
        date: 2014-08-18
       words: 1601
      flesch: 32
     summary: In model-driven software engineering (MDE), model queries are core technologies of many tool and transformation-specific challenges such as design rule validation, model synchro- nization, view maintenance, simulation and many more. As a solution he presented incremental model queries.
    keywords: germany; graph; model; modelling; systems; techniques; university; workshop
       cache: eceasst-949.pdf
  plain text: eceasst-949.txt

        item: #815 of 858
          id: eceasst-95
      author: Adachi, Yoshihiro; Furusawa, Yudai
       title: Logichart: A Prolog Program Diagram and its Layout
        date: 2007-09-30
       words: 6173
      flesch: 66
     summary: Some practical studies on formalizing the syntax of the program diagrams of imperative pro- gramming languages (e.g., Pascal, C) in terms of attribute graph grammars have already been presented [7, 9]. Furthermore, our present study is the first to discuss the minimum-area layout of program diagrams under specific layout conditions and to formalize it as the semantic rules of attribute graph grammar. Proc. LED 2007 2 / 16 ECEASST 2 Prolog program visualization 2.1 Logichart diagrams Prolog is generally an interpreted language, although compiler implementations do exist.
    keywords: grammar; graph; layout; logichart; node; prolog; rules
       cache: eceasst-95.pdf
  plain text: eceasst-95.txt

        item: #816 of 858
          id: eceasst-950
      author: Hussein, Mudhafar; Heckel, Reiko; Danos, Vincent; Sobocinski, Pawel
       title: Modelling Adaptive Networks: The Case of the Petrified Voters
        date: 2014-08-18
       words: 5484
      flesch: 60
     summary: Its places represent graph patterns, with tokens as pattern occurrences, while rules are modelled by net transitions. An observable is a real-valued function on state graphs.
    keywords: constraints; fig; graph; networks; patterns; petri; refinement; rule; state; transformation
       cache: eceasst-950.pdf
  plain text: eceasst-950.txt

        item: #817 of 858
          id: eceasst-952
      author: Tausch, Norbert; Philippsen, Michael
       title: A Modular and Statically Typed Effectful Stack for Custom Graph Traversals
        date: 2014-10-07
       words: 7863
      flesch: 70
     summary: Together with monadic data types, monadic type classes provide the necessary modularity that allows the query programmer to freely combine the desired effect computations. For both, we extend monad transformers (that are also monads) and type classes.
    keywords: class; classes; collection; effect; graph; level; map; monadic; stack; traversal; type; value; vertex
       cache: eceasst-952.pdf
  plain text: eceasst-952.txt

        item: #818 of 858
          id: eceasst-953
      author: Padberg, Julia; Schulz, Alexander
       title: Towards Model Checking Reconfigurable Petri Nets using Maude
        date: 2014-10-07
       words: 7555
      flesch: 77
     summary: Reconfigurable Petri nets form a family (e.g., in [EP03, LO04, EHP+07, PEHP08, KCD10, Mod12, Gab14]) depending on the underlying kind of Petri net and have been applied in various application areas where complex coordination and structural adaptation at run-time is required (e.g., mobile ad-hoc networks, communication spaces, ubiquitous computing, workflows in a dynamic infrastructure). Keywords: Reconfigurable Petri nets, RECONNET, Maude, model checking, LTL 1 Motivation Software systems are increasingly characterized by dynamic structures that require execution and reconfiguration at run-time to adjust the system’s behavior to its changing environment.
    keywords: e t; l e; n e; n s; p l; p r; r e; s t; t r
       cache: eceasst-953.pdf
  plain text: eceasst-953.txt

        item: #819 of 858
          id: eceasst-955
      author: Padberg, Julia; Blumreiter, Mathias
       title: Non-Deterministic Matching Algorithm for Net Transformations
        date: 2014-10-07
       words: 7059
      flesch: 71
     summary: The rules rulenew,T |P perform a lookahead of size two as it checks the amount of adjacent nodes in the residual node sets. rulein|out,P(sn, p1, p2) ≡ |{t1 | t1 ∈ T in|out T1 ∧ post1(t1)|p1 > 0}|≤ |{t2 | t2 ∈ T in|out T2 ∧ post2(t2)|p2 > 0}| ∧|{t1 | t1 ∈ T in|out T1 ∧ pre1(t1)|p1 > 0}|≤ |{t2 | t2 ∈ T in|out T2 ∧ pre2(t2)|p2 > 0}| rulein|out,T (sn,t1,t2) ≡ |{p1 | p1 ∈ T in|out P1 ∧ pre1(t1)|p1 > 0}| 2 Reconfigurable Petri Nets We use the algebraic approach to Petri nets, so a marked place/transition net is given by N = (P,T, pre, post,m) with pre- and post-domain functions pre, post : T → P⊕ and a marking m∈ P⊕, where P⊕ is the free commutative monoid over the set P of places.
    keywords: algorithm; match; morphism; net; nets; non; petri; places; transitions
       cache: eceasst-955.pdf
  plain text: eceasst-955.txt

        item: #820 of 858
          id: eceasst-956
      author: Westfechtel, Bernhard; Tichy, Matthias
       title: Preface
        date: 2014-10-01
       words: 529
      flesch: 44
     summary: Artur Boronat, University of Leicester (UK) • Claudia Ermel, Technical University of Berlin (Germany) • Joel Greenyer, University of Hannover (Germany) • Esther Guerra, Universidad Autónoma de Madrid (Spain) • Dimitris Kolovos, University of York (UK) • Christian Krause, SAP Innovation Center Potsdam (Germany) • Tihamér Levendovszky, Vanderbilt University (USA) • Mark Minas, Universität der Bundeswehr München (Germany) • Arend Rensink, University of Twente (The Netherlands) Gabriele Taentzer, Philipps-Universität Marburg (Germany) • Matthias Tichy, Chalmers University / University of Gothenburg (Sweden) • Pieter Van Gorp, Eindhoven University of Technology (The Netherlands) • Hans Vangheluwe, University of Antwerp (Belgium) /
    keywords: grabats; graph; university
       cache: eceasst-956.pdf
  plain text: eceasst-956.txt

        item: #821 of 858
          id: eceasst-957
      author: Kulcsár, Géza; Stein, Michael; Schweizer, Immanuel; Varró, Gergely; Mühlhäuser, Max; Schürr, Andy
       title: Rapid Prototyping of Topology Control Algorithms by Graph Transformation
        date: 2014-10-07
       words: 5689
      flesch: 59
     summary: The weight increase condition r(w,w′,a) expresses that either the ratio or the difference of overlay edge weights w and w′ can be at most as large as constant a. As e1 = (v1,b) is marked, overlay edge (v1,b) has to be recalculated ((b,b) not as it is a loop).
    keywords: application; control; edge; global; graph; networks; node; overlay; topology; transformation; variant
       cache: eceasst-957.pdf
  plain text: eceasst-957.txt

        item: #822 of 858
          id: eceasst-958
      author: Heindel, Tobias; Danos, Vincent; Honorato-Zimmer, Ricardo; Stucki, Sandro
       title: Mean Quantitative Coverability in Stochastic Graph Transformation Systems
        date: 2014-10-01
       words: 899
      flesch: 43
     summary: Mean Quantitative Coverability in Stochastic Graph Transformation Systems Vincent Danos, Tobias Heindel, Ricardo Honorato-Zimmer, Sandro Stucki 2 pages Guest Editors: Matthias Tichy, Bernhard Westfechtel Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Mean Quantitative Coverability in Stochastic Graph Transformation Systems∗ Vincent Danos1, Tobias Heindel1, Ricardo Honorato-Zimmer1, Sandro Stucki2 School of Informatics, University of Edinburgh, Edinburgh, United Kingdom1 Programming Methods Laboratory, EPFL, Lausanne, Switzerland2 Abstract: Many classical problems for Petri nets, in particular reachability and cov- erability, have obvious counterparts for graph transformation systems. For stochastic graph transformation systems (SGTS)
    keywords: coverability; graph; stochastic; transformation
       cache: eceasst-958.pdf
  plain text: eceasst-958.txt

        item: #823 of 858
          id: eceasst-959
      author: Fredlund, Lars-Åke
       title: Proceedings of the XIII Spanish Conference on Programming and Computer Languages (PROLE 2013)
        date: 2014-10-10
       words: 460
      flesch: 36
     summary: Proceedings of the XIII Spanish Conference on Programming and Computer Languages (PROLE 2013) Preface 2 pages Guest Editors: Clara Benac Earle, Laura Castro, Lars-Åke Fredlund Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Preface Alpuente Albert Oliveras Anindya Banerjee Fernando Orejas Miquel Bofill Yolanda Ortega Manuel Carro Francisco Ortı́n Laura M. Castro Ricardo Peña Marı́a del Mar Gallardo Fernando Rosa Velardo Francisco Duran Julio Rubio Samir Genaim Fernando Sáenz Pérez Paqui Lucio Josep Silva Julio Mariño Alicia Villanueva Ginés Moreno External Reviewers Javier Álvez Jose Morales Giovanni Bacci Adrián Riesco Clara Benac Earle Ricardo Rodrı́guez Javier Espert Ilya Sergey Rémy Haemmerlé Salvador Tamarit Montserrat Hermo Antonio Becerra Terón David Insa Luca Torella Marı́a Martos-Salgado Programme Chair Lars-Åke Fredlund Proc.
    keywords: computer; programming; prole; spanish
       cache: eceasst-959.pdf
  plain text: eceasst-959.txt

        item: #824 of 858
          id: eceasst-96
      author: Maier, Sonja; Minas, Mark
       title: A Pattern-Based Layout Algorithm for Diagram Editors
        date: 2007-09-30
       words: 6831
      flesch: 58
     summary: 6.1.2 Framework This section completes the description of DIAMETA and outlines its environment supporting specification and code generation of diagram editors that are tailored to specific diagram lan- guages. 13 / 16 Volume 7 (2007) Pattern-Based Layout Editor developer Diagram editor DiaMeta editor framework DiaMeta DesignerDiaMeta Generated program code EMF Compiler operates ECore Modeller ECore Specification operates DiaMeta Layout Generator Generated Program code Editor Specification Layout Specification Figure 13: Generating diagram editors with DIAMETA by using the EMF modeler.
    keywords: algorithm; attribute; constraints; diagram; diameta; editor; layout; model; pattern; specification; user
       cache: eceasst-96.pdf
  plain text: eceasst-96.txt

        item: #825 of 858
          id: eceasst-961
      author: Dittmar, Anke; Schachtschneider, Reik
       title: Lightweight Interaction Modeling in Evolutionary Prototyping
        date: 2014-10-25
       words: 5149
      flesch: 53
     summary: A deliberate integration of formal methods into design processes is often suggested to mitigate these limitations and to increase the acceptance of formal approaches beyond domains such as the domain of safety-critical systems. The paper particularly considers design processes that involve a tight inter- play between problem setting and problem solving [Sch83].
    keywords: design; evolutionary; figure; hops; interaction; models; options; process; prototype; prototyping; tiles
       cache: eceasst-961.pdf
  plain text: eceasst-961.txt

        item: #826 of 858
          id: eceasst-962
      author: Harrison, Michael D.; Masci, Paolo; Campos, Jose Creissac; Curzon, Paul
       title: Automated theorem proving for the systematic analysis of an infusion pump
        date: 2014-10-25
       words: 5388
      flesch: 56
     summary: The paper indicates how MAL models can be translated into PVS, and CTL properties can be translated into PVS theorems. It is also concerned with adding tools to the IVY toolkit to enable the automatic development of PVS specifications based on MAL models and assistance with the proofs of these properties.
    keywords: analysis; checking; infusion; model; post; properties; proving; pump; pvs; theorem; topline(st; volume
       cache: eceasst-962.pdf
  plain text: eceasst-962.txt

        item: #827 of 858
          id: eceasst-963
      author: Oladimeji, Patrick; Masci, Paolo; Curzon, Paul; Thimbleby, Harold
       title: PVSio-web: a tool for rapid prototyping device user interfaces in PVS
        date: 2014-10-25
       words: 3754
      flesch: 55
     summary: Our ul- timate aim is to promote and facilitate the use of formal verification tools when developing device user interfaces. The main contribution of this paper is to present a novel graphical environment, PVSio-web [pvs], for rapid prototyping of device user interfaces in PVS [ORR+96].
    keywords: device; display; end; interface; prototyping; pvsio; specification; user; web
       cache: eceasst-963.pdf
  plain text: eceasst-963.txt

        item: #828 of 858
          id: eceasst-964
      author: Rukšėnas, Rimvydas; Masci, Paolo; Harrison, Michael D.; Curzon, Paul
       title: Developing and Verifying User Interface Requirements for Infusion Pumps: A Refinement Approach
        date: 2014-10-25
       words: 5948
      flesch: 60
     summary: For user interface requirements, refinement is made more complex by the fact that systems can use different interaction devices that have very different characteristics. The requirements hierarchy layer, which is directly relevant to regulators, concerns the de- velopment of user interface requirements.
    keywords: alaris; data; device; end; entry; event; interface; machine; refinement; requirements; user
       cache: eceasst-964.pdf
  plain text: eceasst-964.txt

        item: #829 of 858
          id: eceasst-965
      author: Cerone, Antonio; Zhao, Yishi
       title: Stochastic Modelling and Analysis of Driver Behaviour
        date: 2014-10-25
       words: 5921
      flesch: 62
     summary: f f ected and transition to state NotA f f ectedW , without any effect on the future behaviour of the driver from the West. Stochastic Modelling and Analysis of Driver Behaviour Antonio Cerone Yishi Zhao 13 pages Guest Editors: Judy Bowen, Steve Reeves Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST Stochastic Modelling and Analysis of Driver Behaviour Antonio Cerone1 2 ∗ Yishi Zhao1 3 † 1 UNU-IIST — International Institute for Software Technology United Nations University, Macau SAR China 2 cerone@di.unipi.it Dipartimento di Informatica, University of Pisa, Pisa, Italy 3 yishi.zhao@gmail.com Abstract: Driver behaviour is considered a key factor in the majority of car ac- cidents.
    keywords: action; cars; driver; f f; junction; probability; state; transition; west
       cache: eceasst-965.pdf
  plain text: eceasst-965.txt

        item: #830 of 858
          id: eceasst-966
      author: Bowen, Judy; Reeves, Steve
       title: Preface to the proceedings of FMIS 2013
        date: 2015-04-05
       words: 612
      flesch: 46
     summary: Preface Judy Bowen and Steve Reeves 3 Pages ECEASST 2 / 3 Volume 69 (2013) Preface Judy Bowen and Steve Reeves University of Waikato As for the four previous editions, this fifth edition of the International Workshop on Formal Methods for Interactive Systems (FMIS 2013) is a forum for the presentation and discussion of research into the interface between formal methods and interactive system design. The first paper discusses an integration of evolving and prototyping of interactive systems by a “lightweight” use of formal modelling.
    keywords: methods; paper; system
       cache: eceasst-966.pdf
  plain text: eceasst-966.txt

        item: #831 of 858
          id: eceasst-967
      author: Silva, José-Luis; Fayollas, Camille; Hamon, Arnaud; palanque, Philippe; Martiinie, Célia; Barboni, Eric
       title: Analysis of WIMP and Post WIMP Interactive Systems based on Formal Specification
        date: 2014-11-04
       words: 6097
      flesch: 51
     summary: ECEASST 10 / 15 Volume 69 (2013) Figure 6 – ICO low level event transducer model Figure 7 – ICO pinch interaction model In this configuration, two low level events may be handled:  toucheventf_down: another toucheventf_down received event behaves the same way on the PetriNet. Finally, colored Petri nets (CPN) is the more complete approach in terms of analysis enabling validation, verification and performance analysis accomplished by all the different types of analysis techniques except invariant.
    keywords: analysis; cpn; event; figure; formal; graph; ico; interaction; model; properties; property; systems; wimp
       cache: eceasst-967.pdf
  plain text: eceasst-967.txt

        item: #832 of 858
          id: eceasst-968
      author: Hahn, Ernst Moritz; Hartmanns, Arnd; Hermanns, Holger
       title: Reachability and Reward Checking for Stochastic Timed Automata
        date: 2014-11-18
       words: 8380
      flesch: 67
     summary: Axp that may include probability distributions. As the values of clocks are explicit in TPTS, timed properties can be specified by referring to these values directly in the characterisation of B, e.g. referring to an extra clock that is never reset to specify time bounds.
    keywords: automata; bounds; checking; example; model; probability; pta; reachability; reward; sta; stochastic; time; values
       cache: eceasst-968.pdf
  plain text: eceasst-968.txt

        item: #833 of 858
          id: eceasst-969
      author: Intana, Adisak; Poppleton, Michael R.; Merrett, Geoff V.
       title: A Formal Co-Simulation Approach for Wireless Sensor Network Development
        date: 2014-11-18
       words: 6902
      flesch: 49
     summary: (a) SensorApp co-models (b) MintRoute co-models Figure 7: Co-simulation models. Figure 1: Vision of co-simulation approach for WSN development In this work, our FoCoSim-WSN framework cosimulates between node controller models on the Event-B simulation and sensor environment models on MiXiM simulation.
    keywords: controller; development; environment; event; figure; framework; mixim; model; network; node; protocol; sensor; simulation; style
       cache: eceasst-969.pdf
  plain text: eceasst-969.txt

        item: #834 of 858
          id: eceasst-97
      author: Störrle, Harald
       title: The LED Diagram Layout Challenge
        date: 2007-09-30
       words: 282
      flesch: 66
     summary: And, apparently, the gift of spot- ting bad layouts is equally rare, for even in respected journals there are extremely bad layouts. With this semi-serious event, the first of its kind, we aim at improving our understanding of the qualities of layouts and how to achieve them practically.
    keywords: layout
       cache: eceasst-97.pdf
  plain text: eceasst-97.txt

        item: #835 of 858
          id: eceasst-970
      author: Arcaini, Paolo; Gargantini, Angelo; Riccobene, Elvinia
       title: Using SMT for dealing with nondeterminism in ASM-based runtime verification
        date: 2014-11-18
       words: 7063
      flesch: 59
     summary: ASM states are modified by transition relations specified by “rules” describing the modification of the function interpretations from one state to the next one. We call confSet(sn) the set of ASM states reachable in n steps and conformant with sn.
    keywords: asm; coma; conformance; context; java; level; monitoring; nondeterminism; runtime; smt; state; step; verification
       cache: eceasst-970.pdf
  plain text: eceasst-970.txt

        item: #836 of 858
          id: eceasst-972
      author: Huisman, Marieke; van de Pol, Jaco
       title: Preface
        date: 2014-11-18
       words: 728
      flesch: 20
     summary: • Temesghen Kahsai, NASA Ames Research Center, U.S.A. • Gerald Luettgen, University of Bamberg, Germany • Radu Mateescu, INRIA Grenoble – Rhône-Alpes, France • Stephan Merz, INRIA Nancy & LORIA, France • Markus Roggenbach, Swansea University, U.K. • Marco Roveri, FBK-irst, Italy • Thomas Santen, Microsoft Research, Germany • Bernard Steffen, Technical University Dortmund, Germany • Jan Strejček, Masaryk University, Czech Republic • Jun Sun, Singapore University of Technology and Design, Singapore • Tayssir Touili, LIAFA, CNRS & University Paris Diderot, France • Workshop Programme Chairs November 2014 Marieke Huisman University of Twente Jaco van de Pol 1 / 3 Volume 70 (2014) Preface Programme Committee • John Derrick, University of Sheffield, U.K. • Mike Dodds, University of York, U.K. • Wan Fokkink, Vrije Universiteit Amsterdam, Netherlands • Michael Goldsmith, University of Oxford, U.K. • Jan Friso Groote, Eindhoven University of Technology, Netherlands • Anne Haxthausen, Technical University of Denmark, Denmark • Keijo Heljanko, Aalto University, Finland • Marieke Huisman, University of Twente, Netherlands (co-chair)
    keywords: systems; twente; u.k; university; workshop
       cache: eceasst-972.pdf
  plain text: eceasst-972.txt

        item: #837 of 858
          id: eceasst-973
      author: Reimer, Sven; Sauer, Matthias; Marin, Paolo; Becker, Bernd
       title: QBF with Soft Variables
        date: 2014-11-18
       words: 8937
      flesch: 64
     summary: From the result of the QBF with soft variables problem Ω(ψ′) In this paper we extend that classical definition and consider a new quantification type which we call soft variable.
    keywords: clauses; function; inputs; level; maxqbf; number; optimization; prefix; problem; qbf; score; variables
       cache: eceasst-973.pdf
  plain text: eceasst-973.txt

        item: #838 of 858
          id: eceasst-974
      author: Kovacs, Laura
       title: Symbol Elimination for Automated Generation of Program Properties
        date: 2014-11-18
       words: 920
      flesch: 29
     summary: We start by first presenting how symbol elimination is used in symbolic computation for analysing program loops and inferring loop invariants and postconditions. Symbol elimination uses first-order theorem proving techniques in conjunc- tion with symbolic computation methods, and derives nontrivial program properties, such as loop invariants and loop bounds, in a fully automatic way.
    keywords: elimination; program; symbol
       cache: eceasst-974.pdf
  plain text: eceasst-974.txt

        item: #839 of 858
          id: eceasst-975
      author: Hatvani, Leo; David, Alexandre; Seceleanu, Cristina; Pettersson, Paul
       title: Adaptive Task Automata with Earliest-Deadline-First Scheduling
        date: 2014-11-18
       words: 7480
      flesch: 65
     summary: Since a task can be in the queue or not, the queue is encoded as a set q. Tasks themselves are represented via a number of variables: ti represents the i-th task, trun keeps track of the currently running task, ci represents task computation clock explained in Subsection 3.4, ri contains the current response time of the task, and ci is compared to ri to evaluate if the task has completed its execution; di is a clock that is reset when a task is released, and is compared to the natural Di to check if the task’s deadline has passed, Pi is the current priority of the task. Keywords: model-checking, task automata, earliest-deadline-first scheduling 1 Introduction One way to enable real-time embedded systems to cope with environment, application, or platform changes is to introduce adaptivity at the design phase of system development.
    keywords: adaptive; automata; automaton; clock; deadline; location; model; queue; scheduling; set; task; time
       cache: eceasst-975.pdf
  plain text: eceasst-975.txt

        item: #840 of 858
          id: eceasst-976
      author: Broadfoot, Guy H.
       title: The highs and lows of deploying Formal Methods in Industry
        date: 2014-11-18
       words: 467
      flesch: 36
     summary: Advances in theorem proving and model checking are good examples of systematic efforts to improve software correctness. In 1998, I conceived the idea of combing model checking, code generation and the specification approach of Sequence-based Specification together to form an inte- grated software design platform for developing software components whose design (implementation) would be formally verified for correctness with respect to its spec- ification.
    keywords: industry; software
       cache: eceasst-976.pdf
  plain text: eceasst-976.txt

        item: #841 of 858
          id: eceasst-977
      author: Sproston, Jeremy
       title: Exact and Approximate Abstraction for Classes of Stochastic Hybrid Systems
        date: 2014-11-18
       words: 8899
      flesch: 65
     summary: where SF = {(l, v) | (l, v) ∈ S∧l ∈ F}. Proof sketch. We assume that post, guards and update sets of standard probabilistic edges, and guards of continuous probabilistic edges are measurable in the sense of [FHH+11, Hah13].
    keywords: automata; finite; hybrid; location; probabilistic; set; stochastic; time; variables
       cache: eceasst-977.pdf
  plain text: eceasst-977.txt

        item: #842 of 858
          id: eceasst-978
      author: Chen, Jingshu; Duflot, Marie; Merz, Stephan
       title: Analyzing Conflict Freedom for Multi-threaded Programs With Time Annotations
        date: 2014-11-18
       words: 6209
      flesch: 68
     summary: In the following, we describe an approach for mechanically analyzing schedules of multi- threaded programs with timing annotations, with respect to properties that require temporal orders between program statements, typically ensuring the absence of race conditions for ac- cessing shared variables. The scheduling of an initial statement sleep(n ) is analogous, at the beginning of program execution.
    keywords: annotations; execution; k+1; program; round; sleeping; statement; thread; time
       cache: eceasst-978.pdf
  plain text: eceasst-978.txt

        item: #843 of 858
          id: eceasst-979
      author: Berard, Beatrice; Mullins, John
       title: Verification of Information Flow Properties under Rational Observation
        date: 2014-11-18
       words: 7368
      flesch: 63
     summary: To illustrate the expres- siveness of RIFPs, we introduce a subclass of functional rational observers that we call rational Orwellian observers and show that several properties including intransitive non-interference and selective intransitive non-interference for a language L ∈ L are in RIF(L ). Given a family L of languages, our model provides a generic decidability result to the RIF(L ) verification problem: Given L ∈ L and a security property P in RIF(L ), does L satisfy P?
    keywords: flow; information; languages; observation; observers; opacity; properties; set; verification
       cache: eceasst-979.pdf
  plain text: eceasst-979.txt

        item: #844 of 858
          id: eceasst-980
      author: Groote, Jan Friso; van der Hofstad, Remco; Raffelsieper, Matthias
       title: On the Random Structure of Behavioural Transition Systems
        date: 2014-11-18
       words: 7271
      flesch: 69
     summary: (17) 4.3 Experiments with state spaces of realistic systems layer1 10 100 1000 1e4 1e5 1e6 1e7 188569 N 0 10 20 30 40 50 60 70 80 90 100 110 Figure 2: Estimates of the reachable state space of the firewire protocol We are interested in whether the estimates using product state spaces give a better prediction for the sizes of state spaces that we encounter in practice. Keywords: Random graph, P-parallel random transition system, state space size 1 Introduction Modelling the behaviour of systems is gaining popularity.
    keywords: k=0; number; size; space; state; systems; transition
       cache: eceasst-980.pdf
  plain text: eceasst-980.txt

        item: #845 of 858
          id: eceasst-981
      author: De Landtsheer, Renaud; Ponsard, Christophe; Devos, Nicolas
       title: A Constraint-Solving Approach for Achieving Minimal-Reset Transition Coverage of Smartcard Behaviour
        date: 2014-11-20
       words: 6392
      flesch: 63
     summary: [UL06]. In this paper, we take a more focused approach which does not try to capture the behavior of the whole system but only specific behavioral aspects expressed in the widely industrially adopted formalism of state machines [Har87, Fow03]. 1 / 15 Volume 70 (2014) Several coverage criteria for state machines have been proposed and are now considered as standard: transition coverage, state coverage, pair of transition coverage, pair of state coverage, path coverage, etc. Throughout the paper, the concepts of state machine and graph are undistinguished, and denoted by any of these two terms.
    keywords: algorithm; eulerian; graph; machine; node; number; path; problem; reset; state; state machine; test; transitions
       cache: eceasst-981.pdf
  plain text: eceasst-981.txt

        item: #846 of 858
          id: eceasst-982
      author: Mohaqeqi, Morteza; Mousavi, Mohammad Reza; Taha, Walid
       title: Conformance Testing of Cyber-Physical Systems: A Comparative Study
        date: 2014-11-20
       words: 6933
      flesch: 63
     summary: In addition to the two aforementioned studies [vO06] and [AHF+14], which will be explained in detail in the next sections, conformance testing of hybrid systems using some notion of over- approximation has been proposed in [ABW09] and [BWA10]. [MS97] for specifying test cases for hybrid systems.
    keywords: conformance; definition; hconf; hioco; hybrid; input; models; output; set; systems; testing; tss
       cache: eceasst-982.pdf
  plain text: eceasst-982.txt

        item: #847 of 858
          id: eceasst-983
      author: Ročkai, Petr; Barnat, Jiří; Brim, Luboš
       title: Model Checking C++ with Exceptions
        date: 2014-11-20
       words: 7320
      flesch: 52
     summary: 7 Conclusions We have shown how to extend an explicit-state software model checker based on LLVM with support for exception handling, with focus on C++ exceptions. Runtime LLVM IR Execution stack unwinder personality function C++ Runtime Support libunwind The Standard C++ Library Verifiable Bitcode Source Code DWARF unwind tables exception handlers cleanup handlers BINARY __cxa_throw_divine personality function __cxa_throw __cxa_begin_catch __cxa_end_catch Figure 1: The various components involved in exception handling, and their interaction with execution and verification.
    keywords: c++; code; divine; exception; handler; handling; landingpad; language; llvm; model; personality; stack; unwind
       cache: eceasst-983.pdf
  plain text: eceasst-983.txt

        item: #848 of 858
          id: eceasst-984
      author: Jafari, Ali; Khamespanah, Ehsan; Sirjani, Marjan; Hermanns, Holger
       title: Performance Analysis of Distributed and Asynchronous Systems using Probabilistic Timed Actors
        date: 2014-11-20
       words: 7003
      flesch: 55
     summary: To this end, we use discrete time model and discrete probability distributions. We propose PTRebeca on the basis of a study of different distributed and asynchronous applications, studied to identify what is needed for modeling and analysis of those ap- plications, relative to different probabilistic and timed probabilistic models (discrete, continuous, stochastic) proposed in the literature.
    keywords: analysis; message; model; modeling; probabilistic; probability; ptrebeca; semantics; state; systems; time; value
       cache: eceasst-984.pdf
  plain text: eceasst-984.txt

        item: #849 of 858
          id: eceasst-985
      author: Sáenz-Pérez, Fernando
       title: Towards Bridging the Expressiveness Gap Between \linebreak Relational and Deductive Databases
        date: 2014-11-26
       words: 9399
      flesch: 55
     summary: DES> /ra select true (managers) Concluding, opening an ODBC connection allows the user to integrate external relations in Datalog, (DES-solved) SQL, and RA queries, but in this setting it is not possible to integrate Datalog predicates in external SQL queries, as the external database is not aware of Datalog relations. Nowadays, one can face several obstacles when formulating SQL queries because of a number of reasons, including, e.g.: ∗ This author has been partially supported by the Spanish projects CAVI-ART (TIN2013-44742-C4-3-R), STAMP (TIN2008-06622-C03-01), Prometidos-CM (S2009TIC-1465) and GPD (UCM-BSCH-GR35/10-A-910502) 1 / 22 Volume 64 (2013) Towards Bridging the Expressiveness Gap parsing requirements and restricted syntax constructions for practical expressiveness, and limited set of operators and recursion limitations for theoretical expressiveness.
    keywords: current; database; datalog; dbms; des; expressiveness; persistent; predicate; prolog; queries; query; relational; rules; select; sql; system; table
       cache: eceasst-985.pdf
  plain text: eceasst-985.txt

        item: #850 of 858
          id: eceasst-986
      author: Donaldson, Alastair
       title: The GPUVerify Method: a Tutorial Overview
        date: 2014-11-25
       words: 7427
      flesch: 59
     summary: A problem which is specific to data races in GPU kernels is that individual GPU architectures may be relatively deterministic: as there is no operating system running on the GPU, GPU threads are not preempted at unpredictable moments as is the case in concurrent CPU applications. } while(F $1 || F $2) { Threads loop until both are disabled, but a translate(Stmt1,F); thread performs no-ops if its predicate F is F $1 = F $1 && e$1; false.
    keywords: barrier; data; gpuverify; kernel; memory; method; predicate; program; race; sequential; thread; verification; write
       cache: eceasst-986.pdf
  plain text: eceasst-986.txt

        item: #851 of 858
          id: eceasst-987
      author: Sáenz-Pérez, Fernando; Nieva, Susana; Sanchez-Hernandez, Jaime; Aranda, Gabriel
       title: R-SQL: An SQL Database System with Extended Recursion
        date: 2014-11-26
       words: 7589
      flesch: 60
     summary: Last two ones also allow connecting to external databases, but processing of recursive SQL queries are in-memory. It uses the Python library psycopg2 (available at http://initd.org/psycopg/) which allows to connect to an RDBMS and then submit SQL queries as: cursor.execute(<query>) where <query> is any valid SQL query.
    keywords: database; definition; fixpoint; rdbms; recursion; relation; select; sql; stm; stratum; system; union
       cache: eceasst-987.pdf
  plain text: eceasst-987.txt

        item: #852 of 858
          id: eceasst-988
      author: Martos-Salgado, María; Rosa-Velardo, Fernando
       title: On the decidability of model checking LTL fragments in monotonic extensions of Petri nets
        date: 2015-04-02
       words: 9748
      flesch: 73
     summary: On the decidability of model checking LTL fragments in monotonic extensions of Petri nets Marı́a Martos-Salgado and Fernando Rosa-Velardo 18 pages Guest Editors: Clara Benac Earle, Laura Castro, Lars-Åke Fredlund Managing Editors: Tiziana Margaria, Julia Padberg, Gabriele Taentzer ECEASST Home Page: http://www.easst.org/eceasst/ ISSN 1863-2122 http://www.easst.org/eceasst/ ECEASST On the decidability of model checking LTL fragments in monotonic extensions of Petri nets Marı́a Martos-Salgado1 and Fernando Rosa-Velardo2∗ 1 mrmartos@ucm.es Universidad Complutense de Madrid 2 fernandorosa@sip.ucm.es Universidad Complutense de Madrid Abstract: We study the model checking problem for monotonic extensions of Petri Nets, namely for two extensions of Petri nets: reset nets (nets in which places can be emptied by the firing of a transition with a reset arc) and ν -Petri nets (nets in which tokens are pure names that can be matched with equality and dynamically created). We consider two simple extensions of P/T nets, one in each group: reset nets [7] and ν -Petri nets (ν -PN)
    keywords: checking; marking; model; nets; reset; t nets; transition
       cache: eceasst-988.pdf
  plain text: eceasst-988.txt

        item: #853 of 858
          id: eceasst-989
      author: Sáenz-Pérez, Fernando; Ignacio, Castiñeiras
       title: Improving the Search Capabilities of a CFLP(FD) System
        date: 2014-11-26
       words: 9082
      flesch: 65
     summary: M-900 FDi 2.53 1.00 1.95 1.00 0.77 M-900 FDg 2.00 0.79 1.34 0.69 0.67 Q-90 FDi 0.110 1.00 0.514 1.00 4.67 Q-90 FDg 0.078 0.71 0.061 0.12 0.78 Q-105 FDi 1.25 1.00 0.78 1.00 0.62 Q-105 FDg 1.05 0.84 0.08 0.10 0.08 Q-120 FDi 154.00 1.00 1.11 1.00 0.01 Q-120 FDg 129.88 0.84 0.09 0.08 0.00 L-119 FDi 0.530 1.00 0.984 1.00 1.86 L-119 FDg 0.296 0.56 0.282 0.29 0.95 L-127 FDi 4.35 1.00 1.17 1.00 0.27 L-127 FDg 4.62 1.06 0.39 0.33 0.08 L-131 FDi 87.00 1.00 1.19 1.00 0.01 L-131 FDg 98.53 1.13 0.33 0.28 0.00 G-9 FDi 0.421 1.00 0.109 1.00 0.26 G-9 FDg 0.250 0.59 0.062 0.57 0.25 G-10 FDi 3.56 1.00 1.47 1.00 0.41 G-10 FDg 2.11 0.59 0.84 0.57 0.40 G-11 FDi 72.65 1.00 43.98 1.00 0.61 G-11 FDg 42.01 0.58 24.85 0.57 0.59 Table 3: Performance of T OY (F D) using the Search Strategies Second, it is clearly observed that the improvement achieved by T OY (F D g) for is instances is bigger than the one achieved by T OY (F D i), revealing that the approach Gecode offers to extend the library with new search strategies is more efficient than the one of ILOG Solver. T OY (F D i) is bigger for the new improved T OY (F D) models, re- vealing that the approach Gecode offers to extend the library with new search strategies is more efficient than the one of ILOG Solver.
    keywords: domain; f d; gecode; int; primitives; search; solver; strategies; t oy; variables
       cache: eceasst-989.pdf
  plain text: eceasst-989.txt

        item: #854 of 858
          id: eceasst-99
      author: Milanović, Milan; Gašević, Dragan; Giurca, Adrian; Wagner, Gerd; Devedžić, Vladan
       title: Sharing OCL Constraints by Using Web Rules
        date: 2007-11-23
       words: 7315
      flesch: 52
     summary: However, our OCL Parser also supports OCL derivation rules (i.e., derive expressions), and we plan to extend our transformations between OCL and R2ML to enable for the translation between OCL derive rules and R2ML derivation rules. The first step (see Figure 3) is between OCL rules (invariants) represented in the OCL concrete syntax (i.e., in the EBNF technical space [KBA02]) and models compliant with the OCL metamodel (in the MOF technical space)
    keywords: concrete; figure; languages; metamodel; object; ocl; operation; r2ml; rules; syntax; uml; web; xml
       cache: eceasst-99.pdf
  plain text: eceasst-99.txt

        item: #855 of 858
          id: eceasst-990
      author: Almendros-Jimenez, Jesus M.; Luna, Alejandro; Moreno, Gines; Vazquez, Carlos
       title: Analyzing Fuzzy Logic Computations with Fuzzy XPath
        date: 2015-04-02
       words: 7036
      flesch: 60
     summary: More exactly we show that, even when FLOPER was used for implementing fuzzy XPath, now this last language is very useful for formulating queries to be executed againts XML documents representing derivation trees de- picted by FLOPER, thus becoming into a “debugging” technique which can be embedded into the programming environment for analyzing some interesting details (fuzzy computed answers, tree traversals, partial branches, etc.) about fuzzy logic computations. For the purpose of this paper, we will focus on this last option in order to obtain a tree (detailing the whole computational behaviour) for being afterwards analyzed with fuzzy XPath.
    keywords: answers; conditions; figure; floper; fuzzy; goal; language; logic; node; programming; query; rule; tree; xml; xpath
       cache: eceasst-990.pdf
  plain text: eceasst-990.txt

        item: #856 of 858
          id: eceasst-991
      author: Bofill, Miquel; Moreno, Gines; Vazquez, Carlos; Villaret, Mateu
       title: Automatic Proving of Fuzzy Formulae with Fuzzy Logic Programming and SMT
        date: 2014-11-26
       words: 6677
      flesch: 60
     summary: = min(0.5,1) = 0.5 To finish this section, let us comment some connections between the two main topics of this work, i.e. Fuzzy Logic Programming and Fuzzy SMT, with Answer Set Programming (ASP), a well-known declarative programming paradigm oriented towards combinatorial search problems which has been recently combined with fuzzy logic [VDV07]. In [MO09], it is presented an ASP semantics for a kind of fuzzy logic programs very close to MALP, based on the idea of finding models that we also use in this paper when analyzing fuzzy logic formulae with our FLOPER tool.
    keywords: 2013; figure; floper; formula; fuzzy; goal; lattice; logic; models; programming; set; smt
       cache: eceasst-991.pdf
  plain text: eceasst-991.txt

        item: #857 of 858
          id: eceasst-994
      author: Mansutti, Alessio; Miculan, Marino; Peressotti, Marco
       title: Distributed execution of bigraphical reactive systems
        date: 2015-09-06
       words: 10370
      flesch: 61
     summary: Place graph Like link graph embeddings, place graph embeddings are just a structure pre- serving injective map from nodes along with suitable maps for the inner and outer interfaces. First, we introduce a new com- pact representation of partial embeddings, reducing both network and memory footprint of the distributed embedding algorithm; secondly, messages are routed across the overlay network only to processes that can benefit from their content (in [MMP14b] messages were forwarded to the entire neighbourhood).
    keywords: algorithm; atoms; bigraph; definition; embedding; execution; link; process; processes; reactions; set; state; systems
       cache: eceasst-994.pdf
  plain text: eceasst-994.txt

        item: #858 of 858
          id: eceasst-999
      author: Kahl, Wolfram
       title: Graph Transformation with Symbolic Attributes via Monadic Coalgebra Homomorphisms
        date: 2015-09-06
       words: 7466
      flesch: 58
     summary: [LKW93] appear to have been the first to consider attributed graphs in the context of the algebraic approach to graph transformation; they propose to extend the customary unary graph structure signature with an arbitrary attribute signature, and a set of unary attribution oper- ators connecting the two. 8 Comparison with Attributed Graph Transformation in the Adhe- sive Approach In the adhesive HLR approach to attributed graph transformation, presented in detail in [EEPT06, Chapters 8–12], each attributed graph contains its own Σ-algebra for attribute values.
    keywords: approach; attributes; category; coalgebra; graph; homomorphisms; monad; pushout; set; term; transformation; variables
       cache: eceasst-999.pdf
  plain text: eceasst-999.txt