BibSonomyburst/user/minasBibSonomy RSS feed for /user/minas2012-02-15T04:22:04+01:00http://www.bibsonomy.org/bibtex/2c89fcf310595c0c15c1031608d322de1/minasminas2011-12-01T08:28:55+01:002008 Scala <span class="authorEditorList"><a href="/author/Odersky">Martin Odersky</a>, <a href="/author/Spoon">Lex Spoon</a>, and <a href="/author/Venners">Bill Venners</a> </span><em>Artima, </em><em>Mountain View, CA, </em>(<em>2008</em>)Thu Dec 01 08:28:55 CET 2011Mountain View, CAProgramming in Scala20082008 Scala Scala is an object-oriented programming language for the Java Virtual Machine. In addition to being object-oriented, Scala is also a functional language, and combines the best approaches to OO and functional programming. In Italian, Scala means a stairway, or steps---indeed, Scala lets you step up to a programming environment that incorporates some of the best recent thinking in programming language design while also letting you use all your existing Java code.http://www.bibsonomy.org/bibtex/22ae169e1fe6394ac8b5526db97aa492b/minasminas2011-08-12T22:06:13+02:002010 GraGra <span class="authorEditorList"><a href="/author/Orejas">Fernando Orejas</a>, and <a href="/author/Lambers">Leen Lambers</a> </span><em>ECEASST</em> (<em>2010</em>)Fri Aug 12 22:06:13 CEST 2011ECEASSTSymbolic Attributed Graphs for Attributed Graph Transformation.3020102010 GraGra http://www.bibsonomy.org/bibtex/254353fea273de5c8855918826c4ecfac/minasminas2011-08-12T22:05:48+02:002011 GraGra <span class="authorEditorList"><a href="/author/Orejas">Fernando Orejas</a> </span><em>J. Symb. Comput.</em> <em>46(3):294-315</em> (<em>2011</em>)Fri Aug 12 22:05:48 CEST 2011J. Symb. Comput.3294-315Symbolic graphs for attributed graph constraints.4620112011 GraGra http://www.bibsonomy.org/bibtex/2e7d3d38bd13c3f6820db0a08ca33400c/minasminas2011-08-06T16:51:52+02:002011 ConferencePaper DiaGen Layout SonjaMaier myown <span class="authorEditorList"><a href="/author/Maier">Sonja Maier</a>, and <a href="/author/Minas">Mark Minas</a> </span><em>Proc. of the 2nd International Workshop on Visual Formalisms for Patterns, satellite of VL/HCC&#039;10, Leganés-Madrid, Spain, September 21, 2010, </em><em>volume 31 of Electronic Communications of the EASST, </em>(<em>2010</em>)Sat Aug 06 16:51:52 CEST 2011Proc. of the 2nd International Workshop on Visual Formalisms for Patterns, satellite of VL/HCC'10, Legan{\'e}s-Madrid, Spain, September 21, 2010Electronic Communications of the EASSTCombination of Different Layout Approaches3120102011 ConferencePaper DiaGen Layout SonjaMaier myown http://www.bibsonomy.org/bibtex/2f335d61255862b1220512e4d21095315/minasminas2011-04-08T08:29:03+02:002010 DiaPlan GraGra myown <span class="authorEditorList"><a href="/author/Minas">Mark Minas</a>, and <a href="/author/Schneider">Hans Jürgen Schneider</a> </span><em>Graph Transformations and Model Driven Enginering -- Essays Dedicated to Manfred Nagl on the Occasion of his 65th Birthday, </em><em>volume 5765 of Lecture Notes in Computer Science, </em><em>Springer-Verlag, </em>(<em>2010</em>)Fri Apr 08 08:29:03 CEST 2011Graph Transformations and Model Driven Enginering -- Essays Dedicated to Manfred Nagl on the Occasion of his 65th Birthday34-59Lecture Notes in Computer ScienceGraph Transformation by Computational Category Theory576520102010 DiaPlan GraGra myown The categorical approach is well-suited for concise definitions of graph transformation concepts. At the same time, it allows for elegant proofs of their properties. We show that these categorical concepts also allow for a similarly simple and modular implementation of graphs and graph transformations by following first present an implementation of some categorical definitions and constructions, e.g., colimits, in Java, and we demonstrate how this language supports the genericity of the categorical approach. We then show that applying the constructions to the category of sets as well as the category of graphs already provides an implementation of graph transformations that can be used as the foundation of an extensible graph transformation language.http://www.bibsonomy.org/bibtex/2360d27d12b7741f330a81f3c87809879/minasminas2011-04-08T08:20:54+02:002010 ConferencePaper DiaGen myown sketching <span class="authorEditorList"><a href="/author/Mazanek">Steffen Mazanek</a>, <a href="/author/Rutetzki">Christian Rutetzki</a>, and <a href="/author/Minas">Mark Minas</a> </span><em>Proceedings of the Fourth International Workshop on Graph-Based Tools GraBaTs 2010, University of Twente, Enschede, The Netherlands, September 28, 2010. Satellite event of ICGT&#039;10, </em><em>volume 32 of Electronic Communications of the EASST, </em>(<em>2010</em>)Fri Apr 08 08:20:54 CEST 2011Proceedings of the Fourth International Workshop on Graph-Based Tools (GraBaTs 2010), University of Twente, Enschede, The Netherlands, September 28, 2010. Satellite event of ICGT'10Electronic Communications of the EASSTSketch-based Diagram Editors with User Assistance based on Graph Transformation and Graph Drawing Techniques3220102010 ConferencePaper DiaGen myown sketching http://www.bibsonomy.org/bibtex/227edc5b590301a2a802a5c19f99a7500/minasminas2011-04-08T08:20:54+02:002010 Animation ConferencePaper DiaGen myown <span class="authorEditorList"><a href="/author/Strobl">Torsten Strobl</a>, <a href="/author/Minas">Mark Minas</a>, <a href="/author/Pleuß">Andreas Pleuß</a>, and <a href="/author/Vitzthum">Arnd Vitzthum</a> </span><em>Proceedings of the Fourth International Workshop on Graph-Based Tools GraBaTs 2010, University of Twente, Enschede, The Netherlands, September 28, 2010. Satellite event of ICGT&#039;10, </em><em>volume 32 of Electronic Communications of the EASST, </em>(<em>2010</em>)Fri Apr 08 08:20:54 CEST 2011Proceedings of the Fourth International Workshop on Graph-Based Tools (GraBaTs 2010), University of Twente, Enschede, The Netherlands, September 28, 2010. Satellite event of ICGT'10Proceedings of the Fourth International Workshop on Graph-Based Tools (GraBaTs 2010). Appears in Electronic Communications of the EASSTElectronic Communications of the EASSTFrom the Behavior Model of an Animated Visual Language to its Editing Environment Based on Graph Transformation3220102010 Animation ConferencePaper DiaGen myown http://www.bibsonomy.org/bibtex/2013182bbb3a7cea746c6fb20d01be3c2/minasminas2011-03-13T11:11:25+01:002010 ConferencePaper DiaGen Layout SonjaMaier myown <span class="authorEditorList"><a href="/author/Maier">Sonja Maier</a>, and <a href="/author/Minas">Mark Minas</a> </span><em>CHI Extended Abstracts, </em><em>page 4111-4116. </em>(<em>2010</em>)Sun Mar 13 11:11:25 CET 2011CHI Extended AbstractsCHI:2010a4111-4116Interactive diagram layout20102010 ConferencePaper DiaGen Layout SonjaMaier myown http://www.bibsonomy.org/bibtex/2648336a007ff6fe9be04c523905e1e35/minasminas2010-10-21T17:36:50+02:002009 metamodel <span class="authorEditorList"><a href="/author/Steinberg">Dave Steinberg</a>, <a href="/author/Budinsky">Frank Budinsky</a>, <a href="/author/Paternostro">Marcelo Paternostro</a>, and <a href="/author/Merks">Ed Merks</a> </span><em>Addison-Wesley, </em><em>Boston, MA, </em><em>2 edition, </em>(<em>2009</em>)Thu Oct 21 17:36:50 CEST 2010Boston, MA2EMF: Eclipse Modeling Framework20092009 metamodel The Eclipse Modeling Framework enables developers to rapidly construct robust applications based on surprisingly simple models. Now, in this thoroughly revised Second Edition, the project’s developers offer expert guidance, insight, and examples for solving real-world problems with EMF, accelerating development processes, and improving software quality.http://www.bibsonomy.org/bibtex/2f9eddce4448dd27ab905a67fa035cd2e/minasminas2010-10-16T14:35:43+02:002005 metamodel <span class="authorEditorList"><a href="/author/Bézivin">Jean Bézivin</a> </span><em>Software and System Modeling</em> <em>4(2):171-188</em> (<em>2005</em>)Sat Oct 16 14:35:43 CEST 2010Software and System Modeling2171-188On the Unification Power of Models.420052005 metamodel dblphttp://www.bibsonomy.org/bibtex/257d1993b303396a88d216761fd41502a/minasminas2010-09-01T09:42:23+02:002010 Editor myown <span class="authorEditorList"><a href="/author/DeLine">Robert DeLine</a>, and <a href="/author/Minas">Mark Minas</a> (Eds.). </span>(<em>December 2010</em>)Wed Sep 01 09:42:23 CEST 2010decSpecial Issue: Selected papers from {VL/HCC'09}21/520102010 Editor myown http://www.bibsonomy.org/bibtex/2dd03d09eae3d4c7cffcff85656c811b2/minasminas2010-09-01T09:20:58+02:002010 Animation ConferencePaper DiaGen GraGra myown <span class="authorEditorList"><a href="/author/Strobl">Torsten Strobl</a>, and <a href="/author/Minas">Mark Minas</a> </span><em>Proceedings of the 9th International Workshop on Graph Transformation and Visual Modeling Techniques GT-VMT 2010, March 20-21 2010, Paphos, Cyprus, </em><em>volume 29 of Electronic Communications of the EASST, </em>(<em>2010</em>)Wed Sep 01 09:20:58 CEST 2010Proceedings of the 9th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2010), March 20-21 2010, Paphos, CyprusElectronic Communications of the EASSTSpecifying and Generating Editing Environments for Interactive Animated Visual Models2920102010 Animation ConferencePaper DiaGen GraGra myown The behavior of a dynamic system is most easily understood if it is illustrated by a visual model that is animated over time. Graphs are a widely accepted approach for representing such dynamic models in an abstract way. System behavior and, therefore, model behavior corresponds to modifications of its representing graph over time. Graph transformations are an obvious choice for specifying these graph modifications and, hence, model behavior. Existing approaches use a graph to represent the static state of a model whereas modifications of this graph are described by graph transformations that happen instantaneously, but whose durations are stretched over time in order to allow for smooth animations. However, long-running and simultaneous animations of different parts of a model as well as interactions during animations are difficult to specify and realize that way. This paper describes a different approach. A graph does not necessarily represent the static aspect of a model, but rather represents the currently changing model. Graph transformations, when triggered at specific points of time, modify such graphs and thus start, change, or stop animations. Several concurrent animations may simultaneously take place in a model. Graph transformations can easily describe interactions within the model or between user and model, too. This approach has been integrated into the DiaMeta framework that now allows for specifying and generating editing environments for interactive animated visual models. The approach is demonstrated using the game Avalanche where many parallel and interacting movements take place.http://www.bibsonomy.org/bibtex/286a2afdf366e35e267ebd901a8c225de/minasminas2010-09-01T09:19:41+02:002010 ConferencePaper DiaPlan GraGra metamodel myown <span class="authorEditorList"><a href="/author/Hoffmann">Berthold Hoffmann</a>, and <a href="/author/Minas">Mark Minas</a> </span><em>Proceedings of the 9th International Workshop on Graph Transformation and Visual Modeling Techniques GT-VMT 2010, March 20-21 2010, Paphos, Cyprus, </em><em>volume 29 of Electronic Communications of the EASST, </em>(<em>2010</em>)Wed Sep 01 09:19:41 CEST 2010Proceedings of the 9th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2010), March 20-21 2010, Paphos, CyprusElectronic Communications of the EASSTDefining Models - Meta Models versus Graph Grammars2920102010 ConferencePaper DiaPlan GraGra metamodel myown The precise specification of software models is a major concern in model-driven design of object-oriented software. In this paper, we investigate how program graphs, a language-independent model of object-oriented programs, can be specified precisely, with a focus on shape (static structure) rather than behavior. The metamodel-based approach is an apparent choice for such a specification; graph grammars are another natural candidate for specifying the shape of a class of graphs. However, star grammars (equivalent to the well-known hyperedge replacement grammars) do not allow all properties of program graphs to be specified. So we propose contextual star grammars as an extension of this mechanism. We discuss the specifications of program graphs by metamodels and by contextual star grammars.http://www.bibsonomy.org/bibtex/268301c9d3e31e87cc734cc7865baa9e5/minasminas2010-08-19T10:07:23+02:002009 GraGra UML <span class="authorEditorList"><a href="/author/Kuske">Sabine Kuske</a>, <a href="/author/Gogolla">Martin Gogolla</a>, <a href="/author/Kreowski">Hans-Jörg Kreowski</a>, and <a href="/author/Ziemann">Paul Ziemann</a> </span><em>Software and System Modeling</em> <em>8(3):403-422</em> (<em>2009</em>)Thu Aug 19 10:07:23 CEST 2010Software and System Modeling3403-422Towards an integrated graph-based semantics for {UML}820092009 GraGra UML dblphttp://www.bibsonomy.org/bibtex/2418d9e3ccc4f3c70927c7f54ac415120/minasminas2010-07-11T12:43:09+02:002009 GraGra metamodel <span class="authorEditorList"><a href="/author/Ehrig">Karsten Ehrig</a>, <a href="/author/Küster">Jochen Malte Küster</a>, and <a href="/author/Taentzer">Gabriele Taentzer</a> </span><em>Software and System Modeling</em> <em>8(4):479-500</em> (<em>2009</em>)Sun Jul 11 12:43:09 CEST 2010Software and System Modeling4479-500Generating Instance Models from Meta Models820092009 GraGra metamodel http://www.bibsonomy.org/bibtex/27b42b9b55969acfce759de615f0710df/minasminas2010-07-11T12:40:19+02:002004 GraGra metamodel <span class="authorEditorList"><a href="/author/Bardohl">Roswitha Bardohl</a>, <a href="/author/Ehrig">Hartmut Ehrig</a>, <a href="/author/de Lara">Juan de Lara</a>, and <a href="/author/Taentzer">Gabriele Taentzer</a> </span><em>Proc. Fundamental Approaches to Software Engineering FASE&#039;04, </em><em>volume 2984 of Lecture Notes in Computer Science, </em><em>page 214--228. </em><em>Springer-Verlag, </em>(<em>2004</em>)Sun Jul 11 12:40:19 CEST 2010Proc. Fundamental Approaches to Software Engineering (FASE'04)214--228Lecture Notes in Computer ScienceIntegrating Meta-modelling Aspects with Graph Transformation for Efficient Visual Language Definition and Model Manipulation298420042004 GraGra metamodel Visual languages (VLs) play a central role in modelling various system aspects. Besides standard languages like UML, a variety of domain-specific languages exist which are the more used the more tool support is available for them. Different kinds of generators have been developed which produce visual modelling environments based on VL specifications. To define a VL, declarative as well as constructive approaches are used. The meta modelling approach is a declarative one where classes of symbols and relations are defined and associated to each other. Constraints describe additional language properties. Defining a VL by a graph grammar, the constructive way is followed where graphs describe the abstract syntax of models and graph rules formulate the language grammar. In this paper, we extend algebraic graph grammars by a node type inheritance concept which opens up the possibility to integrate both approaches by identifying symbol classes with node types and associations with edge types of some graph class. In this way, declarative as well as constructive elements may be used for language definition and model manipulation. Two concrete approaches, the GenGED and the AToM 3 approach, illustrate how VLs can be defined and models can be manipulated by the techniques described above. ER -SpringerLink - Buchkapitelhttp://www.bibsonomy.org/bibtex/28c764e5d745b60e78e01b787bbfd1636/minasminas2010-07-02T08:38:10+02:002008 Spider-diagrams <span class="authorEditorList"><a href="/author/Delaney">Aidan Delaney</a>, <a href="/author/Taylor">John Taylor</a>, and <a href="/author/Thompson">Simon Thompson</a> </span><em>Diagrammatic Representation and Inference, 5th International Conference, Diagrams 2008, </em><em>volume 5223 of Lecture Notes in Artificial Intelligence, </em><em>page 172--187. </em><em>Springer-Verlag, </em>(<em>2008</em>)Fri Jul 02 08:38:10 CEST 2010Diagrammatic Representation and Inference, 5th International Conference, Diagrams 2008172--187Lecture Notes in Artificial IntelligenceSpider Diagrams of Order and a Hierarchy of Star-Free Regular Languages522320082008 Spider-diagrams The spider diagram logic forms a fragment of the constraint diagram logic and was designed to be primarily used as a diagrammatic software specification tool. Our interest is in using the logical basis of spider diagrams and the existing known equivalencesbetween certain logics, formal language theory classes and some automata to inform the development of diagrammatic logics.Such developments could have many advantages, one of which would be aiding software engineers who are familiar with formallanguages and automata to more intuitively understand diagrammatic logics. In this paper we consider relationships betweenspider diagrams of order (an extension of spider diagrams) and the star-free subset of regular languages. We extend the conceptof the language of a spider diagram to encompass languages over arbitrary alphabets. Furthermore, the product of spider diagramsis introduced. This operator is the diagrammatic analogue of language concatenation. We establish that star-free languagesare definable by spider diagrams of order equipped with the product operator and, based on this relationship, spider diagramsof order are as expressive as first order monadic logic of order.http://www.bibsonomy.org/bibtex/272a7ee6474882fe6545db7cb41ec272d/minasminas2010-06-14T14:15:56+02:002001 Multimedia UML <span class="authorEditorList"><a href="/author/Sauer">Stefan Sauer</a>, and <a href="/author/Engels">Gregor Engels</a> </span><em>Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments HCC 2001, </em><em>page 248-255. </em>(<em>2001</em>)Mon Jun 14 14:15:56 CEST 2010Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (HCC 2001)248-255{UML}-based behavior specification of interactive multimedia applications20012001 Multimedia UML Availability of precise, yet usable modeling languages is essential to the construction of multimedia systems based on software engineering principles and methods. Although several languages have been proposed for the specification of isolated multimedia system aspects, there not yet exists an integrated modeling language that adequately supports multimedia software development in practice. We propose an extension of the Unified Modeling Language (UML) for the integrated specification of multimedia systems based on an object-oriented development method. Since integration of co-existing timed procedural and interactive behavior is at the heart of multimedia systems, we focus on UML-based specification of behavior in this paper. In addition, we outline how these behavioral aspects are to be integrated with media, presentation, and software architecture modeling to achieve a coherent and consistent model.IEEE Xplore - UML-based behavior specification of interactive multimedia applicationshttp://www.bibsonomy.org/bibtex/22137d689ed2881e83aa6f84ed4a31074/minasminas2010-06-14T14:12:21+02:001999 Multimedia UML <span class="authorEditorList"><a href="/author/Sauer">Stefan Sauer</a>, and <a href="/author/Engels">Gregor Engels</a> </span><em>Proceedings 1999 IEEE Symposium on Visual Languages VL&#039;99, </em><em>page 80-87. </em>(<em>1999</em>)Mon Jun 14 14:12:21 CEST 2010Proceedings 1999 IEEE Symposium on Visual Languages (VL'99)80-87Extending {UML} for modeling of multimedia applications19991999 Multimedia UML An analysis of how visual modeling of structure and dynamic behavior of a multimedia application differs from modeling conventional software shows that aspects of the graphical user interface and time-dynamic behavior ought to be integral parts of a coherent multimedia application model. In this sense, we extend the model-view-controller paradigm towards multimedia. As a result, we present OMMMA-L, a visual language for the object-oriented modeling of multimedia applications, that is based on the Unified Modeling Language (UML). The structural and behavioral diagram types of UML have been analyzed and are adapted and extended according to multimedia application characteristics. A presentation diagram is introduced and integrated to adequately describe the visual presentation. In addition to explaining the different diagram types, we also give pragmatic guidelines on how to deploy and combine the various diagramsIEEE Xplore - Extending UML for modeling of multimedia applicationshttp://www.bibsonomy.org/bibtex/2b555af743ada2076f3e5ef02991ab78d/minasminas2010-05-26T14:08:08+02:001995 patterns <span class="authorEditorList"><a href="/author/Gamma">Erich Gamma</a>, <a href="/author/Helm">Richard Helm</a>, <a href="/author/Johnson">Ralph Johnson</a>, and <a href="/author/Vlissides">John Vlissides</a> </span><em>Addison-Wesley Longman Publishing Co., Inc., </em><em>Boston, MA, USA, </em>(<em>1995</em>)Wed May 26 14:08:08 CEST 2010Boston, MA, USADesign patterns: elements of reusable object-oriented software19951995 patterns design patterns marie robot software