Bibliography

This is an automatically generated bibliography describing the content of this study carrel.

1. 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: abc; aiicggjkjljmn; attributes; body; c++; case; class; classes; code; conceptual; containsmember; development; diagram; eceasst; example; expressions; extract; figure; functions; graph; hand; implementation; important; language; left; let; level; like; members; metamodel; new; nodes; notation; object; ocl; old; old class; paper; parameters; program; public; refactorings; referenced; right; rule; schema; setra; software; string; telephonenumber; transformations; type; u �; uml; use; volume; work; xnyc �; � cy; � lhio
   • versions: original; plain text
2. 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: abstract; abstraction; addition; approach; binding; concepts; concrete; constraint; core; current; definition; different; eceasst; elements; example; expressions; extension; figure; grammar; group; kent; language; library; literal; logic; metamodel; modelling; models; modular; module; navigation; new; numbers; object; ocl; ocl4all; ocl::stdlib::integer; ocl::stdlib::real; operations; operator; p r; paper; parser; parsing; primitive; proc; properties; r e; rules; semantics; sequence; specification; standard; string; sub; syntax; t e; technology; temporal; transformation; tree; types; uml; use; user; values; volume
   • versions: original; plain text
3. 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: application; assign; attached; b b; b e; bodies; body; composition; computer; conditions; contextual; definition; e e; e n; eceasst; edges; eept06; embedding; example; exp; exp0; exp1; fea; figure; free; gcm; grammars; graph; graph rewrite; habel; hyperedge; incremental; language; like; match; meta; method; morphisms; nodes; pair; papers; pattern; program; pumk; refactoring; refined; refinement; replacement; residual; rewrite; rewriting; right; rules; schema; science; sequence; set; sets; shape; signature; single; size; source; standard; steps; subclasses; theory; transformation; unique; use; variable; volume; way; ∆(s
   • versions: original; plain text
4. 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; atom; complete; computer; confluence; critical; definition; eceasst; equations; example; expressions; fail; figure; gcm; general; graph; hand; input; integer; labels; left; lemma; list; nodes; pairs; papers; problem; rule; schemata; set; simple; solutions; string; substitution; system; transformation; type(x; unification; unifier; variable; volume; word; x 7→; y 7→
   • versions: original; plain text
5. 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: abstract; acyclic; analysis; application; case; changes; colour; containment; context; corresponding; decidable; definition; derivation; eceasst; equivalent; example; finite; firing; free; free structure; gcm; grammars; graph; hand; induction; items; language; lemma; length; let; lncs; marked; marked net; marking; match; minimum; multiset; net; net n; nets; number; papers; petri; petri nets; pin; places; pout; problem; proof; proposition; question; reachability; reachable; regular; replacement; right; rule; safe; safe nets; safe structure; section; sequence; set; size; start; state; step; structure; t ∈; tokens; transition; volume; word; workflow; workflow nets; ∈ r
   • versions: original; plain text
6. 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; easst; editors; gcm; graph; issue; models; systems
   • versions: original; plain text
7. 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: active; algorithm; approximate; behaviour; closed; closedness; complete; consistent; construction; correct; elements; entries; entry; equivalence; figure; hypotheses; input; ioco(s; learned; learning; model; nondeterministic; observation; observation table; observed; output; possible; preciseness; process; queries; query; quiescence; relation; row; set; state; sul; system; s·e; table; testing; trace; transition; vt14; x},⊥
   • versions: original; plain text
8. 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: = ⇒; analysis; automated; case; conditional; conjectures; discovery; equational; equivalence; example; exploration; failure; functions; generation; hipspec; hipster; induction; inductive; insert; interactive; isabelle; isort; lemmas; list; new; number; order; predicate; problems; proceedings; prod; proof; proving; quickspec; reasoning; recursion; recursion induction; scheme; set; solved; sorted; structural; system; tactic; terms; theorem; theory; true; user; volume; work; zip
   • versions: original; plain text
9. 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: abstract; action; action language; approach; architecture; behavioral; class; code; concrete; declarative; dynamic; elements; event; executable; expressions; figure; generation; independent; instance; language; level; link; main; model; modeling; modifier; object; ocl; operations; parameter; platform; properties; property; query; semantics; snippet; software; state; static; structural; syntax; system; type; uml; use; value; volume
   • versions: original; plain text
10. 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: algorithms; approach; assert; assignment; assume; case; checking; code; conditions; condnf; context; definition; different; eceasst; efficient; encoding; example; execution; figure; form; formula; function; generated; imperative; left; lemmas; loop; model; multiple; note; number; paper; path; pp0; present; proc; program; properties; pscondnf; results; right; running; section; set; single; size; solver; solving; ssa; statements; study; time; tools; unwinding; use; vccnf(π; vcgen; vcs; verification; volume; way
    • versions: original; plain text
11. 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: = =; automation; bag; cmd; cmds; code; command; consensus; e c; e machine; e n; event; event e; eventml; f n; fault; formal; gpm; implementation; input; l e; l o; l s; language; location; loe; machine; messages; model; n g; n l; n n; n o; n p; n s; n t; new; number; nuprl; o r; o t; observer; order; outputs; p e; p l; pages; process; program; proof; properties; property; proposal; protocol; quorum; quorumstate; r e; r n; replicas; round; s =; s e; s t; sec; specification; state; systems; t =; t e; t h; t l; t p; t r; t t; t y; tolerant; type; u t; value; verification; volume; vote; ∗ =
    • versions: original; plain text
12. 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: accincsl(i; analysis; assume(a; avocs; benchmarks; classes; code; condition; constraint; control; coreutils; definite; definition; eceasst; edge; example; exit; experiments; false; figure; flow; function; generalized; heuristic; invariant; iteration; language; loc; loop; loop classes; loopus; node; occurrence; p(i; path; patterns; percentage; portfolio; predicate; program; representing; section; set; single; software; statements; study; syntactic; table; termination; true; value; variable; verification; volume; wcet; ¬for
    • versions: original; plain text
13. 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: approach; automata; automaton; case; clock; computing; configuration; eceasst; edge; eds; finite; form; function; g(σ; games; inf; interval; lemma; lncs; location; model; multi; non; notion; optimal; outcome; penalty; permissive; permissive strategies; player; possible; proof; reachability; real; robustness; sequence; set; setting; springer; steps; strategies; strategy; sup; systems; target; timed; transition; visit; volume; winning
    • versions: original; plain text
14. 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: acceptance; algorithms; automata; automaton; bound; büchi; b̄/or; capped; check; computer; computing; conditions; configuration; configuration automaton; cost; counter; counter automaton; current; definition; double; eceasst; emptiness; enumeration; exact; example; figure; finite; focus; function; generalized; infinite; initial; integers; international; largest; lemma; logics; ltl; maximal; note; number; paper; practical; problem; proc; proposition; quantitative; relation; run; scc; section; set; springer; state; supja; systems; theory; time; transition; val(ρ; value; verification; volume; words
    • versions: original; plain text
15. 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: andrew; avocs; chair; committee; france; grov; gudmund; heriot; ireland; local; papers; programme; research; systems; university; watt; workshop
    • versions: original; plain text
16. 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: acm; actions; approach; asynchronous; cancel; case; causal; ccs; channels; checking; communication; compatibility; completion; composite; composition; computer; conference; criteria; delivery; different; eceasst; example; faulty; fifo; figure; framework; history; implementation; init; instance; international; m1−1; mark; message; model; module; net; number; order; ordering; peer; point; possible; process; properties; queue; receive; reception; resit; results; science; second; secretary; section; send; sender; services; set; software; specification; springer; state; student; studentname; supervisor; systems; teacher; terminal; termination; tla+; transition; verification; volume; web
    • versions: original; plain text
17. 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: application; card; case; checking; class; code; command; conditions; context; data; diagrams; different; eceasst; evaluation; example; expressions; frame; hassent; instance; invariants; language; large; leaf; model; modelling; mondex; object; ocl; ocl4all; operation; operator; paper; post; pre-/post; preand; process; purse; related; report; requirements; returns; scale; scenario; section; selection; set; smart; specification; stage; study; system; table; technique; test; testing; tool; true; uml; university; use; user; validation; value; variables; view; volume
    • versions: original; plain text
18. 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: alphabet; automata; automated; automaton; basic; c[x; case; checking; context; countermodel; definition; eceasst; fcm; finite; following; follows; forest; formula; functional; ground; hedge; initial; interpretation; invariants; language; lisitsa; logic; method; model; order; paper; parameterized; problem; proc; program; proposition; protocols; r(τ(h1),τ(h2; reachability; regular; rewriting; safety; safety verification; section; set; sets; state; symbols; systems; terms; time; token; translation; tree; unary; unranked; unsafe; verification; vocabulary; volume
    • versions: original; plain text
19. 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: abstract; approach; b models; butler; case; class; code; concrete; conditions; conjunction; constructor; contracts; dafny; data; declarations; event; execution; following; formal; gci; guards; hoare; implementation; input; internal; invariants; keys; language; level; machine; map; method; model; modelling; new; number; obligations; output; parameter; plug; post; predicate; programming; proof; refinement; rodin; section; software; specification; statement; system; tool; transformation; types; typing; value; variables; verification; verifier; volume
    • versions: original; plain text
20. 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; actor model; algorithm; analysis; avocs; bfs; cdg; checking; clients; clinger; clq; cluster; communication; computer; controller; cycles; definition; dependency; distributed; distribution; distribution policy; edges; event; example; figure; graph; host; initial; level; ltl; ltl model; lts(ac; message; model; model checking; nlq; nodes; number; philosophers; policy; property; random; rebeca; results; sam; section; set; space; split; state; state distribution; state space; statements; sub; system; time; trace; trains; transitions; volume; 𝑚𝑠𝑔1
    • versions: original; plain text
21. 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: actions; algorithm; approach; auxiliary; average; bounds; budget; candidate; case; checking; confidence; context; decision; dlst15; estimate; estimation; events; expected; function; hash; hypothesis; importance; infinite; initial; lst14; markov; maximum; mdp; mdps; minimum; model; nondeterministic; number; numerical; optimal; present; prng; probabilistic; probabilities; probability; processes; properties; property; random; rare; reachability; results; rewards; sampling; schedulers; seed; set; simulation; smart; smc; specified; standard; state; statistical; systems; techniques; test; traces; true; use; values; verification; volume; work
    • versions: original; plain text
22. 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: adaptive; algorithm; automaton; budget; case; checking; client; commands; computational; confidence; decided; distributed; distribution; eceasst; eds; estimate; false; figure; fixed; framework; function; high; importance; importance splitting; inner; legay; level; lightweight; logic; model; necessary; number; observers; operators; outer; output; overall; parallel; performance; probability; proc; properties; property; rare; results; sampling; score; simulations; single; smc; splitting; springer; state; statistical; systems; temporal; time; traces; true; use; variance; verification; volume; w′′; ω(i
    • versions: original; plain text
23. 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; analyser; analysis; android; behaviour; benchmark; bugs; bytecode; checkers; class; classes; code; codebases; collection; commercial; comparison; compiler; concurrency; data; deadlock; defects; developers; development; different; eceasst; entry; example; false; field; findbugs; finding; high; ibm; impact; inconsistent; information; interprocedural; java; jvm; large; locked; locks; method; performance; point; positives; possible; potential; private; program; programmer; public; real; results; run; sensitive; software; source; static; static analysis; synchronization; testing; threadsafe; time; tool; university; use; volume
    • versions: original; plain text
24. 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: account; acm; analysis; approach; assembly; calculated; calculation; case; checking; code; composition; computer; control; controller; cycles; data; deadline; design; diagrams; eceasst; event; execution; execution time; figure; flow; generation; hierarchical; implementation; input; international; invariants; language; level; micro; model; multiple; need; new; number; op(e; parallel; paths; pcharts; porta; possible; processor; program; properties; real; scheduler; scheduling; semantics; sequentialization; skip; specification; state; statecharts; statements; systems; target; tick; time; timing; tools; transition; uml; variables; volume; wcet; wcet analysis; worst
    • versions: original; plain text
25. 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: approach; assurance; behaviour; body; code; communication; composition; cps; critical; cspm; cyber; d2d; d2r; data; definition; deployment; development; doloop0; eceasst; example; external; figure; formal; fsg; function; gcs; hacms; high; implementation; indirections; level; llvm; loop; machine; mavlink; messages; model; paper; physical; predicate; process; project; properties; refinement; representation; requirements; safety; security; software; specification; stream1; system; tool; translation; verification; verifying; volume; work
    • versions: original; plain text
26. 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: detlef; eceasst; gcm; graph; models; papers; plump; reviewers; revised; volume
    • versions: original; plain text
27. 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: anonymous; class; classes; closures; code; collection; concept; declarative; elements; environment; example; expression; features; functions; initialisation; iterator; java; language; library; list; navigation; new; notion; object; ocl; ocl4all; operations; paper; parameters; programming; redundant; table; tuple; type; use; var; variable
    • versions: original; plain text
28. 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: 2012; 2015; anjorin; application; approaches; attribute; backward; batch; bidirectional; case; challenges; class; classes; completeness; complex; conditions; consistent; constraints; correctness; correspondence; current; diagram; dimension; domain; eceasst; eds; ehrig; elements; example; expressiveness; fig; formal; forward; future; gcm; general; grammars; graph; graph grammars; hermann; icgt; integration; language; lncs; method; model; multi; nacs; papers; possible; public; related; research; rules; running; scalability; scenarios; schürr; set; size; source; springer; support; synchronisation; target; test; tgg; tggs; tool; transformation; triple; triple graph; true; volume; work; years
    • versions: original; plain text
29. 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: abstract; acm; ambiguity; ambiguous; approaches; boolean; brand; case; chain; clauses; computer; conjunctive; context; correct; cotransforming; coupled; data; den; different; disambiguation; doi; eceasst; edges; effect; engineering; evolution; fail; figure; filters; forests; free; gcm; generalised; grammar; graph; higher; impact; incoming; instance; language; leaves; level; like; lncs; lämmel; need; new; node; nonterminal; ones; operators; order; outgoing; packed; paper; parse; parse forests; parsing; possible; practice; preserved; previous; problem; production; programming; programs; representation; revising; rewriting; right; rules; section; semantics; software; sppf; springer; structure; suite; symbol; syntax; table; techniques; transformation; tree; uncertainty; use; van; vertex; views; visser; volume; work; zaytsev
    • versions: original; plain text
30. 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: action; annotated; annotateswith; annotations; application; approach; babelnet; box; bp13b; case; collection; concept; conditions; constraints; construction; contract; definition; derivation; diagram; different; domain; dpo; eceasst; edge; elements; example; figure; frank; gcm; graph; hand; induced; licenseann; licenses; mapping; member; model; modeling; morphism; new; node; notion; original; papers; paul; policies; policy; proc; pushout; repair; request; resources; role; rule; schemes; section; security; sense; service; specific; synset; team; transformation; type; use; values; volume; work
    • versions: original; plain text
31. 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: ack; addition; batch; case; computation; cost; eceasst; evaluation; examples; execution; fib; figure; function; gcm; graph; inpla; interaction; interaction nets; list; mapfib; natural; nets; nil; number; operation; p s; pair; papers; parallel; parallel evaluation; parallelism; result; rewriting; s e; s n; s s; s te; section; sequential; steps; streaming; studies; system; threads; time; unary; unbounded; version; volume; z s
    • versions: original; plain text
32. 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; -adhesive categories; approach; attgraphs; attributes; attribution; catalog; categories; category; class; collections; comma; componentwise; composition; computer; construction; cube; definition; e.g.; eceasst; eept06; ehrig; elements; faces; figure; following; functor; gcm; graphs; hp12; identity; isomorphisms; kampen; lemma; length; morphisms; multiset; n c; object; papers; possible; proof; properties; pullbacks; pushout; readernr; rule; science; sets; slice; square; string; systems; theorem; transformation; values; volume
    • versions: original; plain text
33. 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: 7→ f; algebras; application; approach; arbitrary; a×(g; c s; categories; category; class; closed; condition; cube; definition; eceasst; example; existence; f b; f c; f d; f g; faces; figure; final; following; gcm; graph; g∗(m; hereditary; image; inverse; limits; map; mappings; match; monic; monomorphisms; morphisms; note; object; operations; papers; partial; partial algebras; pre; proof; proposition; pullback; pushout; pushout rewriting; p′i; rewriting; right; rule; section; set; signature; single; sorts; span; structure; sub; total; transformation; underlying; volume; wrt
    • versions: original; plain text
34. 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: 1(1; addition; approach; body; calculus; case; conditions; construction; correctness; definition; eceasst; equations; equivalent; example; fig; figure; finite; fixed; gcm; graph; hand; induction; j∈j; lemma; level; lfp; liberal; local; logic; main; min; monomorphisms; monotonic; morphism; mout; nested; nested conditions; nesting; new; nodes; non; notation; order; papers; partial; pen09; pennemann; placeholders; point; precondition; programs; proof; properties; property; pushout; relative; remark; respect; right; rule; satisfaction; satisfies; section; semantics; set; shift; step; subcondition; subgraph; systems; theorem; transformation; type; unselection; use; valuation; variables; verification; volume; weakest; wlp; work; y(c; y(∃(a; ∃(a
    • versions: original; plain text
35. 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; action; asl; assignexp; attributes; basic; behavior; blockexp; code; constructs; createobjectexp; destroyobjectexp; diagram; disambiguating; eceasst; executable; executable uml; execution; expression; fig; functions; implementation; language; machine; mapping; model; modeling; new; object; ocl; ocl4x; oclexpressioncs; opaqueexp; operation; oxuml; programming; rules; semantics; simplenamecs; software; specification; standard; state; syntax; system; uml; value; volume; whileexp
    • versions: original; plain text
36. 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: actions; approach; assignments; ast; c code; c program; calls; case; code; code generation; compilation; condition; control; corresponding; data; development; different; documentation; eceasst; entry; example; extraction; fibonacci; figure; flow; function; generated; generation; graphical; hardware; initial; int; int b; isola; kieler; language; legacy; legacy c; local; loop; main; main(int; model; model extraction; modeling; netlist; new; notation; number; order; overview; possible; program; representation; return; root; sccharts; scg; section; software; source; statement; states; structure; superstate; synchronous; syntax; systems; transition; use; user; value; variable; visual; volume
    • versions: original; plain text
37. 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; approach; case; class; classes; concepts; constraints; corresponding; definition; design; design model; development; different; diplomas; domain; domain knowledge; eceasst; engineering; explicit; factory; figure; handling; information; information system; instances; isola; knowledge; language; master; methodology; model; model analysis; model annotation; modeling; multi; ontologies; ontology; order; performed; point; printing; process; properties; property; references; relationship; section; set; specific; step; student; study; system; system design; system model; tool; view; view model; volume; work
    • versions: original; plain text
38. 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: application; artifact; aspects; attribute; branch; cinco; code; compound; control; development; domain; edges; elements; end; example; experts; figure; flow; graphical; implementation; international; language; level; lines; linking; means; meta; model; model elements; modeling; need; new; node; possible; prime; problem; process; product; programming; referenced; related; representation; reuse; section; software; solution; source; specific; specification; steffen; submodel; tooling; transformation; type; validation
    • versions: original; plain text
39. 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: analyzer; class; conference; considerations; def; eceasst; email; engineering; evaluation; event; example; expression; extended; figure; following; goal; gore; international; inv; lamsweerde; language; level; logic; message; modeling; models; monitoring; monitors; needs; object; ocl; ocl4all; oclmessage; ocltm; patterns; properties; property; reqmon; requirements; response; runtime; satisfaction; satisfied; scope; sharing; simplified; software; specification; stream; support; system; temporal; timeouts; tse; uml; user; van; variant; volume
    • versions: original; plain text
40. 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: access; api; application; approach; areas; business; cinco; data; different; dime; domain; dywa; eceasst; editor; elements; example; features; figure; flow; generated; generator; graph; gui; information; interaction; mdd; meta; mgl; model; model transformation; modeling; msl; paper; process; product; representation; screens; section; sofsem; source; specific; srf; steffen; target; technical; tools; transformation; types; use; volume; webstory; webstory model
    • versions: original; plain text
41. 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: acm; adversary; algorithm; anonymity; attribute; class; conference; cross; data; data privacy; dataset; debugging; defect; disciplines; disclosure; eceasst; effort; engineering; estimation; example; generalization; icse; ieee; information; instance; international; legal; lgp14; methods; minimization; natural; new; obfuscated; obfuscation; original; paper; personal; pm12; pmgz13; pml15; prediction; preserving; privacy; proceedings; processing; project; protection; regulations; requirements; research; science; section; sensitive; set; sharing; sofsem; software; software engineering; solutions; srf; sub; subject; table; techniques; test; testing; tgx11; usa; use; utility; values; volume; work
    • versions: original; plain text
42. 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: ag(ϕ; analysis; analysis time; application; approach; assertions; automata; automaton; behavior; case; checker; checking; clock; computer; conference; consistency; consistency analysis; consistency checking; definition; different; display; eceasst; effort; events; execution; experience; fact; figure; fld; fld system; fol; formal; formulas; fuel; function; industrial; initial; international; invariance; level; location; logic; logical; methods; model; model checking; modeling; non; nta; order; paper; path; patterns; problem; procedure; proceedings; properties; property; real; requirements; requirements specification; sanity; satisfiability; satisfied; section; set; smt; sofsem; software; specification; srf; state; step; synchronization; system; system model; system specification; systems requirements; tctl; temporal; time; tool; transition; true; uppaal; use; variables; volume; work
    • versions: original; plain text
43. 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; audio; average; bandwidth; best; codec; conference; connected; cost; data; devices; eceasst; evaluation; experiment; header; higher; horizon; information; interface; international; internet; ireland; line; mobile; network; new; numbers; optimisations; packet; payload; performance; protocol; quality; rate; research; results; section; size; skype; sofsem; solutions; speech; spvs; srf; tcp; tcpdump; test; tested; throughput; tool; traffic; user; voice; voip; volume; wechat; whatsapp
    • versions: original; plain text
44. 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; adds; algebraic; application; approach; binary; boolean; case; cheese; classifiers; code; condition; corresponding; data; data structure; decision; decision functions; decision structure; diagrams; different; eceasst; efficient; elements; evaluation; example; existing; faster; figure; final; final decision; fish; form; functions; goto; highest; implementation; isola; languages; large; meat; memory; methods; miaamics; node; number; optimal; predicates; programming; properties; random; recommendation; recommender; representation; result; rules; selection; set; similar; situation; size; small; specifications; statements; structure; sweet; system; target; target elements; terminal; tool; use; user; variety; volume; weight; weighted; white; wine
    • versions: original; plain text
45. 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: britain; easst; editors; extensions; great; languages; modelling; models; new; ocl; papers; preface; volume; workshop
    • versions: original; plain text
46. 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: anna; doctoral; isola; lamprecht; lena; limerick; symposium; university; verification; volume
    • versions: original; plain text
47. 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: centre; forum; ireland; irish; lero; limerick; research; sofsem; software; student; university; volume
    • versions: original; plain text
48. 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; adacore; adoption; altran; analysis; aorte; application; approach; assurance; available; avocs; benefits; bronze; case; code; compiler; contracts; correctness; critical; data; development; different; eceasst; effort; errors; experience; experiments; formal; formal methods; formal verification; frama; functional; gold; guidance; guidelines; hashbytelen; high; industrial; integrity; invariants; key; l t; ladder; language; level; means; methods; n t; new; order; platinum; possible; practical; processes; program; programming; projects; proof; properties; proved; related; reliable; safety; second; security; set; silver; software; software assurance; spark; specific; specifications; stone; strategy; study; support; systems; techniques; test; testing; thales; time; tools; type; use; user; verification; verifying; volume; years
    • versions: original; plain text
49. 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: accumulator; alternative; bag; boolean; c l; c t; col; collection; diagram; e c; e e; e m; e n; e q; element; elemtype; equivalences; exprelem; expression; false; fulfilling; iterate; j e; l e; l l; l s; mark; n c; o n; o t; object; ocl; operations; r e; related; relationships; resp; result; richters; s e; select; semantic; sequence; set; source; t e; t r; t s; tab; true; u e; uml; use; value; warehouse
    • versions: original; plain text
50. 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; abstract; active; analysis; approach; async; avocs; await; boolean; calculus; case; code; condition; condition synchronization; configuration; control; cycle; deadlock; definition; dependencies; dependency; design; doi:10.1007/978; eceasst; edge; example; execution; fag13; false; field; figure; flow; following; formal; free; graph; guard; heap; implementation; java; language; level; main; method; models; monitors; notion; obj(x; object; point; primitives; proceedings; process; program; right; rule; run; starvation; starving; statement; stuck; suspension; synchronization; system; task; true; tsk(x; use; volume; x.m; x.n
    • versions: original; plain text
51. 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; critical; formal; international; methods; papers; publication; systems; verification; volume; work
    • versions: original; plain text
52. 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; activation; aee; amax; amin; analysis; arm; automata; automaton; blinking; bmc; bounded; case; condition; consequence; consistency; counter; cycle; definition; duration; eceasst; embeddedplatform; end; event; example; existential; failure; fair; figure; finite; following; formal; infinite; instance; interpretation; invariant; left; lmax; lmin; local; loop; min; mode; mtl; note; observation; observer; ordering; paper; parameters; partial; partial consistency; pattern; phase; pitman; premise; progress; reactive; requirements; right; rinv; run; scope; section; semantics; set; software; specification; sps; start; state; step; sup; system; table; time; trace; transition; trigger; true; use; variables; volume; work
    • versions: original; plain text
53. 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: algorithm; antecedents; automata; branch; case; checker; children; closed; condition; consequent; constraints; counterexample; cvc4; cyclic; decision; definitions; derivation; eceasst; entailment; example; failed; finite; formulae; fragment; hand; implementation; inclusion; inductive; inductor; inference; infinite; input; instance; international; is17; language; list; logic; l̂s; nfa; nil; node; p(x; p1(x1; path; pivot; predicate; problem; proof; q1(x),; right; root; rule; sab; search; segments; separation; separation logic; sequent; set; sets; slind; state; strategy; system; theorem; transition; tree; tree+2; tuples; valid; variables; verification; volume; y∧emp; |=slseo
    • versions: original; plain text
54. 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: antlr; approach; ast; avocs; backend; bmc; bmoth; checker; checking; code; constraint; course; custom; days; development; different; e c; e s; e t; eceasst; esmc; explicit; exponentiation; features; implementation; induction; invariant; java; jgrapht; krings; l e; language; leuschel; lgba; libraries; logic; ltl; machines; model; model checker; model checking; n o; n s; n t; new; node; o l; predicate; prob; proceedings; r e; r n; representation; result; runtime; s s; s t; set; smt; solver; space; springer; state; steps; symbolic; t o; t u; table; timeout; tools; translation; verified; volume
    • versions: original; plain text
55. 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: addresses; android; application; approach; attacks; avocs; behavior; certain; chains; control; correctness; corresponding; data; detection; different; eceasst; elementary; end; firewall; flows; following; functions; high; inference; information; lahmadi; language; learning; level; limit; match(dstaddr; methods; model; network; networking; number; order; packets; paper; parallel; permissions; policies; policy; port; programming; properties; pyretic; representation; requirements; restrict(t; rules; scanning; sdn; section; security; security chains; security functions; security rules; set; software; specific; stateful; stateless; synthesis; system; tapp; trace; traffic; transitions; true; values; verification; volume
    • versions: original; plain text
56. 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: abstract; abstraction; algorithm; analysis; approach; automata; automaton; backward; backward exploration; backward reachability; case; checking; clock; constraints; data; data variables; definition; diagonal; discrete; doi:10.1007/978; eceasst; edge; efficient; exploration; extended; forward; graph; initial; location; measurements; methods; model; node; number; operation; original; paper; possible; practice; precondition; preimage; property; reachability; reachability analysis; reachable; search; section; set; space; space exploration; springer; state; state space; systems; target; techniques; time; transitions; updates; valuation; values; variables; verification; volume; weakest; zone
    • versions: original; plain text
57. 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; application; avocs; belgian; case; catalogue; checking; collision; component; compositional; compositional verification; contracts; control; data; different; direction; eceasst; elements; example; figure; formal; formal verification; framework; fty; iii; implementation; interfaces; interlocking; level; line; list; model; network; new; ocra; order; points; process; property; railway; refinement; rom; route; rt1; rt2; safety; second; section; signal; size; state; station; step; study; system; table; track; train; use; variables; verification; volume
    • versions: original; plain text
58. 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: algorithm; analysis; applications; approach; avocs; case; celsius; checker; checking; clock; commands; conference; control; critical; cycle; different; drift; duty; eceasst; effects; environmental; example; figo; figure; formal; formal verification; gossip; hardware; information; international; internet; iot; language; length; metadata; methods; model; modelling; module; networks; new; nodes; number; paper; particular; point; possible; prism; prism model; probabilistic; probability; proceedings; property; protocols; range; s1clock; s1phase; sensor; sensor networks; set; simulation; software; space; state; synchronisation; systems; temperature; things; tick; time; true; updateclock; updates; use; value; variable; verification; volume; water; way; wireless; wireless sensor; wsn; wsns
    • versions: original; plain text
59. 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: abstract; applications; approach; architecture; business; class; code; common; concepts; conference; constraints; corresponding; data; database; declarative; development; domain; figure; framework; generation; implementation; integrity; interface; invariants; ischemafacade; java; language; management; mapping; models; object; ocl; ocl invariants; patterns; platform; proc; query; query language; relational; rules; schema; semantical; software; specific; specification; sql; systems; target; template; toolkit; transformation; uml; volume; xml
    • versions: original; plain text
60. 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: abstract; abstraction; access; accessible; acm; address; addresses; addvaddr; api; architecture; avocs; base; child; code; communication; computing; configuration; consistency; control; coq; corresponding; definition; design; development; dst; eceasst; executable; flow; following; formal; fun; functions; hardware; hoare; index; information; isolation; kernel; layer; level; list; lli; logic; management; memory; minimal; mmal; mmu; model; monadic; non; notion; ones; page; parent; partition; physical; pip; policy; present; proof; properties; property; protokernel; proved; proving; result; security; separation; separation kernel; services; shadow; specification; srcp; state; system; tcb; time; translation; tree; type; undefined; use; user; value; verification; virtual; volume; work
    • versions: original; plain text
61. 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: 26262; analysis; annotation; approach; ardila; business; capabilities; castellanos; checking; compliance; compliance checking; composer; conditions; conference; context; critical; defeasible; definition; description; design; development; ds+is; eceasst; effects; elements; engineering; epf; evidence; execution; fcl; figure; formal; formalization; gallina; governatori; information; international; iso; isola; language; line; logic; management; methodological; methodology; model; modeling; non; normative; obligation; patterns; plan; process; process compliance; process model; processes; reasoning; regorous; related; report; requirements; research; results; reuse; rules; safety; safety compliance; scope; section; set; software; specification; spem; standards; state; steps; support; systems; task; tool; use; vision; volume; work; workshop
    • versions: original; plain text
62. 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: able; action; api; application; application developers; architecture; attribute; boolean; code; continuous; create; data; deployment; design; developers; development; domain; ds+is; dsl; dsls; eceasst; end; engineering; entity; evolve; example; figure; files; form; generation; hand; industrial; input; isola; json; kt08; language; lde; level; loc; model; new; number; object; page; parts; possible; practice; process; project; reducer; redux; related; request; schema; section; simple; software; specific; state; store; string; time; true; type; user; value; volume; web
    • versions: original; plain text
63. 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: abstract; approach; binding; case; code; collection; concrete; corresponding; definition; design; domain; dresden; dsl; eceasst; editor; elements; emf; engine; example; expression; figure; generic; group; implementation; instance; integration; languages; level; library; library types; management; metamodel; model; modeling; mof; new; object; ocl; ocl standard; ocl2; ocl4all; omg; operations; paper; parameters; pivot; pivot model; proc; return; section; set; specific; standard; standard library; support; syntax; template; toolkit; type; uml; version; volume; work
    • versions: original; plain text
64. 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: abstract; acm; ape; application; approach; bound; candidate; case; complex; composition; computational; computer; conceptual; concrete; constraints; cpt; data; design; different; discovery; domain; draw; ds+is; eceasst; elements; encoding; example; figure; file; formal; formulas; framework; geovisualization; ile(t; implementation; initial; input; intent; international; isola; knowledge; lamprecht; language; length; level; logic; logical; loop; map; margaria; model; modeling; natural; need; new; operations; order; output; paper; path; pipelines; practice; problem; proceedings; program; program synthesis; programming; prophets; propositional; pscoast; sat; science; scientific; search; section; semantic; set; sltl; software; solutions; solver; solving; space; specification; springer; state; steffen; steps; structure; suffix; support; synthesis; system; table; taxonomies; taxonomy; techniques; templates; temporal; time; tool; tool tool; true; type; usa; usage; use; use tool; user; volume; workflow; workflow discovery
    • versions: original; plain text
65. 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: acm; action; addition; algorithms; analysis; api; art; available; c++; case; cluster; command; communication; component; compose; conference; configuration; constraint; constraint problem; constraint solvers; container; cpu; data; database; decision; design; different; docker; ds+is; dsl; eceasst; effects; efficient; evaluation; example; execution; experiments; figure; frontend; future; hardware; heuristics; ideas; image; integration; international; isola; java; javasmt; job; jsmtlib; language; lib; library; machines; main; management; manager; mean; native; node; object; paper; performance; platform; point; problem; programs; pysmt; requirements; resources; results; right; running; runtime; sat; section; seed; seeding; semantic; service; set; single; smt; smt solvers; software; solver; solving; source; sql; standard; state; string; support; swarm; symbolic; systems; task; theory; thoughts; time; tools; user; variables; verification; volume; way
    • versions: original; plain text
66. 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; algorithm; architecture; assignments; automata; automaton; avocs; behaviour; bip; bisimulation; case; check; checking; components; computer; connectors; constructors; data; definition; eceasst; encoding; engine; example; expressions; failure; figure; formal; generated; global; hierarchical; holes; input; interaction; leaves; matching; max; model; monitor; open; open automaton; open transitions; operators; parameterized; plts; pnet; ports; possible; predicate; presentation; process; properties; property; reset; result; resume; running; satisfiability; science; section; semantics; set; sets; smt; software; solver; specific; state; structure; sub; symbolic; synchronisation; systems; term; transitions; translation; unsatisfiable; use; value; variables; vector; volume
    • versions: original; plain text
67. 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: acm; analysis; c++; car; code; codesonar; components; cross; data; devices; different; ecosystem; example; ferrara; figure; flow; injection; input; iot; java; joycar; joystick; julia; language; line; may-2019; methods; motor; native; particular; proceedings; programming; programs; propagation; security; sinks; software; source; spoto; static; systems; taint; taint analysis; tainted; things; user; value; vulnerabilities; warning
    • versions: original; plain text
68. 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: analysis; applications; autonomous; berlin; bernardeschi; complex; computer; conference; control; cps; cpss; critical; cyber; design; development; doi:10.1007/978; domenici; eceasst; eds; environment; formal; formal verification; function; hardware; heidelberg; hil; hol; hybrid; initial; integrated; international; language; level; logic; loop; methods; model; order; pacemaker; physical; prover; proving; pvs; requirements; safety; simple; simulation; software; specification; springer; stage; system; theorem; theory; time; verification; volume
    • versions: original; plain text
69. 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: analysis; approach; autonomous; behavior; bensalem; bip; case; checking; cmd; code; compiler; components; control; design; detection; dragomir; driver; ergo; esrocos; execution; fault; fdir; figure; framework; generated; language; model; modeling; nominal; properties; real; recovery; requirements; rigorous; robotics; smc; statistical; study; system; taste; test; time; tools; watchdog
    • versions: original; plain text
70. 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: 2017; abstract; advances; alarms; analysis; bases; build; case; code; compiler; cost; data; dependencies; development; eds; external; feedback; files; formal; frama; functions; industrial; information; initial; international; large; lecture; libraries; list; methods; new; open; present; proceedings; process; results; runtime; semantic; setup; software; source; specification; time; tools; usability; user; verification; volume
    • versions: original; plain text
71. 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: acm; analysis; approach; askthecode; assertion; backward; certain; conference; control; debugging; developers; error; example; execution; exploration; fixing; flow; graph; hand; ieee; interactive; international; manual; method; node; prevention; program; randomnode; semantics; situations; symbolic; trace; visual; volume
    • versions: original; plain text
72. 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: build; change; code; electronic; ellen; ercim; evolution; international; maja; mens; model; open; papers; preface; product; refactoring; research; software; source; support; symposium; systems; tom; tool; van; volume
    • versions: original; plain text
73. 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: academia; acm; applicability; application; approaches; autonomous; challenges; checking; collaboration; complex; coverage; deep; different; eceasst; engineering; evaluations; figure; focus; generation; industrial; industry; integration; mbt; model; networks; neural; novel; number; optimization; potential; practice; problems; projects; research; review; scalability; scalable; scale; software; software testing; state; systems; techniques; technology; testing; use; verification; volume; world
    • versions: original; plain text
74. 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: application; basagiannis; centre; challenges; industrial; interavt; irish; lero; practice; research; software; stylianos; systems; techniques; testing; university; verification; volume; workshop
    • versions: original; plain text
75. 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: abstract; abstraction; accesses; alarms; analysis; approach; bugs; cegar; corresponding; cpalockator; data; detection; different; drivers; environment; example; false; figure; kernel; linux; memory; model; modular; modules; precise; projection; race; real; second; set; state; synchronization; thread; tool; transitions; variables; verification; warnings
    • versions: original; plain text
76. 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: approach; block; computer; control; cos; development; distance; figure; following; formal; interactive; law; lemma; line; mathematical; model; modeling; proving; pvs; requirements; robot; simulation; sin; smt; state; step; system; theorem; theory; upper; vehicle; verification; y(i; ∆tv
    • versions: original; plain text
77. 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: approach; case; checking; clustering; consistency; design; end; figure; formalization; formalized; future; generation; georgios; identification; industrial; interavt; ireland; language; legacy; level; monitor; natural; new; nlp; order; pattern; processing; rapid; reform; requirements; results; section; solution; specification; studies; tool; user; verification; volume
    • versions: original; plain text
78. 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: active; alphabet; application; automata; behavior; button; click; coordinates; counter; custom; design; digital; dime; doi:10.1007/978; eds; example; experiment; figure; initial; input; learner; learning; learnlib; lncs; mdd; mining; model; page; position; prototype; robot; set; simulator; software; states; steffen; symbols; systems; testing; volume; way; web
    • versions: original; plain text
79. 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: approach; artefacts; assessment; attribute; bdd; bdd stories; behaviours; class; conference; consistency; development; different; doi; domain; elements; entity; example; figure; gui; guis; interaction; international; models; noun; ontology; proceedings; prototypes; relationship; requirements; rule; scenario; set; silva; software; specification; step; stories; story; system; task; testing; user; verb; verification; vol; winckler; withdraw
    • versions: original; plain text
80. 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; application; article; code; complex; composite; computer; control; default; diagrams; different; eceasst; evolution; example; figure; flow; graph; graph transformation; initial; input; introduce; language; lecture; limitations; machine; mechanisms; mens; metamodel; model; model refactoring; modeling; necessary; need; notes; order; proc; prototype; pseudostate; purpose; refactoring; region; rules; science; software; state; structure; support; systems; tools; transformation; transitions; type; uml; uml models; use; visual; volume; way
    • versions: original; plain text
81. 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: acm; aim; analysis; android; android malware; android ransomware; applications; approach; automata; automaton; classification; computer; computing; conference; data; detection; device; different; dynamic; eceasst; effectiveness; entropy; families; formal; ieee; information; interavt; international; january; journal; legitimate; logic; malicious; malware; malware detection; martinelli; measure; mercaldo; method; mobile; mobile ransomware; model; nardone; network; november; number; precision; ransomware; ransomware detection; recall; recv; research; santone; security; software; symposium; system; table; techniques; tool; trace; users; verification; visaggio; visit; volume; workshop
    • versions: original; plain text
82. 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: arguments; assurance; assurance cases; autonomous; autonomous systems; behaviour; beliefs; cases; different; dp18; duckiebots; duckies; duckietown; eceasst; engineering; entangled; environment; evidence; example; figure; goal; gsn; ideas; illumination; interavt; international; iso; lists; mandatory; modelling; need; nodes; notation; paper; physics; probability; prompts; quantum; research; results; risks; safety; section; software; standard; state; superposition; systems; testing; time; treatment; types; uncertainties; uncertainty; use; vehicles; volume; world
    • versions: original; plain text
83. 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: application; centre; industrial; interavt; lero; limerick; modern; practice; research; systems; techniques; testing; university; verification; workshop
    • versions: original; plain text
84. 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: altitude; applications; approach; approx; broadcasts; buildings; center; cities; communication; computer; cooperative; different; distance; framework; ieee; information; intersection; networks; number; opportunistic; perception; points; random; relaying; scenario; simulations; smart; uavs; urban; use; vehicles; vehicular; wireless; work
    • versions: original; plain text
85. 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: analysis; b(k; components; compute; deterministic; discrete; distribution; error; gi/1; idle; interdeparture; jsd; model; multicomponent; networks; performance; processes; queueing; renewal; sojourn; system; time; time distribution; vol; waiting; ● ●
    • versions: original; plain text
86. 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: circuits; congestion; control; data; distributed; fairness; feedback; hop; latency; max; messages; min; model; mpc; multi; network; number; optimization; pctcp; performance; potential; predictive; predictor; protocol; rates; relays; results; scenarios; security; sizes; throughput; time; vanilla
    • versions: original; plain text
87. 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: activity; beecher; boldyreff; capiluppi; case; data; date; debian; debian projects; developers; development; different; distribution; eceasst; entry; evolution; evolutionary; floss; floss projects; forges; goal; hypothesis; information; international; larger; metrics; number; open; point; proceedings; projects; question; rank; repositories; research; results; sample; second; section; sf.net; similar; size; software; source software; sourceforge; study; success; successful; summary; table; terms; test; time; touches; volume; wilcoxon
    • versions: original; plain text
88. 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: aggregated; aggregation; algorithm; applications; architecture; clustering; clusters; correlation; data; datasets; distributed; edge; estimator; federated; figure; iid; input; layer; lcss; learning; machine; mobility; models; network; neural; non; nsim; output; pearson; process; similarity; systems; training; user; weights
    • versions: original; plain text
89. 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: andreas; benchmark; demo; evaluations; figure; files; förster; interface; manager; networks; omnet++; ootb; oppnets; opportunistic; ops; performance; platform; protocols; queue; results; server; service; simulation; store; user; worker
    • versions: original; plain text
90. 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: andreas; applications; base; communication; data; demo; different; easy; figure; fish; hardware; low; main; molenet; monitoring; network; nodes; power; sensor; soil; station; system; underground; use
    • versions: original; plain text
91. 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: adaptive; attack; bed; cloud; cluster; conference; control; controller; cps; detection; digital; edge; emulator; intrusion; k8s; kihl; model; native; network; physical; plc; skarin; state; system; test; twin
    • versions: original; plain text
92. 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: arduinojson; bit; buffers; byte; clock; cost; data; devices; efficient; energy; esp8266; evaluation; formats; implementations; internet; iot; json; libraries; message; mpack; nanopb; objects; olaf; protocol; serialization; size; stm32f446re; things; transmission; use; xdr
    • versions: original; plain text
93. 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: active; algorithms; applications; approach; aqm; congestion; different; figure; flows; forwarding; hardware; high; implementation; kernel; languages; latency; level; linux; management; mininet; networks; packet; performance; prototyping; queue; queuing; ralf; rapid; raw; schedulers; space; system; tcp; throughput; user; work
    • versions: original; plain text
94. 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: access; approach; auth; certificate; chaining; client; components; concept; decision; device; enterprise; functions; header; http; ips; network; packets; paper; pep; processing; resource; respective; security; service; tls; traditional; trust; trustworthiness; ztsfc
    • versions: original; plain text
95. 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: action; agent; algorithm; approach; aqm; average; bandwidth; bottleneck; bronze; case; class; classes; conference; congestion; control; decision; deep; deep learning; deep reinforcement; delay; dqn; eceasst; end; episodes; fair; figure; flows; gold; learning; link; management; mbps; model; netsys; network; neural; optimal; order; packets; performance; possible; priority; problem; process; qos; queue; queuing; rate; reinforcement; reinforcement learning; replay; requirements; results; reward; scheduling; section; service; set; silver; simulation; smart; state; table; target; tcp; throughput; time; traditional; traffic; training; udp; values; volume; weights; wfq
    • versions: original; plain text
96. 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: algorithm; ancestor; approach; artifacts; ast; ast model; changes; class; code; code synchronization; codedom; common; concrete; conflicts; database; development; differencing; different; domain; eceasst; edit; engineering; evolution; fig; files; general; generated; generation; int; iterative; java; language; level; matching; memory; merge; merging; method; mobile; model; modified; node; novel; number; ole.wr; operations; order; paper; parser; phase; pims; platform; psm; psms; public; scripts; software; solution; source; source code; space; specific; state; support; synchronization; techniques; transformation; tree; vmts; void; volume; way; work
    • versions: original; plain text
97. 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: alternative; andreas; architecture; aware; communication; destination; early; eceasst; engineering; figure; gbit; hosts; ietf; implementation; internet; level; multipath; network; networking; p2p; pan; path; peers; practical; price; research; scion; selection; total; traffic; use; utilization; volume; way
    • versions: original; plain text
98. 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: andreas; application; communication; delay; demo; emulation; emulator; features; flowemu; game; gui; interactive; interface; model; modules; netsys; network; open; packet; parameters; queuing; real; set; single; source; statistics; test; time; traffic; user
    • versions: original; plain text
99. 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; base; capabilities; cities; city; cloud; context; data; domains; dynamic; environment; fiware; hjgh15; information; knowledge; management; mas; model; multi; need; ngsi; order; platform; possible; problems; robotic; smart; solutions; state; systems; teams; use; work; world
    • versions: original; plain text
100. 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: application; approach; architecture; compression; control; cooperative; data; environment; figure; information; instant; layer; maps; multiple; navigation; network; protocol; sequence; shared; sharing; systems; time; uavs; vehicles; work
     • versions: original; plain text
101. 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: analytical; block; channel; coefficients; communication; design; diagram; diffusion; direct; emission; figure; form; fpga; frequency; function; gain; model; modeling; molecular; pa10; particle; processes; receiver; reception; results; simulation; system; technology; transfer; transmitter
     • versions: original; plain text
102. 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: early
     • versions: original; plain text
103. 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: acquisition; andreas; aodv; architecture; communication; control; data; delay; end; evaluation; figure; geophone; higher; hoc; hop; ieee; mbit; multi; network; number; packet; pdr; performance; protocols; rate; reactive; route; routing; rpl; seismic; size; subnetwork; survey; wgn; wgns; wireless
     • versions: original; plain text
104. 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: actual; adversary; andreas; applicable; assumption; attack; attacker; b+12; channel; characteristics; cirs; correlation; cross; high; ieee; inference; key; layer; legitimate; optimization; partners; physec; physical; prediction; press; primitives; properties; ray; reciprocal; results; security; wireless; wks20; work
     • versions: original; plain text
105. 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: 2.6.0; actual; build; build system; case; code; complexity; components; configuration; date; dependencies; dependency; directory; e p; e.g.; eceasst; edges; evolution; explicit; extra; figure; files; future; graph; growth; header; implicit; kernel; linux; linux build; linux kernel; list; logic; maintenance; makao; makefiles; measurements; modules; new; nodes; non; number; object; observation; order; paper; phase; process; recursive; rule; rules.make; s e; scripts; section; series; shows; sloc; software; software evolution; source; source code; study; style; support; system; targets; time; versions; vmlinux; volume; work
     • versions: original; plain text
106. 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: analysis; analytical; andreas; application; computer; data; discrete; distribution; evaluation; event; figure; hardware; hil; internal; layer; left; loop; measurements; model; modeling; network; performance; process; processing; real; right; ros; simulation; software; streaming; system; tcp; test; time; volume
     • versions: original; plain text
107. 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: attacks; cells; circuit; client; data; defense; demo; entry; fingerprinting; local; middle; multipath; nodes; operation; ors; rpis; server; setup; splitting; strategy; sub; tor; traffic; transmission; website; wehrle; wfp
     • versions: original; plain text
108. 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: authors; bremen; communications; data; demonstration; device; disaster; epidemic; forwarding; information; layer; lopy4; lora; loramac; management; node; operations; platform; protocol; pycom; rescue; rescuers; routing; solution; stack; system; use; vb00; work
     • versions: original; plain text
109. 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: affected; analysis; application; behavior; data; different; distribution; download; high; installations; internet; large; measurement; mediawiki; monitoring; new; releases; response; results; scale; security; software; systems; threat; time; versions; web; websites; wordpress; work
     • versions: original; plain text
110. 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: adversary; alternative; construction; coordinate; distance; efficient; embeddings; f2f; friend; greedy; honest; logical; malicious; message; neighbors; network; node; number; overlay; packet; replication; resistant; roos; root; routing; secure; spanning; timeout; tree
     • versions: original; plain text
111. 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: andreas; api; application; approach; bots; censorship; client; conference; cost; creation; custom; different; difficult; effort; engineering; identifier; key; malware; new; obfuscation; paper; polymorphic; possible; protocol; research; resistance; reverse; secure; security; service; social; techniques; user; volume; way
     • versions: original; plain text
112. 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: bootstrapping; citizen; city; collected; data; devices; external; fischer; hamburg; information; interface; jost; lamersdorf; network; new; node; open; processing; queries; sane; science; sensors; services; shared; smart; sources; space; system; urban; user; web; wide
     • versions: original; plain text
113. 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; border; configuration; connected; control; coordinator; core; default; different; future; internet; isd; ixp; ixps; links; multilateral; network; non; open; operators; peering; policies; route; rules; scion; scionlab; servers; set; work
     • versions: original; plain text
114. 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: abstract; analysis; architecture; available; c e; case; chain; code; comparison; complexity; computer; condition; conference; data; design; e n; e o; e r; eceasst; effort; end; engineering; evolution; experience; extractors; fetch; figure; file; format; functions; graph; guess; ieee; iii; impact; industrial; information; international; key; ksloc; language; large; methods; metrics; model; n c; n t; navigator; number; open; patterns; proceedings; quality; r o; refactoring; report; representation; reverse; rigi; scenarios; script; society; software; source; success; support; system; t r; table; test; testing; tools; usa; user; variation; visualization; volume; washington; work; √ √
     • versions: original; plain text
115. 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: aware; channel; collective; congestion; cpm; cpms; cps; dcc; default; edaf; f f; filtering; genc; higher; objects; perception; pve; rules; vehicles
     • versions: original; plain text
116. 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: acceleration; artery; behaviour; cacc; car; channel; characteristics; communication; controller; critical; following; ieee; impact; leader; longitudinal; loss; maximum; model; ots; path; platoons; radio; realistic; receiver; research; scenarios; simulator; situations; speed; stability; standstill; string; traffic; truck; truck platoons; vanet; vehicle
     • versions: original; plain text
117. 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: accuracy; anomaly; anomaly detection; approach; attacks; average; behavior; clients; clustering; clusters; collaborative; data; dataset; detection; different; distance; groups; hosts; inference; intrusion; learning; max; mean; method; models; network; prediction; preliminary; privacy; properties; property; results; similar; traffic; training
     • versions: original; plain text
118. 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: approach; certificate; chameleon; collision; computing; corresponding; dane; delegation; dnscore; dnsfog; dnssec; domain; hash; implementation; key; local; microservices; new; parameters; pattern; private; public; records; rrs; rrsig; server; signatures; signing; soft; tlsa; trust; verification; zone
     • versions: original; plain text
119. 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: adversary; approach; area; autonomous; avs; bank; carriers; challenges; communications; considerations; crime; discussion; generation; help; hiding; ideation; message; motion; opportunities; perspective; physical; potential; safety; scenarios; signal; sound; speculative; steganography; threat; time; traditional; unique; vehicle; vehicular
     • versions: original; plain text
120. 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: acm; adaptation; adaptive; agent; andreas; applications; approaches; architecture; authors; available; bandwidth; better; cloud; communication; computing; conditions; conference; content; content streaming; content types; control; cooperative; current; data; deep; degree; devices; different; dimensional; dimensional content; domain; eceasst; end; environment; example; experience; fairness; flows; higher; ieee; individual; interactivity; international; learning; level; md content; mechanisms; metrics; mobile; models; multi; multimedia; multiple; need; netsys; network; optimization; paper; parallel; point; possible; proceedings; processing; qoe; qos; quality; real; reality; reinforcement; requirements; research; resources; streaming; streams; studies; system; tiles; transitions; types; user; video; video streaming; virtual; volume
     • versions: original; plain text
121. 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; andreas; applications; approach; avionic; belt; cell; clx; communication; cross; delay; end; figure; framework; frequency; hops; ieee; information; layer; link; msf; networks; nodes; novel; packet; phase; qos; routing; rpl; scenarios; scheduling; seat; sensor; sink; slotframe; stack; time; tsch; waic; wireless
     • versions: original; plain text
122. 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: approach; architecture; artefacts; business; case; client; closer; clusters; cobol; code; concept; connected; context; copybooks; data; dependencies; dependency; design; documents; doi:10.1109; eceasst; engineering; entities; evolution; exceptional; facade; figure; functional; functionality; group; high; information; interface; legacy; level; lightweight; migration; missing; model; nodes; number; programs; responsible; section; service; soa; software; source; structure; study; suppliers; system; tool; usage; view; visual; visualisations; volume
     • versions: original; plain text
123. 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: algorithm; analysis; attack; attacker; balancers; cid; cids; client; connection; destination; enumeration; evaluation; following; implementations; instances; load; new; number; packet; paper; protocol; quic; requests; security; server; source; transport; use; volume; vulnerable
     • versions: original; plain text
124. 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: ancillary; attack; ball; beam; bed; cloud; cluster; control; controller; demo; detection; figure; framework; intrusion; kubernetes; main; measurement; mitigation; network; overview; plant; security; signal; system; test
     • versions: original; plain text
125. 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: analogue; client; component; computer; connected; connection; consumers; control; db25; digital; display; framework; frank; idn; ilda; isp; laser; local; matthias; network; options; projector; server; signals; software; specification; streams; tester; testing; use; web; wlan
     • versions: original; plain text
126. 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: additional; applications; approach; attachment; authentication; behavior; connection; data; device; e.g.; encoder; factor; frame; hashing; history; information; int; key; keyed; mobile; model; network; observation; ope; order; points; privacy; proc; protection; scalability; scalable; security; sensitive; server; traces; user; works
     • versions: original; plain text
127. 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: acm; actions; agent; andreas; approach; architecture; binary; case; changes; chen; city; communication; comnav; congested; congestion; context; corresponds; data; decision; deep; design; destination; devices; different; eceasst; environment; fct; fib; fig; flow; flowagent; forwarding; function; game; hidden; indianapolis; information; larger; layer; learning; link; location; memory; multiple; navigation; netsys; network; networking; neural; new; node; number; output; pacific; packet; parameters; path; policy; port; process; protocol; recurrent; reinforcement; reward; rnn; routing; rules; seattle; set; sigcomm; source; specific; state; step; strategy; switch; system; time; topology; traffic; training; usa; use; utilization; value; volume; wave; york
     • versions: original; plain text
128. 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: andreas; attacks; classifier; conference; ctip; cyber; data; detection; different; evaluation; features; genuine; intelligence; malicious; model; modular; module; multi; new; online; paper; phishing; platform; proxy; results; security; set; stage; suspicious; suspicious websites; technique; thabtah; threat; threat intelligence; url; urls; users; websites; work
     • versions: original; plain text
129. 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; acm; active; application; approaches; attacks; authors; best; browser; browser fingerprinting; budget; case; chrome; classification; classifier; conference; content; ctgan; data; dataset; decision; detection; differential; differential privacy; discriminator; dprf; eceasst; entropy; features; figure; fingerprinting; firefox; flows; forest; framework; generation; guarantees; ieee; information; learning; machine; mechanisms; method; model; netsys; network; non; number; packet; passive; pate; precision; privacy; private; private classifier; private synthetic; protocol; quail; random; real; recall; related; research; results; section; security; size; symposium; synthetic; synthetic data; time; trade; traffic; use; utility; values; volume; web; websites
     • versions: original; plain text
130. 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: addition; analysis; approach; architecture; artifacts; assets; basis; case; change; commonalities; commonality; complete; delete; development; different; domain; engineering; evolution; ieee; impact; implementation; individual; infrastructure; level; line; maintenance; modification; modify; new; operations; pages; particular; product; product line; relation; relevant; requirements; resolutions; schmid; section; single; software; software product; specific; spl; sub; support; system; taxonomy; test; usage; variabilities; variability; work
     • versions: original; plain text
131. 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: acm; andreas; approach; centralized; challenges; communication; consistency; controller; data; deterministic; figure; ieee; measurement; network; new; operators; p4update; packets; plane; probe; programmable; reconfigurable; reconfiguration; segway; software; speed; state; time; update; volume
     • versions: original; plain text
132. 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: attackers; attacks; black; blackhole; data; delay; delivery; dos; forwarding; hole; low; malicious; networks; nodes; number; oppnets; opportunistic; packets; protocols; rate; ratio; results; sec; total
     • versions: original; plain text
133. 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; central; chaining; classification; cloud; configuration; data; departments; figure; firewall; function; infrastructure; local; network; nfv; portal; routing; self; service; sfc; switch; traffic; use; users; virtual; vnf; vnfs
     • versions: original; plain text
134. 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: andreas; arm; case; collaborative; components; eceasst; gil; graph; hardware; industrial; manufacturers; mayoral; measures; mechanics; mobile; networks; obsolescence; planned; repair; research; robot; robotics; safety; security; series; stefan; study; system; teardown; vilches
     • versions: original; plain text
135. 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; analysis; avecalc; bags; cases; change; coffee; complete; design; different; evolution; evolution tasks; executable; experiment; figure; fit; fit tables; fitnesse; framework; group; java; lab; latazza; maintenance; maintenance tasks; number; paper; proc; requirements; results; secretary; small; software; students; study; subjects; support; system; tables; tasks; test; testing; threats; time; use; validity; volume; work
     • versions: original; plain text
136. 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: abstracts; alexey; andreas; anna; berlin; blenk; ccfati3; chairs; communication; conference; contents; daniel; digital; early; eceasst; extended; fischer; forum; förster; germany; gesellschaft; giel; hamburg; institute; international; itg; jens; koojana; kuladinithi; lamersdorf; learning; lübeck; malene; management; martin; mathias; michael; münchen; netsys; networked; networking; networks; papers; peer; phd; preface; program; ralf; science; society; stefan; steinmetz; strufe; sweden; systems; table; technologies; technology; thorsten; threat; timm; universität; university; vinel; volume; winfried; wonan; workshop
     • versions: original; plain text
137. 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: approach; artificial; brief; check; choices; clear; data; decisions; deontic; deontic logic; device; divulge; eceasst; ethical; ethics; example; health; human; intelligence; introduction; issues; logic; mathematical; matters; ob(nr; obligation; obligatory; operand; paper; patient; privacy; responsibility; risk; robotics; robots; rules; sick; sick/¬sick; statement; system; technology; user; volume; wearable; wearable device; wearable technology
     • versions: original; plain text
138. 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: algorithm; applications; approach; architecture; better; bnf; code; complexity; computing; controllers; coordinates; development; different; eceasst; elements; evolutionary; evolvable; experiment; figure; fitness; framework; function; general; generation; genetic; good; grammar; grammatical; high; hyperparameters; improved; individuals; isola; learning; level; manufacturing; margaria; maze; mazegen; model; navigation; new; number; ones; order; population; process; random; real; research; robotic; scenarios; search; selection; set; size; smart; software; solutions; springer; symposium; target; use; version; volume; way; world
     • versions: original; plain text
139. 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: analysis; approach; architecture; areas; background; bmc; business; canvas; case; circular; companies; confirm; context; current; data; decision; development; domain; dsl; eceasst; figure; framework; goals; guidance; high; important; integrated; integration; isola; knowledge; level; logic; making; management; manufacturing; margaria; model; modelling; need; new; order; organisations; paper; platform; qualitative; research; risk; ryan; sdgs; software; specific; steffen; study; support; sustainability; sustainable; tool; understanding; volume; workshop
     • versions: original; plain text
140. 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: 2020; addition; adopting; adoption; alignment; approach; asking; benefit; better; business; canvas; change; clear; competences; complexity; conscious; context; corresponding; costs; criteria; current; customers; decision; design; different; digital value; digitalization; dimension; eceasst; enabled; end; established; expertise; figure; focuses; fourth; funding; future; gap; germany; goal; government; holistic; hospitals; impact; implementation; important; industry; innovation; integrated; internal; international; isola; khzg; krankenhauszukunftsgesetz; legacy; long; making; market; means; measures; motivation; needs; new; opportunities; organizations; paper; project; proposition; quality; relevant; requirements; revolution; sanctions; section; services; software; solutions; specific; staff; stakeholders; steffen; strategies; strategy; strengths; success; successful; support; systems; technologies; technology; term; tesla; threat; time; today; transformation; understanding; value; value canvas; vision; volume; vuca; years
     • versions: original; plain text
141. 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: analysis; analytics; applications; approach; architecture; automatic; b. steffen; building; business; capabilities; case; class; code; complex; components; control; data; dataset; design; development; different; digital; digital thread; dime; document; domain; dsls; eceasst; end; environment; equipment; examples; experts; external; fig; figure; flow; formal; functionalities; functions; generation; graphical; gui; hierarchical; ieee; implementation; individual; industrial; industry; information; integrated; integration; international; interoperability; isola; language; layer; level; list; low; machines; maintenance; manufacturing; margaria; mdd; meta; methods; model; modeling; native; naujokat; needs; new; operations; order; platform; predictive; process; processes; programming; pyrus; python; ready; research; service; sibs; smart; smart manufacturing; software; specific; springer; steffen; systems; technologies; thread; thread platform; time; tools; use; users; verification; volume; way; web; workflows
     • versions: original; plain text
142. 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: application; approach; array; binding; case; cation; class; complete; connecting; constant; corresponding; current; data; delete; e.lab; e.trg; eceasst; edge; engine; entry; example; figure; graph; graph pattern; graph transformation; incremental; incremental graph; incremental pattern; initial; insert; label; level; lhs; lhs pattern; mapping; matching; method; model; nac; negative; new; nodes; noti; order; package; paper; partial; pattern; pattern matching; plans; proc; ref; representation; rete; rst; rule; search; section; single; structures; subpattern; time; transformation; tree; type; type type; variable; volume
     • versions: original; plain text
143. 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: activity; analysis; attributes; changes; classes; code; constant; core; course; data; design; developers; effect; effort; empirical; evolution; evolvability; example; field; figure; fowler; increase; interesting; java; large; maintenance; mens; methods; new; number; package; peak; proc; question; refactoring; regular; relationship; research; results; set; shows; significant; software; specific; study; system; table; terms; time; trends; trough; vcscore; velocity; versions; volume; work
     • versions: original; plain text
144. 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: aim; algorithm; application; approach; automating; available; blood; cancer; case; communication; complex; current; data; data model; database; department; development; different; dime; domain; eceasst; environment; fig; figure; haematology; haematology department; healthcare; healthlink; hl7; hospital; human; information; initial; interface; isola; layer; level; library; management; manual; messages; mgus; model; multiple; myeloma; mymm; mymm application; network; new; object; outcome; paraprotein; patient; patient data; possible; process; process model; processes; processing; projects; ratio; referral; research; results; risk; risk stratification; sample; scheduled; server; service; set; sflc; sibs; solution; specific; staff; step; stratification process; system; technologies; type; university; use; validation; value; volume; way; web; web application; workflow
     • versions: original; plain text
145. 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: anila; anna; doctoral; germany; lamprecht; lena; mjeda; symposium; university; volume
     • versions: original; plain text
146. 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; approach; bytecode; change; classes; clone; code; count; data; detection; different; distance; distribution; doi:10.1109; eceasst; evolution; figure; final; framework; history; information; instructions; international; java; jung; level; maintenance; measures; method; metrics; modification; modified; new; number; object; observations; open; order; previous; probability; proceedings; profile; proportion; release; resilience; section; set; small; software; source; study; systems; times; unchanged; version; volume; work
     • versions: original; plain text
147. 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; adaptive; application; application parts; approach; available; campus; changes; collections; combination; component; context; control; cpu; current; d&c; decomposition; decomposition tree; device; different; distribution; divide; eceasst; example; figure; functions; global; group; happiness; high; instances; large; memory; middleware; music; negotiation; new; nodes; number; operations; organization; packs; parts; paul; pda; priority; problem; quality; reasoning; resource; result; rules; section; state; strategies; theatre; time; tree; units; user; utility; variants; volume; work
     • versions: original; plain text
148. 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; architecture; availability; available; avy; bpimp; browser; capabilities; components; configuration; content; crimpl; devices; example; implementation; instantsocial; internet; isfull; media; middleware; mobile; model; multi; music; paul; pimpl; predictors; presentation; property; provided; repository; resources; rut; self; service; situation; user; utility
     • versions: original; plain text
149. 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: able; access; adaptability; advantages; agents; amase; applications; approach; architecture; autonomous; aware; awareness; campus; capabilities; class; code; com; conf; context; context awareness; control; data; different; dynamic; environment; example; features; frameworks; ieee; implementation; information; int; krs99; learning; level; mechanism; middlewares; mobile; mobility; negotiation; network; order; paradigm; pervasive; privacy; proc; properties; qoc; qos; quality; reactive; reasoning; resources; section; security; sensors; services; site; state; support; survey; systems; user; volume
     • versions: original; plain text
150. 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; applications; approach; architecture; arl; aware; client; connection; context; current; device; device parameters; different; future; information; interface; language; management; middleware; mobile; multimedia; paper; parameters; power; preferences; presentations; processing; proxy; rules; section; server; services; situation; size; support; user; video; work
     • versions: original; plain text
151. 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: abstract; approach; assistance; aware; base; campus; class; component; constraint; context; criteria; current; das; data; decision; description; different; distance; domain; driver; driving; dynamic; eceasst; environment; figure; high; information; integration; intelligent; knowledge; language; level; line; logic; mapping; model; modeling; numerical; objects; oncoming; ontology; owl; participants; process; programming; qualitative; rdf; real; reasoning; representation; respect; risk; rules; scenario; scene; sensing; set; signs; situation; spatial; spatio; speed; state; systems; temporal; time; traffic; values; variables; vehicle; volume
     • versions: original; plain text
152. 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: adaptable; adaptation; adaptive; alternative; analysis; applications; aware; c t; chameleon; changes; code; consumer; consumption; context; cost; deployment; development; devices; dynamic; e c; environment; evolution; execution; figure; framework; generic; gprs; high; java; l e; learning; lesson; methods; middleware; mobile; model; n e; n t; network; new; plastic; process; profile; project; provider; qos; r e; requested; resource; run; s t; section; self; service; set; sls; software; state; supply; t e; t h; t o; t r; t t; user; void; wifi
     • versions: original; plain text
153. 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; access control; actual; aggregation; applications; approach; architecture; authentication; aware; campus; case; certain; client; cmf; combination; components; concrete; conditions; context; context information; control; control directives; corresponding; cps; current; data; different; directives; distributed; distribution; eceasst; elements; entity; figure; filtering; framework; general; information; infrastructure; interface; iyouit; level; like; location; luther; main; management; means; mechanisms; mirror; mobile; need; network; ontology; parameter; personal; principle; privacy; proc; process; qualitative; reasoning; relationships; request; respective; section; services; share; sharing; social; specific; system; techniques; time; user; volume; web
     • versions: original; plain text
154. 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; anims; applicable; application; approach; behavior; case; clock; construction; correctness; definition; ehrig; fig; gi+1; gramot; graph; hi+1; language; model; modeling; nacs; pecv; proc; radio; rule; s2a; s2a transformation; s2am; s2ar; science; section; semantical; sequence; set; sims; simulation; source; specification; state; step; study; target; theorem; time; transformation; type; view; visual; vla; vls; volume; � �
     • versions: original; plain text
155. 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: able; adaptation; applications; approach; aware; bootstrap; cappucino; client; components; computing; context; devices; elements; environment; figure; generation; information; loading; main; metamodel; mobile; model; process; project; proposal; section; server; services; shared; software; ubiquitous; user
     • versions: original; plain text
156. 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: account; adaptation; applications; approach; aware; bandwidth; component; coordination; cost; crl; deployment; devices; dicomploy; distributed; environment; function; hoc; host; large; learning; memory; middleware; migration; mobile; nodes; optimal; requirements; resource; scenario; section; self; server; systems; user; way; work
     • versions: original; plain text
157. 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: adaptation; applications; behaviour; channels; classification; computing; constraints; context; control; devices; environment; feature; homes; interaction; issues; layer; needs; pervasive; pervasive computing; qos; services; smart; software; systems; telecommunication; time; trigger; types; user; variables; volume; work
     • versions: original; plain text
158. 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: action; ambienttalk; application; aware; aware programming; behavior; block; case; cellular; changes; code; collections; concurrency; conf; construct; context; coordination; crime; def; dependent; devices; eds; embedding; event; explicit; fact; fact space; handlers; information; interface; introduction; language; logic; loop; method; middleware; model; new; object; phone; proc; profile; programming; public; query; reactive; reactive context; reactive programming; results; retraction; room; rule; section; sound; space; state; study; system; temperature; underlying; volume
     • versions: original; plain text
159. 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; adaptation middleware; adaptive; application; approach; architecture; associated; available; bat; campus; case; communication; component; configuration; context; dependability; dependability mechanisms; dependable; device; different; eceasst; eliassen; environment; example; execution; fault; figure; frequency; function; implementation; int’l; lat; logger; mechanisms; middleware; mobile; model; modeling; music; network; new; nodes; particular; paul; planning; plans; properties; property; qos; quality; related; reliable; scenario; scene; section; service; software; state; storage; strategies; study; support; systems; type; ubiquitous; user; utility; value; video; volume
     • versions: original; plain text
160. 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; applications; aware; campus; caporuscio; context; development; environments; france; germany; inria; kassel; mauro; michael; mobile; norway; oslo; papers; pervasive; preface; romain; rouvoy; services; technical; ubiquitous; university; volume; wagner; workshop
     • versions: original; plain text
161. 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: claudia; ermel; germany; graph; heckel; italy; juan; lara; modelling; notations; preface; reiko; techniques; transformation; universität; university; visual; vmt; workshop
     • versions: original; plain text
162. 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: animation; behaviour; boundary; buffer; channel; colouring; colouring table; components; connector; coordination; dataflow; dynamic; eceasst; ends; engine; exclusion; fifo1; figure; framework; graph; language; matches; mixed; model; new; nodes; operation; paper; pattern; primitive; reason; reconfiguration; regions; reo; reo connectors; rule; run; section; semantics; set; sink; source; state; structure; system; table; time; transformation; use; vmt; volume; write
     • versions: original; plain text
163. 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: agg; applicability; applicable; application; asymmetric; criteria; criterion; def; definition; dependency; direct; following; graph; h21; independent; injective; nacr2; nacs; nextproc; non; pair; parallel; predecessor; process; releaseres; requestres; resource; resp; rule; rule sequence; sequence; sequential; start; sufficient; takeres; theorem; transformation
     • versions: original; plain text
164. 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; actions; agent; application; approach; asf; atl; beliefs; body; class; classes; code; design; design models; development; evolution; false; figure; framework; goals; implementation; instances; language; mas; mde; metamodel; method; modeling; models; multi; new; plans; platform; play; proc; properties; rules; set; source; specification; systems; target; techniques; transformation; uml; use
     • versions: original; plain text
165. 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: adhesive; airport; allowtakeoff; application; arrboarding; arrfield; category; concurrent; conditions; conflict; context; critical; depart; depboarding; depfield; example; extension; factorization; fairweather; forbidtakeoff; gates; hlr; landing; morphism; nacs; negative; nets; openstartingrunway; pair; petri; place; property; psl; pts; pushout; reconfigurable; results; rule; runway; section; sequence; solution; starting; storm; strict; systems; t systems; takeoff; tower; transformation; transition; warning
     • versions: original; plain text
166. 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: access; atoms; bigraphical; bigraphs; bisimilarity; bonds; chemical; composition; computer; connections; construction; context; control; ctrl; definition; directed; discrete; downward; e e; eceasst; edges; electrons; encoding; example; figure; following; form; framework; ground; iff; inner; interface; ipo; iso; link; map; mil06; milner; names; negative; nets; nodes; normal; open; outer; pair; petri; place; polarized; ports; positive; prime; proc; product; prt; reaction; reactive; resource; rpo; rule; science; section; server; service; set; sets; sharing; signature; systems; tensor; theorem; transition; vmt; volume; x :o; y x
     • versions: original; plain text
167. 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: approach; backtracking; combinators; connected; context; description; eceasst; edges; efficient; error; example; fig; flowgraphs; following; framework; functional; general; grammars; graph; graph parser; grappa; haskell; hrg; hyperedge; hypergraph; implementation; instance; language; library; logic; node; numbers; paper; parser; parser combinators; parsing; particular; performance; possible; primitive; proc; production; program; programming; purpose; replacement; report; result; return; sect; sequence; set; special; stmts; string; tentacle; transformation; type; use; visual; vmt; volume; way
     • versions: original; plain text
168. 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: activity; adjacent; application; article; breakdown; case; classical; communication; distance; eceasst; edge; example; exclusion; far; figure; following; global; graph; graph transformation; hand; label; left; like; links; local; means; message; mobile; model; modeling; mutual; negative; neighbourhood; network; new; nodes; non; note; number; operational; paradigm; partners; passing; proc; progres; property; rule; scenario; section; semantics; small; star; system; terms; time; transformation; transformation model; triangulated; triangulation; type; units; visidia; vmt; volume
     • versions: original; plain text
169. 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: access; actions; alloy; analysis; analyzer; approach; architecture; bike; changes; components; configuration; connectors; definition; dsa; dynalloy; dynamic; dynamism; eceasst; edge; elements; example; figure; formal; gin; grammars; graph; hand; hypergraph; initial; labels; language; model; morphism; node; order; partial; particular; point; possible; proc; production; programmed; properties; property; r(g; rewriting; right; running; section; service; set; signature; software; specification; state; station; step; style; systems; tgg; transformation; type; use; verification; vmt; volume
     • versions: original; plain text
170. 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: accessibility; apartment; area; attributes; components; computer; corresponding; design; designer; development; diagram; different; eceasst; elements; example; external; figure; function; hierarchical; hierarchical layout; hyperedge; hypergraph; internal; knowledge; labels; language; layout; layout hypergraph; living; nested; new; nodes; number; operation; predicate; proc; reasoning; relations; representation; result; semantic; set; sleeping; specified; suppression; syntactic; system; visual; volume; walls; way
     • versions: original; plain text
171. 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; approach; attribute; class; code; components; constraints; diagram; diameta; drawing; dummy; dynamic; dynamic layout; editing; editor; evaluation; example; figure; framework; free; graph; hand; initial; language; layer; layout; layout algorithm; layouter; layouting; mm07a; model; new; node; phases; position; rules; section; specification; statechart; states; static; strategy; structured; sugiyama; transformation; transition; user; visual
     • versions: original; plain text
172. 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: application; cast; checking; class; code; conditions; declaration; definition; e n; e s; edge; error; expression; figure; functions; graph; icon; instantiation; long; lookup; message; node; o n; ol p; operators; overload; p e; p p; parameters; path; proc; programs; r e; resolution; rule; safe; section; size; source; template; transformation; tree; ttc; type; t|d; use; vmt; warning
     • versions: original; plain text
173. 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: arc; base; bool; byx; check; colored; constrained; crect; definition; eceasst; example; figure; free; function; geth; getw; gluing; graph; ground; height; inheritance; int; intint; link; method; mvh; mvw; node; note; object; object type; operation; otg; paper; premorphism; problems; proc; production; rectangle; recursive; representation; section; self; self type; set; starting; subbase; subtyping; transformation; type; type graph; vmt; volume; width
     • versions: original; plain text
174. 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: adhesive; algebraic; algebras; application; case; categories; class; context; criterion; definition; dpo; element; f(a; figure; function; general; grammars; graph; hand; hlr; inhibitable; inhibition; inhibitors; lag; level; match; matches; model; morphisms; multiset; nacs; nodes; notion; number; objects; proc; proof; properties; pushout; rewriting; rule; section; set; sig; signature; sig’-alg; sorted; specific; systems; termination; termination criterion; transformation; version; volume
     • versions: original; plain text
175. 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: abstract; backtracking; bytecode; changes; choice; compiler; computer; current; eceasst; edges; environment; example; failure; figure; generation; graph; implementation; input; label; language; list; machine; matches; minimum; node; non; nondeterministic; notes; number; plump; point; possible; proc; program; programming; rule; schemata; science; section; semantics; set; sierpinski; spanning; stack; system; time; transformation; tree; triangle; vmt; volume; yam
     • versions: original; plain text
176. 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: accept; accept state; algorithm; approach; automata; automaton; chart; cold; condition; cut; enabled; errors; event; example; fig; final; getdata; hot; idle; improved; initial; instance; int; jobid; ktww06; life; line; live; location; lsc; lscs; main; main chart; message; model; negative; node; non; outgoing; paper; positive; possible; pre; proc; process; processes; result; safety; satisfied; scheduler; self; sequence; set; specification; state; successor; system; transformation; transformed; transition; validid; verification; violations
     • versions: original; plain text
177. 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: ambiguities; ambiguity; ambiguous; analysis; approach; areas; arrows; attachment; case; components; conflict; context; dag; derivation; diagen; diagram; drawing; edges; editor; example; exclude; fig; grammar; graph; hand; hyperedges; hypergraph; information; language; like; match; model; nacs; nets; nonterminal; parser; petri; place; possible; proc; productions; rating; recognition; reducer; reduction; related; relation; resolution; respective; rhm; rhs; rules; set; sketched; sketching; start; syntax; t_place; terminals; transitions; user
     • versions: original; plain text
178. 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: acyclicity; association; case; class; concepts; constraint; data; definition; diagrams; eceasst; edge; eds; example; fact; figure; formal; graph; hand; identifier; important; indexed; indexing; indices; inheritance; inst[tg; instance; instance graph; label; lncs; meaning; model; modelling; names; namespace; node; notion; object; pair; paper; particular; proc; satisfaction; section; semantics; set; software; source; springer; src(e; tgt(e; transformation; type; type graph; uml; uml class; unsharedness; use; vmt; volume; way; words
     • versions: original; plain text
179. 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: = =; canonical; class; classtablerel; component; consistent; correspondence; corresponding; decomposition; ehrig; elements; example; fact; fig; forward; g00; g10; grammars; graph; hand; integrated; integration; lemma; main; match; model; model integration; model transformation; morphisms; new; proc; projt; proof; result; rules; sch94; science; sequence; source; string; s−t; table; target; tgt; theorem; transformation; triple; trs; trst; tr∗f=⇒; tr∗i=⇒; tr∗st==⇒; ttt; type; vls0; vlt; volume; � �
     • versions: original; plain text
180. 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: abstraction; algebraic; application; approach; attribute; axioms; behavior; canonical; canonical form; case; cf0; component; conditions; constructor; corresponding; data; data abstractions; deterministic; different; example; figure; following; form; graph; graph transformation; instance; internal; language; lhs; method; model; mts; new; node; object; operation; pointer; pop; properties; push; read; rhs; rule; section; set; size; specification; stack; state; string; systems; transformation; type; verification; volume
     • versions: original; plain text
181. 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: abstract; active; agent; arity; code; compilation; compiler; configuration; eceasst; eps; eval; example; figure; following; free; iam; implementation; instruction; interaction; interaction nets; language; machine; memory; nets; nets ϒ; nil; pages; pair; paper; pin; ports; programming; rewriting; right; rule; sequence; set; stack; store; system; term; variables; vmt; volume; way
     • versions: original; plain text
182. 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: action; activity; approach; assignment; case; certain; condition; correctness; correspondence; correspondence rules; corresponding; cross; csp; decision; diagram; edge; elements; execution; expression; figure; fork; graph; great; incoming; instance; language; links; meta; model; model transformations; node; outgoing; output; pa.procex; path; process; process assignment; properties; rules; simple; source; structural; structural correspondence; target; technique; transformation; uml; use; verification; vmt; volume
     • versions: original; plain text
183. 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: algebraic; application; approach; blank; blank nodes; category; complement; conditions; consortium; construction; creation; data; definition; deletion; description; different; dpo; eceasst; eds; example; existence; figure; framework; graph; graph transformation; homomorphism; information; instantiations; language; literals; morphisms; mpoc; nodes; ontology; possible; predicates; proc; pushout; rdf; rdf graph; rdfinst; rdfs; resource; results; rule; schema; section; set; sets; specifications; theorem; theory; transformation; triple; type; unique; uri1; uris; use; vmt; volume; web; wide; world
     • versions: original; plain text
184. 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: approach; b l; basic; c t; child; class; common; connected; constr; constraint; constructs; database; dragos; e =; e c; e n; e t; edge; entities; figure; graph; l e; l f; l l; l u; language; m e; match; matches; mechanism; model; n c; n s; n t; nested; node; o l; o n; p e; pattern; proc; progres; qtl; queries; query; r t; recursive; reduction; reference; rule; s e; s s; s t; section; semantics; specialized; s→s e; t t; transformation; type; u e; value; variable
     • versions: original; plain text
185. 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: agg; analysis; application; applyrule; concurrency; conflict; consumer; domain; eclipse; editor; ehrig; environment; example; fig; fire; firing; formal; framework; graph; hand; high; independence; level; lhs; local; match; matches; modeling; net; net transformation; nets; object; object net; order; parallel; petri; place; producer; reconfigurable; ron; rons; rule; simulation; step; systems; tokens; tool; transformation; transition; type; view; visual
     • versions: original; plain text
186. 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: adjacency; application; approach; attribute; bottoni; cells; composition; computational; computing; construction; contour; control; cyberfilm; data; different; eceasst; edges; ehrig; elements; example; figure; flashing; flow; formula; graph; grids; languages; left; metamodel; new; nodes; object; particular; proc; pushout; relations; rules; section; set; size; spatial; state; structures; taentzer; transformation; type; upper; value; visual; vmt; volume
     • versions: original; plain text
187. 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: abstraction; analysis; approach; automata; base; behaviour; causal; certain; complex; components; computer; concepts; context; continuous; design; different; differential; discrete; eceasst; equations; event; experimental; figure; formalism; foundations; frame; general; graph; hot; input; international; level; liquid; model; modelling; multi; number; object; output; paper; particular; possible; process; real; representation; set; simulation; specific; state; structure; system; theory; time; trajectory; transformation; vmt; volume; world
     • versions: original; plain text
188. 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: andrew; diagrams; eceasst; editors; engineering; fish; gabriele; harald; languages; layout; preface; programme; software; störrle; university; visual; volume; workshop
     • versions: original; plain text
189. 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: 3d uml; attribute; book; challenge; class; classifier; data; diagram; eceasst; edge; evaluation; example; figure; following; groups; guidelines; heuristic; information; integer; interface; journal; language; layout; level; library; machine; mn90; model; new; overview; package; related; source; state; string; target; transformation; uml; unique; user; visualization; volume; workshop
     • versions: original; plain text
190. 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: abstract; application; approach; asg; best; changes; completions; components; constraint; corresponding; diagen; diagram; diagram completions; eceasst; edges; editing; editors; engine; example; fig; figure; following; grammars; graph; hand; hypergraph; instance; languages; layout; layouter; left; level; minimal; model; mouse; new; nodes; nsd; nsds; order; original; parser; particular; possible; problem; proc; proceedings; relations; respect; resulting; right; s1 s2; shortcut; size; srg; statements; stmt; stmt stmt; syntax; time; usability; user; visual; volume; way
     • versions: original; plain text
191. 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; application; approach; atomic; case; closed; components; concrete; concrete euler; contours; curve; cycle; description; diagram; dual; edges; embedding; euler; euler diagrams; example; extended; figure; general; generation; graph; hamiltonian; inside; label; layout; manner; method; minimal; nested; new; new curve; outside; pages; plane; problem; proc; required; section; set; simple; software; split; vertices; wellformed; wellformedness; zone
     • versions: original; plain text
192. 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: algorithm; alignment; applications; authoring; boundary; changes; cluster; constraints; detailed; diagram; drawing; dunnart; dwyer; dynamic; edges; engineering; figure; graph; graph layout; ideal; interactive; layout; length; marriott; model; network; nodes; path; placement; position; proc; separation; stress; tool; topology; user; variety; view; visualisation
     • versions: original; plain text
193. 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: area; case; cognitive; communication; computer; diagram; different; effective; elements; engineering; figure; human; information; integration; language; layout; locator; map; maps; method; model; modelling; modularity; navigation; navigation map; order; overall; paper; poec; positioning; positioning map; principles; proc; research; software; sub; syntax; systems; techniques; tools; visual
     • versions: original; plain text
194. 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: 2006; acnf; adaptive; adaptive star; border; center; chain; context; edges; end; expression; f f; f r; fig; float; grammars; graph; hand; integer; isolated; labels; language; line; multiple; nodes; nonterminal; number; optional; pair; paper; parser; parsing; resp; right; rule; set; sets; star; step; subgraph; transformation; variables; vv f; vv vv; vv x
     • versions: original; plain text
195. 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: approach; automotive; car communication; charts; communication; concepts; context; dependencies; dependency; design; detailed; details; different; domain; dynamic; ecu; ecus; elements; fbs; field; figure; focus; hand; hovers; information; interactive; interactivity; message; mode; mscar; mscs; multiple; new; parallel; path; preliminary; presentation; problem; proc; processes; selected; semantic; sequence; study; systems; techniques; time; traces; user; view; visualization; volume; work; zoom
     • versions: original; plain text
196. 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: computer; conducting; designing; diagrams; empirical; science; studies; university
     • versions: original; plain text
197. 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; abstract syntax; actions; active; algorithm; approach; attributes; changes; components; concrete; concrete syntax; constraints; developer; dfa; diagram; diameta; editing; editor; end; example; false; fig; framework; free; graph; hand; hypergraph; information; input; item; language; layout; layouter; layouting; level; means; model; object; operating; pattern; proc; provides; rules; sect; specification; start; state; syntax; syntax level; transformation; transition; user; visual; volume; xpos; ypos
     • versions: original; plain text
198. 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: algorithm; analysis; ast; attreval; available; build; case; changes; character; checking; class; code; compilation; compiler; complexity; constraint; development; diagram; eceasst; elements; expressions; figure; function; generation; imperative; incremental; incremental ocl; information; input; language; log; method; model; modeling; modification; modified; nodes; normal; number; object; ocl; ocl code; ocl compiler; orig; parse; parsing; partial; performance; position; possible; process; rules; semantic; source; syntax; system; time; tools; transformation; tree; treemodi; treeroot; type; uml; units; vertex; visual; vmts; volume; work
     • versions: original; plain text
199. 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: abstract; access; account; analysis; application; approach; ast; checking; class; classes; code; code analysis; complexity; concepts; concrete; conventions; database; define; definition; development; different; dsl; eceasst; eclipse; ecore; elements; emftextedit; evaluation; example; guidelines; implementation; java; language; lexer; meta; method; model; names; naming; new; ocl; ocl queries; parser; particular; proc; programming; programs; queries; query; representation; restricted; restrictions; rules; sect; set; software; source; source code; specific; sql; state; statements; static; structure; syntax; textual; tools; type; use; volume; work
     • versions: original; plain text
200. 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: abstract; approach; body; boolean; change; class; conventional; embedding; enhancements; env; essentialocl; eval; example; expressions; false; figure; hand; iimp; imperativeexpression; imperativeocl; language; locations; meta; model; ocl; oclexpression; problems; qvt; right; semantics; specification; syntax; true; value; var; volume
     • versions: original; plain text
201. 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: alloy; analysis; animation; arithmetic; association; attribute; bounds; class; code; comp; conf; constraints; contracts; eceasst; end; expression; figure; formulas; function; generation; instances; integer; java; jml; language; method; model; new; object; ocl; ocl operation; operation; operation contracts; order; parkinggarage; parts; postconditions; proc; quantifier; ranges; restricted; results; sat; satisfiability; sci; section; set; size; solver; specification; state; symbol; system; system state; term; ticket; time; tool; translation; type; uml; underspecified; use; values; volume
     • versions: original; plain text
202. 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: access; admingui; administration; advanced; approach; approve_loan; assignment; authorization; authorization constraints; case; class; clerk; constraints; context; control; corresponding; critical; current; eceasst; end; example; figure; following; functionality; hierarchies; information; instance; invariants; means; messages; model; object; ocl; operation; organizational; orka; permission; policies; policy; policy object; proc; project; queries; rbac; rbac administration; relations; role; section; security; set; simplepssod; simplepssodconstraint; sod; specific; state; static; supervisor; system; template; tool; type; uml; use; use system; use tool; user; usevalidationcomponent; validation; volume; way; work; xml
     • versions: original; plain text
203. 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; boolean; case; circuit; collection; common; condition; constant; data; definition; different; eceasst; efficient; elements; evaluation; example; execution; experiments; expressions; figure; following; implementation; input; instance; language; list; map; model; navigation; number; ocl; operation; opposite; optimization; patterns; performance; proc; queries; recommendations; related; relationship; results; rule; set; short; source; time; transformation; type; version; volume; work
     • versions: original; plain text
204. 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: benchmark; books; case; collections; component; computer; cost; different; eceasst; efficient; eos; evaluation; evaluators; example; expressions; group; implementation; information; java; language; large; library; mdt; medium; models; need; number; objects; ocl; particular; performance; program; query; results; scenarios; select; size; software; table; time; tool; uml; use; volume
     • versions: original; plain text
205. 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: abstract; association; atl; checking; class; compile; concepts; context; declarative; decorations; differences; domain; eceasst; elements; errors; evolution; example; exposition; figure; gramot; graphical; imperative; input; instance; instantiation; language; mapping; match; mda; meta; model; mof; multiple; notations; objects; output; pattern; powerful; proc; programming; qvt; qvtrelation; relation; relationtotraceclass; rule; support; systems; techniques; textual; time; transformation; type; umlx; use; variable; view; volume; workshop
     • versions: original; plain text
206. 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: aspects; benchmark; case; code; commercial; context; corresponding; criteria; different; dresden; dynamic; eceasst; evaluation; example; exceptions; expressions; favorite; features; following; functionalities; generation; graphical; group; hol; ideal; important; information; invariant; kmf; language; level; managing; mdt; means; metamodel; model; modeling; new; ocl; ocl specifications; ocle; operation; order; page; person; proc; related; results; section; set; specifications; standard; static; support; textual; toolkit; tools; uml; undefined; universe; use; users; values; volume; web; xmf
     • versions: original; plain text
207. 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: aim; approach; assertions; attribute; card; cases; change; command; conclusion; context; creation; currency; different; eceasst; environment; example; execution; extra; frame; function; fvs; generation; instance; invariant; investigation; issue; lockingstate; model; model validation; mondex; nonlocking; object; observations; ocl; operation; pocket; postconditions; pre; preconditions; process; satisfied; scenario; scenario observations; set; state; step; study; system; table; test; testing; tool; uml; use; validation; value; variables; volume
     • versions: original; plain text
208. 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: community; development; germany; gogolla; jordi; language; martin; modeling; new; ocl; performance; pieter; preface; tools; university; van; workshop
     • versions: original; plain text
209. 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: analysis; aodv; aodv routing; aodv−rs; aodv−ttl; components; data; destination; discovery; effect; field; figure; higher; hop; i.e.; i3 i1; i6 i3; inconsistent; information; initial; network; nodes; overhead; packet; protocol; reactive; route; route discovery; routing; rrep; rreq; s d; scheme; simulation; streams; time; ttl; ttl field; value
     • versions: original; plain text
210. 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; communication; count; delay; demand; destination; discovery; disjoint; distance; eceasst; end; failure; figure; ghz; hoc; hop; hops; host; ieee; implementation; interferences; intermediate; kernel; link; linux; loss; management; mesh; multi; multipath; neighbor; netlink; network; nodes; notebook; order; packet; path; path routing; possible; process; protocol; real; route; routing; rrep; rreq; scenario; selection; source; space; table; testbed; traffic; user; vector; volume; wireless; wowkivs
     • versions: original; plain text
211. 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: adhesive; categories; editors; ehrig; graph; high; level; lncs; models; nets; pages; petri; proceedings; rewriting; science; springer; systems; transformation; volume
     • versions: original; plain text
212. 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; algebra; application; attribute; behavior; category; condition; corresponding; definition; domain; dsig; eceasst; eclipse; edges; editor; ehrig; environment; firing; gluing; graph; graph transformation; hand; injective; lhs; mappings; marking; match; modeling; morphisms; nac; net; net transformations; nets; nodes; number; object; petri; petri net; placenode; places; pn1; pngt; post; problem; proc; reconfigurable; right; ron; rule; section; source; systems; tokens; transformation; transition; type; visual; volume
     • versions: original; plain text
213. 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: action; analysis; analysis model; automata; behavior; block; compiler; complex; component; concept; corresponding; design; different; eceasst; elements; example; execution; figure; filter; fi−1; following; fragment; gramot; graph; great; hierarchy; implementation; karsai; language; level; mapping; metamodel; model; modeling; output; pattern; platform; platform→analysis; pml; psm; rule; simple; skeleton; software; source; specific; structures; system; target; template; time; transformation; uml; volume
     • versions: original; plain text
214. 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: ambient; asynchronous; calculus; causal; causal nets; code; components; computation; debugging; debunits; eceasst; envelopes; event; fact; figure; flows; following; instance; jscl; language; model; nets; networks; new; notification; places; pngt; primitives; programmers; reaction; research; signal; systems; topics; transition; volume
     • versions: original; plain text
215. 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: acs1; acs2; additional; addremsupport; adhesive; ahl; ahl systems; airplane; airport; algebraic; application; apsize; asp; blacktoken; category; conditions; critical; definition; entergate; example; extension; figure; gate; gatelarea; gluing; high; hlr; leavegate; level; match; means; morphism; nacs; negative; nets; newsups; pair; petri; places; points; reconfigurable; results; rule; s s; section; set; size2; strict; structure; support; systems; theorem; towergate; transformation; use; weak; ● ●
     • versions: original; plain text
216. 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: adhesive; ahl; ahl system; algebraic; application; area; asg; case; communication; conditions; definition; different; emergency; environment; escort; figure; fire; firing; getcall; high; id(p9; ifrt; input; level; local; location; marking; message; morphisms; nets; officer; open; open ahl; output; p p; p10; person; petri; places; pngt; post; pre; proc; reconfigurable; rules; sco; secure; set; start; systems; theorem; token; transformation; transitions; tς(x; weak
     • versions: original; plain text
217. 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; abschnitt; agenten; aktivitäten; alle; allerdings; als; ansatz; anschließend; antwortzeit; antwortzeitanteile; anzahl; auch; auf; auktionen; aus; ausgeführt; außerdem; änderungen; basierend; basis; beitrag; beschrieben; betrachtet; bieter; bzw; d.h; dabei; damit; das; dass; daten; dazu; definiert; definition; dem; der; des; deshalb; design; die; dieses; durch; dynamischen; e n; eceasst; eigenen; eigenschaften; ein; eine; eingehalten; einzelnen; entwicklung; ergebnis; erreichen; existiert; fall; folgenden; für; gebot; genutzt; gibt; gleichen; gruppe; gva; immer; informatik; innerhalb; ist; jeder; jeweils; jun08; kann; komplexität; können; lässt; level; lösung; management; managementaktionen; manager; mechanismus; medien; menge; mit; mittels; modell; möglich; muss; nach; nicht; nrtv07; nur; nutzen; oder; overhead; performance; prinzipielle; proc; sehr; selbstorganisierende; service; sich; simulation; sind; sla; slas; slm; slo; slos; sofern; sogenannte; soll; spiel; strategie; systemen; systems; szenario; theorem; thesis; und; untersucht; über; verallgemeinerte; verhalten; verkäufer; verlauf; verletzung; vgl; vickrey; volume; vom; von; weiteren; weiterhin; welche; wenn; werden; wie; wiesbaden; wird; workflow; wowkivs; wurde; zielwert; zur; zwei; zwischen
     • versions: original; plain text
218. 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: ability; activities; adaptive; adaptivity; agent; application; approach; architecture; autonomic; autonomous; behavior; challenges; combination; component; computing; configuration; construction; control; coordination; coordination strategies; decentralized; definition; design; developers; development; dynamics; eceasst; elements; engineering; entities; following; framework; functionalities; generic; implementation; information; integration; intended; loops; management; mechanisms; modeling; models; organization; organizing; phenomena; point; proc; project; properties; reference; renz; requirements; research; reusable; scenarios; section; selection; self; service; simulation; sodekovs; software; strategies; sudeikat; support; systematic; systems; usage; utilization; validation; volume; wowkivs
     • versions: original; plain text
219. 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: aber; abschnitt; abstractnetworklayer; acm; adapter; adaptierbare; adaptiert; adaption; adaptive; allgemeinen; als; andererseits; anforderungen; ansatz; anwendung; arbeiten; architektur; art; attribute; auch; auf; aufgaben; aus; avr; bei; beispielsweise; bereich; bezeichner; beziehungsweise; bietet; bis; bit; c++; conference; darstellung; das; dass; definition; dem; den; der; der adaption; des; die; diese; drei; durch; durchgeführt; dynamische; ebenfalls; eceasst; eine; einerseits; eingebettete; einsatz; entsprechend; erbringen; ereignis; ereigniskanäle; ereignissen; erfolgt; ermöglichen; erzeugt; event; famouso; feld; findet; folglich; formen; funktionalität; für; gateways; gezeigt; handelt; hier; hin; immer; innerhalb; ist; jedoch; jeweilige; kann; kommunikation; komponenten; konfiguration; können; laufzeit; layer; limitierten; magdeburg; mechanismen; mehr; middleware; mit; mittel; multicast; muss; möglichkeit; nach; neben; network; netzwerk; nicht; nlcan; notwendig; nur; oder; paxcan; proc; project; protocol; publish; publisher; real; ressourcen; ressourcenbeschränkte; schichten; schulze; sehr; sein; service; setzen; sich; sie; sind; software; sowie; standard; statische; stellen; struktur; subjekt; subscribe; subscribe middleware; systeme; typedef; udp; unabhängig; und; universität; unter; unterstützt; verfügung; verschiedenen; verwendet; viele; vielzahl; volume; von; vorgestellt; wann; weitere; welche; wenn; werden; wird; wowkivs; wurde; z.b; zum; zur; zusätzlichen; zwei; zwischen; über
     • versions: original; plain text
220. 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: accuracy; applications; area; challenges; conference; continuous; correlations; data; different; energy; gateways; global; grid; gsgm; gsn; high; information; interface; international; latency; measurements; model; networks; nodes; number; object; operators; overlay; patterns; prediction; predictors; proceedings; processing; quality; queries; real; requirements; research; section; sensor; sensor networks; single; sink; spatial; stream; systems; temporal; time; values; volume; wireless; world; wowkivs; wsns
     • versions: original; plain text
221. 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: appearance; arrival; available; backup; band; blocking; case; channels; cognitive; communications; control; data; devices; figure; handoff; ieee; mac; networks; nodes; novel; number; operating; opportunistic; primary; probability; proc; process; pus; radio; rate; scheme; section; sharing; spectrum; sus; technology; time; transmission; unlicensed; users; wireless
     • versions: original; plain text
222. 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: access; acm; approach; basic; block; building; case; class; consistency; data; data store; definition; different; eceasst; environments; event; figure; global; global data; graph; grid; implementation; invalidate; java; jvm; local; measurements; mechanisms; memory; michael; model; multiuser; network; new; node; object; object model; object view; operation; optimistic; pages; peer; proc; programming; push; references; replication; scene; service; shared; sharing; size; store; system; tgos; time; token; transactional; type; update; view; virtual; volume; wissenheim; work; worlds; wowkivs; write
     • versions: original; plain text
223. 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; applicable; application; approaches; checking; components; computer; conditions; corresponding; definition; derivation; different; driving; eceasst; edges; elements; equivalent; fig; figure; formula; general; gotdlicence; grammars; gramot; graph; graph transformation; groove; hand; injective; lhs; main; means; model; morphism; nac; nacs; negative; new; nodes; number; officer; paper; parallel; person; possible; proc; production; rule; science; set; simulation; source; special; src; state; structure; system; target; tgt; tools; transformation; translation; type; typing; volume
     • versions: original; plain text
224. 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; authorization; backbone; configuration; dec; different; distributed; experiments; federation; figure; infrastructure; links; management; mesh; network; nodes; operation; project; remote; researchers; reservation; resources; secure; sensor; sensor network; shibboleth; system; testbed; time; visit; web; wired; wireless; wireless sensor; wisebed; wsn
     • versions: original; plain text
225. 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: access; address; addresses; addressing; application; barrier; bit; communication; data; different; global; header; heterogeneous; ieee; issues; layer; medium; micaz; model; network; nodes; order; packets; pan; payload; platforms; project; protocols; radio; routing; sensor; spot; stacks; sun; tinyos; types; use; way; wsn; zeus
     • versions: original; plain text
226. 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: algorithm; application; approach; behavior; characteristics; computation; consistency; copies; crt; data; ddves; definition; degree; elastic; environments; example; figure; fuzzy; fuzzy logic; inconsistent; large; linguistic; logic; maekawa; management; means; medium; membership; model; negative; number; objects; output; parameter; replicated; replies; reply; responsiveness; rule; runtime; scenario; section; set; sets; small; states; system; time; trade; users; value; variable; virtual
     • versions: original; plain text
227. 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; aber; acm; adabas; als; altanwendung; anhand; ansatz; anwendung; anzahl; application; architektur; arne; artikel; auch; auf; aufgrund; aufwand; aus; basis; bei; beispiel; broker; business; bzw; carsten; code; companion; computer; das; dass; data; dbms; define; dem; der; des; die; dienste; diese; direkt; durch; eceasst; eher; eine; einige; einsatz; enterprise; existierenden; fallbeispiel; fallstudie; funktionalitäten; für; geschäftsprozesse; hier; ieee; integration; international; ist; jedoch; kann; kleiner; kombination; komponenten; koschel; können; legacy; mainframe; man; methoden; mit; mittels; modernisierung; natural; neuen; nicht; noch; nur; pages; phase; praxis; proceedings; programm; projekt; rpc; sag; server; services; sich; sind; soa; society; software; sollte; systems; und; unter; usa; verlag; verteilte; verwendet; vgl; view; volume; von; vorgehen; web; werden; wie; wird; wowkivs; wurde; yacht; z.b; zeigt; zum; zur; über
     • versions: original; plain text
228. 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: c e; challenge; client; composition; concepts; e d; e n; e q; e r; e s; evaluation; execution; g e; input; l e; l n; m e; mece; n c; n d; n g; n n; n s; n t; o l; o n; output; owl; p e; points; process; r t; s c; s o; s s; semantic; service; set; solution; system; t e; t h; t o; t p; t s; t t; test; time; u e; u n; u t; web; wsbpel; wsc; wsdl
     • versions: original; plain text
229. 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: abbildung; abschnitt; algorithms; alle; als; anforderung; arbeiten; auch; auf; aus; bei; bereich; berlin; betrieb; bis; bisher; bmwi; bundesministerium; co2; conference; dabei; dafür; daher; dar; das; dass; data; daten; dazu; decke; dem; der; deren; des; deutschland; dhl; die; diese; durch; eceasst; eine; eingesetzt; einsatz; ermöglicht; erreichen; evolutionary; forschung; frontend; für; genetic; gestaltung; gmbh; gps; gsm; hardware; immer; informationen; intelligente; inwest; jedoch; kann; kassel; kommunikation; komponenten; konfiguriert; können; kunden; ldg08; literatur; logistik; mehrwert; middleware; mit; morgen; nach; nicht; nur; nutzer; optimierung; ortung; pk07; problem; proc; projekt; pt09; research; routing; sektion; sensorknoten; sets; sich; sie; sind; somit; sowie; springer; stellen; stellt; strauss; systeme; tabu; technologien; time; tourenplanung; transportkette; und; über; vehicle; verfahren; viele; volume; von; vr08; wechselbrücken; wechselbrückensteuerung; weiter; welche; werden; windows; wird; wirtschaft; wowkivs; wurde; yellowbox; z.b; zum; zur
     • versions: original; plain text
230. 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: 25th; actuators; adaptation; applications; approach; architecture; available; aware; aware applications; aware playground; calculation; centric; complete; components; composition; computer; context; control; data; david; developers; development; devices; different; eceasst; environment; example; high; home; implementation; level; light; meeting; needs; new; package; paper; platform; playground; possible; potential; processing; project; provider; requirements; research; room; rule; sensors; service; smart; solution; support; system; test; time; tools; user; vision; volume; way; work; wowkivs
     • versions: original; plain text
231. 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: algorithms; approach; architecture; broker; central; conference; consumer; delegation; delegation web; different; eceasst; enhanced; example; framework; international; load; management; measurement; monitoring; mows; multiple; muws; new; oct; operation; parameters; ping; qos; quality; request; section; selection; selector; server; service; service ping; service selection; simple; sla; time; uddi; volume; web; web service; wowkivs; wsdm; wsrf
     • versions: original; plain text
232. 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: + +; able; actuators; analysis; attacker; authenticity; availability; categorization; challenges; communication; conference; confidentiality; cryptographic; current; data; devices; different; digital; eceasst; global; identification; identifiers; information; integrity; international; internet; key; large; localization; mechanisms; middleware; need; networks; physical; possible; privacy; proceedings; processing; properties; property; protocol; reader; regulations; research; rfid; section; security; sensitive; sensitivity; sensor; server; state; storage; systems; tag; tags; technologies; things; timestamp; topics; tracking; use; users; volume; wireless; world; wowkivs
     • versions: original; plain text
233. 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: abbildung; aber; abstraktionsebenen; als; anforderungen; angepasst; ansatz; ansätze; anwendungen; anwendungsentwicklung; anwendungsmuster; architekturen; art; auch; auf; aus; bei; bereich; besonderen; d.h; dar; das; dass; daten; datentypen; dem; der; des; die; dienste; dienstorientierten; diese; direkt; durch; ebene; eceasst; effiziente; eigenschaften; eine; eingebettete; eingesetzt; einund; endnutzer; erlaubt; ermöglichen; erstellt; folgenden; für; gegensatz; hardware; implementierung; industrieautomatisierung; informationen; installation; integration; ist; kann; knoten; kompatibel; können; mess-; metadatenbeschreibung; middleware; mit; muss; muster; networks; netze; neuer; nicht; oder; pages; plattform; proc; programmierung; sensoren; service; sind; soa; soa soa; software; stellen; systeme; und; über; verwendeten; verwendung; vielzahl; volume; von; vorhandene; während; web; welche; welt; werden; wie; wiederverwendbarkeit; wird; wowkivs; z.b; zum; zunehmend; zur; zwischen; ε soa
     • versions: original; plain text
234. 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: approach; class; constraints; constructs; control; core; development; elements; execution; figure; flow; generated; gramot; graph; graph transformation; information; input; internal; language; level; lhs; mapping; match; matched; matching; metamodel; model; model transformation; object; ocl; omg; output; patterns; platform; plug; proc; qvt; relations; rewriting; rhs; rules; software; specification; specified; support; system; target; trace; transformation; validated; vcfl; visual; vmts; volume
     • versions: original; plain text
235. 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; abschnitt; als; ansatz; ansätze; anwendungen; api; apis; application; architektur; arm; auch; auf; aus; ausblick; auswertung; basierten; basismuster; bei; beispielsweise; beitrag; bereits; beschreiben; beschriebenen; bestehende; bezeichnet; component; dabei; damit; dann; das; daten; definiert; dem; der; deren; des; detailliert; die; dienste; diese; durch; ebene; eceasst; eclipse; eigentlichen; eine; einheitlicher; einzelnen; entwickelt; erfolgen; existierende; funktionalität; für; geschäftsund; gestützten; gleichzeitig; grundlage; hier; hierbei; hinweg; ide; implementierung; informationen; infrastruktur; innerhalb; instrumentierung; instrumentierungsansatz; instrumentierungscode; instrumentierungsmuster; instrumentierungswerkzeugs; integration; ist; java; jedoch; kann; kenngrößen; komponenten; konsistente; korrelatoren; können; laufzeit; management; messungen; middleware; mit; mithilfe; monitoring; muss; muster; möglich; neben; nicht; oder; performance; plugin; proc; proceedings; projekts; quellcode; rahmen; realisiert; realisierung; request; response; sca; schmid; schnittstelle; service; sich; sind; soa; sodass; somit; spezifikation; stellen; systems; trigger; umgebung; und; unter; unterstützt; verfügung; vermessung; verteilter; verwendet; verwendung; vgl; volume; von; von soa; vorgehensweise; vorgestellte; web; weitere; werden; wie; wiesbaden; wird; workflows; wowkivs; wurde; zeigt; zeitmessungen; zum; zur; zwischen; über; überwachung
     • versions: original; plain text
236. 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: actions; behavior; bpel; bprules; business; business process; c t; changes; class; constraints; corrective; e c; e n; e t; expression; functions; important; instances; l e; language; management; monitoring; n c; n s; n t; new; number; o n; orchestrations; p e; p r; process; processes; qos; r e; r t; r u; requirements; runtime; s e; s p; s s; s t; section; sensors; service; set; specified; state; sub; web; y s
     • versions: original; plain text
237. 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: aoe; aoes; aoi; aois; approach; architecture; area; central; certain; changes; concept; coordinator; e.g.; effect; entities; environment; event; future; games; implementation; information; inside; interest; interest management; management; management scheme; massively; mmves; model; network; peer; possible; proceedings; propagation; properties; relevant; requirements; scheme; spatial; state; structure; system; updates; user; virtual
     • versions: original; plain text
238. 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: application; approach; available; building; communication; community; company; compositional; computing; cooperative; data; decentralized; devices; example; frequent; group; hierarchies; hierarchy; high; high speed; information; level; likely; location; mobile; model; modeling; network; observed; opportunistic; participants; patterns; perception; person; personal; possible; primitives; probabilistic; probability; room; sensing; sensors; spatial; spatio; speed; structure; surroundings; temporal; time; way; world
     • versions: original; plain text
239. 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: +49; abbildung; aktivitäten; als; ambient; angesiedelt; anpasst; anpassungen; ansatz; ansatzes; anwendungen; anwendungsdomäne; architektur; auch; auf; aufgrund; ausführung; ausführungszeit; ausnahmebehandlung; autonomen; aware; basierend; bedeutet; begriff; bei; benutzer; bereits; beschreibung; beschrieben; besteht; betrachtet; bpel; bpmn; bspw; business; bzw; computing; conference; context; dabei; daher; das; dass; daten; definiert; dem; demonstrator; der; des; die; dienste; dienstleistungen; diese; durch; ebene; eceasst; eine; eingesetzt; einheiten; engine; entwickelt; entwicklung; erfolgt; evaluiert; execution; faktoren; feld; framework; für; geschäftsprozesse; gibt; haben; hier; hierbei; ihren; innerhalb; instanz; integration; intelligence; international; ist; jedoch; kommunikation; konfiguration; konfigurationszeit; konfigurierten; kontextinformationen; kontextsensitive; kontextsensitivität; können; lage; layer; leistungsmodule; management; manuell; maschinen; master; member; menge; mit; mittels; mobilen; modellierung; müssen; nicht; nur; oder; osgi; process; prozesse; prozesskontext; prozesslandkarte; prozessmodellierung; prozessmodule; r2b; rahmen; regeln; relevanten; repository; ressourcen; robot; rules; schlagkartei; schnittstellen; sein; services; sich; sind; smart; sogenannte; soll; somit; sowohl; spezifischen; system; systemen; szenario; technologie; teilprozess; time; umgebung; und; unterschiedlichen; verhalten; verteilter; verwendet; volume; von; vorgestellten; web; welche; werden; wie; wird; workflow; wowkivs; wsdl; wurde; während; z.b; zugehörigen; zunächst; zur; zwei; zwischen; über
     • versions: original; plain text
240. 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: achievements; addition; application; apps; architecture; available; building; combination; concept; content; current; data; deficiencies; different; distribution; diversity; download; eceasst; efficient; end; figure; future; future internet; generic; high; hop; implementation; information; infrastructure; intermediate; internet; major; mechanism; multiple; network; network virtualization; operating; osr; overlays; p2p; parallel; parts; paths; peer; performance; physical; proc; protocols; provider; quality; reliability; resources; router; routing; single; source; specific; steps; system; today; topology; traffic; transmission; transport; use; user; virtualization; volume; way; wowkivs
     • versions: original; plain text
241. 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: addresses; architecture; case; changes; context; control; data; debugging; descriptor; different; domain; example; execution; framework; guest; hardware; hvm; hypervisor; implementation; instance; interface; introspection; kernel; level; library; linux; look; machine; memory; modified; monitoring; network; operating; order; page; para; performance; physical; privileged; proceedings; promox; protocol; protocol stack; pseudo; rate; section; size; stack; state; system; table; tcp; time; virtualization; volume; wowkivs; x86; xen; xenaccess
     • versions: original; plain text
242. 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: approach; available; aware; bandwidth; consists; core; dec; different; eceasst; end; figure; future; hardware; independent; infrastructure; limitations; links; machine; management; mbit; memory; method; model; network; nics; overlay; paper; parallel; physical; properties; resources; routers; run; section; service; single; software; system; system virtualization; time; underlay; virtualization; virtualized; vls; vmm; vms; vns; volume; vrs; wowkivs; xen
     • versions: original; plain text
243. 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: arbitrating; bbcs; bbs; bit; black; burst; clock; clock synchronization; collision; complexity; convergence; cooperative; data; delay; deterministic; diameter; dominant; duration; encoding; figure; frame; high; hoc; hop; length; local; low; mac; macro; master; maximum; medium; multi; network; nmaxhops; node; offset; protocol; real; reference; round; section; sensor; sequence; slot; start; synchronization; tick; time; time synchronization; topology; transmission; use; value; wide; wireless
     • versions: original; plain text
244. 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: abstract; actions; anchoring; approach; asml; available; behavior; behavior preservation; bisimilarity; bisimulation; case; dsmls; equivalence; events; figure; framework; fsm; gramot; graph; input; instance; instantaneous; inter; languages; level; macro; model; non; operational; output; preservation; references; semantic; semantic anchoring; set; source; state; statechart; step; study; systems; target; transformation; transitions; triggers; unit; variant; verifying; volume; weak
     • versions: original; plain text
245. 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: attacker; attacks; case; cheating; closer; closest; data; different; digit; disjoint; entries; factor; fighting; forward; function; hash; honest; ids; information; key; keys; keyspace; leaf; majority; malicious; matching; messages; mmves; multiple; network; node; number; p2p; paths; peer; position; prefix; queries; query; radix; replicas; replication; responsible; result; routing; routing table; scheme; secure; security; segment; set; structured; symmetric; table; time; voting; way
     • versions: original; plain text
246. 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; algorithm; approach; causal; clocks; components; different; distributed; end; events; example; following; logical; mmves; number; order; p2p; parallel; players; pruned; related; relation; section; size; sparse; supremum; system; time; users; vector; vector clocks; virtual; world
     • versions: original; plain text
247. 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: commodity; control; core; cpu; design; domain; fairness; fig; flexibility; flexible; forwarding; fps; guest; hardware; high; idd; interfaces; mark; memory; modern; multi; number; order; packet; performance; platform; router; software; virtual; virtualization
     • versions: original; plain text
248. 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: adam; architectures; commodity; controller; core; different; figure; flexibility; flow; flowstream; forwarding; hardware; hosts; laurent; load; mark; module; network; new; performance; platform; processing; router; servers; switch; technologies; traffic; usage
     • versions: original; plain text
249. 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: addition; adjustments; adsl; arrival; bandwidth; case; client; comparison; computer; conditions; connection; control; data; delay; design; devices; distribution; eceasst; emulation; end; environment; equal; experiment; figure; hardware; host; implementation; inter; layer; linux; machines; measurements; measures; method; multimedia; network; network environment; new; packet; paper; parameters; performance; physical; platforms; proc; real; real adsl; real environment; research; resources; results; router; section; server; service; similar; software; solution; step; streaming; system; time; tool; traffic; video; videolan; virtual; virtual client; virtual environment; virtual machines; virtual network; virtualization; vod; volume; wowkivs; xen
     • versions: original; plain text
250. 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; application; architecture; attachment; case; constraints; control; corresponding; creation; description; different; domain; eceasst; end; example; figure; infrastructure; infrastructure provider; interface; internet; involved; issues; level; lifecycle; link; management; mechanisms; migration; multiple; network; network virtualization; new; node; operator; order; physical; plane; possible; protocol; provider; qos; requirements; resources; roles; section; service; setup; signaling; specific; substrate; support; topology; user; vif; virtual; virtual network; virtualization; vnet; vnet operator; vnet provider; volume; wowkivs
     • versions: original; plain text
251. 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; active; ap1; approach; association; authentication; available; beacon; buffered; channel; connection; control; different; figure; frames; ieee; infrastructure; interface; interval; layer; listen; mac; management; medium; mode; multiple; network; new; node; number; operating; packets; pcf; period; physical; point; power; psm; saving; scenario; second; set; simulation; single; sta; stas; support; throughput; time; traffic; virtual; virtual access; virtualization; volume; wireless; wlan; wowkivs
     • versions: original; plain text
252. 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: alexander; andreas; auch; beiträge; berlin; bonn; braun; christian; christoph; darmstadt; david; den; der; die; dresden; eceasst; eine; environments; fischer; frank; für; geihs; hogrefe; jochen; karlsruhe; kassel; kivs; klaus; kurt; lübeck; management; mannheim; matthias; michael; modell; müller; münchen; network; organisation; peter; programmkomitee; ralf; routing; sebastian; sehr; service; stefan; stuttgart; thomas; torsten; tu darmstadt; ulm; und; universität; universität kassel; virtual; virtualization; volume; vorwort; wagner; web; wehrle; wir; workshops; wowkivs; zapf
     • versions: original; plain text
253. 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: algorithms; applications; approach; architecture; average; catalog; centric; centric peer; communication; complex; control; current; data; database; declarative; dht; distance; distributed; distribution; eceasst; end; environment; equipment; event; execution; figure; generation; global; grids; group; high; indexing; industrial; information; language; large; local; management; max; mean; measured; metadata; methods; model; monk; network; new; nodes; operator; p2p; paper; peer; peer communication; power; processing; program; protocols; queries; query; real; section; select; sensors; set; simulation; sources; state; streams; sub; systems; time; transmission; use; volume; wide; wowkivs
     • versions: original; plain text
254. 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; available; bandwidth; decentralized; destination; different; fig; flows; future; ieee; information; interference; link; load; network; node; number; online; optimization; outgoing; path; pdr; performance; prediction; proc; pt[d; qos; ratio; rejection; requests; routing; scout; shortest; source; spf; time; traffic; training; value; weight; wsp
     • versions: original; plain text
255. 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: algorithm; analysis; arc; changes; computer; concurrent; configuration; control; current; dynamic; eceasst; editor; equivalent; example; figure; flow; following; glaze; graph; graphics; hand; initial; lo04a; marked; marking; mcrenet; mcrn; model; net; nets; petri; petri net; pipe; places; plane; possible; proc; process; reconfigurable; reconfigurable petri; rewriting; rule; science; set; state; structure; systems; tool; transitions; volume
     • versions: original; plain text
256. 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; area; avatar; behavior; case; cell; changes; characterization; client; collected; collection; components; data; density; design; development; different; dve; eceasst; engine; environments; example; expected; figure; level; load; map; maps; metrics; model; necessary; network; number; objects; performance; proc; protocol; rel(n; relationships; requirements; resource; second; set; single; size; software; space; spatial; specific; state; study; system; terrain; time; torque; transmission; type; updates; user; validation; values; virtual; visibility; volume; wowkivs
     • versions: original; plain text
257. 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: adaptive; agent; analysis; computer; condition; d(p̂; eds; elementary; eos; event; figure; firing; generalised; iff; invariants; köhler; lecture; like; location; marking; mobile; mobility; multiset; net; net n; nets; notes; object; object net; petri; place; pool; pren; private; processes; projection; public; reachable; science; springer; state; structure; synchronisation; system; system net; theorem; tokens; transition; type; verlag; volume; π1(µ; π2n
     • versions: original; plain text
258. 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: adaptation; adaptive; algebraic; approach; change; compile; components; conditions; construct; control; cq1; cq3; data; device; different; dynamic; eceasst; execution; figure; gets; graph; high; instances; level; local; management; member; mobile; multi; nets; new; order; p p; petri; pictures; place; pmr; pool; possible; postconditions; pre; preconditions; process; processes; produces; questionnaire; rdss; resources; result; rewriting; riss; rule; rule(id; schema; sequence; set; sets; specific; start(name; synch; synchronizers; system; tasks; team; team member; terms; time; tpcq2; transformation; transition; type; volume; wippog; workflow
     • versions: original; plain text
259. 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: abstract; activities; activity; activity diagrams; adaptation; approach; associated; construction; control; correspondence; data; definition; diagrams; different; eceasst; edges; enactment; figure; flows; fork; graph; join; language; lncs; metamodel; multiset; nets; node; operational; pair; particular; patterns; petri; proc; process; processes; related; representation; resources; rewriting; rule; section; semantics; specification; synchronisation; syntax; transformation; translation; triple; use; visual; vmt; way; workflow
     • versions: original; plain text
260. 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: abc; abstract; agent; approach; asm; assumptions; belief; b|a; changes; conditionals; condor; condorasm; currstate; degree; discovery; distribution; dynamic; eceasst; entropy; environment; epistemic; epistemic state; epstate; evidence; example; framework; function; general; inductive; information; instance; international; isberner; kern; knowledge; level; machines; mobile; modelling; monitored; new; nullary; operator; possible; probabilistic; probability; problem; proceedings; processes; propositional; p∗(abc; qualitative; reasoning; representation; revise(ψ; revision; rules; sentences; set; state; system; universe; unquantified; update; volume; yields; young
     • versions: original; plain text
261. 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: andrea; conference; contributions; corradini; doctoral; emilio; germany; graph; heckel; icgt; italy; leicester; preface; reiko; researchers; students; symposium; systems; transformation; tuosto; volume
     • versions: original; plain text
262. 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: 2006; abstract; agg; application; approach; attribute; case; changes; code; correspondence; data; development; edges; editing; elements; engineering; example; figure; general; grammar; graph; implementation; java; language; machine; mapping; model; modeling; new; nodes; programming; rules; section; semantics; set; simultaneous; software; source; source code; state; state machine; structure; syntax; systems; tgg; tool; transformation; transition; triple; triple graph; type; updates; uppaal; use; volume; way; xml
     • versions: original; plain text
263. 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: assign; attachment; class; compatible; corresponding; definition; doctoral; eceasst; edges; external; figure; finite; flat; following; formula; fragment; free; function; grammars; graph; hand; heap; hyperedge; icgt; interpretation; language; lemma; let; locations; logic; mapping; nil; nodes; non; pair; points; predicate; proc; productions; proof; prop; property; replacement; result; right; semantics; separation; separation logic; sequence; set; sets; single; source; string; symbolic; symposium; tagged; terminal; variable; volume; work; α(h
     • versions: original; plain text
264. 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; application; approach; architecture; business; categories; category; code; computer; conf; data; different; dimension; doctoral; doi:10.1109; eceasst; engineering; example; figure; forward; functional; general; granularity; graph; icgt; ieee; information; legacy; level; matching; methodology; migrating; migration; model; operations; paper; pattern; principles; proc; process; prototype; redesign; related; representation; reverse; rules; section; services; soa; society; software; source; step; symposium; systems; target; techniques; technological; transformation; usa; user; volume; washington; work
     • versions: original; plain text
265. 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; applications; aware; campus; context; development; environments; france; germany; kassel; mechanisms; michael; mobile; norway; oslo; papers; pervasive; romain; rouvoy; sintef; ubiquitous; university; volume; wagner; workshop
     • versions: original; plain text
266. 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: gabor; gabriele; graph; karsai; model; research; taentzer; transformation; volume; workshop
     • versions: original; plain text
267. 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: //oo; architectural; behaviour; case; component; context; csp; definition; diagram; doctoral; eceasst; editor; extraction; figure; formal; graph; icgt; inclusion; initial; injective; level; mapping; minimal; model; morphism; present; process; processes; production; pushout; refactoring; relation; rule; section; sem �; semantic; signal; structure; support; symposium; system; tool; transformation; verification; volume
     • versions: original; plain text
268. 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; applications; approaches; blue; campus; case; certain; change; communication; computing; connected; context; coordination; def; descriptors; devices; eceasst; event; game; information; international; issues; lime; limited; local; local tuple; location; means; members; message; middleware; mobile; nearby; network; new; number; operations; order; players; privacy; propagated; propagation; protocol; range; red; returns; scenario; scope; section; set; space descriptors; spaces; systems; taggedas; team; time; totam; traffic; tuple; tuple space; use; volume
     • versions: original; plain text
269. 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: abstractions; acm; actor; ambienttalk; applications; asynchronous; campus; case; certain; client; code; communication; computing; conference; connection; constructs; context; control; data; devices; different; eceasst; environment; event; failures; far; fault; information; java; language; layer; level; means; message; middleware; mobile; model; network; new; objects; period; pervasive; proceedings; programming; range; reader; reference; remote; rfid; rfid tags; rfid technology; section; sensors; services; systems; tags; technology; time; type; use; volatile; volume; way
     • versions: original; plain text
270. 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: adaptation; adaptive; advertised; approach; aware; broker; capabilities; case; client; context; current; data; descriptions; device; discovery; functionality; levels; middleware; mobile; mode; module; provider; qos; request; requirements; resources; semantic; service; service discovery; service provider; similar; status; systems; traffic; use; user; volare; web; web service
     • versions: original; plain text
271. 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: account; adaptation; approach; available; aware; computing; context; context information; context.signalstrength; current; degree; description; elements; environments; execution; figure; function; information; international; local; matching; mean; measures; mechanism; memory; middleware; music; non; order; overall; paper; partial; pervasive; properties; rank; related; requirements; response; route; section; selection; service; service selection; service.response; similarity; ubiquitous; uncertainty; user; utility; values; variants
     • versions: original; plain text
272. 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; algorithm; application; approach; architecture; aspects; automotive; available; aware; awareness; behaviour; campus; change; characteristics; communication; component; computing; concepts; concerns; conditions; configuration; consortium; constraints; context; context information; control; current; data; datatype; decision; deployment; description; design; development; device; different; distributed; dylite; dynamic; dyscas; eceasst; environment; example; figure; framework; functionality; functions; handling; hardware; implementation; information; interactions; internal; item; key; knowledge; level; loaded; logic; management; middleware; mode; new; package; performance; pervasive; platform; policies; policy; proc; project; qos; quality; real; reference; related; requirements; resource; run; self; service; set; software; specification; state; status; support; system; system configuration; technology; temperature; time; types; utilization; variability; vehicle; volume
     • versions: original; plain text
273. 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; adaptation reasoning; applicable; application; application variants; approach; architecture; atomic; available; best; campus; combinatorial; component; component types; composite; composition; computation; constraints; context; different; eceasst; evaluation; example; explosion; figure; function; international; large; middleware; mobile; model; new; number; paper; plan; possible; proc; properties; qos; realization; realization plan; reasoning; reasoning approach; resource; runtime; scale; section; service; software; solution; types; ubiquitous; utilities; utility; variability; variants; volume
     • versions: original; plain text
274. 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: adaptation; adaptive; application; approach; architecture; autoadapt; conditions; data; environment; execution; flooding; framework; function; hoc; hop; information; inquiry; learning; metrics; mobile; module; neighbors; network; node; overhead; payton; persistent; persistent query; proc; quality; queries; query; reply; results; set; simulator; strategy; support; time; use
     • versions: original; plain text
275. 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: abstract; action; algorithm; applications; aspects; available; balanced; cluster; cluster head; clustering; communication; coordination; current; distance; doctoral; eceasst; edges; energy; environmental; epoch; example; flow; following; framework; graph; head; hyperedge; icgt; information; international; join; level; list; membership; message; modelling; models; ndc; network; new; nodes; number; nutrient; practical; proc; productions; r(l; replacement; sensor; set; shr; signal; simulation; sink; state; suitable; symposium; transition; volume; wireless; wsns
     • versions: original; plain text
276. 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: adhesive; analysis; application; case; category; conditions; construction; cont1; definition; derivation; direct; dpo; efficient; ehrig; equivalence; example; grammar; graph; independent; intermediate; main; nacs; names; negative; new; objects; occurrence; paper; pattern; permutation; permutation equivalence; person; possible; prc(d; process; relations; rule; sequence; set; steps; stop2; sts; stss; sub(t; subobject; switch; switching; systems; task; transformation; volume; workson
     • versions: original; plain text
277. 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: analysis; annotations; applicability; application; approach; assertion; behavior; class; code; dir; eceasst; field; figure; file; following; fsobject; getparent; information; instanceof; invariants; java; language; laws; model; object; parent; primitive; program; programming; refactoring; return; section; semantic; step; this.parent; tools; transformations; type; use; volume
     • versions: original; plain text
278. 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: active; algorithm; application; applied; approach; architecture; case; chronos; client; clock; connection; current; delay; distribution; doctoral; eceasst; edges; elements; event; figure; function; generalised; graph; graph transformation; graph(i; gsgts; gsmp; hand; icgt; initial; jitter; kl07; latency; list; markov; match; match(i; matches; mean; model; modelling; names; network; new; node; p2p; packet; peer; possible; probability; processes; random; receiver; reconfigurations; rule; sc2; semi; set; simulation; skype; state; stochastic; super; symposium; systems; time; tool; transformation; type; voip; volume
     • versions: original; plain text
279. 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: antonio; certification; china; committee; floss; foundations; international; macau; nations; open; open source; opencert; portugal; sar; software; source; techniques; united; university; workshop
     • versions: original; plain text
280. 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: able; application; assessment; body; bug; code; collaborative; common; community; company; complex; contributors; control; conventional; copyright; corporate; cots; decision; developers; development; development models; different; eceasst; end; example; fork; foundation; group; important; infrastructure; ipr; kernel; large; legal; license; linux; lists; mailing; models; new; number; open; opencert; organisational; oss; oss development; oss projects; ownership; people; process; profit; projects; release; repository; roles; small; software; source; stakeholders; standards; start; structures; successful; support; systems; technical; understanding; user; vendors; volume; web; work
     • versions: original; plain text
281. 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: -calculus; .∼iπ; agent; ambients; ambm; ambn; barbed; barbed bisimilarity; barbs; bigraphical; bigraphs; bisimilarities; bisimilarity; bisimulations; brss; case; congruence; construction; contexts; controls; d |; decorated; definition; discrete; eceasst; figure; following; general; iff; interface; ipo; ipo barbed; jpkx; labels; level; link; loc; milner; mobile; names; nodes; notice; notion; open; place; proc; processes; proposition; reaction; reactive; rules; section; set; systems; volume; ↓di
     • versions: original; plain text
282. 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: analysis; certification; code; community; course; coverage; development; diploma; educational; engineering; following; foundations; functions; international; methods; open; open source; opencert; practical; process; requirements; seminars; software; source; source certification; special; specification; standard; students; target; tasks; techniques; technology; testing; tests; training; work; workshop
     • versions: original; plain text
283. 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: abstract; acm; algorithms; alias; analysis; analysis tool; buffer; bugs; certain; checkers; code; defect; dereference; detection; different; example; false; flow; format; framework; function; identifiers; information; interprocedural; library; locations; memory; new; number; open; open source; pointer; positives; possible; proceedings; programs; real; requirements; results; search; section; sensitive; set; situations; software; source; source code; specifications; static; static analysis; summaries; summary; svace; tools; use; value
     • versions: original; plain text
284. 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: activities; ada; analysis; application; artifacts; certification; code; community; components; configuration; coverage; criteria; critical; critical systems; cycle; development; different; do-178b; dynamic; eceasst; eclipse; engineering; errors; final; floss; framework; free; guarantees; high; industrial; information; initiative; integrated; integration; integrity; level; life; management; material; modeling; need; objectives; open; opencert; possible; processes; production; project; qualification; qualified; quality; requirements; safety; software; source; standard; support; systems; testing; tests; time; tools; traceability; transition; use; volume; workflow
     • versions: original; plain text
285. 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: abstract; adaptive; agents; application; approach; arrows; base; c t; c2,3; categorical; categories; category; class; communication; composition; construction; corresponding; definition; diagram; eceasst; example; fat; figure; following; functor; general; graph; identity; implementation; information; logical; map; maps; mas; mas morphisms; masi; masl; match; mobile; modeling; morphisms; multiagent; multiagent systems; new; note; notion; object; p(ob; paths; pdx; pfalzgraf; processes; production; properties; property; pushout; relations; remark; sense; sequel; sequence; set; sets; step; structure; suitable; systems; task; theory; transformation; types; u c; volume; way; work; zzvv
     • versions: original; plain text
286. 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: absence; algorithm; analysis; barbara; bijective; checking; corresponding; cycles; definition; dining; eceasst; edge; euler; example; expression; figure; following; forbidden; graph; graph transformation; graph(m; gts; initial; könig; lncs; marking; morphism; net; nets; order; pages; paths; petri; petri graph; philosophers; proc; reachable; regular; rule; semilinear; set; sets; spg; springer; states; systems; technique; transformation; transition; verification; volume
     • versions: original; plain text
287. 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: amalgamation; application; case; composite; control; definition; derivation; diagram; eceasst; edges; eds; ehrig; example; fact; figure; following; formula; geraniums; graph; graph transformation; groove; hand; instance; left; lncs; match; model; morphisms; nested; new; nodes; number; paper; parallel; pots; predicates; proc; quantifier; root; rozenberg; rule; schema; section; set; simple; single; springer; sub; systems; taentzer; token; total; transformation; transition; tree; universal; use; vmt; vol; volume
     • versions: original; plain text
288. 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: abstraction; adr; analysis; approaches; architectures; bigraphs; calculi; calculus; case; complex; composition; comput; conformance; context; design; different; eceasst; edges; encoding; engineering; example; figure; flat; free; grammars; graphs; hierarchical; hosts; inductive; instance; interface; items; jm03; layers; lect; like; line; logic; logical; main; mechanism; model; montanari; network; nodes; notion; order; paper; particular; pipeline; possible; proceedings; process; reconfiguration; refinement; requirements; rewrite; rewriting; rings; rules; sci; section; set; software; specification; springer; structured; structured graphs; systems; term; transformation; type; use; verification; verlag; virtues; visual; vmt; volume; way
     • versions: original; plain text
289. 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: additional; approach; assistance; components; context; correctness; diagram; editing; editing operations; editor; example; extended; fig; figure; free; grammar; hand; hyperedges; hypergraph; instance; intelligent; language; meaningful; new; nodes; nsd; nsds; operations; parser; patch; patches; possible; process; removal; selection; set; size; statement; stmt; stmt stmt; support; syntax; transformation; user; visual; vmt; volume; work
     • versions: original; plain text
290. 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: approach; arrows; auto; business; case; components; cond; context; contraction; cost; derivation; diagram; editing; editor; end; example; fig; flowchart; function; grammar; hand; hypergraph; languages; layer; layout; like; link; minas; n11; n12; n13; n21; n22; n23; n33; n34; nodes; nsd; nsds; order; parser; parsing; performance; possible; process; productions; results; statements; stmt; structure; syntax; time; unconnected; user; vmt; volume; way; work
     • versions: original; plain text
291. 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: algorithm; application; approach; available; cache; case; changes; code; concurrent; container; different; eceasst; eds; elements; execution; figure; firing; fixpoint; framework; global; graph; graph pattern; graph transformation; implementation; incremental; incremental pattern; initial; input; language; level; local; lock; locking; manipulation; matcher; matching; message; model; model manipulation; model transformation; multi; multiple; net; nets; network; node; notification; output; paper; parallel; parallelization; pattern; pattern matching; performance; petri; phases; place; proc; queries; queue; rete; rule; search; separate; set; space; springer; subsection; system; termination; thread; threaded; token; transformation; transition; type; update; viatra2; vmt; volume
     • versions: original; plain text
292. 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; abstract diagram; addition; approach; collaring; concrete; concrete diagram; concrete level; conditions; connected; connectivity; contours; corresponding; curves; cycle; definition; diagram; dual; dual graph; eceasst; edge; euler; euler diagram; example; face; ffh08; figure; generation; geometric; graph; interior; label; layout; left; level; logical; map; mental; multiple; new; non; operation; outside; path; plane; point; proceedings; process; reasoning; removal; right; rules; satisfies; set; sets; simple; systems; transformations; unique; vertex; vertices; volume; wellformedness; zone
     • versions: original; plain text
293. 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: application; attribute; case; compatibility; definition; diagram; ehrig; evolution; example; figure; graph; g′1; g′2; hand; independence; language; lemma; l∗1; main; model; model refactoring; model transformation; nacs; nets; nodes; operation; parallel; petri; proc; p∗1; refactored; refactoring; refactoring rules; right; rules; sc2pn; section; software; source; springer; state; statecharts; step; target; terminal; terminating; theorem; transformation; type; volume; wrt
     • versions: original; plain text
294. 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: activities; activity; application; average; case; class; code; constraints; diagram interpreter; diagrams; dynamic; eclipse; elements; emf; environment; example; execution; figure; flexibility; fujaba; graph; improved; instance; interpreter; java; links; matching; matching strategy; meta; meta model; method; model; modeling; n.a; new; number; objects; optimal; order; pattern; performance; proc; runtime; scalability; section; software; story; story diagrams; story pattern; storypatternobjects; strategy; system; time; transformation; uml; volume
     • versions: original; plain text
295. 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: activities; activity; adaptive; aho; application; architecture; building; camera; consistency; destination; device; environment; fig; follow; gluing; interface; layer; layered; leader; manets; matching; member; mobile; mobility; mobility layer; mobility net; model; net; nets; new; phe+07; place; processes; rules; select; spec(r; start; stop; systems; team; team layer; team member; teamwork; theorem; token; transformations; volume; workflow; workflow layer
     • versions: original; plain text
296. 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: + +; //oo; = =; application; attr; backward; case; class; cols; column; completeness; consistent; correctness; ehrig; elements; example; fig; figure; following; forward; g10; grammars; graph; injective; match; matches; model; morphism; nac; nacs; negative; proc; result; rules; sequence; source; string; table; target; tgt; theorem; tr1f; tr2s; transformation; trf; triple; triple graph; trs; tr∗f=⇒; type; valid; volume; � �
     • versions: original; plain text
297. 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; attachment; basis; concepts; connection; container; description; device; diagram; eceasst; elements; figure; gmf; graphical; graphical elements; graphical language; graphical meta; graphical representation; important; infrastructure; inside; kind; language; level; library; mapping; meta; model; mof; necessary; object; paper; plug; point; property; related; relationships; representation meta; representations; role; section; service; shape; spatial; specification; structure; symbol; uml; volume
     • versions: original; plain text
298. 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: abstractions; access; algebraic; application; approach; argument; aspects; case; categorical; chi; chil; chir; class; code; computation; condition; dectoken; dpo; drawing; eceasst; edge; editing; editors; example; figures; following; framework; functional; g n; generic; graph; graph transformation; graphmor; gratra; haskell; high; homomorphisms; image; implementation; interaction; interface; item; label; language; level; library; like; low; mapm; matching; modification; monad; monadic; mor.ran; morphism; n e; n n; new; node; object; operations; partial; petri; phil; place; proc; programmed; programming; progress; pure; pushout; ranphi; return; rewriting; rule; sect; select; sierpinski; single; span; spo; srcs; statet; subgraph; system; target; tools; transformation; transition; type; use; user; view; visualisation; vmt; volume; way
     • versions: original; plain text
299. 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: advice; aogg; approach; aspect; base; behavior; client; code; concerns; definition; eceasst; example; execution; figure; grammars; graph; graph grammars; information; initial; join; log; models; morphism; nn nn; object; order; original; paradigm; pointcut; points; policy; productions; programming; rewriting; rules; section; security; servers; set; system; transformation; type; vmt; volume; weaved; weaving; xxx
     • versions: original; plain text
300. 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: acid; amino; approaches; attaches; chemical; code; coli; current; data; dimensional; dna; eceasst; expression; figure; gene; gene expression; general; genetic; genome; graph; graph rewriting; grgen.net; implementation; marker; molecule; node; nucleotide; number; order; polymerase; process; processing; promoter; protein; purpose; reactions; representation; rewriting; ribosome; rna; rules; runtime; search; seconds; section; sequence; simulation; size; strand; string; structure; synthesis; systems; thymin; total; transcription; transformation; translation; vmt; volume
     • versions: original; plain text
301. 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: artur; boronat; germany; graph; heckel; italy; leicester; modeling; programme; reiko; support; transformation; university; visual; vmt; workshop
     • versions: original; plain text
302. 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: access; attributes; availability; choice; code; communication; community; coordination; correctness; critical; debugging; dependency; design; developers; development; documentation; eceasst; effective; engineering; factors; figure; formal; international; management; measure; methods; metric; mic05; model; open; open source; oss; particular; practices; proceedings; process; processes; programming; project; quality; related; release; requirements; review; section; software; software quality; source; source software; techniques; testing; use; volume; work
     • versions: original; plain text
303. 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: analysis; application; application checker; automatic; base; certification; checker; checks; compatibility; components; database; dependencies; developers; different; distributions; external; foundation; information; infrastructure; interfaces; issues; knowledge; libraries; library; linux; linux application; linux distributions; linux foundation; list; lsb; main; number; portability; possible; report; specific; standard; system; target; tool; versions
     • versions: original; plain text
304. 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: abstract; account; action; algebra; analysis; atm; attributes; availamount; balance; bank; card; case; cash; closed; complementary; components; coordinated; coordination; corresponding; eceasst; formal; instance; integer; interaction; language; level; local; machine; means; methods; model; objects; order; p(c1; pin; postconditions; preconditions; process; program; reactive; require; semantics; software; specification; state; system; testing; trace; transition; true; user; variables; volume; wrapper
     • versions: original; plain text
305. 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: approach; composition; design; eceasst; hardebolle; karsai; lengyel; levendovszky; model; modeling; mpm; multi; paradigm; preface; systems; technique; transformation; university; volume; workshop
     • versions: original; plain text
306. 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: abstract; actors; approach; behavior; belt; block; buffer; case; cell; code; concurrent; concurrent design; continuous; control; control software; controllers; data; design; discrete; ecs; efficiency; end; event; extraction; figure; grant; high; information; integration; interactions; interface; layer; level; loop; low; mechanical; mechatronic; methodology; model; modeling; motion; motor; multi; order; parts; pcus; physical; poosl; predictable; process; production; profiles; real; refinement; required; section; sensor; setup; sim; software; step; study; synthesis; system; time; tool; unit; usage; volume; way
     • versions: original; plain text
307. 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; approach; attribute; business; common; composition; concepts; correspondence; derivation; different; dsml; duedate; elements; entity; figure; generated; gettermethod; heterogeneous; high; java; language; level; level models; links; low; main; mechanism; metaclasses; metamodel; modeling; models; msec; multi; necessary; possible; practical; problem; project; readmethod; related; relationships; security; transformation; use; view; view models
     • versions: original; plain text
308. 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: aadl; analysis; annotations; architectural; automata; behavioral; command; communication; components; computational; computer; connectors; control; cps; cyber; data; description; design; domains; eceasst; elements; energy; engineering; example; family; flow; furnace; garlan; heat; heating; hybrid; information; interactions; international; modeling; models; mpm; new; paper; performance; physical; plug; power; proceedings; processes; properties; room; section; software; state; style; support; systems; temperature; thermostat; time; tools; types; volume; zone
     • versions: original; plain text
309. 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: analysis; assertions; before(rule1; bpmncomposite; bpmncontainment; bpmnflowobject; bpmnsequenceflow; business; case; control; edges; false; iii; model; nodes; process; properties; property; reasoning; rule; system; transformation; true; type; verification
     • versions: original; plain text
310. 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: application; approach; attributes; cbse; code; communication; component; configuration; control; corba; data; design; domain; eceasst; environment; example; executable; experiments; experts; figure; files; framework; gme; hardware; heterogeneous; ice; ieee; instances; interfaces; language; middleware; modeler; modeling; models; mpm; necessary; network; new; options; orca; order; parameters; platform; project; real; robotics; set; simulation; software; specific; specification; structural; systems; tag; technologies; technology; time; tools; types; use; users; volume; work
     • versions: original; plain text
311. 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: access; contributions; easst; eceasst; journal; open; software; technology
     • versions: original; plain text
312. 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: advantages; augmentation; automata; automated; automaton; checks; concrete; conformance; constraints; definitions; development; domain; elements; explicit; figure; finite; formedness; generic; input; language; layer; levels; mapping; metamodeling; metamodels; modeling; modification; mpm; need; nets; number; order; original; output; pattern; pattern specification; petri; relaxation; rules; section; semantics; specification; state; syntax; systematic; tool; transformation; use; volume; way
     • versions: original; plain text
313. 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: action; animation; animator; approach; behavior; class; code; condition; configuration; coordinator; different; domain; dynamic; element; engine; event; field; figure; framework; generation; graph; handler; init; languages; level; machine; metamodeling; method; model; model transformation; modeling; mpm; multi; namespace; new; paradigm; processing; properties; reference; rule; simulation; source; specific; state; techniques; transformation; transition; vaf; vaf rule; visual; vmts
     • versions: original; plain text
314. 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: access; approach; binding; bpel; class; collaboration; collaboration pattern; collaborationuses; conference; consumer; different; e.g.; elements; example; figure; information; instance; instantiation; integration; layer; meeting; model; model references; modelcollaboration; pattern; proc; provider; references; reserved; role; rooms; rules; set; software; support; system; tool; transformation; uml; user; web
     • versions: original; plain text
315. 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: algebraic; cases; composition; conditions; copsy; dsl; dsl composition; dsls; elements; example; figure; formal; framework; generation; hall; hand; inference; inputs; intentions; language; level; mark; means; metamodel; model; outputs; paper; parameters; reactive; relation; rules; satel; section; semantics; specifications; syntax; system; target; test; testing; tick; tickintention; transformation; types; use; variables
     • versions: original; plain text
316. 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: abstraction; architecture; automata; behavior; chip; clock; data; design; different; example; figure; formal; formal verification; global; heterogeneous; imply; initiator; integrated; interconnects; lambda; level; locations; modeling; models; network; onoc; optical; optical network; passive; path; photonic; physical; processes; properties; property; representation; router; routing; section; signal; simulation; state; step; structure; switch1.transmissiontotarget; systems; targets; time; transition; uppaal; verification; wavelength; λλλλ1111; λλλλ2222; λλλλ3333; λλλλ4444
     • versions: original; plain text
317. 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; critical; critical systems; france; germany; markus; papers; preface; program; roggenbach; swansea; systems; university; verification; volume; wales; workshop
     • versions: original; plain text
318. 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: act; analysis; automata; automaton; axis; behavior; case; cif; cif model; components; control; controller; design; discrete; engineering; error; event; figure; format; framework; hardware; hybrid; integrate; interchange; machine; maxdown; maxup; mbe; means; model; motor; mri; paradigm; patient; plant; position; process; real; requirements; scanner; sct; section; sensor; simulation; speed; state; stop; study; supervisory; supervisory control; support; synthesis; system; table; tabletop; theory; time; tool; uncontrolled; vertical
     • versions: original; plain text
319. 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: abstract; approach; automata; automaton; backoff; case; checking; clocks; constraint; discrete; distribution; edge; extension; fin; finite; following; ieee; inverse; inverse method; location; maximum; method; minimum; model; non; note; parameters; parametric; path; ppta; probabilistic; probabilities; probability; problem; proc; properties; protocol; real; reference; results; satisfying; scheduler; section; set; slot; state; station; system; time; timing; tps; transition; valuation; version; volume; yes; η(ρ
     • versions: original; plain text
320. 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: actions; algorithm; alloy; approach; behaviours; bmc; boolean; cases; checking; concurrent; counterexample; csp; dfs; eceasst; encoding; event; fdr; finite; following; format; generation; high; impl; initial; leaf; length; level; lts; minisat; model; number; nusmv; operational; order; pat; performance; present; problems; process; processes; refinement; relation; results; root; ros98; roscoe; rules; running; sat; section; semantics; sequential; set; sink; solver; solving; spec; states; supercombinators; symbolic; symfdr; system; table; test; traces; transition; variables; visible; volume; watchdog
     • versions: original; plain text
321. 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: analysis; assignments; boolean; case; checking; clock; clocked; compiler; constraints; ctl; default; define; definition; design; eceasst; esac; examples; expression; fifo; figure; form; function; h b; h x; h y; hierarchy; init; input; instant; language; ltl; lustre; master; model; module; multi; need; number; operator; order; output; place; present; process; processes; program; protocol; relations; section; set; signal; single; smv; source; specifications; state; subset; synchronous; systems; tmp; translation; true; type; use; value; variables; verification; volume; work; xok
     • versions: original; plain text
322. 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: -calculus; abstraction; actions; approach; approximation; available; behaviour; calls; case; checking; code; communication; components; computer; concurrent; conference; consists; controller; data; different; eceasst; editors; execute; execution; false; following; formulae; function; identifier; idle; implementation; init; interface; international; language; large; loop; mcrl2; means; method; model; multi; need; non; order; pages; paper; parallel; possible; press; proceedings; process; processes; program; programming; properties; property; recursion; refinement; requirements; resume; return; safety; scpl; second; section; semantics; set; software; source; space; specification; spin; springer; state; statement; study; suspend; switch; syntax; system; task; techniques; translated; translation; values; variables; verification; volume; work
     • versions: original; plain text
323. 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: approach; assignment; bb_0; bits; blk; blocks; boolean; c++; calls; case; checking; class; clock; code; compiler; control; corresponding; counter; data; default; design; eceasst; end; equation; example; false; figure; flow; formalism; function; gcc; icount; input; instance; instruction; intermediate; label; language; model; new; non; output; parallel; pgm; possible; present; process; processes; program; programming; properties; representation; return; running; scheduler; scheduling; scheme; section; sequence; set; sigali; signal; ssa; state; step; stm; synchronous; systemc; thread; time; tool; translation; true; use; value; variables; volume; yield
     • versions: original; plain text
324. 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: abstract; actioncontrol; addview; allevents; application; approach; artefacts; available; basis; behaviours; computer; condition; correct; currentmonth; currentyear; dayview; design; development; eceasst; editview; entry; errors; event; example; fest; fmis; formal; functionality; ieee; implementation; interactive; interface; international; junit; mainview; methods; model; operation; order; pim; possible; presentation; process; removeevent; required; requirements; set; simplecalendar; software; specification; state; system; testing; tests; uistate(addview; usability; user; value; visible; volume; way; widgets; work
     • versions: original; plain text
325. 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: able; access; action; analysis; approaches; aspects; assistance; behaviour; checking; complex; computer; computing; conference; context; control; danger; danger(p; devices; different; dimensions; eceasst; events; example; fmis; formal; framework; health; heart; home; ieee; international; journal; knowledge; language; logic; ltl; match; methods; mobile; model; non; number; order; patient; pervasive; pervasive systems; probabilistic; proc; proceedings; processes; properties; property; protocols; proverif; query; real; reasoning; records; requirements; rfid; safety; science; section; security; sensors; specification; springer; state; systems; temporal; time; tools; urgent; user; verification; volume; workshop; ∈{1
     • versions: original; plain text
326. 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: addiu; am06; asm; assembly; assembly code; bbs; bits; blum; case; code; compilation; coq; correctness; cryptographic; cryptographic proofs; def; encode; figure; formal; formalization; framework; function; game; generator; hoare; implementation; instructions; int; integers; jumps; lines; logic; loop; mips; mod; modulo; montgomery; multi; multiplication; non; number; operational; precision; program; proofs; pseudorandom; sect; section; security; seed; semantics; separation; standard; state; su07; triple; verification; volume; word
     • versions: original; plain text
327. 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; absorbing; abstractions; algebra; analysis; approach; behaviour; case; chain; channel; choice; composition; contestant; continuous; curtain; cyclic; def; direct; discrete; eceasst; eigenvalues; ephemeral; equilibrium; evaluation; example; expression; fmis; game; intuition; long; markov; markovian; matrices; matrix; mean; message; model; monty; ones; parallel; passage; possible; probabilistic; probabilistic process; probability; process; processes; properties; protocol; quantitative; recurrent; representation; section; set; software; specification; state; stochastic; systems; term; time; transition; transition matrix; useful; volume; win
     • versions: original; plain text
328. 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; assertion; class; conditions; convenient; correctness; counterexamples; ctr; decidable; decide; definition; ensures; entailment; fig; follows; form; frame; free; heap; higher; incr; integer; language; level; logic; main; nested; new; order; parameters; problems; procedure; programs; proof; property; sendtoall; separation; simple; specification; ssh; sshs; stack; store; theorem; triples; use; user; value; variables; verification; work; z>0; ∀x1; ∼=→
     • versions: original; plain text
329. 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: address; addresses; algorithm; arithmetic; array; assertions; block; byte; char; code; condition; content; cover; curr; data; disjointness; dst; element; example; field; figure; function; high; hol; invariant; isabelle; kfree; layout; level; lightweight; list; logic; loop; low; memory; model; old; pointer; post; prev; programs; proof; reasoning; region; section; separation; set; size; split; src; state; struct; structure; tmp; tuch; types; unfolding; variable; verification; view; volume; work
     • versions: original; plain text
330. 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: = =; activity; actual; analysis; application; associated; behaviour; bill; button; case; changes; checking; clauses; condition; configurable; configuration; context; design; devices; different; earcon; eceasst; evaluation; event; example; figure; files; fmis; formal; function; general; hand; high; home; hub; hubs; input; interactive; list; literal; log; mam; match; message; modalities; model; modelling; monitoring; movement; multiple; non; number; output; pervasive; problem; process; promela; properties; real; redundant; results; rule; sat; screen; section; set; shake; simple; single; speech; study; system; temporal; time; true; types; user; variable; verification; volume; webcam; work
     • versions: original; plain text
331. 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: -happens; action; agent; analysis; axiom; beli; boss; case; choicei; cognitive; def; definition; disappointment; distress; distrust; eceasst; effect; emotions; example; f(1; factor; fear; fmis; following; formal; framework; future; goali; grdi; hope; instant; intention; j(α; joy; logic; logical; means; outcome; possible; prepare; press; previous; proposition; relations; relief; report; satisfaction; set; structure; support; time; true; trust; university; volume; α ϕ; ϕ def
     • versions: original; plain text
332. 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: aspinall; attempts; bertot; challenges; compiler; computer; design; document; early; eceasst; eclipse; editor; emacs; formal; future; general; gestures; good; graphical; ides; important; interactive; interfaces; lüth; mathematical; need; notes; particular; potential; proc; proof; provers; proving; rules; science; script; system; technology; theorem; theorem provers; tools; user; user interfaces; volume; web; work
     • versions: original; plain text
333. 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: a2;a3; algebra; algorithm; benchmarks; color; composition; constraints; database; deadlocks; design; eceasst; edges; evaluation; example; figure; function; games; graph; group; implementation; input; interest; language; model; nodes; number; ordering; paper; parity; parity games; particular; player; preprocessors; prototype; queries; query; random; regions; requirements; res(g; residual; resilient; results; running; section; self; sequence; server; set; solvers; strategies; strategy; user; volume; winners; witness; workbench
     • versions: original; plain text
334. 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: ack; actions; approach; behaviour; blackhole; chanin; channel; chp; code; communicating; composition; copy; csp; deadlock; enroll; events; example; fdr; function; generated; haskell; implementation; input; language; library; mid; mirror; model; output; parallel; philosophers; process; processes; program; programming; pure; rec; refinement; semantics; skip; source; specification; syncbarrier; system; type; use; value; volume; |||
     • versions: original; plain text
335. 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: able; addition; associated; attribute; check; checking; class; classes; concatenation; constraints; context; contract; def; designer; diagram; eceasst; element; evolution; example; figure; functions; global; interface; language; list; main; mapping; meta; method; model; model transformation; modelbase; necessary; need; ocl; owner; post; pre; problem; refinement; set; single; source; source model; specification; standard; string; target; target model; tool; transformation; type; uml; verification; volume; way
     • versions: original; plain text
336. 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: abstraction; analysis; architecture; association; case; co09; code; concepts; constraints; context; cycle; definition; development; different; domain; eceasst; editing; element; environment; evaluation; expressions; features; fig; figure; focus; formal; functionality; hybrid; ide4ocl; information; instance; landscape; language; layer; level; library; mechanism; metamodel; model; modeling; mof; multiple; object; ocl; ocl specification; omg06; operation; package; paper; pivot; pragmatics; proc; project; related; repository; requirements; section; semantics; software; specification; springer; standard; statement; support; syntactical; syntax; testing; tool; uml; usage; use; value; verification; verify; view; volume; work
     • versions: original; plain text
337. 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: @attribute; abstract; approach; args; arguments; body; book; case; class; classes; code; conditions; context; definition; desugar; dsl; eceasst; end; end end; example; expression; feature; field; figure; implementation; int; java; javaclass; language; library; machine; message; meta; method; model; mop; mspec; names; new; object; ocl; operation; paper; post; pre; protocol; public; root; run; sales; section; specification; string; support; syntax; system; testing; use; value; volume; xmf
     • versions: original; plain text
338. 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: algorithm; approach; case; code; compilation; compiler; data; definition; efficient; environment; eval(ε; expressions; false; figure; following; fsym(t; functional; host; i1,nop; if(c1; if(is; ifswapping; instruction; java; languages; matching; number; optimization; pattern; pattern matching; pil; program; programming; rule; section; size; step; structure; tests; time; tom; transformation; true; variable; φ(π
     • versions: original; plain text
339. 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: a(x; alpha; analysis; approach; axioms; beta; case; coinductive; computation; computer; constructive; correct; data; definitions; digit; eceasst; eds; exact; example; extraction; fix; formula; induction; language; left; logic; main; mathematical; method; monotone; nat; non; numbers; order; point; predicate; principle; proc; program; programming; proof; rat; rational; real; realisability; representation; right; sds; sect; set; springer; system; term; theory; type; usual; variables; volume; τ(a; φ(x; φ(µ
     • versions: original; plain text
340. 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: abstract; analysis; ann; applications; arithmetic; avocs; berger; calculus; case; computable; computation; computer; constructive; correspondence; digit; eds; example; extraction; formal; functions; known; lambda; logic; logical; mathematics; paradigm; programming; programs; proofs; pure; real; relevant; schwichtenberg; science; set; springer; studies; systems; theory; volume
     • versions: original; plain text
341. 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; activity; approach; assl; business; business process; case; certain; class; concrete; constraints; container; context; data; declarative; declarative process; definition; eceasst; ecore; examination; example; execution; figure; generation; homework; homeworkuio; instance; interface; invariants; july; languages; lectureadt; like; logic; meta; model; modeling; objects; ocl; paper; platform; process; process models; processes; relationships; section; sequence; specific; state; study; temporal; tool; type; uio; uml; user; user interface; value; volume; workflow; xul
     • versions: original; plain text
342. 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: automated; boolean; class; coll(name(setexpr; collection; constraints; definition; different; eceasst; expressions; figure; fol; following; formulas; function; library; logic; mapping; model; ocl; ocl constraints; order; predicates; proc; prover9; reasoning; section; setexpr; sets; simple; smt; software; solvers; subset; table; theorem; tool; uml; unsatisfiability; unsatisfiable; use; volume; work; yices
     • versions: original; plain text
343. 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: agent; hoffmann; julia; mobile; modeling; nets; padberg; preface; systems
     • versions: original; plain text
344. 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: activities; activity; additional; aho; application; approach; area; case; changes; company; control; data; different; eceasst; emergency; evacuation; figure; firing; flexible; gas; hand; high; independence; indicator; level; lines; main; manets; marking; member; mobile; modeling; m′1; net; nets; new; order; persons; perspective; petri; pn1; pn2; pn3; process; processes; prodanalyse; prodevacuate; reading; reconfigurable; reconfigurable systems; requirements; results; rule; scenarios; set; steps; systems; t system; team; time; token; transformation; transition; volume
     • versions: original; plain text
345. 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; approach; architecture; avocs; b machine; behaviour; case; channels; combination; concurrent; consistency; controller; csp; csp controller; csp‖b; deadlock; divergence; eceasst; end; execution; figure; flight; formal; framework; freedom; loop; machine; machine references; mobile; mobile csp; mobility; office; operations; order; paper; parallel; point; precondition; process; processes; reference; response; return; sell; set; state; static; system; tickets; use; verification; volume
     • versions: original; plain text
346. 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; artifacts; association; available; base; class; classes; corresponding; definition; description; design; domain; eceasst; elements; enumeration; evaluation; example; fig; formal; generated; generation; instances; languages; level; library; lower; management; measure; measurements; meta; metrics; model; model metrics; modeling; mof; number; object; ocl; operation; order; particular; phase; process; property; prototype; quality; results; rule; scope; section; set; smm; software; specific; specification; tool; type; uml; user; value; volume
     • versions: original; plain text
347. 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: agg; algebraic; analysis; application; approaches; atl; attribute; case; class; classes; code; concepts; conditions; consistency; corresponding; different; eceasst; eclipse; ecore; emf; emf model; engine; example; fig; figure; following; formal; framework; graph; graph transformation; http://; java; kind; languages; lhs; methods; model; model refactoring; model transformation; modeling; net; new; objects; petri; place; possible; proc; pullupattribute; refactoring; rhs; rule; setra; software; springer; subclass; superclass; tool; transformation; uml; volume
     • versions: original; plain text
348. 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: calder; cnr; fmis; formal; harrison; interactive; international; isti; italy; massink; methods; michael; mieke; model; newcastle; papers; systems; university; volume; workshop
     • versions: original; plain text
349. 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: activities; activity; business; c t; constraints; correctness; e n; entities; implementation; instantiation; l e; manual; method; n t; o n; ocl; operations; process; processes; project; r o; reference; siemens; software; system; t e; t r; u t
     • versions: original; plain text
350. 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: application; cabot; chimiak; development; germany; languages; model; ocl; opoka; papers; preface; semantics; specification; tool; university; workshop
     • versions: original; plain text
351. 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: bottoni; committee; definition; esther; formalisms; guerra; juan; lara; model; papers; pattern; software; technical; university; vffp’09; visual; workshop
     • versions: original; plain text
352. 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: activities; anti; block; bpmn; branches; business; business process; combination; conference; constructs; control; deadlock; eceasst; edges; elements; entry; errors; event; false; fig; figure; flow; gateways; graph; graphical; incoming; international; join; language; loop; matching; model; modeling; nd1; negative; nodes; outgoing; parallel; path; patterns; possible; proceedings; process; processes; queries; query; set; split; state; type; use; verification; visual; visualization; volume; x)or; xor
     • versions: original; plain text
353. 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; activities; activity; activityedge; approach; business; business process; close; concrete; constraint; dmm; elements; example; execution; figure; flow; formulas; groove; instance; language; logic; lts; metamodel; model; modeling; order; patterns; process; process constraint; process patterns; produce; property; quality; report; requirements; rules; runtime; semantics; set; specification; state; stereotype; syntax; system; temporal; test; token; transition; uml; verification; visual; vpp; vpps
     • versions: original; plain text
354. 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; acts; affairs; aristoteles; assertions; author; berlin; brentano; case; conception; content; conventional; der; die; different; distinction; domain; eceasst; example; existence; false; festschrift; following; formal; forms; frege; general; german; hjk; intentional; interpretation; intuitionistic; judgement; language; level; logic; logical; löf; mahr; martin; matter; meaning; means; mental; mind; model; modern; notion; object; particular; philosophy; pragmatic; presentation; proofs; proposition; quantification; question; reality; reference; rules; russell; semantics; sense; sentence; set; speech; states; stroke; style; subject; system; tarski; theoretic; theory; things; thoughts; today; true; truth; twa77; twardowski; type; und; use; values; variables; verlag; view; volume; wittgenstein; word
     • versions: original; plain text
355. 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: approach; augmented; bool; categories; constraint; constraint relaxation; dangling; definition; design; design pattern; diagram; domain; eceasst; edges; elements; environment; figure; general; hierarchy; information; instance; language; metamodel; metamodeling; method; model; modeling; multiplicity; navigation; ocl; partial; pattern; relaxation; relaxed; restrictions; result; section; set; set(t; software; solution; specific; structural; support; system; target; tool; transformation; uml; valid; validation; vffp; visual; vmts; volume; way
     • versions: original; plain text
356. 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; adaptive star; application; backup; bdy; body; border; class; classes; clones; cls; computer; conditional; conditional adaptive; contains; cts; definition; derivation; e e; eceasst; edges; example; exp; expression; fea; features; figure; grammars; graph; h.-j; hand; instances; kreowski; languages; left; like; m m; method; models; multiple; nodes; object; ovrd; parameters; pgc; program; properties; property; recell; replacement; restore; rules; science; set; signature; software; sorts; star; star grammars; star rules; structure; sub; theorem; transformation; tree; use; v m; variables; visible; volume
     • versions: original; plain text
357. 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: brazil; change; engineering; evolution; favre; heckel; jean; marie; model; preface; reiko; software; techniques; tom; transformation; university
     • versions: original; plain text
358. 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: abstract; algorithms; approach; attributes; behavior; class; classes; component; constraint; containment; diagram; different; drawing; eceasst; ecore; edge; editor; engine; example; figure; glm; graph; hand; instance; intl; language; layout; layout algorithms; list; lmm; mapping; meta; meta model; model; package; pattern; proc; reuse; rule; specific; specification; syntax; user; visual; volume
     • versions: original; plain text
359. 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: abstract; abstractaxis; abstractions; allocations; axes; axis; cognition; combination; complex; concepts; conceptual; concrete; coord; coordinate; dimensions; eceasst; elements; euclidian; example; figure; float; formal; intercepts; knowledge; language; linguistic; mapping; meaning; means; meta; model; modeling; non; notation; notion; number; order; patterns; physical; place; possible; press; real; research; scientific; section; semantic; set; space; spatial; symbolic; symbols; systems; theory; traditional; understanding; university; use; values; view; visualization; volume; way
     • versions: original; plain text
360. 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: actions; active; amalgamated; application; card; concepts; condition; consistent; container; containment; creation; current; cycle; definition; different; eceasst; eclipse; edge; emf; emf model; event; example; festschrift; fig; figure; following; framework; graph; graph transformation; h.-j; instance; interaction; kernel; kreowski; match; model; model transformation; modeling; morphism; multi; nac; node; note; number; object; paper; parallel; parallel graph; queue; region; result; rooted; rule; scheme; section; set; simulation; state; statecharts; structures; transformation; transition; type; volume
     • versions: original; plain text
361. 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: aco; algorithms; ant; ant colony; ants; application; approach; autonomous; autonomous units; auxiliary; class; colony; common; communities; community; conditions; construction; control; current; cvrp; delete; depot; eceasst; edge; environment; evaporation; expressions; feasible; festschrift; figure; following; follows; global; gluing; goal; graph; graph transformation; h.-j; hand; initial; kreowski; len; length; load; memory; modeling; neighbors; node; optimization; pair; parallel; pheromone; possible; private; problem; round; routing; rule; section; semantics; semar; sequences; set; sit; solution; solving; start; state; stop; systems; tour; transformation; units; value; vehicle; volume; way
     • versions: original; plain text
362. 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: aggregation; algorithms; approach; assemblies; assembly; basic; block; building; causality; components; computing; conf; definition; eceasst; edges; elements; embedding; figure; following; graph; graph processes; graph rewriting; h.-j; hand; information; kreowski; labels; language; left; mechanism; natural; new; nodes; occurrences; operations; order; paper; processes; relation; rewriting; right; rule; section; self; set; simple; solution; step; structure; subgraph; surface; test; transformation; tube; volume; way
     • versions: original; plain text
363. 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: approach; association; axioms; categorical; category; class; consists; customer; data; date; dpo; eceasst; edges; eept06; elements; epireflector; extended; festschrift; fig; figure; following; framework; functor; graph; h.-j; homomorphisms; induced; information; inheritance; instance; k �; kreowski; left; lemma; level; link; message; methods; migration; model; node; object; operation; order; predicate; processes; programs; proof; proposition; pullback; pushout; refactoring; right; rule; schema; section; signature; software; sort; specification; structure; subcategory; sys(s; systems; target; transformation; type; typing; valid; volume; � �
     • versions: original; plain text
364. 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: 2010; = =; algebraic; atom; axioms; blink; case; checking; clause; computer; conjecture; data; def; eceasst; equations; evaluation; expander2; expansion; festschrift; fig; fixpoint; following; formula; functions; greatest; h.-j; horn; incremental; induction; instance; interpretation; kreowski; kripke; lab; leads; list; logic; logical; ltls; means; methods; model; mutex; narrowing; operators; order; padawitz; path; predicate; processes; programming; proof; redices; reducts; relation; resolution; resp; rules; s =; safe(st; science; second; section; set; sets; simplification; specification; states; steps; structures; systems; term; transition; true; type; var; variables; volume
     • versions: original; plain text
365. 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: birgit; chiorean; dan; demuth; gogolla; jos; martin; modeling; ocl; warmer; workshop
     • versions: original; plain text
366. 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: abstract; algebras; algorithms; application; appropriate; attribute; automata; automaton; basic; case; checking; class; classes; collage; commands; components; computer; concrete; data; definition; design; different; displays; drewes; eceasst; eds; engelfriet; example; fact; festschrift; finite; general; generator; grammars; graph; h.-j; implementation; input; intended; kreowski; languages; load; major; marbles; means; model; new; number; output; point; possible; properties; ranked; recognizers; regular; regular tree; research; results; science; set; springer; system; term; theoretical; transducers; tree; tree automata; tree grammars; tree transducers; treebag; type; unranked; user; volume; way; weighted; workbench
     • versions: original; plain text
367. 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: acc; acl; acl1; acl2; acr; acs; adhesive; application; application conditions; authors; categories; category; catnr; church; concurrency; conditions; definition; derivation; direct; eept06; ehrig; figure; graph; h.-j; habel; high; hlr; independent; kreowski; l(ρ; left; lemma; level; local; morphisms; negative; nested; orders; parallel; parallelism; publishers; pushouts; right; rosser; rule; schema; shift; structures; systems; theorem; title; transformation; true; volume; weak; ←֓ �; ∃(a; � ordernr
     • versions: original; plain text
368. 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: basic; biochemical; computer; computing; definition; elements; enabled; event; extended; finite; framework; interactions; interactive; modules; nature; notion; paper; periodic; processes; reaction; reaction systems; resa(t; research; result; science; sequence; set; sets; state; systems; w0,w1,
     • versions: original; plain text
369. 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: action; active; amps; application; approach; aspect; attributes; bind; certain; class; counters; design; design patterns; diagrams; domain; dsml; elements; environment; extension; figure; gme; incomplete; information; infrastructure; insertion; language; metamodel; metamodeling; method; model; model patterns; modeling; operations; original; pattern; process; software; specific; static; support; time; tool; transformation; type; uml; user; value; volume; work
     • versions: original; plain text
370. 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: attachment; condition; confluence; coverable; critical; definition; derivations; direct; eceasst; example; figure; hyperedges; hypergraph; injective; isomorphism; joinability; joinable; labels; lemma; morphism; nodes; non; pair; persistγ; pushout; rules; seq; set; signature; systems; theorem; transformation; transformation systems; volume
     • versions: original; plain text
371. 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: algebraic; approach; arcs; condition; corresponding; cpr; definition; derivation; different; direct; distinguished; dpo; eceasst; edges; elementary; enabled; encoding; enriched; fig; figure; fire; firing; grammar; graph; graph g; graph transformation; h.-j; hand; inhibitor; kind; kreowski; marking; models; morphism; nets; node; partial; petri; petri nets; place; pushout; read; relation; reset; rewriting; rule; section; set; spo; sts; stsm; sub(t; subgraph; systems; t net; token; transformation; transition; type; volume; way
     • versions: original; plain text
372. 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: communications; computer; contributions; easst; grammars; graph; hans; interests; jörg; kreowski; research; transformation; volume
     • versions: original; plain text
373. 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: 6th; attlist; attributes; catalog; certain; class; collection; confidence; context; data; description; design; diagram; domain; dsl; eceasst; eclipse; editor; element; emf; entries; example; figure; framework; gmf; grammar; graphical; hci; idea; interface; june; label; language; level; link; management; meta; model; object; pattern; pattern language; plml; possible; problem; solution; source; specific; standard; textual; type; user; value; volume; workshop; xml; xtext
     • versions: original; plain text
374. 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; able; adaptation; adaptive; addition; ambient; applications; approach; architecture; capabilities; communication; complex; components; computing; context; controllers; current; data; development; devices; e.g.; eceasst; environment; european; event; features; figure; german; home; ict; information; instrumentation; integrated; layer; level; like; living; management; middleware; mobile; model; new; ontologies; ontology; organisation; osgi; pan; paper; performance; platform; power; processing; project; properties; research; rheinmain; runtime; saks; section; self; sensor; service; service platform; strategies; subsystem; system; technologies; university; user; volume; work
     • versions: original; plain text
375. 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: abbildung; aber; allem; als; anforderungen; anforderungserhebung; ansatz; ansätze; anwender; anwendungen; auch; auf; bei; benutzer; bereits; computer; computing; conference; dabei; damit; dann; darauf; das; dass; dem; der; der nutzer; deren; des; design; die; diese; durch; eceasst; ein; einbeziehung; eine; endkunden; engineering; entwickeln; entwickler; entwicklung; erfassen; forschung; für; haben; hier; hoffmann; hrsg; ihn; immer; information; interaction; ist; j.m; jedoch; kann; krcmar; können; lassen; leimeister; mit; möglichkeiten; müssen; neuartigkeit; neue; nicht; nutzer; nutzerintegration; nutzung; oder; partizipativen; probleme; proceedings; prototypen; requirements; saks; sich; sie; sind; späteren; stellen; systeme; technik; technikgetriebene; technische; ubiquitous; ubiquitous computing; ubiquitärer; umsetzung; und; user; verständnis; vision; volume; von; vor; vorstellung; weiser; weitere; welche; wenn; werden; wie; wird; zum; zur; über
     • versions: original; plain text
376. 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: + +; + =; = +; = =; = model; = ; algebraic; bird; conclusion; consequence; conservative; course; definition; eceasst; end; fitch; free; harry =; hets; john =; kreowski; logic; logical; m =; mary =; m|σ =; order; penguin; premises; proof; propositional; set; shop; signature; specification; students; sunny |; swt |; table; teaching; theory; truth; volume; world; | tennis; | tsh; | |; | ||; | φ; || f; || t; || whenjohn; || |;  =;  =;  ||
     • versions: original; plain text
377. 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: abstract; association; atl; atoms; class; code; compliant; concept; concrete; concrete syntax; data; definition; ebnf; eceasst; element; example; excerpt; expression; false; figure; individualpropertyatom; input; instance; integrity; interchanging; language; level; logic; mappings; mda; metamodel; models; mof; negation; object; objectvariable; ocl; ocl metamodel; oclapps; odm; ontology; operation; order; output; owl; paper; person; proc; process; r2ml; r2ml model; rdf; rdm; rdm metamodel; ruleml; rules; second; section; semantic; sharing; solution; space; specification; step; swrl; swrl xml; syntax; tcs; technical; terms; textual; transformation; true; type; uml; use; value; var; variable; volume; web; xmi.id; xmi.idref; xml
     • versions: original; plain text
378. 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: 10th; agnostic; agnostic service; approach; available; component; concept; creation; creation approach; creation tools; description; developers; development; different; discovery; eceasst; end; environment; evaluation; event; feedback; fig; figure; graphical; group; idea; issues; january; knowledge; needs; new; non; participants; plug; potential; process; programming; prototype; questions; results; rule; saks; sbbs; semantic; service; service creation; suggestions; tasc; tasc approach; tasks; technical; technology; technology agnostic; tools; usability; users; volume; vse; web; work
     • versions: original; plain text
379. 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; adaptive; ambient; application; approach; aspects; assisted; attribute; available; aware; behavior; building; computing; conceptual; context; context aware; context information; context infrastructure; context model; definition; description; development; different; e.g.; element; entity; environment; features; focus; following; home; implementation; information; infrastructure; inhabitant; int; layer; level; living; management; metamodel; model; modeling; operative; proc; relation; relevant; representation; sensors; server; services; smart; specific; system; type="boolean"/; type="string"/; types; user; xml
     • versions: original; plain text
380. 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: actions; activities; algorithm; approach; appropriate; availability; books; bookshop; bpel; bprules; business; business processes; client; component; composition; constraints; corrective; cost; different; distributor; example; execution; functional; ieee; instances; language; line; management; manager; managing; method; monitor; monitoring; non; objective; order; parts; process; processes; qos; quality; registry; requirements; runtime; sections; selection; self; service; service selection; set; state; strategy; system; time; values; volume; web; web services
     • versions: original; plain text
381. 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: analysis; approach; behavior; bgdt06; bifurcation; boc04; case; chains; change; communication; complex; continuous; continuous state; current; design; deterministic; different; discrete; discrete state; entities; equilibrium; example; global; graph; hyperbolic; initial; interest; level; level modeling; local; macro; map; meer; modeling; models; networks; new; nodes; non; object; orbit; overview; parameters; point; probability; properties; random; real; rules; self; set; space; stable; state; state space; stochastic; subset; system; target; time; time macro; time t; variables; world
     • versions: original; plain text
382. 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: activities; adaptive; adjustment; agent; application; approach; availability; bee; behavior; building; catalog; coaction; coherent; configuration; coordination; creation; decentralized; design; differentiation; dissemination; dynamic; eceasst; elements; endogenous; entities; environment; external; extrinsic; feedback; figure; foraging; influences; information; integration; inter; local; locations; loops; management; mas; mechanisms; modeling; models; natural; partitioned; processes; programming; properties; renz; resources; saks; section; self; set; software; structures; sudeikat; systemic; systems; template; types; volume
     • versions: original; plain text
383. 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: agents; algorithms; analysis; annealing; benchmark; cca; class; cluster; clustering; component; construction; data; demartines; dimensional; dispersion; distances; eceasst; figure; function; gpd194; grid; herrmann; high; hérault; input; learning; mapping; maps; mds; methods; neighborhood; non; number; organizing; popescu; position; projection; proteins; radius; saks; schelling; scheme; self; set; sets; som; sop; space; structures; swarm; topographic; ultsch; volume
     • versions: original; plain text
384. 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: abstractions; algorithm; approach; class; code; collaboration; concepts; conceptual; concretestrategy; connection; decorator; definition; design; developer; diagram; draw; drawscrollbar; dynamic; eceasst; entities; entity; example; external; figure; form; formal; hierarchical; implementation; instance; method; multiple; notation; object; operation; pattern; pattern instance; pin; pinbox; primary; proc; relationships; role; simple; single; software; spqr; standard; strategy; structural; subpatterns; system; tool; uml; useful; vffp; view; visualization; volume; window
     • versions: original; plain text
385. 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: abbildung; abhängig; adaptive; algorithmen; allerdings; als; anhand; ansatz; ansätze; anwendungsfällen; arbeit; assessment; auch; auf; aufgaben; aufgrund; aus; autonomic; beim; beispiel; beispielsweise; beitrag; benchmarks; bereich; communications; computing; configuration; d.h; dabei; damit; das; dass; dem; demo; der; derartiger; deren; des; dessen; die; dieser; direkt; drei; durch; durchgeführt; eceasst; eine; einfachen; einsatz; ergebnis; ermöglicht; erwartet; erzeugen; erzeugt; evaluation; evaluierung; fall; future; für; generierung; hier; implementierung; informationen; innerhalb; interferenz; international; internen; ist; jeweils; kanal; kanalauswahl; kann; kanäle; kommunikationssysteme; kommunikationstechnik; komplexe; komplexität; kontext; kontextsensitiven; können; lassen; leistungsfähigkeit; leistungsmessungen; lösen; messung; methode; metriken; mit; miteinander; muss; möglichkeit; müssen; neuen; nicht; nur; oder; probleme; prozess; präsentiert; qualität; reihe; ressourcen; rolle; saks; schnittstellen; schon; schwierigkeit; sehr; selbstanpassenden; selbstmanagement; selbstorganisation; selbstorganisierende; self; sense; sich; sind; situationen; smirnov; soll; sowie; sowohl; sut; systeme; systemeigenschaften; testen; testende; testfall; testfälle; tests; tiemann; umgebung; und; vergleich; verglichen; verschiedene; vielzahl; volume; von; vorgeschlagene; werden; wie; wird; wissen; z.b; ziel; zseby; zum; zur; zustand; zusätzlich; zwischen; änderungen; über
     • versions: original; plain text
386. 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; case; changes; class; classes; concerns; context; contribution; definition; development; diagrams; different; eceasst; engineering; evolution; example; figure; functional; goal; graph; help; ieee; important; information; international; language; leaf; leite; mechanism; modeling; models; necessary; order; paper; process; related; relationships; requirements; rules; scenarios; section; software; system; tasks; topic; traceability; transformation; type; use; views; visualization; volume; work; xml
     • versions: original; plain text
387. 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: activities; adaptive; analyses; business; communication; contribution; control; cooperation; coordination; creation; cybernetics; data; decision; dependencies; design; development; different; divisions; eceasst; evaluation; example; implementation; information; interorganisational; ios; layer; lenses; level; management; model; networks; new; operational; order; organisations; organizing; overall; problem; processes; relationships; req; requirements; research; resource; saks; scenarios; schwaninger; science; selection; self; semantics; specific; standardized; standards; strategic; support; systems; technical; theoretical; theory; value; viability; volume; vsm
     • versions: original; plain text
388. 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: approaches; authors; challenges; cluster; communication; content; design; devices; discovery; environment; events; goals; interaction; internet; language; massive; middleware; mobile; need; networks; new; nodes; number; objects; pages; programming; project; pub; rate; routing; section; sensor; services; shortcomings; size; solutions; sub; systems; things; volume; wireless
     • versions: original; plain text
389. 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: access; acm; adaptation; alice; applications; architecture; bindings; binjiu; blogging; capabilities; client; communications; component; content; control; description; devices; different; digihome; discovery; eceasst; environments; event; figure; frascati; home; house; http; implementation; information; integration; interface; international; java; means; mechanism; message; micro; monitoring; network; new; notification; order; particular; pervasive; pervasive bindings; platform; proceedings; process; protocol; public; reference; sca; scenario; section; server; service; simple; smart; social; social bindings; solution; standard; subsection; support; system; technology; time; twitter; type; upnp; usa; use; user; volume; way; xml; york
     • versions: original; plain text
390. 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; adaptive applications; applications; architecture; argument; available; aware; behavior; campus; client; commands; components; computer; computing; conference; context; context events; context simulation; developers; eceasst; engine; events; framework; ieee; information; installation; international; invocation; memory; middleware; mobile; mode; music; navigation; network; nodes; paper; paspallis; platform; possible; proceedings; satmotion; scenario; scope; script; self; server; service; signal; simulation; software; step; support; systems; tasks; terms; testing; time; tool; user; utility; volume
     • versions: original; plain text
391. 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: adaptation; adaptive; application; approach; architecture; autonomic; checkpoint; component; computing; context; control; data; deployment; distance; elements; engineering; fcl; fcls; feedback; figure; hatchback; information; infrastructure; loops; mape; mechanisms; metamodel; model; modelling; monitor; nodes; paper; plan; position; proceedings; processing; push; report; sca; scenario; section; self; services; stop; systems; time; trailer; truck
     • versions: original; plain text
392. 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: abstract; applications; approaches; artifacts; aspects; aware; bed; campus; categories; category; code; complex; computing; context; context information; development; different; domain; dsl; e.g.; eceasst; elements; entities; entity; environment; example; figure; fire; floor; generated; high; hospital; include; information; international; java; knowledge; language; level; mdd; medic; metaclass; metamodel; middleware; mlcontext; model; modeling; order; patient; person; pervasive; physical; properties; related; room; section; services; simple; software; source; specific; static; syntax; systems; temperature; textual; time; types; uml; user; volume
     • versions: original; plain text
393. 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; applications; bob; code; connectivity; contract; current; deal; devices; disconnections; discovery; environment; interaction; languages; lines; model; multi; multiple; nil; objects; participants; party; phase; phone; programmer; programming; reconnections; requirements; scenario; services; set; state; system
     • versions: original; plain text
394. 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: adaptive; analysis; applications; approach; architectural; architectural constraints; c t; case; code; component; constraints; controller; coordinator; domain; driver; e c; e d; e f; e m; e r; e s; e t; example; exists; g e; l e; l l; language; level; method; music; n e; n s; n t; net; new; o l; o n; p t; pervasive; s l; s s; s t; section; security; software; specific; state; system; t l; t r; time; use; verifycomponents; volume; work
     • versions: original; plain text
395. 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: adaptation; applications; aware; ben; campus; context; environments; france; germany; kassel; lille; mechanisms; michael; mobile; mokhtar; norway; oslo; pervasive; preface; program; romain; rouvoy; services; sonia; ubiquitous; university; volume; wagner; workshop
     • versions: original; plain text
396. 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: constraints; definition; design; diagrams; dmm; dynamic; eceasst; environment; evalon; evaluation; expressions; figure; formal; iterateexp; language; letexp; maths; meta; metamodel; modeling; new; object; ocl; ocl semantics; oclapps; operation; overview; package; patterns; proc; process; result; section; semantics; sequence; specification; standard; structure; syntax; uml; value; visitor; volume
     • versions: original; plain text
397. 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: adaptation; affective; ambient; ash; aware; bam; bayes; behaviour; behaviour preferences; campus; changes; computing; context; context elements; control; decisions; eceasst; elements; examples; explicit; facial; feedback; figure; home; international; learning; mechanism; meta; mlp; needs; negative; network; neural; neural network; new; number; online; ontological; ontology; order; parameters; positive; possible; preferences; preferred; proc; reaction; reasoning; relation; representation; rules; section; service; set; smart; solution; state; supervised; system; time; training; user; valence; values; vol; volume; workshop
     • versions: original; plain text
398. 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: adaptivität; auch; beiträge; das; david; der; des; die; eceasst; fragen; für; jahren; kassel; kivs; klaus; können; management; mannheim; michael; münster; neue; new; preface; saks; selbstorganisation; self; sich; systems; technical; technische; und; universität; uns; volume; von; vorwort; wiesbaden; wir; workshop; zapf
     • versions: original; plain text
399. 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; application; approach; automata; class; components; composition; computer; condition; constrained; control; correctness; cxk; definition; eceasst; edges; editors; ehrig; examples; expressions; figure; final; finite; finite state; following; free; grammars; gramot; graph; graph transformation; hand; hans; hartmut; initial; input; jörg; language; lecture; level; linear; mapping; model; model transformation; model type; mtu2; notes; operations; output; pages; paper; parallel; proc; processes; product; right; rule; science; section; sequential; set; sets; source; start; state; state graph; terminal; transformation; transformation units; transitions; type; units; volume; way; word; working; ×···×
     • versions: original; plain text
400. 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: abbreviates; adhesive; application; base; car; category; cond(p; conditions; constraints; definition; eceasst; ehrig; example; expressiveness; finite; following; form x; formulas; free; grammars; gramot; graph; graph conditions; graph formulas; graph g; hlr; hp09; hr+ conditions; hyperedges; iff; injective; label; let; monadic; morphism; mso; nodes; number; order; path; platooning; problem; proc; proof; properties; property; replacement; repl′; satisfiability; satisfies; second; set; sets; simple; system; theorem; transformation; true; validity; variables; volume; weak; |=a
     • versions: original; plain text
401. 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: 2010; adhesive; algebra; approach; case; category; class; data; definition; eceasst; edges; element; equivalent; example; formulas; function; gramot; graph; graph transformation; gsg; gsg(ag; hand; hlr; homomorphism; instance; isomorphism; kind; labels; match; means; morphisms; nat; nodes; particular; proc; pullbacks; pushouts; rule; section; set; signature; specification; springer; substitution; symbolic; symbolic graph; term; transformation; tsp|σ; values; variables; volume
     • versions: original; plain text
402. 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; causal; charts; concatenation; condition; coregions; corresponding; decidable; definition; detection; events; figure; finite; free; gates; general; hmsc; lemma; message; open; open coregions; order; ordering; p(e; p.g; partial; problem; process; processes; property; race; receive; run; section; send; sequence; set; sets; space; state; system; visual
     • versions: original; plain text
403. 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: activity; algorithm; cancel; collection; composer; condition; consists; constructs; core; current; de-/re; diagrams; different; eceasst; elements; end; example; exception; fail; false return; figure; function; graph; issuccess ←; iterator; languages; match; matches; matching; method; model; model transformation; new; packet; packetin; pattern; pre; primitives; remiterations; resolution; resolver; return; return π; rewriter; rule; section; set; story; transformation; transformation languages; true; true return; vmt; volume; π end; π.current; π.matchsets; ← false
     • versions: original; plain text
404. 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: access; algorithm; arrow; atomic; automaton; bk08b; category; checking; cospan; cospan(hgraph; definition; deterministic; discrete; equivalence; file; finite; following; functor; graph; graph languages; interface; invariant; languages; monotone; myhill; nerode; nerode quasi; nodes; object; operations; order; outer; proc; properties; property; quasi; quasi order; recognizable; recognizable graph; regular; relation; rewrite; right; rule; second; section; set; simulation; size; states; system; theorem; theory; time; user; volume
     • versions: original; plain text
405. 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: + +; abstract; animated; animation; approach; at_topbottom; avalanche; behavior; board; component; described; diameta; different; dynamic; edge; editing; editors; end; environments; event; external; figure; following; generating; graph; gts; interactive; internal; lane; languages; left; m.tc; marble; model; order; point; position; proc; right; rolling; rule; section; shifting; specification; specified; start; state; static; switch; system; time; transformation; transition; user; visual; way
     • versions: original; plain text
406. 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: activity; attribute; case; check; child; class; code; consistency; constraints; context; corresponding; diagrams; dresden ocl; eclipse; editor; element; environment; example; figure; fujaba; generation; instance; integration; interface; java; method; model; object; ocl; ocl constraints; ocl editor; ocl toolkit; parser; repository; result; section; story; story diagrams; syntax; transformations; transition; uml; use; variable
     • versions: original; plain text
407. 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: abstract; application; approach; c10; case; class; conditions; constraints; construction; context; curve; definition; diagram; different; dpo; eceasst; edges; elements; example; feet; figure; function; generation; graph; hand; inside; language; lay; left; matches; model; modeling; morphism; nac; negative; nested; new; nit; nodes; outside; paper; preserving; proc; relations; right; rules; s.t; section; semantics; set; single; spider; transformation; type; unit; use; vmt; volume; zones
     • versions: original; plain text
408. 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: acc; access; backup; bdy; body; border; class; conditions; constraints; context; contextual; contextual star; cts; definition; derivation; diagram; edges; expressions; fact; figure; grammars; graph; hand; incomplete; inv; language; meta; method; models; negative; nodes; object; ocl; ovrd; parser; positive; program; program graphs; recell; replacement; rules; section; set; sets; software; sorts; specification; star; star grammars; star rules; terminal; transformation; variable; volume
     • versions: original; plain text
409. 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: application; approach; behavior; checking; compatibility; computer; condition; definition; doi; eceasst; edges; elements; event; example; figure; formal; formulas; function; grammars; gramot; graph; graph grammars; graph morphism; hand; initial; injective; left; logic; match; model; morphism; newe; newv; possible; proc; proof; properties; provers; proving; relational; relational graph; right; rule; science; set; sets; source; specification; springer; state; structures; system; target; technique; theorem; total; transformation; tuple; type; typing; use; variables; verification; vertex; vertices; vertt; volume; work; |g|; |h|; |t|
     • versions: original; plain text
410. 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: abstract; application; approach; area; assignment; associated; case; cdf; containment; def; delay; discrete; distribution; eceasst; edges; elements; enabled; events; example; finite; follows; function; general; graph; graph transformation; hierarchical; hierarchy; higher; level; local; markov; matches; matching; model; modelling; notion; number; ones; order; partial; places; point; power; probability; processes; quota; reconfiguration; recovery; regions; respect; rule; scheduling; semi; set; sgt; simulation; state; step; stochastic; structure; systems; time; transformation; type; vmt; volume; way
     • versions: original; plain text
411. 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: 7→ y; adr; agent; algebras; atomic; bigraphical; bigraphs; binding; category; composition; computer; definition; discrete; eceasst; environment; figure; fn γ; form; free; global; hyperedge; interface; j−k; language; link; list; local; location; l−m; milner; names; nodes; normal; objects; particular; prime; proc; proposition; pure; reactive; rewriting; rules; section; set; shr; signature; simple; systems; tentacles; term; types; typing; variables; volume; xn−1; y γ; ρ)k
     • versions: original; plain text
412. 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: analysis; application; causality; complete; conditions; construction; cont1; definition; dependencies; dependency; derivation; derived; direct; dnet(d; efficient; ehrig; equivalence; example; fig; figure; firing; general; graph; her09; injective; n[i; nacs; net; nets; object; order; p(q; paper; permutation; permutation equivalence; person; petri; place; proc; relations; rule; sequence; set; steps; sts; stsn; switch; systems; task; technique; transformation; transition; workson
     • versions: original; plain text
413. 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: 7→⊥; abstract; calculus; code; col−→; com−→; configuration; connections; env; equations; example; figure; following; form; implementation; interaction; int−→; lemma; lightweight; machine; mackie; names; nets; new; programming; reduction; rules; section; sequence; terms; update
     • versions: original; plain text
414. 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: category; copy; davis; definition; edges; elements; encoding; event; fabris; figure; formalism; graph; head; implementation; instance; kramer; level; list; list nodes; morphisms; nodes; order; partial; parts; plain; proof; pushouts; rank; rewriting; rule; section; sequence; slot; special; squares; structures; theory; transformation; use; vmt; volume; way; winner; work
     • versions: original; plain text
415. 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: abstraction; algorithm; approach; automatic; behavior; bisimulation; c++; certain; code; compiler; concurrent; context; csp; csp model; eceasst; example; executable; extraction; fdr2; figure; formalization; function; gap; gramot; high; hol; i32; intermediate; invariants; isabelle; label; language; level; level csp; like; llvm; llvm2csp; low; main; memory; model; network; non; operating; operational; parameterized; process; processes; program; project; properties; prover; real; refinement; relation; scheduler; section; semantics; set; software; source; specification; springer; state; systems; tau; theorem; threads; time; tools; transformations; transition; use; value; variable; vates; verification; volume
     • versions: original; plain text
416. 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; approach; case; condition; criterion; deleting; different; eceasst; examples; figure; finite; function; graph; matches; model; morphisms; nac; negative; node; non; number; path; proc; rewriting; rule; section; set; specific; starting; state; sufficient; systems; termination; transformations; transition; type; volume
     • versions: original; plain text
417. 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: aligning; alignment; allo; approach; architecture; cell; customer; domain; dsl; dsls; engine; eol; expressions; figure; instance; instantiation; languages; level; level queries; mechanism; metamodel; model; modelling; mof; navigation; object; ocl; operation; operator; point; proc; queries; query; return; section; semantics; specification; statement; string; support; table; type; uml; value; var; volume
     • versions: original; plain text
418. 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; architecture; association; atom; attributes; case; class; classes; cluster; component; compound; conceptual; construction; correctness; corresponding; declarative; description; eceasst; ecore; elements; emf; entity; figure; formalization; functor; graph; group; ids; isabelle; like; line; link; list; model; model transformations; new; outsubs; package; post; postroot; pre; predicate; prolog; proof; relation; root; rules; section; set; specification; structure; style; subcomp; subcomponents; system; term; theorem; transformation; use; uses; verification; volume
     • versions: original; plain text
419. eceasst-421
     • author: Kahl, Wolfram
     • title: Co-tabulations, Bicolimits and Van-Kampen Squares in Collagories
     • date: 2010-07-25
     • words: 7292
     • flesch: 67
     • summary: This implies symmetry: F ., F `., M ., M ` = F ., F`tM ., M` = M ., M`., F ., F` and, furthermore, difunctionality of M`., F: M `., F ., F `., M ., M `., F = M`., M ., M`., F ., F`., F = M`., F . Assuming also M ., M`uF ., c` v f ., f`., m ., m`uc ., (F ., F`tM ., M`) ., c` assumption = f ., f`., m ., m`u(c ., c`., f ., f`tc ., c`., m ., m`)
     • keywords: adhesive; algebraic; allegories; allegory; approach; b p; b r; categories; category; characterisation; cocone; colimits; collagories; collagory; composition; condition; definition; difunctional; eceasst; following; functor; gluing; graph; iff; kampen; lax; lemma; mappings; morphism; object; occ; pushout; relation; sobociński; span; squares; tabular; tabulation; theorem; transformation; v r; van; volume
     • versions: original; plain text
420. 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: committee; emilio; germany; graph; italy; jochen; küster; leicester; modeling; preface; programme; software; transformation; tuosto; university; vmt; workshop
     • versions: original; plain text
421. 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: abstract; agg; aim; algebraic; analysis; application; applied; approach; atm; atoms; bpel; bpmn; business; case; chemical; concepts; conditions; conf; corresponding; cycle; data; deadlock; diagram; different; domain; e.g.; eceasst; edge; ehrig; elements; engineering; ermel; failure; figure; grammars; gramot; graph; graph modelling; graph transformation; graphical; healing; information; int; kernel; languages; level; light; like; metabolic; model; model transformation; modelling; multi; new; nodes; normal; number; operations; pair; parallel; particular; pathway; patient; practice; problem; proc; process; programming; properties; reactions; related; representation; results; rnorm; rule; scheme; section; self; set; simulation; software; source; specific; springer; state; study; support; syntax; system; taentzer; target; techniques; technology; theory; tools; traffic; transformation; triple; type; user; visual; volume
     • versions: original; plain text
422. 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: + +; application; behaviour; bisimilarity; case; challenges; completeness; component; congruence; context; correctness; correspondence; corresponding; eceasst; ehrig; elements; fig; figure; following; formal; forward; functional; general; grammars; gramot; graph; graph transformation; hand; label; language; left; mixed; model; model transformations; morphisms; node; operational; order; preservation; proc; respect; results; rules; science; sec; semantics; situ; source; source model; specification; springer; src; systems; target; target model; technique; tgt; transformation; transformation rules; triple; triple graph; tr∗f=⇒; type; verification; volume; work; xyx
     • versions: original; plain text
423. 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: agg; agile; application; area; changes; concepts; context; correct; correctness; current; development; evolution; example; execution; formal; graph; instance; introduction; level; like; methods; migrations; model; paper; patterns; position; process; pushout; removal; research; semantics; software; state; structure; support; system; time; tools; transformation
     • versions: original; plain text
424. 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: -adhesive; activate; ahli; ahli nets; aho; algebraic; alice; amalgamated; analysis; application; approach; appropriate; behavior; callee; calls; case; chat; client; communication; communication platforms; computer; condition; conference; contact; control; corresponding; data; eceasst; ehrig; example; executecallrequest1; features; fig; figure; firing; following; formal; gramot; graph; hand; high; higher; history; host; individual; interaction; left; level; marking; match; modeling; multicasting; nets; order; parallel; participant; petri; petri nets; place; platforms; possible; proc; reconfigurable; reconfiguration; request; result; right; rule; section; send; skype; springer; state; steps; structure; study; systems; token; transformation; transition; type; user; volume; way
     • versions: original; plain text
425. 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; arbitrary; axioms; bruni; calculi; calculus; case; caspis; congruence; context; corresponding; definition; design; diagrams; different; eceasst; edge; eds; encoding; example; extrusion; fig; figure; following; free; gadducci; gramot; graph; graph transformation; graphical; hand; hierarchical; hierarchical graphs; immune; labels; left; level; like; list; lncs; modeling; models; montanari; names; nested; nesting; nodes; notion; operators; order; parallel; pipeline; process; processes; reduction; restriction; rules; semantics; service; session; set; sides; springer; standard; static; structural; syntax; systems; terms; transformation; use; view; volume
     • versions: original; plain text
426. 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: causal; causalities; context; definition; distance; enabled; entities; entity; example; finite; graph; independent; infa; influence; interactive; lemma; length; minimal; note; processes; product; reaction; resource; resp; sequence; set; sets; state; step; systems
     • versions: original; plain text
427. 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: abstract; approach; category; class; complement; component; composition; construction; data; definition; diagram; eceasst; epimorphism; example; fig; folding; following; framework; graph; hand; information; inheritance; migration; model; morphism; new; objects; pair; proc; proof; proposition; pullback; refactoring; right; second; section; sequential; set; setra; systems; typing; unique; uniqueness; volume; weak
     • versions: original; plain text
428. 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: agg; algebraic; algorithms; berlin; certified; computer; correctness; data; development; ehrig; formal; future; grammars; graph; group; integrated; integration; mathematical; modelling; past; petri; practice; semantics; software; specification; system; techniques; tfs; theory; transformation; types; uml; visual
     • versions: original; plain text
429. 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: accountable; agg; analysis; application; approach; atom; available; bonding; case; ch3; chemical; chemistry; cl−; computer; constant; constraints; context; critical; differential; dpo; eceasst; edges; elementary; equations; example; figure; general; gramot; graph; graph transformation; group; gts; h2o; hand; identity; implementation; incidence; instantiation; law; left; matrix; modelling; molecular; molecules; morphism; net; nodes; number; overlappings; pair; pattern; place; possible; proc; process; rate; reaction; reaction rules; refinement; representation; results; rule; science; section; set; sn1; species; starting; step; stochastic; stoichiometric; study; system; terms; transformation; transformation system; type; volume
     • versions: original; plain text
430. 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: abstract; action; activities; activityfinalnode; activitygroup; approach; behavior; case; context; ctl; derivation; dmm; dmm rule; dynamic; eceasst; elements; engineer; engineering; events; example; example model; executable; execution; expected; figure; gramot; graph; groove; groupfinalnode; instance; language; language derivation; metamodel; model; modeling; need; new; overriding; performed; process; result; rule; runtime; sect; section; semantics; semantics specification; software; specification; state; syntax; system; test; test case; token; traces; transformation; transition; type; uml; volume; way; work
     • versions: original; plain text
431. 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; chair; claudia; colloquium; committee; community; contribution; development; eceasst; ehrig; ermel; fernando; gabriele; germany; gramot; graph; graph transformation; hartmut; icgt; international; model; modelling; new; order; orejas; paper; preface; second; session; software; steering; systems; taentzer; techniques; transformation; universität; verification; volume
     • versions: original; plain text
432. 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: action; application; argument; bernd; class; conditions; context; definition; design; development; diagram; epistemic; example; fact; form; general; implementation; judgement; judging; library; like; mahr; metamodel; model; model object; modelling; object; observation; pattern; position; question; realization; relationship; requirements; sequence; software; subject; system; theory; transformation; type; university; use; φ(g; ψ(y
     • versions: original; plain text
433. 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: 2006; 2008; 2010; algebraic; algebraic graph; application; approaches; computer; concepts; conditions; conference; correctness; e.g.; eceasst; eclipse; eds; ehrig; emf; following; framework; future; grammars; graph; graph transformation; input; international; language; lncs; model; model transformations; modeling; notes; proceedings; properties; results; rule; schürr; science; software; source; specification; springer; structure; syntax; systems; taentzer; target; text; theory; transformation; triple; verification; volume
     • versions: original; plain text
434. 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: 2nd; application; automata; automaton; bit; boolean; circuits; corresponding; decision; definition; eceasst; edge; example; figure; following; formula; function; gramot; jmosel; labels; let; logic; m2l(str; new; nodes; numbering; optimization; order; order value; parametric; position; predicates; proc; procedure; result; second; section; semantics; set; syntax; terms; transformer; tree; value; value numbering; variables; vector; volume
     • versions: original; plain text
435. 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; association; assumption; atomic; attribute; budget; c t; case; cim; class; closure; code; collection; composite; concrete; constraint; constraint patterns; context; development; eceasst; eclipse; element; employee; engineering; example; exists; expressions; figure; following; instance; integer; inv; language; library; lncs; manager; meta; model; modeling; n t; navigation; needs; number; object; ocl; oclapps; oclexpression; office; operator; paper; parameters; path; pattern; platform; proceedings; process; properties; property; related; relation; restriction; section; self; semantics; set; simple; specification; structured; support; t e; targetattribute; tool; transformation; uml; use; user; value; volume; work
     • versions: original; plain text
436. 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: abstract; annotations; approach; constraints; dependencies; directional; ecore; element; emf; example; expression; figure; instances; language; meta; modeling; models; navigable; navigation; non; object; ocl; opposite; oppositepropertycallexp; references; role; sap; syntax; technologies; uni
     • versions: original; plain text
437. 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: 1.x; 2.x; ae.aggregation; appropriate; association; case; compilability; composite; composition; conceptual; constraints; container; context; correct; correctness; corresponding; def; development; different; eceasst; efficient; elements; ends; errors; fact; failure; figure; following; framework; informal; inv; language; listing; metamodel; model; model compilability; modeling; mof; namedelement; namespace; object; ocl; omg10; paper; proc; related; requirement; respect; rules; second; section; semantics; set; specification; state; static; test; testing; tools; uml; use; volume; wfrs
     • versions: original; plain text
438. 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: 7→ y; abrial; abstract; algorithm; approach; center; change; coloring; computation; computing; concrete; construction; context; correct; definition; design; development; different; distributed; eceasst; edges; event; examples; final; finite; following; formal; graph; init_ln; initial; instantiation; invariant; labels; lc0; lc1; level; local; local computation; machine; means; model; modeling; neighbors; new; new_label_edge; new_label_nodes; new_state_nodes; nodes; obligations; order; pattern; problem; proc; proof; properties; proving; refinement; refines; relabelling; relation; resp; result; ring; rule; section; set; sets; software; solution; specification; star; state; step; systems; tool; tree; variables; vertex; vertices; visidia; volume
     • versions: original; plain text
439. 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: + +; address; approaches; arbitrary; ast; bidirectional; bidirectional model; calls; case; certain; code; concrete; context; corresponding; different; domain; elements; engineering; existing; fig; figure; file; framework; grammar; graph; high; inspired; integration; language; level; links; los; metamodel; model; moflon; necessary; new; nodes; ob1.stl; ocl; pair; parser; proc; rule; schürr; simple; solution; specific; stl; study; support; syntax; templates; text; text transformation; textual; tggs; tool; transformation; triple; user; value; volume
     • versions: original; plain text
440. 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: action; analysis; analyzer; antlr; approach; asg; auto; basic; code; collectionliteralpartcs; complete; complex; constraints; csg; cst; document; eceasst; eclipse; eclipse ocl; editor; engineering; expression; generated; grammar; identifier; iterator; java; lalr; language; left; lexer; line; lpg; mdt; meta; model; modeling; multiplicativecs; number; object; ocl; operator; parser; parsing; performance; proc; project; reduction; references; result; rules; semantic; significant; simple; size; specification; support; syntax; tooling; traditional; transformation; type; uml; unarycs; use; version; volume; xtext; xtext grammar
     • versions: original; plain text
441. 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: association; car; case; ced08; class; code; code generator; codegen(body; codegen(expr1; collection; database; dcodegenproc(expr)e; different; eceasst; efficiency; elements; end; exists; expressions; figure; following; form; generator; int; iterator; iterator expressions; join; key; language; large; left; mapping; model; mysql; mysql code; mysql4ocl; nested; object; ocl; ocl expressions; operators; ownership; person; primitive; procedure; processing; query; scenarios; section; select; set; source; specific; subexpressions; table; type; uml; value; var; volume; work
     • versions: original; plain text
442. 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: able; application; bon; bon model; bonclasses; case; classes; client; cluster; consistent; context; definition; diagrams; diff; difference; eceasst; eclipse; ecore; editor; elements; end; example; figure; folding; formalisation; forms; framework; function; graphical; graphical model; graphs; hierarchy; ide; inheritance; input; interpretation; language; level; metamodel; model; modelling; object; ocl; outline; partial; predicate; proc; properties; pvs; record; relations; relationships; relevant; representation; second; set; specification; static; subset; system; textual; textual model; theory; tools; tree; type; uml; use; useful; vertices; view; visualisation; volume; work
     • versions: original; plain text
443. 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: analysis; architecture; available; classes; closure; code; community; concepts; constraints; data; different; example; figure; functions; graph; implementation; import; isorphan; java; javaclass; language; libraries; library; method; modeling; need; object; ocl; omg; operator; paper; process; proposal; reuse; running; section; specification; standard; start; support; tool; transitive; uml; user
     • versions: original; plain text
444. 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: antonio; cerone; certification; foundations; iist; international; italy; macau; minho; nations; opencert; oss; pisa; portugal; preface; sar; satellite; software; source; techniques; united; university; unu; volume; workshop
     • versions: original; plain text
445. 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; application; approach; architecture; artifacts; assets; assurance; available; certain; certification; certified; characteristics; code; compare; component; component certification; concepts; context; cope; data; database; design; developers; development; different; documentation; domain; eceasst; engineering; engines; etc; evidence; figure; formal; framework; important; information; knowledge; level; metrics; model; number; open; open source; opencert; order; organization; oss; oss components; oss reuse; oss search; oss software; possible; prerequisite; process; processes; product; program; project; properties; property; qualities; quality; repositories; repository; requirements; respondents; results; reusable; reuse; reusers; search; section; services; sme; sme project; smes; software; software certification; software reuse; source; source code; source software; specific; static; support; survey; system; testing; tools; toolset; trustworthiness; typical; volume; widespread; widespread oss
     • versions: original; plain text
446. 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: access; brucker; c l; c t; cartridges; class; code; constraints; control; core; corresponding; datatype; design; dialect; e l; e n; e s; eceasst; end; example; f t; formal; framework; generation; hol; implementation; l t; language; mda; metamodel; method; model; n s; n t; o n; object; obligations; ocl; oclapps; operation; package; postcondition; proof; properties; r e; r l; repository; roles; s f; s o; s s; s t; section; secureuml; security; software; specification; su4sml; support; system; t e; t h; t r; t t; t u; t y; template; test; theorem; transformation; type; uml; verification; volume
     • versions: original; plain text
447. 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: accreditation; achievement; assessment; body; case; certification; certification process; confidence; css; cust; cycle; developers; different; discussion; eceasst; environment; factors; goals; h h; iec; impact; important; independent; iso; l l; life; m h; m l; m m; open; opencert; oss; paper; possible; process; processes; product; quality; reference; related; repository; research; section; software; source; stakeholders; standards; supp; table; tests; user; volume
     • versions: original; plain text
448. 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: access; adaptations; applications; approach; available; case; cenelec; certification; channel; code; communication; components; control; core; critical; development; different; domain; eceasst; european; figure; formal; functional; grey; hardware; hypervisor; implementation; instantiates; interfaces; level; machines; malicious; means; mechanisms; memory; meta; metamodel; model; model software; open; open model; open source; opencert; openetcs; operating; order; paper; paradigm; partitioning; platform; potential; proc; railway; railway control; resource; safety; scenario; section; security; software; source; specific; specification; standards; supplier; systems; time; usable; v&v; validation; virtualisation; volume
     • versions: original; plain text
449. 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: alias; analysis; aop; approach; aspect; assembly; automata; automaton; behavior; c++; canada; cert; checking; code; coding; compilation; compiler; computer; data; design; development; eceasst; error; evaluation; execution; file; flow; following; foss; framework; free; gcc; gimple; hardening; implementation; information; input; instance; international; java; language; main; matching; model; moped; mourad; open; opencert; order; paper; pattern; plan; proceedings; process; program; programming; project; properties; property; recommendations; remopla; report; representation; rules; run; science; secure; security; security evaluation; security hardening; shl; software; solutions; source; specified; state; static; structure; systems; technical; techniques; time; tree; university; use; verification; volume; vulnerabilities; weaving
     • versions: original; plain text
450. 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: analysis; apache; assurance; authority; bug; certification; code; common; community; conference; core; current; dedicated; developers; development; documentation; eceasst; effort; engineering; experience; formal; free; important; interest; international; management; methodologies; methods; need; open; open source; opencert; oss; oss projects; paper; peer; population; practices; proceedings; processes; projects; quality; release; research; respondents; results; review; roles; section; similar; software; software engineering; source; source software; state; success; survey; systems; techniques; testing; time; tools; users; volume; work; workshop; years
     • versions: original; plain text
451. 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: activities; activity; address; analysis; certification; code; commits; committers; contribution; correlation; data; developers; development; deviation; eceasst; email; engineering; figure; foss; foss developers; foss projects; gnome; hypothesis; information; international; lists; mailing; mailing lists; mean; messages; methodology; metrics; multiple; number; open; open source; opencert; patterns; percentage; posters; posts; process; projects; quality; repositories; repository; research; sas06; software; source; source software; sowe; ssl08; std; study; sum; svn; systems; table; terms; tools; total; volume; workshop
     • versions: original; plain text
452. 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: access; analysis; application; best; bugs; category; ccscs; cert; certification; checkers; checking; clang; coccinelle; code; coding; compliance; concerned; control; current; dereference; eceasst; error; expression; figure; flow; function; handling; identifier; information; language; library; line; linux; memory; non; number; open; opencert; order; patch; pointer; position; possible; potential; proc; program; programming; project; proper; python; recommendations; return; rules; script; search; section; secure; security; semantic; software; source; specific; standard; support; tool; use; variable; violations; void; volume; work; worlds
     • versions: original; plain text
453. 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: abstract; analysis; break; case; certificate; checking; client; cloud; code; complete; complexity; computation; computing; condition; cpu; database; defect; definitions; different; eceasst; example; experiment; false; formal; goto; hard; i.e.; implementation; kernel; language; large; level; linear; linux; list; lock; logic; means; model; non; number; open; open source; opencert; order; original; overall; particular; point; practice; problem; proc; procedure; process; programming; project; required; result; return; rule; second; section; set; significant; software; source; source code; source verification; spinlock; state; statement; static; symbolic; system; task; technologies; technology; time; tree; verification; volume; volunteer; work
     • versions: original; plain text
454. 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: activities; actors; analysis; approach; aspects; attempt; cerone; code; communities; community; context; degrees; development; eceasst; education; effective; engineering; explicit; externalisation; extrinsic; floss; floss communities; floss project; formal; framework; free; freedom; grading; increase; information; international; intrinsic; knowledge; learning; learning tools; libre; management; methods; model; motivations; new; open; open source; opencert; participation; phases; pilot; postgraduate; proceedings; process; production; project; quality; questions; report; research; role; section; shaikh; social; software; software development; software engineering; source; source software; sowe; students; studies; study; techniques; technologies; testing; tools; undergraduate; university; url; use; volume; way; work
     • versions: original; plain text
455. 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: application; approach; archive; article; automatic; available; behavior; cases; certification; code; community; comprehensive; correct; coverage; cpan; developer; development; different; distribution; documentation; eceasst; expressions; files; frameworks; function; good; guarantee; information; kind; methods; module; network; new; open; opencert; operating; package; perl; possible; programmer; programs; quality; run; section; simple; software; source; specific; suite; syntax; task; testing; tests; user; version; volume; writing
     • versions: original; plain text
456. 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: able; actions; agenda; analysis; application; approach; behavior; cases; chinese; code; code analysis; complexity; coverage; criteria; cyclomatic; design; development; different; distance; eceasst; edges; engineering; event; example; figure; find; finite; formal; graph; graphical; gui; guisurfer; information; inspection; interactive; interface; java; layer; length; login; main; method; metrics; model; number; opencert; order; pagerank; paper; particular; path; possible; postman; problem; proc; programming; properties; quality; quickcheck; related; reverse; section; sequence; set; shortest; software; source; source code; specifications; state; system; techniques; test; testing; tool; user; user interface; values; vertex; vertices; volume; window
     • versions: original; plain text
457. 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: appendix; bool; brucker; chapter; class; collection; constant; definition; different; document; eceasst; eds; environment; equality; example; expressions; extensions; following; formal; formalization; function; future; higher; hol; implies; infinite; interpretation; invariants; invocations; isabelle; issues; language; like; lncs; logical; machine; methods; modeling; normative; object; ocl; ocl semantics; ocl standard; oclapps; oid; omg03a; operation; operator; order; overloading; page; particular; past; present; process; programming; proof; properties; recursion; recursive; referential; rules; section; self; semantics; set; sets; smashed; specification; springer; standard; standardization; state; strict; strong; style; syntax; system; theory; true; type; uml; universe; use; values; variable; volume; wolff
     • versions: original; plain text
458. 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: algorithm; analysis; annotated; annotations; approach; architecture; caller; code; components; computer; contract; control; correct; criterion; data; definition; dependency; doi; eceasst; edges; example; execution; figure; formal; gamapolarslicer; graph; ieee; input; integration; international; layer; max; min; n t; node; open; opencert; pdg; post; precondition; present; procedure; proceedings; process; program; project; related; reuse; safe; section; slice; slicing; society; software; source; specification; statements; static; symbolic; system; t e; tool; trajectory; usa; variables; visualization; volume; way; work; workshop
     • versions: original; plain text
459. 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: algebraic; annotated; annotations; approach; arithmetic; assertions; automatic; base; bits; bitwise; cao; case; code; conditions; constructions; container; cryptographic; deductive; def; development; division; domain; dτe; eceasst; example; expressions; extension; field; finite; following; formal; functions; gf2n; implementation; input; integer; java; jessie; language; logic; logical; mathematical; matrices; matrix; memory; model; modn; modn(x; modulo; new; o f; obligations; ofs; opencert; operations; order; paper; platform; poly; poly f; polynomial; prime; proc; programs; proof; properties; range; return; ring; safety; section; semantics; seq; set; software; specific; tool; translation; type; typedef; use; vcgen; vector; vector[n; verification; volume; way
     • versions: original; plain text
460. 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: = l; analysis; assessment; c t; checks; complementary; compound; data; definition; e =; e c; e m; e n; e t; elements; evaluation; example; figure; framework; information; instances; l e; l l; l s; l t; listing; logicaltool; meta; model; modelling; n c; n s; n t; o l; o n; o o; o u; ocl; p l; pacs; queries; query; r e; r u; repository; s e; s t; s u; section; t r; t t; t u; tool; u e; u l; u n; u p; user
     • versions: original; plain text
461. 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; analyzeclauses; case; clause; computer; constraint; context; correct; correctness; destination; eceasst; exactlyone; example; expression; fig; following; forall; function; general; items; metamodel; metamodeling; model; multiplicity; navigation; new; new context; node; number; ocl; oclapps; operation; optimization; original; original constraint; original context; possible; previous; proc; proof; proposition; queries; relocateconstraint; relocated; relocation; relocationpath; restrictions; results; rule; set; single; source; steps; transformation; true; validation; volume
     • versions: original; plain text
462. 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: adornment; advanced; algorithms; application; approach; attribute; case; check; checking; conditions; constraints; cost; different; edge; elements; example; extend; figure; generic; graph; graph pattern; injectivity; input; instance; lhs; like; matching; metamodel; model; nac; negative; nodes; operation; order; paper; parameters; pattern; pattern matching; plans; possible; predicates; proc; process; representation; search; search plans; source; target; time; tools; transformation; type; variables; viatra2; volume
     • versions: original; plain text
463. 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: 2006; adhesive; adhesive hlr; ahl; algebraic; algebras; categories; category; class; comma; corollary; data; definition; fsp; functions; functor; generalized; graph; high; hlr; hlr categories; hlr category; idea; injective; level; morphisms; nets; petri; phil; post; pre; proof; ptnets; pullbacks; pushouts; schemas; sets; specification; systems; theorem; transformation; transition; tsig(x; type; weak; weak adhesive
     • versions: original; plain text
464. 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: additional; application; architecture; basis; bus; castool; command; common; components; computer; configuration; connection; data; design; development; diagrams; different; domain; drawing; eceasst; eds; elado; elements; energy; engineering; engineering systems; figure; flow; form; framework; functionalities; für; graph; gui; information; layout; level; like; line; main; methods; model; modeling; net; networks; object; order; parts; pins; pleßow; proc; product; purpose; requirements; result; routing; software; special; specific; structure; switchlay; systems; technical; techniques; tools; tree; user; visual; visualization; vmt; volume; votan; way
     • versions: original; plain text
465. 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; admissibility; application; c c; c h; c n; collector; concrete; constraints; edge; elements; equation; equivalence; example; execution; figure; graph; groove; h n; incoming; l c; lhs; list; lts; match; matedge; materialisation; materialise; matnode; multiplicities; multiplicity; n l; n n; n s; n t; neighbourhood; new; node; operation; outgoing; pre; relation; rule; section; set; shape; singnode; space; state; system; t c; table; transformation; values; variables; volume
     • versions: original; plain text
466. 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: active; adaptation; alu99; analysis; approaches; architecture; automata; behavior; clock; clockinstance; communication; constraints; convoy; create; definition; diagrams; eceasst; engineering; example; figure; framework; grabats; graph; graph transformation; hashset; initial; instances; invariant; method; modeling; number; order; paderborn; proc; properties; protocol; railcab; reachability; real; reconfiguration; role; rules; run; section; set; software; specified; springer; state; statechart; stepgraph; story; string; successor; systems; timed; timing; transformation; transition; tts; verification; volume; zone
     • versions: original; plain text
467. 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; analysis; approach; assistance; bpms; business; completion; components; conf; context; conventional; correct; derivation; diagen; diagram; diagram editors; drawing; eceasst; editors; errors; event; event event; event flow; example; fig; figure; flelem; flow; gateway; generation; grabats; grammars; hyperedge; hypergraph; int; kinds; language; layout; minas; model; new; nodes; paper; parser; patches; persuade; possible; problem; process; processing; recognition; recognizer; sequence; set; sketch; sketching; strokes; syntax; techniques; tools; transformation; user; user assistance; visual; volume
     • versions: original; plain text
468. 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: activities; activity; alternative; application; approach; decision; definition; definition language; elements; end; environment; evaluation; example; figure; graph; industrial; instance; language; management; model; modeling; original; p2a; p2a workflow; p2p; package; paper; participant; progres; prototyping; rapid; revised; revisions; specification; start; support; termination; tools; transformations; transitions; translator; upgrade; user; volume; wde; wdt; wfms; workflow; workflow definition; xor
     • versions: original; plain text
469. 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: algorithms; annotation; approach; bpel; business; case; checking; correspondence; corresponding; development; different; domain; editors; elements; engineering; example; execution; figure; filtering; framework; generic; graph; grid; identifier; identifier inputid; identifier process; information; input; inputid; layout; layouting; links; metamodel; model; model elements; nodes; ordering; possible; processid; r2id; rec2id; rec2id recid; receive; records; relations; requirement; s2id; sal; scope2id; scope2id processid; scope2id sfinished; sfinished; software; source; source model; specific; structure; target; target model; tool; tprocess; tprocess s2id; traceability; traceability models; traceability visualization; transformation; treceive r2id; tvariable; tvariable v2id; use; user; v2id; var2id; verification; visualization; volume
     • versions: original; plain text
470. 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: algebraic; approach; associated; attribute; attribute computations; categorical; category; class; computations; data; dpopb; eceasst; edges; engine; evaluation; example; fact; fig; formal; framework; functions; grabats; graph; graph rewriting; graph transformation; haskell; hlr; implementation; inductive; instance; java; lambda; language; lazy; list; lncs; mechanism; model; module; morphism; myinteger; nat; new; nodes; object; order; process; programming; programs; prototype; public; pushout; respect; rewrite; rewriting; rule; section; signature; springer; string; structural; system; terms; theoretical; theory; tool; transformation; type; use; users; value; volume
     • versions: original; plain text
471. 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; animated; animation; applications; approach; aspects; behavior; calculation; car; cars; complex; component; concepts; diameta; different; dynamic; eceasst; editing; elements; environment; events; example; external; fig; figure; following; graph; hypergraph; inner; instance; interactive; internal; intersection; language; media; model; modeling; multimedia; order; paper; properties; rule; sensor; simulation; specification; state; static; structure; system; time; traffic; transformation; transition; user; visual; vls
     • versions: original; plain text
472. 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: adaptive; aktuelle; albrechts; alexander; allen; als; andreas; anforderungen; anwendungen; applications; approach; architekturen; area; auch; auf; beiträge; bereichen; bereits; berlin; bis; braun; business; christian; communications; daniel; darmstadt; das; den; dennis; der; des; detection; die; dienste; dieser; durch; düsseldorf; dynamic; eceasst; eine; elmar; europe; fischer; flexibility; flexible; fragen; für; gemeinsam; generation; germany; hail; hamburg; hand; hellbrück; herausforderungen; herrmann; hoc; hoffmann; horst; internet; itg; jahren; jan; jochen; karlsruhe; kassel; kiel; kivs; klaus; kommunikation; können; kurt; labs; lübeck; manfred; marco; martin; michael; mit; mobile; modeling; mohamed; nec; networks; neue; nicht; noch; norbert; oder; organisation; peter; pfisterer; proc; processes; programmkomittee; research; sebastian; selbstorganisation; self; sensing; sensordaten; services; sich; siemens; sind; stefan; stuttgart; systeme; thomas; torsten; und; universität; universität hamburg; university; über; verteilten; virtualisierung; volume; von; vorwort; weber; werden; wie; wir; wireless; wman; wolfgang; workflows; workshop; wowkivs
     • versions: original; plain text
473. 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: ai+1; approach; associations; computer; condition; constraints; container; containment; containment edges; cycle; cyclic; definition; edges; ehrig; emf; engineering; graph; homomorphism; instance; model; modeling; mof; nodes; object; points; proc; properties; pushout; relation; result; rule; science; set; software; source; span; state; substates; taentzer; transformation; valid; vmt
     • versions: original; plain text
474. 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; application; approach; atstate; bfs; bgt91; changes; checker; child; condition; dfs; edge; example; exploration; figure; grammar; graph; groove; host; host graph; incremental; input; lhs; linear; matches; matching; negative; network; node; order; parent; pattern; plan; positive; possible; production; rete; rete network; rete state; root; rule; search; section; set; size; space; space exploration; special; stack; start; state; state space; strategies; strategy; structure; subgraph; system; time; transformation; use
     • versions: original; plain text
475. 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: bliss; canonical; case; certifier; checking; computing; cores; database; different; eceasst; edges; execution; experiments; figure; fixed; form; framework; function; generation; good; grabats; graph; groove; grows; index; isomorphism; larger; leaf; list; ltsmin; memory; module; m−→; nodes; number; performance; position; reduction; representation; results; rt-0; rules; sequence; set; size; space; start; state; state space; system; time; tool; total; transformation; tree; user; values; vector; volume
     • versions: original; plain text
476. 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: applicable; application; basic; berlin; conditions; control; definition; destination; eceasst; editor; eds; ehrig; emf; emf model; example; figure; framework; grabats; graph; graph transformation; henshin; input; language; lhs; lncs; manager; match; means; meta; mobility; model; model transformation; modeling; morphism; nested; node; object; order; paper; parameter; personal; pmm; possible; proc; rhs; right; route; rule; section; service; springer; structures; subunit; tool; transformation; tree; type; unit; user; view; visual; volume; web
     • versions: original; plain text
477. 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: analysis; application; committee; development; different; editors; germany; grabats; graph; international; model; proceedings; software; techniques; tools; transformation; university; verification; workshop
     • versions: original; plain text
478. 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: action; activities; activity; algorithm; behavior; case; central; code; collaborations; collaborative; components; control; corresponding; ctla; current; decision; diagrams; door; edge; event; executable; execution; fig; flow; incoming; initial; inner; input; int; join; local; machines; mapping; marking; model; modeling; new; node; nok; number; output; panel; partition; pid; places; properties; queue; reachable; refinement; res1; result; return; sdl; send; service; set; signal; specifications; state; state machines; station; stm; system; target; timer; token; transformation; transition; uml; use; var; waiting
     • versions: original; plain text
479. 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: academic; analysis; case; code; collection; community; compliance; context; d e; data; developers; development; different; dresden; e ci; e e; e n; e ta; eceasst; editing; error; evaluate; evaluation; experience; expressions; f e; feature model; features; feedback; fig; future; ide4ocl; important; industrial; knowledge; landscape; language; large; libraries; m e; management; mandatory; mechanism; model; modeling; modularisation; mof; multiple; n s; ocl; p e; package; paper; personal; proc; project; related; requirements; research; respondents; results; reuse; s e; s p; section; semantics; set; software; specification; specify; statement; step; support; survey; syntax; testing; time; tools; uml; usage; use; user; view; volume; workshop
     • versions: original; plain text
480. 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: access; cardinality; class; classes; constraint; diagrams; example; expressions; instantiation; language; logic; meta; modeling; object; ocl; oml; overview; owner; path; pathlp; permission; polymorphic; properties; property; reasoning; rules; subclass; table; testing; type; uml; user
     • versions: original; plain text
481. 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: discussion; eceasst; france; functions; germany; graphical; languages; limitations; modelling; models; notations; ocl; operations; papers; preface; state; textual; tools; transformation; types; uml; university; usa; volume; workshop
     • versions: original; plain text
482. 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: abstract; algorithm; application; approach; block; blockholder; blocksem; case; classes; concrete; correspondence; creation; dataflow; deleting; display; eceasst; elements; example; figure; grammars; graph; inheritance; language; level; meta; model; modelling; nac; new; nodes; normal; object; operational; operator; paramno; patterns; pisrc; pl2sem; place; placesem; proc; pushout; related; rhs; roles; rule; r′rl; s.t; sch94; semantic; set; source; syntactic; syntax; target; tgg; tggs; token; touches; transformation; transition; triple; triple graph; triple patterns; triple rule; visual; vmt; volume; work
     • versions: original; plain text
483. 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: algorithm; analysis; application; approach; asztalos; attribute; automated; case; certain; components; conditions; constraints; contact; control; customization; edges; figure; flow; following; formal; formula; framework; graph; inal; incoming; language; lengyel; main; mcdl; member; methods; mobile; model; model transformations; networks; output; paper; phone; present; propagation; properties; property; refactoring; rewriting; rule; section; similarity; social; system; transformation; verification; vmts
     • versions: original; plain text
484. 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: agreement; algorithms; approach; array; broadcast; case; cfm; coordinator; correct; current; design; error; example; fact; failure; false; fault; fault tolerant; following; formal; formulae; language; mcmt; message; methodology; model; new; number; order; paper; point; possible; problems; processes; properties; property; reliable; round; safety; second; section; send; set; smt; sofm; specification; state; support; systems; table; time; tolerant; tolerant algorithms; tool; trace; transitions; validation; value; variable; verification; volume
     • versions: original; plain text
485. 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; authentication; að→; case; checking; code; definition; eceasst; entropy; equivalence; example; execution; figure; final; flow; hand; iff; information; information release; initial; input; interactive; jco; knowledge; language; lattice; measure; model; observational; observer; p),(u′; pages; paper; password; policies; policy; prior; probability; program; quantitative; relation; release; rules; section; secure; security; semantics; set; space; standard; states; static; static analysis; system; technique; transition; user; valid; values; verification; volume; write; τð→
     • versions: original; plain text
486. 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: access; acm; algorithm; analysis; andersen; approach; arguments; atoms; auxiliary; bddbddb; bes; boolean; c2s; case; checking; compact; computation; constant; context; database; datalog; datalog program; definition; domains; eceasst; efficient; equation; evaluation; example; facts; figure; fixed; following; form; generated; ground; hash; hypotheses; inferred; int’l; java; lists; ls09; memory; model; new; number; operations; order; paper; pbes; pointer; points; predicate; proc; program; prototype; representation; resolution; results; rules; seconds; section; set; sets; solutions; solve; solvers; strategies; strategy; structure; systems; terms; time; true; use; value; variables; volume; vp(x; x2s; xsb
     • versions: original; plain text
487. 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: approach; case; check; clock; controller; count; counter; csp; current; delay; development; digital; end; event; execution; fdr; formal; fsm; gmj; grn; hardware; informal; language; machine; maj; major; methods; min; model; necessary; new; note; operations; phase; process; processes; ready; red; requirements; reset; rmn; road; signal; spec; state; state b; traffic; update; values; variables; vhdl; yel; yellow; ymn
     • versions: original; plain text
488. 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: a(ψ; a(ψϕ; algorithm; approach; automaton; checking; condition; configuration; control; controller; counter; crossing; cycle; definition; eceasst; example; fh98; figure; following; formula; induction; inductive; initial; input; interlockings; ladder; ladder logic; logic; logic formula; model; order; pelican; pla; plb; process; program; propositional; railway; reachable; results; rungs; safety; sat; section; set; slice; slicing; state; step; systems; temporal; tla; tlb; traffic; transitions; true; use; variables; verification; volume; westrace; world
     • versions: original; plain text
489. 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: abstract; action; additional; algorithm; anticipated; choice; concrete; convergent; coordination; deadlock; development; end; event; follows; guard; inside; inv3; invariants; left; lin; location; lout; machine; model; neq; new; non; note; notice; number; obligations; outside; place; probabilistic; proof; proving; qualitative; r eq; rabin; re(l; reasoning; refinement; right; rin; section; set; standard; states; support; termination; tool; tourist; use; variables; variant
     • versions: original; plain text
490. 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: algorithm; application; approach; class; composite; computer; connection; edges; element; engine; figure; graph; isomorphic; language; mappings; matching; matchregion; metamodel; model; modeling; negative; node; number; object; operator; pattern; pattern graph; points; possible; queries; query; query language; region; rules; science; section; set; star; star operator; star region; state; structures; subgraph; syntax; target; tool; transformation; uml; vmt; volume
     • versions: original; plain text
491. 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: committee; definition; eceasst; formalisms; international; kim; languages; model; pattern; preface; proceedings; program; software; technical; university; visual; workshop
     • versions: original; plain text
492. 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: access; adr; architectural; aspects; authentication; chain; components; configuration; cot; design; edges; example; federated; federation; figure; fims; formal; graph; identity; idp; idps; iii; information; instance; ips; level; lhs; management; model; nodes; noip; non; organisations; patterns; pips; preserving; productions; providers; relationships; rhs; rule; security; service; single; sps; style; systems; terminal; terms; trust; type; users; volume; way
     • versions: original; plain text
493. 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: atomic; automorphism; channel; chan{int; checking; client; datatype; definition; detection; diagram; dm08; eceasst; embedding; evalp; example; execp; expr; expressions; fig; following; formal; guard; hand; i(s; int; kripke; language; lemma; list; lite; model; names; pid; process; proctype; promela; proof; properties; prover; pvs; reduction; rules; run; section; semantics; set; space; specification; state; statement; static; structure; symmetry; syntax; system; technique; theorem; type; typing; update; variable; verification; volume; work; |=p
     • versions: original; plain text
494. 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; align; application; approaches; behavior; case; certain; changes; combination; components; constraint; diagram; different; drawing; eceasst; edge; editor; example; figure; graph; instances; instantiation; language; layered; layout; layout algorithms; map; mapping; meta; model; pattern; proc; rule; section; set; solution; specific; syntax; user; variables; visual; way
     • versions: original; plain text
495. 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: ahlr; anc; application; approach; base; bit; case; category; class; condition; control; definition; derivation; dpo; dpo recursive; dpo rule; edges; eept06; elements; example; execution; fig; figure; function; graph; helper; hierarchy; j∈{b; language; left; lhs; match; matches; model; morphism; object; parent; pbr; perm; proc; processing; proposition; prr; pullback; recursion; recursive; recursive rule; role; rule; second; section; set; shows; square; standard; step; structure; table; transformation; type; value; volume; way
     • versions: original; plain text
496. 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: 2006; abstraction; analysis; approach; asg; buffer; case; cell; checking; code; concrete; drop; eceasst; edges; eds; example; execution; exploration; figure; flow; graph; graph transformation; groove; gts; icgt; interpretation; isomorphism; java; language; lncs; matching; methods; model; new; nodes; non; object; possible; problem; proceedings; program; programming; properties; reduction; rensink; representation; rules; section; semantics; set; shape; software; space; springer; state; symposium; system; techniques; tool; transformation; transition; use; val; verification; volume; work
     • versions: original; plain text
497. 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: actions; addr; algorithm; apis; application; checking; communication; core; data; dependency; different; distributed; dpor; dynamic; eceasst; exploration; figure; formal; framework; independent; local; mailbox; memory; model; mpi; network; operations; order; partial; pid; possible; primitives; proc; process; processes; program; proof; rdv; receive; recv; reduction; rendez; request; section; send; server; set; simgrid; simple; space; specification; src; state; status; systems; test; tla+; traces; transitions; verification; volume; vous; wait; ∧tj
     • versions: original; plain text
498. 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: act1; application; approach; automated; business; buyer; cancel; case; checking; choreographies; choreography; communication; components; consistency; current; deprecated; eceasst; end; event; example; figure; gcm; global; implementation; implementation models; ims; invariants; item; local; lpms; machines; mcm; message; modeling; models; need; node; order; paper; partner; prob; proceedings; properties; region; relation; request; root; s10; sap; section; send; service; set; soa; specific; state; transitions; translation; type; use; verification; volume; work
     • versions: original; plain text
499. 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: abstract; analysis; antworld; application; approach; asm; block; bpel2sal; calls; case; checking; code; complex; conditions; constraints; contracts; control; csp; different; doctoral; eceasst; elements; errors; example; execution; figure; firing; forall; framework; graph; graph transformation; graphical; icgt; information; input; language; m(typeo; metamodel; model; model transformation; neg; nets; notation; number; order; parameters; paths; pattern; petrinet’; place; possible; problems; proc; programming; programs; results; rule; safety; satisfaction; section; seq; set; simulator; single; springer; statement; static; static type; structure; symposium; system; textual; time; token; transformation; transformation programs; transition; type; type checking; type constraints; typing; use; uses; variable; viatra2; volume; ’place’(place
     • versions: original; plain text
500. 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: approach; automata; automaton; categorical; category; channels; colimit; composition; connectors; consistency; coordination; data; definition; dis(c; dis(paop; distributed; dynamic; ends; example; figure; flattening; following; functor; graph; local; model; morphism; names; nets; network; nodes; object; pa2; petri; port; port automata; primitives; proof; pullback; pushout; reconfigurations; reo; rule; section; semantics; set; source; state; structural; system; transformation; transition
     • versions: original; plain text
501. 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: access; actions; actors; allocation; approach; assignment; average; balancing; business; case; control; corresponding; deadline; dispensing; distribution; doctoral; domain; dynamic; eceasst; escalation; feature; figure; flexible; flow; graph; graph transformation; handling; hierarchy; human; icgt; instance; label; language; level; load; management; managerial; mean; min; modelling; models; number; order; particular; performance; pharmacist; pharmacy; policies; policy; prescription; priority; probe; process; processes; protocols; r1.3; requirements; resource; results; role; rules; scheduling; section; simulation; specific; state; stochastic; study; symposium; system; table; task; technician; time; transformation; uml; use; version; volume; workers; workflow
     • versions: original; plain text
502. 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: 2006; arcs; calculus; chain; concurrent; consumable; definition; dgg; dggs; dpo; dynamic; dynamic graph; eceasst; edges; encoding; event; example; figure; following; fresh; gin; gpi; grammars; graph; graph grammars; graph t; gtp; hand; inclusion; initial; items; join; k〈v; left; mcc; messages; morphism; mpc; names; nets; new; node; nta; original; pdgg; persistent; petri; pggs; pngt; process; processes; production; pushout; read; read〈k〉|val〈v; refined; removable; right; section; semantics; set; static; structure; t(g; type; type graph; val〈c; version; volume
     • versions: original; plain text
503. 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: adhesive; application; application conditions; approach; behavior; bisimulation; category; conditions; context; cospan; definition; diagram; dpo; equivalent; example; finite; following; gacs; graph; holds; h′′; icgt; induction; model; monogac; monos; morphism; object; pushout; reactive; rewriting; root; rule; satisfies; set; systems; theory; user; volume
     • versions: original; plain text
504. 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: arrow; atomic; automaton; automaton functors; bdd; bdds; bits; category; check; checking; cospan; different; discrete; doctoral; edge; efficient; encoding; example; figure; finite; following; formula; function; functor; graph; graph languages; hand; icgt; implementation; interface; invariant; languages; myhill; nerode; new; nodes; notion; number; operations; order; outer; present; proceedings; quasi; recognizability; recognizable; recognizable graph; regular; relation; rule; sec; second; section; set; size; state; subgraph; transformation; transition; verification; volume
     • versions: original; plain text
505. 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: approach; class; computer; determined; diagram; eceasst; edges; example; expression; figure; general; graph; hide; identity; length; links; means; model; object; ocl; original; particular; path; properties; query; relationship; result; scenario; selection; snapshots; techniques; textual; transformation; uml; underlying; use; visible; visual; volume; work
     • versions: original; plain text
506. 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: activities; alexander; available; base; collaborative; collaborative interactive; common; communication; community; creation; cross; culture; data; definition; description; design; design pattern; designers; different; documents; domain; enable; end; hci; interactive; interactive systems; keywords; knowledge; language; new; pattern; pattern language; platform; problem; reasoning; related; relationships; set; sharing; solution; spaces; support; systems; team; tools; understanding; users; virtual; way; wisdom; work
     • versions: original; plain text
507. 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: ackermann; add; approach; arrow; binary; case; class; collection; common; components; condition; constraint; constraint patterns; context; description; development; diagrammatic; diagrams; disjoint; eceasst; element; event; example; figure; formal; framework; information; language; library; modelling; notations; number; ocl; operation; parameters; partition; patterns; post; postcondition; precondition; proc; set; sets; software; specification; specification patterns; subset; title; type; use; vffp; visual; volume; way
     • versions: original; plain text
508. 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: anti; approach; atomic; aware; computer; constraint; definition; design; development; diagrammatic; different; dpf; enforcement; engineering; example; facade; fig; following; formal; framework; graph; international; level; match; mde; metamodel; model; modelling; morphism; paper; pattern; predicate; rules; scheduler; signature; software; specification; transformation; triple; universal; vffp; volume; work
     • versions: original; plain text
509. 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: aco; analysis; ant; approach; approximated; augur; behaviour; class; colony; conflict; dependencies; design; doctoral; eceasst; edges; extract; figure; function; graph; hypergraph; icgt; initial; java; local; method; model; new; nodes; number; operations; optimal; optimisation; order; partial; petri; pheromone; problem; proc; refactoring; representation; result; rules; search; sequence; set; solutions; space; states; steps; structure; superclass; symposium; systems; transformation; transitions; unfolding; use; volume
     • versions: original; plain text
510. 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: active; basic; canonical; cases; constraints; contiguous; cover; curves; decomposition; definition; diagrams; disjoint; eceasst; elements; example; figure; function; granules; gtvmt; habitat; instance; interpretation; interval; language; model; modeling; notion; object; overlapping; present; proc; projection; reader; related; s.t; satisfaction; satisfies; sds; semantics; sequence; set; sets; shaded; specification; spider; spider diagrams; state; system; temporal; time; type; unitary; use; valid; valuation; variables; visual; volume; w.r.t; zone
     • versions: original; plain text
511. 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: baldan; categories; computer; editors; ehrig; graph; high; level; lncs; nets; padberg; pages; petri; petri nets; proceedings; rewriting; rozenberg; science; springer; systems; transformation; volume
     • versions: original; plain text
512. 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: arrows; atomic; automaton; automaton functor; bounded; brec; category; class; cospans; decidability; decidable; decomposition; definition; discrete; edge; expressiveness; finite; functor; graph; graph languages; initial; interface; l(a; languages; lemma; logic; nodes; order; primitive; primitive recursive; problem; proc; proof; prrec; pumping; recognizable; recognizable graph; recursive; representable; set; size; state; theorem; word
     • versions: original; plain text
513. 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: + +; behaviour; business; case; condition; consistent; constraint; corresponding; eceasst; ehrig; extended; fig; forward; functional; grammars; graph; ĝ0; ĝn; injective; integrated; language; main; match; model; model transformation; morphism; pc(as; premise; private; proc; propagated; propagation; public; rule; satisfies; security; sequence; source; source constraint; strong; study; target; thm; transformation; triple; triple graph; tr∗f=⇒; tr∗f=⇒bc; validity; vls
     • versions: original; plain text
514. 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: abstraction; addcl; adds; algorithm; analysis; application; applied; approach; branch; calculation; case; cloud; configuration; corresponding; criteria; current; cut; definition; dependency; dependency graph; disabled; eceasst; edges; enabled; enclosing; evaluation; example; execution; exploration; figure; graph; graph transformation; gts; logical; model; navigation; net; new; nodes; number; numerical; occurrence; operator; order; ordering; overview; paper; path; petri; pngt; points; problem; proc; result; return; rule; section; selection; set; solution; space; starting; state; step; systems; trajectory; trajectory exploration; transformation; transition; true; type; use; vector; volume
     • versions: original; plain text
515. 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: adaptation; applications; aware; campus; context; development; devices; environments; france; gabriel; germany; hermosillo; inria; lille; mechanisms; norway; pervasive; preface; projects; services; ubiquitous; university; volume; workshop
     • versions: original; plain text
516. 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: abstraction; acm; ambienttalk; applications; asynchronous; certain; changes; chat; collections; communication; contents; data; def; developers; devices; discovered; drawing; elements; environment; event; group; implementation; intensional; isolates; means; mobile; network; new; objects; peer; problem; programmer; programming; publish; reference; remote; section; session; sets; shape; state; structure; subscribe; synchronizing; syncisolate; systems; time; type; user; volatile; volatile collections; volatile sets; volume; wescribble
     • versions: original; plain text
517. 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; aware; aware applications; awareness; behaviour; calls; campus; challenges; communication; computer; computing; conference; context; context awareness; email; facebook; filtering; hardware; ieee; information; killer; location; messages; mobile; modern; number; opportunities; paper; people; pervasive; phone; position; sensors; smart; smartphone; software; status; system; time; ubiquitous; user; volume; way; work
     • versions: original; plain text
518. 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: austria; courses; education; educators; edusymp; engineering; martina; modeling; models; necessary; novel; peter; preface; research; software; students; symposium; technologies; technology; tools; university; volume
     • versions: original; plain text
519. 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; application; approach; aukoton; automation; category; challenges; coding; concepts; conference; context; control; current; data; design; development; empirical; engineering; engineers; example; factory; gnr; guidance; ieee; industrial; industrial adoption; information; international; issues; knowledge; learning; material; mde; methods; model; modeling; new; paper; participants; phase; pim; platform; practice; problem; process; process control; professional; qualitative; related; requirements; research; role; seci; software; specific; statement; study; support; table; technology; theory; tool; transfer; uml; university; user; user guidance; work
     • versions: original; plain text
520. 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: application; arrows; categories; category; computation; example; factorisation; fig; figure; fork; fork table; graph; h(cp; objects; philosopher; philosopher fork; productions; reversible; set; state; system; table; thinking; thinking philosopher; transactions; transformation; vertices; volume
     • versions: original; plain text
521. 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: abstraction; analysis; approach; appropriate; attributes; case; categories; class; classes; concept; concept map; course; design; diagrams; domain; dynamic; education; help; map; mapping; maps; messages; missing; modelling; models; module; objects; ooad; participants; problem; proc; relationships; responsibilities; results; sc08; section; sequence; sequence diagrams; software; specialisation; static; students; study; system; teaching; techniques; uml; use
     • versions: original; plain text
522. 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: abstraction; aspects; behaviour; choice; code; compiler; computer; constraints; course; definition; different; eclipse; editor; emf; example; focus; generation; grammars; graphical; handling; language; level; mdd; meta; model; modelling; module; object; operational; platform; presentation; runtime; semantics; simple; specification; structure; students; syntax; teaching; technologies; textual; theory; tools; transformation; use; volume
     • versions: original; plain text
523. 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: basic; boolean; collection; composite; constraints; context; course; dresden; eceasst; editor; edusymp; elements; engineering; examples; expressions; false; false true; important; independent; instances; integer; invalid false; invalid invalid; invalid null; iterator; java; language; learning; library; logic; logical; model; modeling; object; ocl; oclany; oclinvalid; oclvoid; omg10; operations; paper; proc; programming; queries; resources; results; section; self; semantics; set; software; special; specification; standard; string; students; table; teaching; tools; true; true invalid; tuple; type; uml; values; version; volume
     • versions: original; plain text
524. 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: class; descriptions; diagram; e l; e n; elements; exercises; l l; language; learning; m e; m2n; model; modeling; n c; n o; n t; natural; o l; p r; paper; possible; s e; s s; sample; solution; specification; students; t e; t o; t s; textual; tool; u e
     • versions: original; plain text
525. 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: abstract; adaptation; adaptive; als; application; behavior; conceptual; control; description; developer; different; engine; evolvable; figure; flexibility; flexible; framework; knowledge; loop; middleware; model; monitoring; new; paper; process; properties; quality; related; requirements; section; self; set; software; sub; systems; tasks; time; utility; works
     • versions: original; plain text
526. 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: assessments; background; blackboard; camera; course; diagram; document; document camera; exercises; experience; fair; following; good; knowledge; lab; large; learning; lecture; media; modeling; new; object; paper; poor; practical; projector; questions; recordings; report; results; section; self; sessions; slides; small; state; students; support; survey; teacher; teaching; technology; term; time; traditional; uml; undecided; university; use; videos; votes
     • versions: original; plain text
527. 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: academic; activities; activity; allocation; coach; communication; course; customer; data; description; development; electronic; engineering; forum; group; iteration; management; measures; meeting; members; messages; min; personal; process; project; respect; role; role allocation; rtm; scheme; semester; software; students; task; team; teammates; time; web; week; work
     • versions: original; plain text
528. 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: approach; attribute; authors; bad; bindings; circular; class; classes; code; common; composition; context; customised; design; different; domain; dsvl; duplicate; eceasst; element; example; extract; family; figure; generic; graph; instance; language; level; lhs; matching; meta; model; model refactoring; modelclass; multiple; new; number; participants; pattern; proc; pull; quality; refactoring; relationship; remove; reuse; rhs; role; service; similar; smell; solutions; source; specifications; super; support; table; target; technique; tool; transformation; uml; users; vffp; visual; volume
     • versions: original; plain text
529. 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: abstract; action; approach; behavioural; behavioural pattern; bindings; code; common; composition; concrete; constraints; context; design; designer; different; dimensions; domain; dsvl; dsvl meta; eceasst; elements; end; execution; factory; figure; filter; generic; implementation; instance; instantiation; language; layer; level; links; maramadsl; meta; metaphor; mhg07; model; modelling; multiple; notations; participant; pattern; pattern specification; proc; query; relationship; reuse; set; shapes; simple; software; specification; specified; structural; support; symbol; tools; types; uml; users; vffp; view; visual; volume; work
     • versions: original; plain text
530. 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: algorithm; application; approach; blocks; book; checkedge; code; cost; customer; distributed; edge; elements; example; figure; generation; graph; graph transformation; haswritten; host; likes; local; modeling; node; offset; operations; pattern; publisher; query; reference; remote; root; runtime; schema; search; search tree; section; shop; specification; subtrees; systems; transformation; tree; unbound; volume; wishes
     • versions: original; plain text
531. 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: addition; algebraic; analysis; application; approach; boolean; coherent; concatenation; condition; dangling; digraph; dpo; edges; equation; example; external; figure; grammars; graph; host; incidence; initial; internal; k=1; like; linear; matrices; matrix; minimal; necessary; nets; nodes; notation; note; petri; possible; proc; production; proposition; reachability; rule; section; sequence; state; techniques; tensor; transformation; transition; type; vector; vl06b; work
     • versions: original; plain text
532. 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; analysis; application; approach; case; certain; completeregistration; computer; conference; configuration; considered; constraints; development; diagrams; different; domain; domain expert; eceasst; elements; expert; figure; formal; language; methodology; modeling; models; mpm; paper; patterns; payment; ppsl; process; properties; property; registration; semantic domain; semantics; set; software; specific; specific languages; specific models; specification; target; transformations; translational; uml; verification; volume; workflow
     • versions: original; plain text
533. 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: abstract; analysis; application; approach; assignment; attribute; case; cder; complete; constraints; control; declarative; definition; description; eceasst; edge; elements; flow; following; formalism; formulae; function; graph; inheritance; instance; interface; main; mcdl; member; metamodel; methods; mobile; model; model transformations; morphism; network; nodes; offline; output; paper; pattern; phonebookmark; possible; present; properties; property; rewriting; rom; rule; section; set; similarity; social; transformation; true; type; value; verification; vmts; weakly; work
     • versions: original; plain text
534. 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: action; amp; animation; approach; arbitrary; aspect; attribute; case; chart; composite; control; design; domain; eceasst; edges; elements; engine; environment; event; execution; figure; framework; graph; guard; host; interactive; interactive model; language; match; metamodel; model; model elements; model patterns; model transformation; modeling; mpm; new; node; operational; operational model; outgoing; patterns; portviews; refactoring; rewriting; rule; section; selected; selection; software; source; specific; state; static; static model; support; system; target; transformation; transformation engine; transition; user; visual; visualization; vmts; volume
     • versions: original; plain text
535. 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; definition; diagrams; distance; eceasst; end; execution; figure; finish; form; graph; languages; length; logic; logical; modelling; mpm; names; notation; order; paper; parameter; possible; predicate; programming; programs; prolog; result; road; role; route; second; specification; start; structure; syntax; textual; unfolding; values; variable; visual; visual notation; volume
     • versions: original; plain text
536. 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: adaptation; approach; breaking; changes; connection; control; corresponding; default; difference; dst; eceasst; evolution; evolver; example; execution; figure; generic; input; instance; junction; language; leftlink; length; link; merged; metaclass; metamodel; metaproperty; migration; migration transformation; mmi−1,i; mml; model; modeling; mpm; new; non; obligatory; operations; order; paper; place; place transformation; possible; railroad; rightlink; specific; springer; src; step; structured; table; trainplace; transformation; user; volume; work
     • versions: original; plain text
537. 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: abstraction; active; algebraic; analysis; approach; backup; best; candidate; cardinality; constraints; corresponding; cost; current; edges; example; exploration; fig; figure; firing; gpartial; graph; graph transformation; graph transition; gts; ilp; instance; integer; linear; marking; model; net; nets; number; numerical; occurrence; optimal; optimization; path; petri; places; problem; proc; programming; reachability; rule; search; section; sequence; service; set; solution; space; standby; state; state space; system; t net; techniques; trajectory; transformation; transition; traversal; type; vector; volume
     • versions: original; plain text
538. 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: application; approach; atl; attribute; case; chain; class; composition; condition; criteria; definition; domain; edges; ejb; ejbarchive2; elements; elimination; engineering; evolution; example; following; graph; interface; international; lhs; links; meta; metamodel; model; nac; new; package; paper; possible; procedure; rhs; rules; r′2; section; sessionbean; springer; target; trace; traceability; transformation; uml; value; version; volume
     • versions: original; plain text
539. 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: abstract; arrows; categorical; category; complement; composition; condition; conflict; definition; free; function; functorial; functoriality; garbage; graph; hand; heterogeneous; l(k; matches; morphisms; nodes; partial; property; proposition; pullback; pushout; respect; rewriting; rule; set; source; span; system; transformation; � �
     • versions: original; plain text
540. 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: alternatives; analysis; analysis models; approach; aspect; common; component; composition; constructs; cylinder; definition; design; eceasst; engineering; engineeringmodel; example; executable; experiments; false; figure; formal; framework; gams; hydraulic; inout; interfaces; isatomic; knowledge; language; level; library; log; mass; mbse; model; modeling; mpm; particular; ports; problem; process; profile; properties; relationships; requirements; section; set; simulations; single; specific; splitter; stereotype; sysml; system; systems engineering; test; testable; time; tool; transformations; uml; volume; work
     • versions: original; plain text
541. 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; approach; assl; checks; class; command; decision; diagram; eceasst; end; example; execution; extensions; figure; imperative; instantiation; iteration; language; metamodel; modeling; models; object; ocl; openter; operation; plugin; postconditions; procedure; process; running; runtime; section; semantics; sequence; snapshot; start; state; tool; uml; use; user; volume; waiting; workflow
     • versions: original; plain text
542. 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: = =; additional; application; approach; categories; category; condition; definition; derivation; dpo; eceasst; edge; entry; example; fig; function; gluing; graph; groove; hand; labels; lemma; list; morphisms; multigraphs; nodes; object; paper; proc; production; pushout; results; rule; section; set; sg(lmg; sgmg(lmg; simple; simple graphs; sim−1; spo; systems; tool; total; transformations; use; vmt; volume; work
     • versions: original; plain text
543. 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: abstract; add; additional; algebraic; application; approach; automatic; blank; configurations; conn; connection; dmz; domain; dsmls; example; facts; figure; firewall; framework; fwcl; graph; heterogeneous; http; if1; if2; integration; internet; itml; landscape; language; mapping; meta; modelling; models; mof; mpm; nacs; nodes; paper; port; proc; rdf; rule; section; semantic; specific; ssh; syntax; textual; transformation; use; wan; web
     • versions: original; plain text
544. 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: account; attributes; balance; bank; behavior; buyticket; cinema; class; client; conditions; configuration; constraints; context; diagrams; different; dynamic; eceasst; evaluator; example; execution; expressions; formal; implementation; inv; invariants; invocation; language; logic; maude; message; metareduce(m; method; modcl; modeling; models; module; object; ocl; ocl constraints; oclexp; ocltype; oid; operator; post; proc; representation; result; return; rewriting; rule; seats; section; self; session; sort; specification; stack; starttime; state; strategy; syntax; system; term; ticket; tools; types; uml; use; validate; validation; volume
     • versions: original; plain text
545. 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; ahoipti; ahoipti nets; algebraic; aob; applyrule; approach; asg; behavior; consumer; data; definition; domain; eceasst; eclipse; editor; ehrig; environment; figure; fire; firing; formal; general; graph; high; individual; jectnet; kind; level; level nets; marking; model; modeling; net transformation; nets; object; object nets; operation; petri; petri nets; place; pngt; post; pre; proc; producer; reconfigurable; reconfigurable object; reconfiguration; rons; rule; section; selection; set; signature; special; split; standard; system; system net; tokens; tool; transformation; transition; tta; type; visual; volume; way; σpt
     • versions: original; plain text
546. 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: -adhesive; -functor; agraphspntg; applicability; approach; as2; c1,m1; c2,m2; categories; category; correspondence; corresponding; creation; definition; different; direct; e g; eceasst; eept06; ehrig; figure; formal; g g; graph; hlr; independence; individual; initial; injective; lemma; level; morphisms; nat; net; nets; ni2; parallel; petri; place; pngt; pos; post; pre; proc; proof; properties; ptinet; pushouts; restricted; sequential; systems; theorem; tokens; transformations; translation; type; volume
     • versions: original; plain text
547. 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: -adhesive; = =; application; approach; basis; behavior; categories; category; class; coll(ni; collective; condition; construction; data; definition; diagram; dpo; eceasst; eept06; ehrig; equivalence; example; figure; firing; formalization; function; gluing; graph; high; hlr; independence; individual; individual tokens; injective; level; local; m(i; main; marking; match; morphisms; nets; new; ni0; ni1; ni2; parallel; petri; place; pngt; post; pre; proc; proof; pti; pti nets; ptinets; pushout; results; rule; selection; send2; set; sets; step; switch1; systems; s−→; t nets; t systems; theorem; tokens; transformation; transition; volume; weak; ρ(t
     • versions: original; plain text
548. 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; algebraic; application; approach; case; case study; data; designer; different; eceasst; emergency; example; figure; firefighter; gas; gas reading; graph; hand; high; initial; insertion; leak; left; level net; member; modelling; morphisms; net; net patterns; net transformation; nets; new; operation; order; places; pngt; possible; postprocessing; preprocessing; problems; reading; rule; scenarios; second; section; set; specification; structure; study; systems; task; task repair; team; team member; transformation; transformation rule; transition; type; use; volume; workflow
     • versions: original; plain text
549. 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; ahl net; ahlnetsys; aho; ahonahl; ahonpt; algebraic; analysis; apt; area; category; class; company; cond; consistent; corresponding; data; definition; emergency; figure; firing; fskel; functor; functorial; gas; high; higher; hoc; level; level net; low; marking; mhl; mobile; morphisms; net; net class; net systems; networks; object; order; order net; petri; places; pngt; post; pre; proc; ptsys; pushout; result; rules; section; set; sig; signature; skeleton; strict; t net; tok; tokens; transformation; transition; type; volume; workflows
     • versions: original; plain text
550. 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: berlin; claudia; eceasst; germany; graph; models; nets; petri; pngt; systems; transformation; volume
     • versions: original; plain text
551. 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: application; behaviours; design; development; emulation; emulator; example; figure; gui; interaction; interface; map; mobile; model; parser; pim; presentation; presentation model; process; requirements; system; tool; user; widgets; work
     • versions: original; plain text
552. 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: active; agents; approach; auxiliary; bind; cat; cons; correctness; definition; effects; example; following; functions; general; generic; impure; interaction; interaction nets; law; laws; list; log; map; model; monad; monadic; nested; nets; nil; order; pair; paper; patterns; port; programming; proposition; reduction; result; ret; return; rules; second; sequential; set; symposium; system; type; use; way; writer
     • versions: original; plain text
553. 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; conference; contributions; corradini; doctoral; germany; graph; icgt; international; italy; preface; reiko; series; students; symposium; systems; transformation; variety; volume
     • versions: original; plain text
554. 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: agg; analysis; application; condition; conflict; conflicting; confluence; consistent; containment; containst; creation; critical; cycle; definition; doctoral; eceasst; edges; emf; emf graph; emf transformation; example; figure; firing; graph; icgt; instances; local; model; node; notion; opposite; pairs; parallel; petri; petrinet; place; possible; properties; relation; removepre; rule; set; situation; symposium; token; transformation; transition; type; use; valid; volume
     • versions: original; plain text
555. 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: -calculus; application; approach; assignment; attributes; case; checker; checking; conf; context; counterpart; elements; evaluation; example; f(1; figure; fix; formula; graph; gtvmt; individual; initial; international; lncs; logic; m(1; male; marriage; married; maude; membership; message; model; morphism; object; order; point; properties; proposal; quantified; ranking; relation; rewrite; rewriting; rule; second; semantics; set; signature; single; sort; state; status; systems; temporal; tool; transformation; use; variables; woman; worlds; ω[γ;∆; ∆]kρ
     • versions: original; plain text
556. 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: action; activities; activity; analysis; attribute; behaviour; candidate; case; checking; consistency; design; device; display; domain; eceasst; engineering; example; figure; fmis; formal; fquit; function; holding; human; important; infusing; infusion; infusion pump; infusionrate; inner; interactive; interface; ival1; ivy; keys; layer; line; mal; means; medical; menu; middle; model; modelling; number; options; outer; paper; particular; paths; possible; process; procurement; properties; property; pump; range; rate; shows; specification; springer; state; step; systematic; systems; task; techniques; use; value; volume; vtbi
     • versions: original; plain text
557. 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: abc; application; approach; appropriate; autocompletion; behavior; blue; calculators; case; changes; character; clear; color; consistent; correct; c×cui; d �; data; data entry; del �; dependable; design; devices; different; digit; display; divergence; eceasst; entry; error; example; exponent; features; fmis; formal; fsm; general; green; input; interactive; interface; key �; keying; keys; language; left; length; like; line; n �; need; notation; number; o �; ok �; paper; possible; predictability; press; problems; proc; prompts; properties; regex; set; simple; specification; state; string; syntax; systems; time; traffic; uis; user; value; volume; w3c; ways; work; � y; � �
     • versions: original; plain text
558. 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; automata; bag; bag decomposition; category; center; clique; cospan; cospan decompositions; costar; decomposition; definition; diagram; edges; example; figure; finite; graph; inner; interface; languages; like; morphisms; nodes; notion; order; outer; paper; path; pathwidth; proc; second; section; set; size; star; star decomposition; theory; tree; tree decomposition; treewidth; volume
     • versions: original; plain text
559. 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: abstract; actions; approach; case; choices; class; consistent; constraints; design; diagram; different; domain; event; function; graph; heterogeneous; identifier; inconsistency; lncs; location; logic; maude; means; metaclass; metamodel; model; mof; multi; multimodel; number; object; oid; operation; operator; plan; property; ras; relation; repair; repairchoices; representation; resolution; search; sequence; set; sort; specification; state; statemachine; study; synchronization; syntax; theory; transition; uml; use; view
     • versions: original; plain text
560. 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: 2010; = =; active; amalgamated; amalgamation; application; begin; behaved; bundle; conditions; corresponding; current; definition; direct; disjoint; eceasst; edge; element; end; enterregions; error; event; example; false; figure; finite; formal; gcm; general; graph; graph transformation; initialization; interaction; interpreter; interpreter semantics; isfinal; isinitial; kernel; leaveregions; leavestate1; match; matches; matchings; maximal; model; morphisms; multi; new; node; note; number; operational; orthogonal; parallel; pointer; possible; prepare; prod; produce; queue; repair; rule; scheme; section; semantics; set; springer; statecharts; statemachine; states; step; sub; substates; terminates; termination; transformation; transition; transitionstep; trigger; true; type; uml; use; valid; visual; volume; wait; weakly
     • versions: original; plain text
561. 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: 2010; = =; = ⇒; acc; acr; application; application conditions; approach; backward; case; completeness; component; conditions; connection; consistent; correctness; corresponding; decomposition; definition; eceasst; ehrig; error; event; example; exit; false; figure; final; forward; g =; g s; gcm; grammars; graph; graph grammars; graph transformation; guard; information; initial; isfinal; language; machine; match; model; model transformation; morphism; nested; net; nets; new; open; p s; p t; paper; pe s; petri; place; proceedings; prod; pushout; r s; region; results; rules; s s; section; sequence; source; start; state; statechart; string; superstate; t s; t t; t1 s; target; theorem; token; tr1; tr1f; transformation; transformation sequence; transition; triple; triple graph; triple rules; triple transformation; trs; true; tr∗f; type; use; volume; wait; ∃(a; ∅ =
     • versions: original; plain text
562. 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: a⊕d̃; bell; case; category; classes; closure; cnt; complements; construction; definition; different; eceasst; edges; elements; equivalence; following; formula; g(x; gcm; general; graph; hypergraphs; ind; injective; k(x; m(x; m(y; merged; morphisms; nodes; number; partition; possibilities; possible; preimage; proposition; pushout; pushout complements; range; results; second; set; unique; volume; xλx; zλx; ≡p(≡
     • versions: original; plain text
563. 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: bijection; case; condition; constructor; coq; definition; easy; eceasst; elements; equivalence; example; fcti; figure; finite; finite_graph; following; function; gcm; graph; guardedness; ilist; ilist t; ilist2list; ilist_rel; ilistmult; imap; inductive; infinite; label; lemma; length; lgti; list2fint; lists; makelistfin; map; mk_graph; multiplicity; nat; nodes; problem; proof; property; recursive; relation; remark; representation; set; solution; sons; sup; t l; type; use; volume; way; work
     • versions: original; plain text
564. 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; algebraic; application; approach; aspects; attributes; city; code; comparison; conditions; constraints; control; diagrams; different; eceasst; edges; editor; elements; embedding; employee; environment; example; execution; expressions; figure; fujaba; generated; grammar; graph; graph transformation; inheritance; injective; java; language; lhs; load; loadurgentpallet; matching; method; model; modeling; multiple; negative; nodes; non; onroute; ordered; pallet; paths; patterns; proc; progres; properties; rules; runtime; schema; set; simple; specification; story; structures; support; systems; taentzer; transformation; transformation rules; truck; types; uml; use; variables; visual; vmt; volume
     • versions: original; plain text
565. 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; adaptive star; aig; arbitrary; asg; association; border; class; class diagram; classes; cloning; composite; concrete; conditions; connected; construction; derivation; dhjm10; diagram; eceasst; edges; end; ends; example; finite; following; gcm; grammars; graph; incoming; instance; labels; language; multiple; multiplicity; new; node; nonterminal; note; number; object; outgoing; point; regular; rules; r̂c; section; set; singular; source; star; sub; subgraph; target; terminal; uml; unique; use; volume
     • versions: original; plain text
566. 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: application; approach; atomic; attribute; auth; case; common; conclusion; conditions; consistent; constraint; construction; doc; document; eceasst; edge; elements; expansion; figure; final; form; gcm; graph; incremental; left; level; lv1; lv2; manager; match; mgr; mgr lv2; modification; morphisms; nacs; negative; new; node; occurrence; original; p(c; paper; particular; parts; policies; policy; positive; premise; present; preserving; problem; procedure; pushout; reduction; right; rules; s.t; section; secured; set; sets; structural; transformations; type; update; volume; y u
     • versions: original; plain text
567. 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; editors; gcm; graph; international; issue; models; systems
     • versions: original; plain text
568. 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; activity_id; allocator; ambulance; analysis; case; checking; cognition; complex; computer; control; data; definitions; dependency; description; design; details; developed; diagram; dicot; different; dispatch; eceasst; engine; experts; flow; flow model; fmis; following; formal; function; high; human; incident; informal; information; information flow; instance; interactive; items; language; level; location; london; manual; model; modelling; new; number; order; proc; proqa; pvs; real; relations; science; section; service; simulation; specification; state; status; studies; study; system; system_state; taker; task; theories; theory; type; use; useful; user; verification; volume; work
     • versions: original; plain text
569. 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: 10cursorposition; action; alaris; bbraun_real; big; braun; button; computer; current; cursor; decrease; definition; design; device; digit; display; display(st; displayed; eceasst; effect; endif; entry; errors; event; fmis; formal; formalising; function; functionality; human; increase; information; infusion; interactive; interactive number; interface; left; max; memory; minimum; model; new_val; number; number entry; paper; position; possible; predictability; predictable; prediction; press; property; pumps; real; sal; small; specification; state; system; tens; trim; type; unit; user; value; volume
     • versions: original; plain text
570. 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: abstract; action; actual; analysis; assumptions; behaviours; belief; checking; cognitive; constraint; delta; entry; example; formal; increase; infusion; interactive; mismatch; model; number; plausible; properties; pump; rate; system; time; timing; user; value; verification; volume
     • versions: original; plain text
571. 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; activate; ament; ament et; analysis; approach; behaviour; causes; checking; cognitive; completion; concepts; conditions; cueing; data; detailed; device; device errors; different; distinction; doughnut; eceasst; empirical; errors; et al; example; experiment; figure; fmis; formal; generic; gum; high; higher; human; initialisation; initialisation errors; initialisation step; instantiation; intrinsic; level; load; low; main; memory; model; modelling; observed; paper; particular; plausible; post; previous; procedural; rates; results; salience; section; sensory; sequence; set; specific; step; study; system; task; task errors; terms; user; user model; volume; work
     • versions: original; plain text
572. 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; amber; amberlight; analysis; assessment; atm; attention; automatic; automaticity; behaviour; card; case; cash; closure; cognitive; composition; conditions; condj; conscious; contention; csp; driver; driving; eceasst; environment; errors; event; example; expectation; expecti; experience; fmis; follows; formal; framework; general; goalaction; gothrough; hazard; human; hurry; interaction; leave; light; model; novelty; parallel; park; pine; process; processes; ree; response; rules; safe; sas; scheduling; section; set; start; stop; study; synchronisation; systems; task; taskaction; traffic; user; volume; xpectcheck
     • versions: original; plain text
573. 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: algorithm; applications; automata; automaton; class; edge; equivalence; figure; final; finite; graph; implementation; input; int; lemma; loop; macro; mark; merge; minimization; nodes; non; number; phase; program; propagate; redirect; remove; representative; rule; schema; schemata; states; tag; transitions
     • versions: original; plain text
574. 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: a320; abstract; actual_mode; aircraft; airplane; airspeed; altitude; altvals; analysis; angle; approach; automation; behavior; boolean; bounded; checker; checking; clb; climb; commands; constraints; control; current; descend; dynamics; example; false; fcu; fcu_mode; flaps; flight; formal; fpa; functions; guard; human; hybrid; infinite; interactive; machine; mental; mental_mode; method; model; modeling; module; new; observer; pilots; pitch; pitchvals; protection; real; relational; representation; sal; scenario; set; speedvals; state; surprise; synchronous; systems; thrust; true; type; uninterpreted; use; values; variables; vertical; volume
     • versions: original; plain text
575. 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; app; archetype; arguments; arity; behaviour; case; cons; definition; example; explicit; figure; foldr; following; functional; functional programming; hand; haskell; head; higher; inductive; instance; interaction; interaction nets; language; list; listcase; matching; nets; nil; order; paper; patterns; ports; proc; programming; programs; recursion; recursion patterns; recursive; result; right; rules; section; style; system; tail; unfold; use; visual; visual programming; vmt; way; work
     • versions: original; plain text
576. 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: action; adaptnoti; agents; algebraic; autonomous; broadcasting; calculus; comhordú; computer; constraint; coordination; coverage; def; definitions; description; distance; d−→; e)?t; eceasst; elastic; entities; entity; environment; existing; expressions; fail; fmis; formal; formalisation; free; function; input; language; level; message; mobile; model; modelling; msglatency; network; notes; output; pages; position; process; processes; properties; protocol; real; safety; science; section; sender; set; space; state; sufficient; switch; system; takei∈i; tcbs; temporal; terms; theoretical; time; transition; type; understanding; v?−→; value; variables; velocity; volume; w;−→; wireless
     • versions: original; plain text
577. 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: animating; animation; approximation; boolean; bounds; case; compilationjobs; compilationunits; constraint; contracts; d s; dependency; e l; e n; eceasst; eds; execution; expressions; figure; formula; functions; graph; implementation; l l; l u; language; model; modifies; n d; o l; o u; objective; objective functions; ocl; ocl operation; operation; operation contracts; optimal; optimization; order; possible; post; postconditions; problem; proc; quantifier; r e; results; rpre; s e; s o; sat; sci; semantics; set; solution; solver; specification; state; support; system; t s; time; tool; u n; u t; uml; use; value; volume
     • versions: original; plain text
578. 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: appropriate; argument; auto; bag; body; changes; class; classifier; clause; collection; concepts; concrete; conformance; constraint; content; covariant; declarations; document; eceasst; eclipse; edition; example; expression; figure; group; introduction; issues; iteration; java; lambda; language; library; library model; management; meta; model; modeling; number; object; ocl; ocl specification; ocl standard; oclany; oclself; ocltype; omg; operation; overloading; parameter; precedence; proc; return; revision; section; semantics; sequence; set; similar; specification; standard; standard library; support; syntax; template; time; tooling; type; uml; usage; version; volume
     • versions: original; plain text
579. 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: abstract; access; alignment; associations; basic; behavior; class; classes; classifier; clause; complete; complete ocl; composite; concrete; constraint; definition; distinct; document; eceasst; edition; emof; environment; evaluation; expression; expressioninocl; features; figure; functionality; group; hierarchy; implementation; interchange; language; library; major; management; merged; meta; model; modeling; non; number; object; ocl; ocl pivot; ocl specification; oclany; omg; operation; package; pivot; pivot meta; practical; primitive; problems; proc; property; reflection; representation; section; semantics; specification; standard; string; support; syntax; tools; types; uml; uris; usage; values; variety; version; volume; xmi
     • versions: original; plain text
580. 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: analysis; available; chimiak; co09; code; collected; components; current; data; demuth; description; developers; development; dresden; eceasst; eclipse; eclipse ocl; editor; engineering; environment; evaluation; expressions; extensions; feature; feature model; figure; framework; functionality; future; gathering; generation; gogolla; ide4ocl; ide4ocl feature; idea; information; java; landscape; language; level; library; licence; list; mde; model; modelling; ocl; ocl tools; oclarity; ocle; open; opoka; overview; owner; paper; parser; proc; project; provider(s; queries; related; report; research; results; section; set; software; specification; squam; standard; support; supported; systems; tests; textual; tools; topcased; uml; unit; university; use; user; verification; version; version(s; view; volume; web; workshop
     • versions: original; plain text
581. 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: adoption; burkhart; current; discussion; france; germany; jordi; language; martin; modelling; ocl; preface; robert; session; standard; state; support; textual; tool; uml; university; workshop
     • versions: original; plain text
582. 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: algebra; asymmetric; attribute; cases; checkout; conflicts; contracts; coverage; criteria; data; definition; dependencies; dependency; derivations; direct; eceasst; edges; example; fig; flow; graph; gtvmt; hotel; int; interface; lab(e; labels; names; nodes; object; occupyroom(1,“j”,3; order; parameters; read; rule; second; section; services; set; signatures; source; step; system; table; tagts; test; testing; transformation; type; use; values; variables; visual; volume; web
     • versions: original; plain text
583. 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: abstract; alu; analysis; architecture; assembly; behavior; binary; c t; computer; data; description; e d; e g; e l; e s; eceasst; elements; example; execution; expression; extract; figure; formats; g r; generated; generation; hardware; harmless; information; instruction; l t; language; level; memory; metamodel; model; modeling; n d; n g; n s; n t; o u; ocl; operation; partial; pipeline; platforms; processor; programming; r e; r n; r u; s s; s t; s u; set; simulator; software; source; syntax; t e; t r; text; time; transformation; u e; u l; u t; volume
     • versions: original; plain text
584. 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; asset; checking; clause; collect; complexity; constraints; depth; eceasst; elements; elucidative; errors; evolution; examples; expressions; found; group; implicit; improvements; inconsistencies; inconsistent; iterator; language; listing; management; metamodel; minor; missing; models; non; object; ocl; ocl rules; omg; operation; paper; possible; process; related; results; rules; semantics; specification; specified; static; superstructure; syntactical; syntax; tests; tools; total; type; uml; uml specification; unit; usage; version; volume; wfrs; work; wrong
     • versions: original; plain text
585. 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: computer; computing; graph; like; membrane; membrane computing; models; natural; neural; păun; systems; transformation; volume
     • versions: original; plain text
586. 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: algorithm; allinstances; analysis; approach; body; calls; case; change; checks; class; collect; context; definition; delta; department; development; different; e(s; eceasst; elements; emf; employees; endif; evaluation; event; example; expression; figure; function; furcas; ifexp; impact; incremental; iterator; jane; language; large; lead; let; manager; metamodel; model; modelling; object; ocl; ocl expressions; operation; operationcallexp; overall; parameter; partial; performance; proc; project; propagation; property; result; rules; salary; section; selection; self; set; single; source; standard; subexpression; syntax; textual; traceback; tracebackn(s; tracebacksteps; tuple; type; unused; value; variable; view; volume
     • versions: original; plain text
587. 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: analysis; application; editors; fabio; graph; international; languages; leonardo; mariani; modeling; series; software; support; systems; techniques; tools; transformation; university; verification; visual; vmt; volume; workshop
     • versions: original; plain text
588. 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: avocs; critical; easst; paper; short; systems; university; verification; workshop
     • versions: original; plain text
589. 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: approach; bowen; eceasst; fmis; formal; interactive; international; methods; model; systems; university; workshops; year
     • versions: original; plain text
590. 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: amaral; application; approach; cécile; contributions; design; eceasst; engineering; hans; hardebolle; lászló; lengyel; lisboa; model; modelling; mpm; multi; nova; paper; paradigm; possible; preface; research; systems; technology; transformations; universidad; university; vangheluwe; vasco; volume; workshop
     • versions: original; plain text
591. 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: abstraction; alternative; alternative trace; case; concept; creation; distribute; elements; excerpt; figure; fromvhftop; helper; information; input; instance; integervector; language; link; local; local trace; mapping; marte; metamodel; model; object; operational; origin; output; properties; property; qvt; qvt trace; qvto; rule; scenarios; section; standard; study; synchronization; tiler; trace; trace metamodel; traceability; transformation; uml
     • versions: original; plain text
592. 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: = =; application; approach; architecture; case; checking; class; classes; code; compliance; component; consistency; constraints; definition; dependencies; dependency; description; design; design models; development; different; eceasst; elements; engineering; example; fig; figure; flexible; formal; ieee; intended; intensional; interfaces; layer; level; like; logic; meta; method; minimal; models; mpm; order; package; persistence; proc; relation; representation; satisfying; sec; set; signature; single; software; statements; structure; support; symbols; systems; tool; uml; violations; volume; work
     • versions: original; plain text
593. 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: active; analysis; applications; approach; architectures; arguments; assurance; attack; augmentation; bdmp; boolean; bouissou; cases; complex; concerns; continuity; corrections; critical; data; demand; design; development; different; eceasst; egnos; end; engineering; european; evidence; failure; fault; figure; fmis; formal; global; gnss; goal; gps; ground; gsn; hazards; impact; implementation; information; infrastructures; instance; integrated; integrity; jamming; level; location; loss; malicious; markov; models; navigation; operation; particular; potential; previous; probability; problems; processes; raims; range; related; report; requirements; safety; satellite; sbas; secondary; security; security concerns; semi; signals; significant; source; space; support; systems; techniques; threats; time; timing; underlying; use; users; volume; vulnerabilities
     • versions: original; plain text
594. 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: algorithm; associated; cell; clusters; connected; data; definition; depth; eceasst; edge; example; figure; graph; graph g; hierarchical; hierarchy; human; initial; interaction; m1(g; maximal; merge; merging; networks; node; number; operations; particular; partite; path; pathway; possible; protein; result; section; set; sets; structure; theorem; tree; underlying; undirected; user; vertex; vertices; vmt; volume
     • versions: original; plain text
595. 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: activity; altran; analysis; application; approach; automated; behaviour; cbyc; certificate; checks; clear; code; construction; core; correctness; cost; customer; data; design; development; eal5; early; eceasst; effective; enclave; end; errors; experiences; formal; formal design; formal methods; formal notation; formal specification; high; implementation; industrial; industrial use; industry; information; key; language; large; lifecycle; need; notation; number; point; possible; praxis; process; product; project; proof; properties; refinement; requirements; run; security; security properties; software; source; spark; specification; stage; stakeholders; support; supported; system; techniques; test; time; tis; tokeneer; tokeneer system; tool; use; user; verification; volume
     • versions: original; plain text
596. 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: abstraction; ada; aocs; approach; attitude; bdd; bmc; case; checker; checking; code; complete; control; counterexamples; critical; diagrams; eceasst; error; figure; finland; formula; generated; handling; heljanko; higher; implementation; large; list; logic; ltl; manager; methods; model; model checking; modeling; nominal; number; nusmv; onboard; orbit; pli; possible; priority; procedure; properties; property; results; safe; safety; satellite; software; source; space; state; step; symbolic; symbolic model; system; t.o.(119; table; time; timers; transition; unit; value; variable; verifying; volume
     • versions: original; plain text
597. 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: abstract; access; activestate; annotations; api; applet; applications; belgian; bugs; card; case; class; code; data; eceasst; eid; electronic; elementaryfile; errors; example; fields; file; high; identity; information; instance; interval; java; java card; lines; logic; low; memory; method; number; open; permissions; persistent; platform; predicate; process; program; public; requires; results; section; separation; short; size; smart; software; specification; state; static; study; time; tool; transaction; use; valid; verifast; verification; verifier; verify; void; volume
     • versions: original; plain text
598. 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: approximating; automata; band; behaviour; condition; definition; different; eceasst; environment; example; execution; fig; following; guard; guarded; idealised; iff; interval; lemma; level; m(m; methane; note; output; precision; predicate; prev; program; proof; pump; reactive; real; reasoning; refinement; rely; safety; sampled; sampling; sequence; set; specifications; state; stop; stream; systems; teleo; theorem; time; true; use; variable; volume; water; ρ.p
     • versions: original; plain text
599. 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: abstract; adequacy; approach; artefacts; change; concrete; development; domain; eceasst; elements; engineering; environment; event; example; figure; following; formal; formal model; formalised; frames; incremental; informal; invariants; light; management; means; method; mixing; model; model elements; modelling; obligations; paper; pedestrians; peds; phenomena; problem; process; proof; properties; reference; refinement; request; requirements; rodin; satisfaction; section; set; software; specification; state; stop; structured; support; system; tool; traceability; tracing; traffic; validation; volume; way; work; world; wrspm
     • versions: original; plain text
600. 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: analysis; approach; b l; c o; c t; checking; code; concurrent; control; controllable; csup; d t; des; discrete; e d; e e; e n; e −; ein; event; figure; fsas; l e; l l; l s; model; n c; n d; n n; n s; n t; o l; o n; o u; p e; plant; processes; promela; r e; r n; r o; r u; r v; s e; s s; s t; specification; spin; step; supervisor; synthesis; systems; t =; t e; t o; t p; t r; t t; t u; t y; theory; tool; transformation; u e; u l; u n; work
     • versions: original; plain text
601. 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: abstract; approaches; change; channels; components; concrete; conditions; data; database; decomposed; decomposition; design; development; different; eceasst; end; event; final; following; formal; global; guidelines; information; interface; inv1; invariants; local; machine; master; memo; message; model; modelling; modularisation; old; operation; process; proof; properties; property; refined; refinement; request; res; response; sdb; sec; server; set; shared; sis; snt; stage; sub; survey; synch; system; techniques; tool; udb; uis; update; user; value; variables; verification; volume
     • versions: original; plain text
602. 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: alc; alc−ltl; approach; atomic; behavior; boolean; bounded; case; checker; checking; class; connectives; customer; definition; description; diagrams; dynamic; eceasst; example; experiment; figure; finite; following; formal; formulae; integrated; list; logic; ltldl; minisat; model; model checking; modeling; new; order; paper; pending; problem; proceedings; properties; relations; representation; runtime; sake; scenario; seconds; semantics; set; sets; shop; smt; smt(dl; software; solver; solving; state; static; stock; structure; syntax; system; temporal; theory; transition; uml; volume; warehouse; work; yices
     • versions: original; plain text
603. 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: abstract; addition; ambiguous; approach; boundaries; boundary; but09; car; commanded; control; control systems; document; driver; eceasst; environment; event; ewl; figure; formal; formal model; functional; guidelines; lane; layering; ldws; level; mcc; missing; model; modelling; monitored; new; offset; paper; phenomena; process; refinement; related; requirements; revision; section; speed; stage; status; step; structured; structuring; system; table; traceability; validation; variable; volume; warning; width; zone
     • versions: original; plain text
604. 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; altarica model; analysis; assessment; bdd; case; checking; component; definition; e t; eceasst; elec; evaluation; events; fault; figure; flow; functionalities; generator; hierarchy; hydi; industrial; input; l u; language; main; model; model checking; module; node; nusmv; o u; ocas; output; p u; plugin; proc; results; s e; safety; safety assessment; section; semantics; sequence; set; simulation; state; structure; symbolic; synchronization; system; techniques; temporal; time; tools; trace; translation; tree; u t; variables; verification; volume; weak; work
     • versions: original; plain text
605. 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: activities; activity; approach; basic; bpel; business; centralized; characteristic; cmu; consumer; coordination; cross; data; different; electric; emt; end; event; example; exception; execution; fault; figure; graph; handler; information; infrastructure; language; loop; maintenance; management; means; meta; mobile; model; nodes; orchestrators; paper; partitioning; process; processes; producer; railroad; receive; request; rules; scope; second; section; services; set; setra; signal; simple; start; structured; support; switch; systems; team; technology; traffic; transformation; volume; web; workflow; working
     • versions: original; plain text
606. 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; approach; behavior; bisimilar; bisimilarity; bisimulation; check; checking; contexts; definition; dependent; diagram; dist; dpo; false; graph; hirschkoff; insert; interface; labels; layer; match; model; morphism; pair; partial; proc; productions; pushout; refactoring; rules; set; space; state; step; successors; systems; table; technique; transformation; transition; true; vmt; volume; w w
     • versions: original; plain text
607. 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: alexander; avocs; bendisposto; cliff; critical; jens; jones; michael; preface; romanovsky; systems; university; verification; workshop
     • versions: original; plain text
608. 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; = ̂; abstract; approach; case; concrete; constraint; constructs; critical; deadline; delay; end; event; event b1; expiry; false; figure; guard; invariant; machine; model; modeling; new; occurrence; order; patterns; possible; process; properties; refined; refinement; refining; response; ru e; section; set; specification; step; sub; system; t ru; tick; time; timing; tock; trigger; variables; volume; work
     • versions: original; plain text
609. 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: analysis; application; approach; architecture; balancer; class; clients; coloured; database; design; domain; dsvl; eceasst; figure; firing; formalism; function; immediate; language; load; mapping; model; modelling; modellingand; mpm; multi; nets; number; performance; petri; place; qpn; queued; queueing; rule; server; set; simulation; specific; sub; systems; throughput; tier; tier systems; time; tokens; transaction; transformation; transitions; utilization; visual; volume
     • versions: original; plain text
610. 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: adequacy; approach; artifact; aspect; assurance; candidate; cases; certificate; certification; certified; checking; claim; clear; code; complete; confidence; context; critical; dependability; determination; development; direct; eceasst; engineering; evaluation; evidence; formal; framework; general; immediate; important; indirect; information; interpretation; involved; issues; machine; mathematical; metrics; model; paper; pieces; place; point; positioning; practice; problem; process; proof; question; rationale; real; reason; requirements; results; role; safety; setting; shao; software; software certification; specification; system; system certification; theory; things; time; use; view; volume; wassyng; world
     • versions: original; plain text
611. 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: application; approaches; behavior; bézivin; characteristics; conformsto; connects; consistency; contains; core; current; definition; development; didonet; different; elements; engineering; example; favre; ieee; istransformedin; level; links; macromodel; management; mde; megamodel; model; modeling; perovich; possible; proc; reference; related; relations; salay; section; seibel; shows; software; structural; system; term; tool; traceability; transformation; types; unification; unified; use; volume
     • versions: original; plain text
612. 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: + +; application; attribute; attribute formula; axiom; backward; bd1.name; bd2cd; bidirectional; case; cl2; cl2.name; class; cn1; computation; conditions; consistent; constraint; correspondence; declarative; different; elements; example; fig; formula; forward; grammars; graph; handling; implementation; input; instructions; integration; label; lhs; model; need; operationalization; order; parameters; particular; qvt; relational; rule; runtime; scenario; section; set; software; solver; source; specification; string; symbolic; target; tgg; tgg rule; tggs; transformation; triple; values; variables; way; work
     • versions: original; plain text
613. 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: @m1f; algebra; approach; assignment; attribute; attribute manipulation; backward; bidirectional; box; card; complex; composition; consistent; constraints; content; correspondence; corresponding; csp; data; definition; dictionary; different; eceasst; eept06; entries; entry; example; extension; final; following; formalization; forward; g00; g10; g11; grammar; graph; implementation; kön08; language; learning; level; lncs; manipulation; match; metamodel; model; morphism; operations; p1f; p2s; partition; proc; programming; rules; sequence; set; signature; single; source; specification; springer; string; support; target; techniques; term; tgg; tgg rules; tggs; theorem; transformation; triple; triple graph; type; tς(x; user; values; variables; volume
     • versions: original; plain text
614. 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: acm; adaptation; automated; bidirectional; bidirectional grammar; changes; convergence; cpost; csharp; definition; different; documentation; eceasst; eds; end; engineering; evolution; example; future; general; grammar; grammar transformation; grammarbase; group; international; introduce; java-5; jls; language; lämmel; like; list; lncs; lz11; megamodel; metasymbol; metasyntactically; mutation; need; new; nonterminal; notation; notation evolution; notation grammar; notation specification; operator; order; original; paper; parser; plus; proceedings; programming; rascal; recovery; related; relationship; rename; repetition; separator; software; source; specification; springer; start; steps; syntactic; terminals; transformation; uppercase; volume; way; work; xbgf; xedd; zay10; zaytsev; ξbgf
     • versions: original; plain text
615. 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: abstract; action; activity; business; business process; change; computer; condition; context; correspondence; corresponding; csp; diagrams; eceasst; edge; embedding; expressions; figure; graph; incoming; level; mapping; metamodel; model; new; nodes; notebook; outgoing; process; processes; processjoin; redesign; relation; rule; section; semantic; syntax; transformation; triple; use; verification; vmt; volume; workflow
     • versions: original; plain text
616. 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: analysis; approach; concrete; correctness; current; domain; dsltrans; engineer; equivalence; experiment; fact; figure; finite; graph; i.e; inarc; infinite; instance; language; language engineer; language translations; machine; means; metamodel; model; mpm; net; nets; operational; outarc; particular; petri; place; possible; proc; relation; rules; semantics; sentence; set; software; sos; source; specification; state; state machine; symbolic; syntax; systems; target; transformation; translation; use; volume; weight=1; work
     • versions: original; plain text
617. 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; alternatives; analysis; application; approach; architecture; automatic; automotive; autosar; available; behaviour; buffers; case; choices; communication; components; computer; configuration; deployment; design; development; different; domain; eceasst; engineering; execution; exploration; figure; functional; hardware; ieee; implementation; information; jtl; language; level; messages; meta; methods; model; modelling; mpm; multiple; optimal; performance; platform; possible; power; priority; process; properties; real; refinement; runnables; search; section; set; simulation; software; solutions; space; study; systems; tasks; technique; time; transformation; university; use; volume; window
     • versions: original; plain text
618. 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: acm; alignment; anna,1984; approach; argument; behavior; bidirectional; bilist; combinators; cons; create; data; default; definition; delta; delta lenses; dependent; eceasst; elements; example; fatherline; female; figure; folds; framework; free; function; functor; getm; head; horizontal; inductive; information; language; laws; left; lens; lenses; level; list; mapping; mary,1956; matching; model; modifications; modified; names; new; node; operations; order; original; pc10; pch12; person; peter,1981; point; polymorphic; positions; proc; putm; putn; recursive; related; relation; right; section; shape; simple; source; state; transformation; tree; type; updates; value; view; volume
     • versions: original; plain text
619. 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: = ←−; = −→; bidirectional; class; classes; consistency; coordinate; correct; definition; element; equivalence; example; false; following; grid; hippocratic; history; iff; ignorant; information; lemma; lenses; matching; model; names; pair; paper; r(m; rm(m; sets; state; test; transformations; true; work
     • versions: original; plain text
620. 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: analysis; andrew; constraints; engineering; fish; germany; graph; gtvmt; iii; international; italy; lambers; languages; leen; model; modeling; papers; preface; proceedings; submissions; techniques; transformation; university; visual; volume; workshop
     • versions: original; plain text
621. 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; acs; agg; algebraic; analysis; application; approach; atgi; case; concrete; conditions; definition; deonticbpmngts; dependency; eept06; equivalence; example; finer; flattened; flattening; graph; graph transformation; image; inheritance; model; morphism; nac; nacs; necessary; node; original; pac; pacs; productions; prototype; relationships; sequence; system; termination; theorem; transformation; type; type graph
     • versions: original; plain text
622. 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: activities; activity; agg; arctis; behavior; block; button; case; checker; component; conflict; crossing; detection; development; distributed; eceasst; edges; eds; engineering; errors; esm; example; figure; flow; game; graph; graph transformation; gtvmt; initiative; kraemer; lncs; mixed; mixed initiative; model; new; node; particular; pattern; pin; pins; primary; remedy; rules; seci; secondary; software; source; space; springer; start; state; step; system; target; token; transformation; uml; use; volume
     • versions: original; plain text
623. 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: analysis; application; approach; behavior; bigstep; case; context; control; coverage; coverage criteria; criteria; criterion; definition; different; dmm; dmm specification; dynamic; ec+; edge; engineer; example; execution; figure; flow; graph; input; invocation; invoked; language; lts; matching; means; metamodel; model; modeling; node; number; order; paper; possible; proceedings; quality; result; rule; rule coverage; section; semantics; set; smallstep; software; specification; state; suite; system; tdss; test; test coverage; testing; tool; unique; way
     • versions: original; plain text
624. 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; behaviour; categories; category; client; clock; definition; delay; eceasst; ehrig; example; fastclient; figure; firing; general; global; gluing; graph; high; level; marking; morphisms; nets; network; petri; petri nets; places; post; pre; proc; restriction; router1; rule; section; springer; state; structuring; systems; t n1; t n2; t nets; techniques; timed; timestamps; tokens; transformation; transition; value; volume
     • versions: original; plain text
625. 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: action; case; code; components; copy; criteria; delete; different; edges; elements; example; execution; expressions; figure; graph; graph transformation; great; group; group operator; host; input; language; matches; matching; model; multiple; new; nodes; number; objects; operator; output; pattern; pc1; pc2; ports; rule; set; signal; single; step; subgraph; subgroups; transformation; user; vmt
     • versions: original; plain text
626. 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: = false; = true; attribute; c2 t; case; check; class; class t; code; column; condition; conformance; constraints; design; different; disabling; elements; example; figure; forward; graph; guerra; instance; inter; language; lncs; main; matching; mechanisms; meta; model; modelling; morphism; negative; ocl; operational; pamomo; pattern; persistent; pre; public =; related; relations; rule; satisfaction; scenario; section; set; shows; source; specification; springer; table; target; trace; traceability; transformation; triple; use
     • versions: original; plain text
627. 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: adaptation; adapters; approach; atl; attribute; attribute.class; binding; bound; case; class; classes; classification; composition; concept; concept mm; containment; context; corresponding; datatype; difference; direction; eceasst; ecore; elements; example; feature; fig; generic; helper; heterogeneities; heterogeneous; hot; list; means; metamodels; mms; model; model transformations; mpm; multiplicity; naming; ocl; order; package; proc; property; reference; resolution; reuse; rewriting; section; set; single; source; specific; specific mm; specific source; string; structural; subtype; target; transformation; type; umlclass; volume; work
     • versions: original; plain text
628. 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: application; approach; behaviour; compatibility; compatible; completeness; components; composition; compositionality; conditions; decomposed; definition; different; disjoint; edges; example; fig; following; global; graph; graph transformation; gtvmt; hand; idle; interface; left; lhs; local; m p; machine; node; note; notion; number; paper; partial; partial graph; passing; production; proposition; ready; results; rhs; rule; set; soundness; split; start; synchronisation; system; transfer; transformation; transitions; union; volume; work
     • versions: original; plain text
629. 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: alarm; alternative; approaches; automatic; bcs; body; central; combinations; comfort; configuration; constraints; control; create; cross; csp; dependencies; diagram; excludes; feature; feature model; fig; figure; flattened; flattening; graph; gtvmt; initial; key; line; locking; locking system; model; moso; number; optimization; optional; oster; pairs; pairwise; paper; plot; polite; power; proc; process; product; reduction; redundant; remote; require; requirefrom; results; rules; security; semantic; software; software product; solver; spl; spls; story; strategies; subset; system; target; testing; time; transformation; tree; valid; value; volume; window
     • versions: original; plain text
630. 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: actions; arc; arcs; bounded; channel; checking; class; classes; communicating; confluent; control; cps; decidability; eager; eceasst; events; fact; finite; following; formula; fst; grammars; graphs; gtvmt; hlms11; hrg; hyperedge; hypergraph; initial; local; logic; matching; message; model; mso; non; note; order; partial; previous; problem; proc; processes; pushdown; rcps; reachability; results; rules; run; runs; second; semantics; sequence; set; stack; state; systems; topology; transition; treewidth; undecidable; underlying; vertex; vertices; volume; word
     • versions: original; plain text
631. 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: action; adjoint; adjunction; algebraic; algebras; approach; arrow; associativity; behaved; bidirectional; cartesian; categories; category; closed; coalgebra; commute; comonad; const1; correspondence; counit; data; database; descriptions; eceasst; following; function; functor; johnson; law; laws; left; lenses; morphism; object; paper; particular; proc; products; programming; right; section; set; source; transformations; type; unit; update; view; volume; work; � �
     • versions: original; plain text
632. 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: applicable; application; approach; arbitrary; bounds; clan; conditions; constraints; definition; derivation; diagrams; edges; elements; example; figure; form; free; generation; grammar; graph; i(a; iggg; inheritance; instance; l(tgimult; language; layer; lower; match; meta; model; modeling; morphism; multiplicities; new; ocl; paper; restricted; rules; satisfiable; set; simple; software; taentzer; terminating; tgie; tgimult; transformation; type; type graph; upper; vertex; vertices; work
     • versions: original; plain text
633. 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: = =; adapter; addproject; agg; applicable; cases; challenges; computer; condition; contracts; custom; different; driver; eceasst; error; example; expected; failure; figure; graph; implementation; line; list; logical; model; multi; operation; oracle; output; parameters; post; pre; reports; response; result; returns; rule; services; set; signatures; software; string; successful; system; technical; test; testing; transformation; types; use; visual; visual contracts; volume; web
     • versions: original; plain text
634. 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: algebra; applications; arrow; associativity; behaved; case; category; classical; complement; condition; constant; domain; eceasst; edge; example; g(s; generalised; graph; law; laws; lens; lenses; mixed; monad; monotonic; new; object; operations; paper; satisfied; satisfy; section; set; spans; state; structure; transitions; update; updating; view; volume; work
     • versions: original; plain text
635. 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: albert; application; areas; development; engineering; grabats; graph; international; papers; preface; software; systems; tools; transformation; varró; workshop; zündorf
     • versions: original; plain text
636. 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; approach; arrows; behavior; blocks; ccsl; chronotfsm; clock; composition; computation; constraints; control; controller; data; delayedfor; different; enters; event; example; figure; heterogeneous; initial; instance; instants; interface; language; like; machine; mocs; model; modeling; paper; parts; pins; power; proc; sdf; section; semantic; semantic adaptation; specification; state; structure; switch; system; tfsm; tfsm model; ticks; time; transition; union; use; volume; window; work
     • versions: original; plain text
637. 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: algorithm; alignment; approach; automatic; automatic ad; components; computation; diagram; diagram components; different; eceasst; editor; engine; example; figure; following; functionality; gal; graph; hoc; hoc layout; improvement; instances; lal; layout; layout patterns; local; meta; model; new; nodes; pattern; pattern instances; performance; proc; set; size; small; sub; suggestions; syntax; user; visual; visualization; volume
     • versions: original; plain text
638. 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: abstract; bidirectional; committee; database; development; different; engineering; germany; international; language; luxembourg; model; pamomo; papers; preface; proceedings; programme; related; requirements; reviewers; schema; semantics; software; specification; talk; techniques; transformations; university; volume; workshop
     • versions: original; plain text
639. 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; arbitrary; arrows; automata; automaton; cancellable; category; class; condition; cospan; definition; discrete; edges; example; expressive; finite; following; functors; graph; graph automata; graph languages; hyperedge; inf; initial; interface; l(a; languages; linear; node; non; order; path; problem; pushout; relation; right; section; set; state; transition; width
     • versions: original; plain text
640. 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: access; annotated; annotations; application; approach; atomic; case; composition; conditions; constraints; construction; content; contextual; control; definition; device; different; document; domain; eceasst; elements; example; execution; figure; form; gac; general; graph; gtvmt; left; level; location; match; modeling; models; morphism; negative; particular; present; process; rbac; relation; request; right; role; rule; s.t; section; security; set; single; type; user; volume; way
     • versions: original; plain text
641. 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: algorithm; atom; case; chain; checker; close(m1,m2; closure; consistent; definition; dot(m1,m2; eceasst; edge; end; exploration; expression; finding; following; graph; groove; gtvmt; host; implementation; incremental; induction; lab(e; label; matches; matching; mr(g; network; nodes; paper; path; pattern; performance; proc; regular; regular expression; results; rete; rule; search; set; structure; tgt(e; updates; use; vertex; volume; word
     • versions: original; plain text
642. 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: algebra; application; approach; car; case; complex; composition; computer; conditions; constraints; corresponding; definition; deterministic; diagram; dpo; eceasst; edge; example; g1,g2; generation; global; grammars; graph; graph transformation; gtvmt; labels; level; local; lts; modelling; models; morphism; movecar; negative; new; nodes; paper; parameters; pepa; proc; projection; pushout; rule; s(g; service; set; signature; space; span; states; steps; systems; t g; tagts; tis; transformation; transformation systems; transition; type; union; view; volume
     • versions: original; plain text
643. 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: application; approach; basic; consistency; corresponding; creation; customization; definition; developer; development; difference; eclass; eclipse; editable; editing; editor; elements; end; engineering; ereference; features; fig; following; hybrid; ieee; implementation; language; management; metamodel; model; modeling; modifications; multi; number; order; original; overall; page; process; projective; related; requirements; rights; section; selection; set; software; solution; specification; support; synchronization; synthetic; system; transformation; view; view metamodel; view modeling; volume; wizard; work
     • versions: original; plain text
644. 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; actions; activity; algebraic; apn; approach; book; borrow; c =; checking; composite; conditions; context; control; control policies; data; event; example; figure; formulas; input; library; log; logic; model; modeling; order; original; places; policies; policy; properties; rlist; rules; section; security; semantics; set; statechart; states; system; temporal; tokens; tool; transformation; transition; uml; variables; verification; volume; workingdays
     • versions: original; plain text
645. 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: architecture; association; available; carsten; classes; code; complex; diagrams; directories; directory; eceasst; editor; elements; ends; features; fig; figure; file; fujaba; generated; generation; grabats; graph; import; integration; interfaces; java; jmi; large; links; mechanism; merge; metamodel; methods; model; moflon; names; new; object; ocl; package; pages; paper; proc; project; projectdir; projectmetrics; refinement; result; rules; schema; section; specifications; textfile; tool; transformation; type; uml; user; volume
     • versions: original; plain text
646. 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: 5th; abstract; adaptation; amaral; approach; authors; behavior; ccsl; cometa; components; composition; computation; concepts; definition; design; different; discussion; domains; eceasst; elements; evaluation; execution; group; heterogeneous; international; languages; level; means; meta; methodology; mocs; model; model composition; modeling; mpm; mpm’11; multi; need; paper; paradigm; possible; proceedings; semantics; session; software; state; syntax; system; technology; transformations; university; usability; views; volume; workshop
     • versions: original; plain text
647. 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: approach; attributes; case; communication; concepts; context; cost; design; development; different; domain; dsl; dsls; eceasst; end; engineering; evaluation; external; general; human; important; information; internal; iso04; kind; languages; level; measures; metrics; model; mpm; new; order; papers; particular; phase; process; product; productivity; programming; quality; real; requirements; section; software; specific; standards; study; system; systematic; terms; testing; time; tools; usability; usability evaluation; usable; use; user; visual; volume
     • versions: original; plain text
648. 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: abstraction; analysis; application; approach; architecture; aspects; basic; behaviors; cometa; communication; community; components; computation; concepts; concerns; connectors; data; definition; description; design; different; discrete; domain; elements; example; execution; figure; heterogeneity; heterogeneous; interfaces; language; level; marte; mbe; moc; mocdomain; mocs; modeling; models; mpm; new; ports; possible; present; profile; ptolemy; rtes; section; semantics; solutions; specific; support; synchronization; system; time; types; uml; volume
     • versions: original; plain text
649. 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: accurate; ambiguities; article; aspects; case; children; company; complete; constraints; context; contract; correct; corresponding; description; different; domain; eceasst; examples; expressions; figure; following; genealogical; information; inv; invariant; language; library; mentioned; model; modeling; multiplicity; need; ocl; ocl specification; paper; parents; pentru; person; pitfalls; problem; process; question; requirements; respect; section; semantics; sex; snapshots; software; specification; students; teaching; tree; uml; undefined; understanding; user; volume
     • versions: original; plain text
650. 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: activities; activity; atl; case; concepts; concrete; constraints; course; development; different; editor; elements; engineering; extensions; figure; finished; formal; formal verification; graphical; hours; language; main; mde; metamodel; metamodeling; model; modeling; net; nets; ocl; petri; petrinet; practical; process; resources; rule; section; simplepdl; students; study; syntax; syntaxes; target; teaching; technologies; textual; time; tina; tools; transformation; use; verification; work; xtext
     • versions: original; plain text
651. 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: abstraction; application; approach; attribute; cardinality; cell; corresponding; current; duration; edges; elements; fig; firing; graph; graph g; graph transformation; gts; gtss; ilp; instance; instance graph; model; net; nets; nodes; number; occurrence; optimal; optimization; petri; places; problem; rule; sequence; ship; sink; solution; space; start; state; storage; systems; t g; t net; test; time; time instance; timestamp; tokens; trajectory; transformation; transition; type; type graph; vector
     • versions: original; plain text
652. 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: -adhesive; -functor; -reachable; agg; analysis; application; as1; as2; behavior; c1,m1; c2,m2; categories; confluence; corresponding; critical; direct; eept06; ehrig; figure; formal; framework; functional; graph; in=1; in=3; individual; local; morphisms; net; nets; out=1; pair; petri; place; properties; pti; rule; section; systems; termination; th1; theorem; token; tool; transfer; transformation
     • versions: original; plain text
653. 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: basic; classification; computer; consistency; context; courses; development; different; eceasst; education; edusymp2011; elements; engineering; experts; framework; important; initial; issues; learning; level; modeling; models; object; perspective; practices; problems; proceedings; process; quality; related; research; science; software; specific; students; successful; systems; table; teaching; tools; uml; understanding; volume; way; work
     • versions: original; plain text
654. 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: age; agg; aging; algorithm; attracting; class; concept; diagrams; different; distance; drawing; eceasst; edge; embedder; environment; evolutionary; example; fig; flexibility; forces; function; grabats; grammars; graph; graph transformation; implementation; incomplete; layout; layout algorithm; map; mental; model; new; node; number; patterns; possible; problem; proc; quality; repulsive; requirements; rules; section; sequences; single; spring; temperature; transformation; transformation sequences; volume
     • versions: original; plain text
655. 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: andreas; education; educators; edusymp; france; germany; languages; marion; modeling; models; papers; preface; software; symposium; technologies; technology; university; volume
     • versions: original; plain text
656. 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; action evolution; ahl; algebraic; an′; apache; case; changes; communication; condition; construction; copy; corresponding; data; different; direct; ehrig; evolution; example; figure; firing; following; free; gluing; graph; high; insert; level; level nets; match; modelling; modification; modify; mp′; nets; new; occurrences; order; pattern; per95; petri; places; platform; possible; process; processes; production; remove; robots; scenarios; section; single; transformation; transition; user; user user; wave; wavelet
     • versions: original; plain text
657. 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: abstraction; analysis; appropriate; attributes; case; class; classes; computer; concepts; conceptual; design; diagrams; difficult; domain; education; generalisation; hierarchies; knowledge; learning; mapping; maps; modelling; models; natural; novices; objects; ooad; participants; problems; proc; responsibilities; science; section; sequence; software; specialisation; students; study; system; threshold; threshold concepts; transformative; troublesome; uml; understanding; use; world
     • versions: original; plain text
658. 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: abstractions; concepts; courses; design; development; experience; good; learning; mits; modeling; models; programming; skills; software; students; use
     • versions: original; plain text
659. 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; axioms; backend; basic; case; choose; construct; corresponding; definitions; domain; eceasst; encoding; equality; example; expressions; following; formula; function; hypotheses; inference; input; int; integer; isabelle; logic; nat; new; non; number; obligation; operators; order; p(x; particular; predicate; proof; quantifiers; reasoning; records; rewriting; rules; section; semantics; set; sets; smt; smt solvers; solvers; sort; springer; standard; state; theorem; theory; tla+; tlaps; translation; tuples; type; typing; uninterpreted; untyped; use; volume
     • versions: original; plain text
660. 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; application; arend; christian; development; germany; grabats; graph; international; krause; model; netherlands; papers; pattern; proceedings; rensink; tools; transformation; universität; university; volume; workshop
     • versions: original; plain text
661. 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: addition; attribute; constraints; correspondence; different; eclipse; editor; emf; emorf; execution; expression; figure; grammars; graph; graphical; interpreter; meta; model; model transformations; objects; ocl; place; refactoring; rule; specification; support; system; target; tool; transformation; triple
     • versions: original; plain text
662. 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: application; behavior; calendar; class; code; condition; current; diagram; eceasst; eclipse; ecore; emf; event; example; executable; figure; generation; grabats; instance; lines; matching; method; model; modeling; modgraph; nac; newattendee; nodes; object; ocl; operations; optional; parameter; pattern; public; references; rule; running; steps; transformation; tree; unbound; user; utility; volume
     • versions: original; plain text
663. 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: algorithm; bisimilarity; case; certificate; cgv; checking; complexity; computer; count; eceasst; edges; element; equal; example; false; following; function; generalised; gossips; grabats; graph; groove; hash; int; isomorphism; lab; mapping; model; nodes; number; pages; partition; positives; problem; results; science; sequence; set; size; space; state; symmetry; time; total; values; volume
     • versions: original; plain text
664. 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: + +; analysis; automatic; backward; block; checker; checking; class; classdiagram; complex; conditions; conformance; constraints; correspondence; corrnode; counter; diagram; e l; e m; e s; eceasst; elements; example; extended; figure; forbidden; forward; framework; generator; grammars; graph; implementation; integration; invalid; invariant; language; metamodel; model; ocl; pattern; process; rules; sct; section; source; springer; static; stereotype; support; systemblock; target; target model; testing; tgg; tggs; tool; transformation; triple; valid; validation; validity; w.r.t
     • versions: original; plain text
665. 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: agg; analysis; attribute; class; conditions; conflict; correspondence; critical; eceasst; editor; eehp09; ehrig; elements; emf; extension; fig; figure; formal; forward; forward translation; grammars; graph; hego10; henshintgg; istranslated; model; model transformations; modeling; nacs; order; pair; proc; right; rules; sc2; sequence; set; shows; source; systems; target; tggs; tool; transformation; translation; triple; triple graph; true; type; use; visual
     • versions: original; plain text
666. 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: application; approach; basic; binding; block; box; case; code; complete; concept; concrete; constraints; coverage; criteria; data; different; eceasst; engine; equation; example; figure; grabats; graph; gray; implementation; inport; input; languages; like; line; lncs; match; matching; metamodel; metrics; model; nodes; operations; outport; pattern; pmc0; possible; process; quality; results; run; search; section; sequence; set; specifications; springer; state; statement; steps; suite; system; task; testing; time; tools; transformation; unbinding; unbound; use; variables; volume; white; work
     • versions: original; plain text
667. 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: algorithms; analysis; bdd; bdds; checking; compression; core; data; decision; design; diagrams; eds; explicit; hash; laarman; languages; lncs; ltsmin; memory; model; model checking; multi; number; order; parallel; performance; pins; pol; proc; reachability; saturation; scalable; set; shared; specification; speedup; springer; state; strategy; sylvan; symbolic; symbolic model; table; time; transition; van; vectors; verification; weber
     • versions: original; plain text
668. 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: algebraic; application; approach; c e; change; classical; conditions; cospan; different; dpo; e t; eceasst; editor; ehrig; example; firing; function; graph; hamburg; hand; high; interface; labels; left; level; living; marking; modeling; morphism; n e; nets; node; object; padberg; petri; place; pnml; post; reconfigurable; reconfigurable place; reconnet; right; rule; scenarios; set; simulation; step; systems; token; tool; transformation; transition; transition nets; user; volume; xml
     • versions: original; plain text
669. 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: abstract; application; conditions; graph; milner; proc; reactive; rewriting; systems; transformation
     • versions: original; plain text
670. 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; ahoi nets; algebraic; analysis; application; applied; approach; aspects; asynchronous communication; behaviour; c.f; channels; communication; computing; conditions; connectionid; corresponding; data; devices; different; example; fig; firing; following; graph; higher; individual; information; level; living; message; modelling; models; nets; object; order; petri; place; publish; rule; scheme; sec; send; set; shared; specific; subscribe; synchronous; synchronous communication; system; time; tokens; topic; transformation; transition; type; ubiquitous; ucss; volume
     • versions: original; plain text
671. 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: 2012; abstract; formalisms; germany; graph; italy; julia; luxembourg; nets; padberg; petri; pngt; process; systems; transformation; workshop
     • versions: original; plain text
672. 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: agg; analysis; approach; assertions; check; checking; class; code; condition; corresponding; e s; element; end; environment; example; exercises; figure; flaws; graph; graph transformation; head; java; java code; list; main; method; model; number; possible; principal; programming; r u; representation; rules; s s; search; solutions; source; source code; specific; static; string; structures; student; t r; text; tool; transformation; usage; variable; verification; volume
     • versions: original; plain text
673. 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: algorithm; application; atom; case; colouring; complexity; computer; condition; constant; degree; edge; example; expressions; fast; figure; graph; hand; host; host graphs; input; items; labels; left; linear; list; matching; morphism; node; number; pair; partial; plump; preserving; proc; programming; programs; reachable; rooted; roots; rule; rule schemata; schemata; set; size; string; time; transformation; variable; volume
     • versions: original; plain text
674. 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: abstract; api; asg; belt; changes; condition; conveyor; core; domain; editor; elements; example; graph; language; lhs; machine; metaedit+; metamodel; model; model transformation; modelling; modelling language; nacs; nodes; object; operational; operator; original; paper; parts; pattern; possible; production; properties; property; python; ramification; rhs; rule; section; semantics; specific; system; tool; transformation; use; value; visual
     • versions: original; plain text
675. 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: approach; associations; catalog; class; concrete; constraint; correctness; cycle; design; diagram; different; domain; educational; edusymp2011; engineering; enhancement; examples; experiment; figure; finite; generalization; hierarchy; identification; identifying; instrument; interaction; language; level; meta; model; modeling; multiplicity; new; notation; path; patterns; possible; problematic; problems; quality; results; role; satisfiability; section; software; specification; structure; subjects; table; textual; uml; verification; visual; volume
     • versions: original; plain text
676. 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: -algebra; absorbing; abstract; act,−→,99k; action; algorithm; analysis; assume; automata; case; chains; characterisation; checking; computation; continuous; csl; definition; digitisation; digitised; distribution; dma; eceasst; error; finite; formula; goal; goal states; hermanns; holger; hybrid; imc; infinite; interactive; interval; i∗-phase; lncs; logic; markov; markov automata; markov states; maximum; mdp; measurable; measure; minimum; model; neu10; paper; paths; point; probabilistic; probabilities; probability; proc; prωa; queues; reachability; schedulers; section; set; springer; state s; states; step; stochastic; systems; technique; theorem; time; transitions; unbounded; volume
     • versions: original; plain text
677. 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: abrial; approach; array; code; condition; constants; context; convergent; correct; correctness; definition; designs; development; elsif; end; event; example; figure; final; formal; g(j+1; generation; invariants; level; loop; machine; models; note; partition; perspective; post; procedure; program; progress; proof; range; refinement; rule; section; spark; status; subsection; subtype; terms; translation; type; variables; verification; work
     • versions: original; plain text
678. 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: aalto; avocs; bamberg; brno; committee; critical; critical systems; lüttgen; masaryk; merz; preface; programme; research; stephan; swansea; systems; university; verification; volume; workshop
     • versions: original; plain text
679. 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; abstract; abstraction; aircraft; airspace; alert; analysis; autoresolver; behaviors; checking; cmd; command; components; concept; conflict; controller; coordination; counterexamples; ctl; ctr; debugging; design; designers; eceasst; fairness; figure; following; formal; formal specification; formula; future; involved; los; ltl; model; model checking; model validation; model verification; module; nusmv; operational; pages; pilot; possible; previous; priority; process; properties; protocol; real; resolution; results; safety; satisfiability; section; separation; set; specification; system; system model; tcas; threshold; time; traffic; tsafe; tsafe alert; tsafe resolution; validation; variables; verification; volume; work
     • versions: original; plain text
680. 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: algorithms; approach; assertions; automatic; avocs; case; cheney; chl11; collector; conditions; conference; definitions; different; eds; execution; fig; formal; garbage; graph; heap; higher; hol; input; international; invariants; isabelle; lines; list; lncs; logic; loop; map; mcc09; memory; mn05; node; objects; objs; order; original; p q; p r; pointer; predicate; program; proofs; proving; pure; reachability; reachable; reasoning; root; rules; schorr; semi; separation; separation logic; set; sets; space; spatial; springer; stack; symbolic; symbolic execution; theory; tue09; type; unfolding; value; variables; vb08; verification; volume; waite
     • versions: original; plain text
681. 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: abs; analysis; approach; asr; atomic; automata; automaton; channels; checking; concurrent; consumer; consumption; control; design; e m; e n; e t; eceasst; event; example; execution; figure; foo; formal; idea; ieee; language; level; locations; m p; main; memory; methods; micro; model; module; n t; native; optimization; order; overhead; p r; p t; problem; processes; producer; r e; representation; results; s e; scheduler; section; semantics; set; simulation; state; systemc; systemc methods; t t; time; transformation; uppaal; use; value; variables; verification; volume
     • versions: original; plain text
682. 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: abstract; applications; approach; appropriate; attribute; concepts; concrete; corresponding; coupling; different; distributed; edge; eds; elements; example; figure; functionality; grabats; graph; graph transformation; hand; interfaces; left; local; management; manager; modeling; new; node; objects; progres; reference; remote; requirements; resource; runtime; schema; section; self; similar; software; specification; specifier; systems; task; transformation; transformation systems; types; use; visual; volume; way
     • versions: original; plain text
683. 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: @perm; abstract; access; access permissions; acq; algorithm; analysis; approach; b l; checker; checking; class; concurrency; different; dimensions; e d; e n; e s; eceasst; evmdd; exe; f u; global; invariants; l e; l l; l s; language; local; matrix; method; model; mtts; muteximpl; n n; n s; n u; notacq; number; object; p u; parallel; permissions; plural; possible; proceedings; program; properties; pulse; pure; q u; r e; read; reference; results; s =; s s; s t; s u; section; set; smc; software; specifications; t e; t h; table; tool; transition; typestates; u b; u e; u l; u r; u t; verification; volume; work
     • versions: original; plain text
684. 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: analysis; approach; bw1; case; checking; choice; clear; collision; control; controller; controltable; csp||b; ctl; ctrl; derailment; domain; double; eceasst; end; engineers; events; example; exit; figure; formal; generic; industrial; information; interlocking; junction; line; machine; modelling; models; number; operation; p101; p102; p103; p104; paper; plan; points; pos; position; prob; process; processes; railway; red; release; route; safety; scheme; section; set; signal; state; study; system; table; traces; track; train; variables; verification; volume; winter; work
     • versions: original; plain text
685. 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: = ̂; access; apparent; approach; behaviour; command; composition; concurrent; conditions; deterministic; evaluation; evaluators; example; following; fractional; guard; hayes; hbdj11; hold; idle; iff; interval; lemma; logic; non; note; parallel; permissions; possible; predicate; process; processes; programs; properties; read; real; reasoning; rely; set; sets; stable; state; stream; systems; temporal; time; true; value; variable; volume; write
     • versions: original; plain text
686. 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: actions; agent; analysis; assocabort; assocrelreq; assocreq; buffer; bugs; case; charts; clear; committee; communication; configuration; correctness; data; devices; different; eceasst; figure; formal; health; iee08; ieee; inconsistent; information; initial; issues; language; machines; manager; mcrl2; measurement; message; model; modelling; number; operating; paper; phase; problems; process; processes; properties; property; protocol; requirements; rest; section; session; session setup; setup; setup protocol; signal; sort; standard; state; state machines; std; system; tables; transition; uml; unassociated; use; verification; verifying; version; volume
     • versions: original; plain text
687. 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: abstract; abstraction; approach; array; atomic; case; changes; concrete; data; different; element; elmas; execution; false; findslot; function; global; idle; implementation; insertpair; inv; kiv; linearizability; linearizable; linearization; local; location; locked; lookup; ls.pc; lsq; multiset; non; obligations; operation; point; predicate; process; processes; program; proof; proving; refinement; reserved; result; return; section; simulation; slot; specification; state; status; step; study; theory; true; type; use; value; variables; volume
     • versions: original; plain text
688. 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: acm; algorithm; approach; book; chapter; child; code; containment; current; data; database; eceasst; elements; example; figure; form; graph; information; instance; integration; intermediate; international; languages; large; library; management; matching; method; model; modelling; mpm; multi; nodes; normal; paradigm; pattern; present; queries; query; querying; relationships; results; root; scenarios; search; section; set; solution; source; structural; subject; techniques; transformation; tree; type; use; volume; wildcard; work; xml; xpath
     • versions: original; plain text
689. 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: a).rrsign; abstract; answer; attacks; authoritative; cache; case; chain; coq; corresponding; data; database; def=; dns; dnssec; dnssec model; domain; eceasst; event; execution; extensions; field; figure; following; formal; i).rrset′; idx; information; integrity; isserver; key; keys; ksk; message; model; names; nsec; opencert; particular; poisoning; pre; process; proof; properties; protocol; public; query; received; record; resource; response; rfc; rollover; rrset; rrsig; rrzsk; s srv; s.serverkeys; s.viewauth; section; security; server; server srv; set; signature; specification; srv; standard; state; system; s′.viewcache; timeout; trust; type; use; valid; view; volume; zone; zsk
     • versions: original; plain text
690. 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: axiom; cone; conflicts; conflictset.t; conjunctive; coq; definition; dependencies; dependency; direct; distributions; example; filter; forall; formalisation; function; installable; module; package.t; packages; packageset.t; parameter; proj1; proof; prop; set; sig; strong; theorem; theory; type; verification
     • versions: original; plain text
691. 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: analysis; attributes; bazaar; best; best practices; better; big; c(x; classes; classic; code; communities; community; companies; control; correlation; data; design; developers; development; different; documentation; eceasst; effort; example; fact; fan; files; forks; functional; gem; github; good; high; hosting; information; instance; level; maintainability; method; methodologies; metrics; model; nbps; need; new; non; number; open; open source; opencert; oss; ossp; people; possible; practices; proc; process; program; project; quality; rails; related; requirements; results; role; ror; ruby; rules; similar; simple; size; software; source; source code; source projects; source software; standards; study; system; table; time; total; traditional; use; users; volume; way; web; weighted; work
     • versions: original; plain text
692. 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: approach; checkonly; classname; clause; column; comparison; conflict; different; domain; eceasst; elements; equivalence; example; exogenous; exogenous model; fig; framework; generic; information; input; language; management; means; merge; merging; metamodel; model; model management; model merging; model transformation; mof; moment; new; operator; prefix; proceedings; process; qvt; rdbms; rdbmsdomain; relation; relationships; resolution; schema; section; setra; software; specific; strategy; string; table; target; trace; transformation; uml; volume
     • versions: original; plain text
693. 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: approach; architecture; block; class; code; complex; computer; corresponding; current; design; diagrams; different; eceasst; eclipse; editor; environment; features; figure; framework; fujaba; gef; germany; grabats; graph; graphical; gui; information; java; language; level; model; modifications; new; parser; plex; plex code; plug; process; progres; prototype; reengineering; replex; reverse; science; section; signal; software; source; source code; specification; state; story; structure; structure graph; subsystem; support; systems; telecommunication; tool; transformation; txl; user; view; volume
     • versions: original; plain text
694. 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; activity; analysis; certification; code; collaboration; collaboration effectiveness; communications; communities; community; context; contribution; contributors; coverity; data; development; eceasst; effectiveness; engagement; factors; figure; filtering; floss; floss community; free; high; indicators; individual; information; interaction; interplay; learning; level; measure; messages; metrics; mining; model; n2(t; network; number; online; open; open source; opencert; practice; process; product; production; productivity; project; quality; report; reputation; scan; section; social; software; source; source software; specific; stage; systems; task; team; terms; time; trust; user; volume
     • versions: original; plain text
695. 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; big; causes; certification; closed; code; communication; community; community antipatterns; companies; company; consequences; context; contributors; data; description; developers; development; different; eceasst; example; external; figure; floss; floss antipatterns; floss community; floss development; floss projects; form; general; identification; information; laplante; level; management; measure; ontology; opencert; order; problems; process; product; project; quality; quantitative; refactored; refactoring; result; section; situation; software; solution; source; spaghetti; sparse; structure; support; symptoms; technology; template; tools; use; volume; web
     • versions: original; plain text
696. 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; activity patterns; actors; analysis; antipatterns; approach; basic; bug; cerone; code; collaboration; commit; communication; communities; community; contents; contribution; contributors; data; descriptive; developers; development; documentation; eceasst; effectiveness; engagement; engineering; explicit; figure; free; high; impact; individual; information; interaction; international; knowledge; large; learning; learning process; level; management; mining; models; motivations; new; observe; ontology; open; open source; opencert; organisation; oss; oss community; oss learning; participants; patterns; peer; post; practices; proceedings; process; processes; product; production; productivity; project; quality; reports; repositories; reputation; roles; section; social; software; software quality; source; source software; sowe; stage; support; systems; terms; text; tools; understanding; use; volume
     • versions: original; plain text
697. 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; adaptation design; adaptive; application; approach; attention; behavior; change; computer; consistency; context; controllability; controllable; design; design variation; device; different; event; general; goals; guidelines; high; human; indoor; information; interaction; interface; map; meet; mobile; navigation; notification; notification design; participants; particular; pop; position; principles; problem; reaction; recommendations; row; service; software; strip; study; system; tasks; transparency; usability; usable; user; variation
     • versions: original; plain text
698. 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; artifacts; case; communication; concept; context; coordination; coordination information; coordination spaces; decentralized; declarative; design; dht; different; distributed; distribution; enactment; endpoint; environment; event; figure; framework; functionality; information; infrastructure; jadex; local; logic; mas; mechanisms; media; medium; model; multiple; network; nodes; organizing; paper; peer; peer coordination; proc; programming; publish; related; remote; scribe; self; service; spaces; study; subscribe; support; systems; tuple; usage; volume; work
     • versions: original; plain text
699. 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: adaptation; aging; air; anti; approach; automation; behaviour; cases; changes; code; continuous; contribution; control; coverage; current; cycle; different; domain; eceasst; engineering; evolution; example; explicit; extensive; figure; general; human; improvements; keeping; knowledge; learning; length; mechanism; model; modification; new; operational; operator; order; pace; phase; proc; process; production; quality; requirements; research; runtime; sacs; scenarios; simulation; socodis; software; system; test; test cases; testing; tube; updates; validation; violation; vision; volume
     • versions: original; plain text
700. 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: abstract; agraph; api; attribute; automated; code; corresponding; data; definition; description; development; different; eceasst; edge; element; example; exchange; figure; file; format; function; generation; grabats; gxl; hyperedge; implementation; import; information; instance; java; kind; language; libraries; library; list; net; nets; node; petri; place; proc; programming; representation; root; schema; science; section; software; specification; structure; syntax; textual; tools; tree; type; unit; volume; work; xml
     • versions: original; plain text
701. 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: certification; event; floss; foundations; international; open; opencert; proceedings; satellite; software; source; techniques; volume; workshop
     • versions: original; plain text
702. 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: adaptive; approach; clusterhead; communication; conference; delay; delivery; demand; different; disaster; distance; eceasst; exchange; ferry; figure; framework; group; heterogeneous; hoc; international; layer; list; management; manets; members; membership; message; mobile; multicast; networking; networks; new; nodes; overhead; paper; protocol; reliable; resolution; rmda; routing; sacs; scenarios; socodis; step; system; tolerant; traffic; volume
     • versions: original; plain text
703. 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: actual; algorithm; basic; characteristics; communication; conference; data; dbm; deviation; direction; distance; doi:10.1109; eceasst; estimation; exploration; fig; ieee; information; international; knowledge; line; localization; mean; measurements; mobile; models; necessary; network; network nodes; nodes; noise; odometry; order; parameters; physical; range; robot; robotics; robust; robustness; rssi; sacs; scenarios; sensory; signal; simulation; socodis; speed; standard; strategies; study; tasks; typical; use; volume; way; wireless; wireless network
     • versions: original; plain text
704. 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: aodv; application; approaches; area; available; batman; bundle; characteristics; communication; connected; connectivity; control; data; decision; delay; delivery; destination; disaster; diverse; dtn; dtn routing; dymo; emergency; end; figure; forward; hoc; hybrid; hybrid manet; information; link; manet; manet routing; mechanisms; message; model; network; networking; nodes; olsr; operations; order; overview; packets; paper; partition; path; probability; proc; protocol; range; responders; response; route; routing; routing protocol; scenario; schemes; store; suited; time; transmission; use; wireless
     • versions: original; plain text
705. 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: adaptive; applied; autonomous; berlin; challenges; communication; disaster; hamburg; ilmenau; kassel; michael; organization; preface; sacs; scenarios; sciences; self; socodis; systems; technische; universität; university; workshop; zapf
     • versions: original; plain text
706. 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; agents; approach; area; article; casualty; communication; data; demonstrator; devices; different; eceasst; environment; evaluation; exchange; figure; forces; goals; incident; information; jena; layer; library; management; mass; mci; mobile; model; nodes; parts; patient; place; plan; positioning; proceedings; professional; project; rescue; role; routing; run; sacs; scenario; schau; self; service; short; simulation; simulationagent; smac; socodis; software; specific; speedup; staging; system; technical; title; transport; treatment; triage; volkmar; volume
     • versions: original; plain text
707. 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: bazaar; characteristics; code; communication; community; contribution; contributors; delone; developers; development; different; figure; free; impact; information; literature; mclean; measures; model; necessary; number; open; open source; organization; oss; oss projects; paper; people; process; product; projects; quality; release; role; section; software; source; source software; success; successful; systems; traditional; users; volume; volunteers
     • versions: original; plain text
708. 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 a