Rewriting Logic and Its Applications

Given a graph-grammar formalization of DSLs, we build on graph transformation system morphisms to define parameterized DSLs and their instantiation by an amalgamation construction. Results on the protection of the behavior along the induced morphisms allow us to safely combine definitions of DSLs to build more complex ones. We illustrate our proposal on our e-Motions definition of the Palladio DSL. The resulting DSL allows us to carry on performance analysis on Palladio models.

[1]  Claude Kirchner,et al.  Incremental Construction of Unification Algorithms in Equational Theories , 1983, ICALP.

[2]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[3]  José Meseguer,et al.  Folding variant narrowing and optimal variant termination , 2010, J. Log. Algebraic Methods Program..

[4]  Reiko Heckel,et al.  A Combined Reference Model- and View-Based Approach to System Specification , 1997, Int. J. Softw. Eng. Knowl. Eng..

[5]  Juan de Lara,et al.  From types to type requirements: genericity for model-driven engineering , 2011, Software & Systems Modeling.

[6]  João Araújo,et al.  MATA: A Unified Approach for Composing UML Aspect Models Based on Graph Transformation , 2009, LNCS Trans. Aspect Oriented Softw. Dev..

[7]  Francisco Durán,et al.  Dynamic Validation of OCL Constraints with mOdCL , 2011, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[8]  Hartmut Ehrig,et al.  Introduction to the Algebraic Theory of Graph Grammars (A Survey) , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[9]  Hartmut Ehrig,et al.  The Category of Typed Graph Grammars and its Adjunctions with Categories , 1994, TAGT.

[10]  Hillel Kugler,et al.  Model Checking Using SMT and Theory of Lists , 2011, NASA Formal Methods.

[11]  Jean-Marie Hullot,et al.  Canonical Forms and Unification , 1980, CADE.

[12]  Hartmut Ehrig,et al.  Fundamental Theory for Typed Attributed Graph Transformation , 2004, ICGT.

[13]  Maribel Fernández.  AC Complement Problems: Satisfiability and Negation Elimination , 1996, J. Symb. Comput..

[14]  Heiko Koziolek,et al.  Facilitating Performance Predictions Using Software Components , 2011, IEEE Software.

[15]  Chris J. Myers,et al.  Bounded Model Checking of Analog and Mixed-Signal Circuits Using an SMT Solver , 2007, ATVA.

[16]  Patrick Viry,et al.  Equational rules for rewriting logic , 2002, Theor. Comput. Sci..

[17]  Francesco Parisi-Presicce,et al.  Spatial and Temporal Refinement of Typed Graph Transformation Systems , 1998, MFCS.

[18]  Antonio Vallecillo,et al.  On the Behavioral Semantics of Real-Time Domain Specific Visual Languages , 2010, WRLA.

[19]  Steffen Zschaler,et al.  Modular DSLs for Flexible Analysis: An e-Motions Reimplementation of Palladio , 2014, ECMFA.

[20]  Annegret Habel,et al.  Correctness of high-level transformation systems relative to nested conditions† , 2009, Mathematical Structures in Computer Science.

[21]  Juan de Lara,et al.  Automating the transformation-based analysis of visual languages , 2009, Formal Aspects of Computing.

[22]  Francesco Parisi-Presicce,et al.  Formal Software Specification with Refinements and Modules of Typed Graph Transformation Systems , 2002, J. Comput. Syst. Sci..

[23]  Hartmut Ehrig,et al.  Adhesive High-Level Replacement Categories and Systems , 2004, ICGT.

[24]  Francesco Parisi-Presicce,et al.  Transformations of Graph Grammars , 1994, TAGT.

[25]  Francisco Durán,et al.  Behaviour Protection in Modular Rule-Based System Specifications , 2012, WADT.

[26]  Albert Zündorf,et al.  The PROGRES approach: language and environment , 1999 .

[27]  Peter Csaba Ölveczky,et al.  Formal Simulation and Analysis of the CASH Scheduling Algorithm in Real-Time Maude , 2006, FASE.

[28]  Kim Marriott,et al.  Explicit representation of terms defined by counter examples , 1986, Journal of Automated Reasoning.

[29]  José Meseguer,et al.  Symbolic Model Checking of Infinite-State Systems Using Narrowing , 2007, RTA.

[30]  José Meseguer,et al.  Membership algebra as a logical framework for equational specification , 1997, WADT.

[31]  David Sinclair,et al.  Automatic Approximation for the Verification of Cryptographic Protocols , 2002, FASec.

[32]  Natarajan Shankar,et al.  PVS: A Prototype Verification System , 1992, CADE.

[33]  José Meseguer,et al.  Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols , 2007, High. Order Symb. Comput..

[34]  Cesare Tinelli,et al.  Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T) , 2006, JACM.

[35]  ÖlveczkyPeter Csaba,et al.  Semantics and pragmatics of Real-Time Maude , 2007 .

[36]  Greg Nelson,et al.  Simplification by Cooperating Decision Procedures , 1979, TOPL.

[37]  Antonio Vallecillo,et al.  Simulating domain specific visual models by observation , 2010, SpringSim.

[38]  Jacques Klein,et al.  Semantic-based weaving of scenarios , 2006, AOSD.

[39]  Grigore Rosu,et al.  Matching logic: a new program verification approach (NIER track) , 2011, 2011 33rd International Conference on Software Engineering (ICSE).

[40]  José Meseguer,et al.  The Temporal Logic of Rewriting: A Gentle Introduction , 2008, Concurrency, Graphs and Models.

[41]  Reiko Heckel,et al.  Structural and behavioural compatibility of graphical service specifications , 2007, J. Log. Algebraic Methods Program..

[42]  Nikolaj Bjørner,et al.  An SMT Approach to Bounded Reachability Analysis of Model Programs , 2008, FORTE.

[43]  José Meseguer,et al.  Rewriting Modulo SMT , 2013 .

[44]  Eelco Visser,et al.  Code generation by model transformation: a case study in transformation modularity , 2008, Software & Systems Modeling.

[45]  Steffen Becker,et al.  Model-Based performance prediction with the palladio component model , 2007, WOSP '07.

[46]  Gabriele Taentzer,et al.  DIEGO, another step towards a module concept for graph transformation systems , 1995, SEGRAGRA.

[47]  Stephan Merz,et al.  Model Checking , 2000 .

[48]  Francisco Durán,et al.  On the Reusable Specification of Non-functional Properties in DSLs , 2012, SLE.

[49]  Toshinori Takai,et al.  A Verification Technique Using Term Rewriting Systems and Abstract Interpretation , 2004, RTA.

[50]  Juan de Lara,et al.  Genericity for model management operations , 2011, Software & Systems Modeling.

[51]  Reiko Heckel,et al.  Classification and comparison of module concepts for graph transformation systems , 1999 .

[52]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[53]  José Meseguer,et al.  Abstract Logical Model Checking of Infinite-State Systems Using Narrowing , 2013, RTA.

[54]  Antonio Vallecillo,et al.  Model-driven performance analysis of rule-based domain specific visual models , 2013, Inf. Softw. Technol..

[55]  Douglas C. Schmidt,et al.  Model-Driven Engineering , 2006 .

[56]  R. Nino,et al.  Symbolic reachability analysis for rewrite theories , 2012 .

[57]  Maribel Fernández.  Negation Elimination in Empty or Permutative Theories , 1998, J. Symb. Comput..

[58]  Arie van Deursen,et al.  Domain-specific languages: an annotated bibliography , 2000, SIGP.

[59]  C.-H. Luke Ong,et al.  Verifying higher-order functional programs with pattern-matching algebraic data types , 2011, POPL '11.

[60]  H. Kreowski,et al.  Graph transformation units and modules , 1999 .

[61]  José Meseguer,et al.  Model checking linear temporal logic of rewriting formulas under localized fairness , 2015, Sci. Comput. Program..

[62]  Pawel Sobocinski,et al.  Adhesive Categories , 2004, FoSSaCS.

[63]  Reiko Heckel,et al.  Horizontal and vertical structuring of typed graph transformation systems , 1996, Mathematical Structures in Computer Science.

[64]  Stéphanie Delaune,et al.  The Finite Variant Property: How to Get Rid of Some Algebraic Properties , 2005, RTA.

[65]  Uwe Fink,et al.  Performance Solutions A Practical Guide To Creating Responsive Scalable Software , 2016 .

[66]  José Meseguer,et al.  Equational abstractions , 2008, Theor. Comput. Sci..

[67]  Jacques Klein,et al.  Reusable Aspect Models , 2007 .

[68]  José Meseguer,et al.  Design and Analysis of Cloud-Based Architectures with KLAIM and Maude , 2012, WRLA.

[69]  Antonio Vallecillo,et al.  A graphical approach for modeling time-dependent behavior of DSLs , 2009, 2009 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC).

[70]  Alberto Verdejo,et al.  Implementing CCS in Maude 2 , 2002, Electron. Notes Theor. Comput. Sci..

[71]  Joël Ouaknine,et al.  State/Event-Based Software Model Checking , 2004, IFM.