Filters








7 Hits in 3.4 sec

Enforcing QVT-R with mu-Calculus and Games [chapter]

Julian Bradfield, Perdita Stevens
2013 Lecture Notes in Computer Science  
In previous work, we gave a precise game-theoretic semantics for the checkonly semantics of QVT-R transformations, including the recursive invocation of relations which is allowed and used, but not defined  ...  QVT-R is the standard Object Management Group bidirectional transformation language.  ...  The first author is partly supported by UK EPSRC grant EP/G012962/1 'Solving Parity Games and Mu-Calculi'.  ... 
doi:10.1007/978-3-642-37057-1_21 fatcat:wgnqawchfrgf5clxllmraf6mty

Recursive Checkonly QVT-R Transformations with General when and where Clauses via the Modal Mu Calculus [chapter]

Julian Bradfield, Perdita Stevens
2012 Lecture Notes in Computer Science  
In this paper we show how to interpret checkonly QVT-R -or any future model transformation language structured similarly -in the modal mu calculus and use its well-understood model-checking game to lift  ...  We demonstrate and justify a corresponding extension to the rules of the QVT-R game.  ...  The first author is partly supported by UK EPSRC grant EP/G012962/1 'Solving Parity Games and Mu-Calculi'.  ... 
doi:10.1007/978-3-642-28872-2_14 fatcat:xt7ud4mzd5bnfcgdvn6kih5lra

Model Transformation Languages with Modular Information Hiding

Andreas Rentschler
2015
To alleviate entailed maintenance efforts, this thesis presents a modularity concept with explicit interfaces, complemented by software visualization and clustering techniques.  ...  Model transformations, together with models, form the principal artifacts in model-driven software development.  ...  Acknowledgements It is obvious that, although a dissertation lists one individual as author, research and writing remains a communal enterprise.  ... 
doi:10.5445/ksp/1000045910 fatcat:uxid36iva5gprkihu6f4ixr3uy

Twenty Years of Rewriting Logic [chapter]

José Meseguer
2010 Lecture Notes in Computer Science  
Rewriting logic is a simple computational logic that can naturally express both concurrent computation and logical deduction with great generality.  ...  logical framework uses; (iii) its language implementations and its formal tools; and (iv) its many applications to automated deduction, software and hardware specification and verification, security,  ...  I thank the organizers of WRLA 2010 for giving me the opportunity and the stimulus to do some reflecting, surveying, and guessing about rewriting logic at this point, when twenty years have passed since  ... 
doi:10.1007/978-3-642-16310-4_2 fatcat:ho7s76r67nc63bndpoptbh5k4e

Twenty years of rewriting logic

José Meseguer
2012 The Journal of Logic and Algebraic Programming  
Rewriting logic is a simple computational logic that can naturally express both concurrent computation and logical deduction with great generality.  ...  logical framework uses; (iii) its language implementations and its formal tools; and (iv) its many applications to automated deduction, software and hardware specification and verification, security,  ...  I thank the organizers of WRLA 2010 for giving me the opportunity and the stimulus to do some reflecting, surveying, and guessing about rewriting logic at this point, when twenty years have passed since  ... 
doi:10.1016/j.jlap.2012.06.003 fatcat:5tx4a5uxlvapfpf5fajozkbboi

Supporting software architecture documentation and evolution

Thomas Haitzer
2016 unpublished
thus reduces the risk of architectural drift and erosion.  ...  However, the precision and recall of such approaches is still limited, and they are not designed to be continuously used in the software development process, but rather to reconstruct a view at a certain  ...  It is based on model checking, verifying patterns on a model of the system, where patterns are described as mu-calculus logic formulae.  ... 
doi:10.25365/thesis.40859 fatcat:prjdfsiwyfhcnkdqstafs2mlve

Correct and Efficient Accelerator Programming (Dagstuhl Seminar 13142)

Bernadette Charron-Bost, Stepahn Merz, Andrey Rybalchenko, Josef Widder, Albert Cohen, Alastair Donaldson, Marieke Huisman, Joost-Pieter Katoen, Stephen Kobourov, Martin Nöllenburg, Monique, Sergiu Hart (+2 others)
2013 unpublished
This is a survey of algorithms for approximating a curve by a simpler curve, mostly by a polygon with few edges.  ...  I discuss the problem definition, the variations and different objectives, and the pitfalls. I also survey the classical algorithms of Douglas and Peucker; Imai and Iri; and of Chan and Chin.  ...  In this talk, I present the alternating epistemic mu-calculus [1] . The logic allows to capture abilities that could not be expressed in ATL.  ... 
fatcat:m7452gw4cvecbd2vi6w3uha5ai