http://mw.hh.se/wg211/api.php?action=feedcontributions&feedformat=atom&user=Admin WG 2.11 - User contributions [en] 2026-04-05T21:01:33Z User contributions MediaWiki 1.43.5 http://mw.hh.se/wg211/index.php?title=Main_Page&diff=572 Main Page 2012-01-27T06:25:01Z <p>Admin: </p> <hr /> <div>[[:Category:WG211 | WG211]]</div> Admin http://mw.hh.se/wg211/index.php?title=Main_Page&diff=571 Main Page 2012-01-26T14:50:31Z <p>Admin: </p> <hr /> <div>[[:Category:WG211 | WG211]]<br /> <br /> <br /> <br /> &lt;htmlet nocache=&quot;yes&quot;&gt;peotest&lt;/htmlet&gt;</div> Admin http://mw.hh.se/wg211/index.php?title=Main_Page&diff=570 Main Page 2012-01-26T14:34:01Z <p>Admin: </p> <hr /> <div>[[:Category:WG211 | WG211]]<br /> <br /> <br /> <br /> &lt;htmlet nocache=&quot;yes&quot;&gt;wg211reg&lt;/htmlet&gt;</div> Admin http://mw.hh.se/wg211/index.php?title=Main_Page&diff=569 Main Page 2012-01-26T14:31:48Z <p>Admin: </p> <hr /> <div>[[:Category:WG211 | WG211]]<br /> <br /> <br /> <br /> &lt;htmlet nocache=&quot;yes&quot;&gt;wg211reg.html&lt;/htmlet&gt;</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/WG211-Aims-2011-02-25&diff=373 WG211/WG211-Aims-2011-02-25 2011-12-12T10:06:31Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> <br /> &lt;p align=&quot;center&quot;&gt; '''IFIP WG 2.11 on Program Generation''' &lt;/p&gt; &lt;p align=&quot;center&quot;&gt; '''Mission Statement''' &lt;/p&gt; &lt;p align=&quot;center&quot;&gt; &lt;/p&gt;<br /> <br /> '''Aim'''<br /> <br /> Raising the level of abstraction in software specification has been a fundamental goal of the computing community for several decades. In particular, the pervasive need for software in modern engineering creates both the need for and the opportunity of a style of programming at a level of abstraction farther from the execution platform and nearer to the problem domain. This approach has been termed _program generation_ or _generative programming_, since the target programs generated are at the level of abstraction at which, traditionally, programming has been done by hand.<br /> <br /> The goal of IFIP WG 2.11 is to investigate a wide range of techniques to make this approach to programming practical for a wide range of software development tasks. This includes technology for:<br /> * enabling application programmers to write programs more conveniently and without the need of expert knowledge in computer science<br /> * enabling domain experts to design a domain-specific programming language and to generate a language processor (a compiler or interpreter) and an integrated development environment (IDE) for it<br /> * specifying a generic program, which can be specialized conveniently to diverse programs in a fixed application domain, and providing automatic tools for generating the specialized programs and navigating between them<br /> <br /> '''Scope'''<br /> <br /> The working group covers the following research areas (and maybe others):<br /> * programming language design, semantics and implementation<br /> * program analysis and verification<br /> * program synthesis<br /> * type systems and type theory<br /> * programming models and programming methodology<br /> * software engineering<br /> * software product lines<br /> * programming paradigms (object-oriented, aspect-oriented, feature-oriented, functional, logic)<br /> * software-oriented architectures, model-oriented design<br /> * program optimization<br /> * program parallelization<br /> * program libraries<br /> * code generation and optimization<br /> * program analysis and composition tools and IDEs<br /> <br /> Targeted execution platforms may be of any kind and include, in particular:<br /> * software architectures and virtual machines<br /> * the Cloud<br /> * multicores, manycores and GPGPUs<br /> * mobile devices and embedded systems<br /> * FPGAs and other malleable hardware<br /> <br /> '''Objectives'''<br /> <br /> The objectives of the working group are:<br /> * to foster collaboration and interaction between researchers in the areas listed above and to make them aware of the common goal of generative programming<br /> * to demonstrate concrete benefits in specific application domains<br /> * to develop techniques for assessing productivity, reliability and usability<br /> * to determine the potential of a common platform and infrastructure for program generation and transformation<br /> * to examine and further the adoption of program generation and transformation features in mainstream programming languages and environments(<br /> <br /> ''(Posted by Ulrik P Schultz, WG 2.11 Vice Chair - 25 Feb 2011)''</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/TeachingProgramGeneration&diff=347 WG211/TeachingProgramGeneration 2011-12-12T10:06:30Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> <br /> =<br /> ----<br /> + Teaching Program Generation=<br /> <br /> Getting program generation accepted and used starts with teaching our students.<br /> <br /> * How should we incorporate program generation in the computer science curriculum?<br /> <br /> This session gives room for expressing views and reflecting on experience.<br /> <br /> Issues include:<br /> <br /> * experience with teaching courses on/involving program generation<br /> * place in the curriculum (wrt other material)<br /> * theoretical and conceptual framework<br /> * tools<br /> * course organization<br /> * topics and their relative priority (what is important)<br /> * suitable example domains<br /> * books<br /> * meta languages<br /> ** typing<br /> ** other guarantees<br /> <br /> ==<br /> ----<br /> -++ Existing Courses==<br /> <br /> * Martin Erwig<br /> * Program Synthesis - Berkeley<br /> * Julia Lawall - DSLs<br /> * Walid Taha - MSP<br /> <br /> * Crista Lopes - Irvine<br /> ** Programming Languages 2 (PL2)<br /> ** http://www.ics.uci.edu/~lopes/teaching/inf102W06/index.html<br /> ** Reflection<br /> ** Ruby<br /> <br /> * Peter Sestoft<br /> ** run-time code generation<br /> ** ML as meta-language (difficult to learn)<br /> ** future: scheme as meta-language<br /> <br /> * Paul Kelly<br /> ** Compiler Construction<br /> ** Advanced Computer Architecture<br /> <br /> * Eelco Visser<br /> ** Program transformation<br /> *** http://swerl.tudelft.nl/bin/view/Pt<br /> ** Software generation and configuration<br /> *** http://www.cs.uu.nl/wiki/Sgc/WebHome<br /> <br /> * Tim Sheard<br /> ** staged programming<br /> ** http://web.cecs.pdx.edu/~sheard/course/stagedcomp/index.html<br /> <br /> ==<br /> ----<br /> -++ Domains==<br /> <br /> * Compilers<br /> * J2EE<br /> * Linear Transforms (FFTW, Spiral)<br /> * Web programming<br /> * Language processing<br /> ** regular expressions<br /> ** grammars<br /> * Databases<br /> ** SQL<br /> ** database binding<br /> * Functional reactive programming<br /> ** Pan (Conal Elliot)<br /> ** Haskore<br /> * User interface generators<br /> * Hardware synthesis<br /> ** Lava<br /> <br /> ==<br /> ----<br /> --++ Issues==<br /> <br /> * Binding<br /> * Variable capture<br /> * Hygienic macros<br /> * Concrete syntax<br /> * Staged computation<br /> * Partial evaluation<br /> * Binding time<br /> ** binding time analysis<br /> <br /> ==<br /> ----<br /> <br /> ----<br /> ++ Techniques==<br /> <br /> * Reflection<br /> * Introspection<br /> * Parsing<br /> * Template languages<br /> ** String Template<br /> * Wizards<br /> <br /> ==<br /> ----<br /> <br /> ----<br /> ++ Technologies==<br /> <br /> * Dynamic (scripting) languages<br /> ** Ruby<br /> ** Scheme<br /> * Staged languages<br /> ** Template Haskell<br /> <br /> * Google web toolkit<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> <br /> =<br /> ----<br /> <br /> ----<br /> --+ Course Outlines=<br /> <br /> Here are some actual, proposed, or imagined outlines for courses involving elements of program generation.<br /> <br /> ==<br /> ----<br /> --++ Eelco Visser - Software Engineering 2==<br /> <br /> Goal: learn students how to abstract programming patterns into domain-specific languages.<br /> <br /> * Part I : Using DSLs<br /> ** Discuss examples of DSLs in real life<br /> *** regular expressions<br /> *** context-free grammars<br /> *** rewrite rules<br /> *** web DSLs<br /> *** database DSLs (SQL)<br /> *** workflow<br /> ** Considerations<br /> *** explanation of domains should not take over the course<br /> ** Lab<br /> *** Experiment with some of these in practical exercises<br /> <br /> * Part II : Developing DSLs (DSL Engineering)<br /> ** Syntax and semantics<br /> *** an intro into language definition<br /> ** DSL design<br /> *** domain engineering<br /> *** what goes into the DSL?<br /> *** language design issues<br /> ** Implementation techniques<br /> *** term rewriting<br /> *** graph rewriting<br /> *** model transformation<br /> *** attribute grammars<br /> *** XML, XSLT<br /> *** syntax embedding<br /> *** reflection (Ruby, Python)<br /> *** DSL definitions as modules<br /> ** Lab<br /> *** Implement a (couple of) (simple) DSL(s)<br /> <br /> * Part III : Limitations of DSLs<br /> ** flexibility / adaptability of generated code<br /> ** hygienic code generation / variable capture<br /> ** modularity / separate compilation<br /> ** retargetability of generators<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> <br /> ==<br /> ----<br /> --++ Sam Kamin - Program Generation==<br /> <br /> Proposed (and extremely tentative) course on program generation,<br /> upper-level undergrad level<br /> <br /> * I. Uses of program generation and transformation<br /> ** A. Textual abstraction as a kind of program abstraction<br /> *** 1. Programs as collections of fragments<br /> *** 2. Product-line architectures; components<br /> *** 3. Synthesis of programs from specifications<br /> ** B. The cost of abstraction<br /> *** 1. The cost of generality in libraries<br /> ** C. Overcoming the cost of abstraction<br /> *** 1. Gaining efficiency through program generation/transformation<br /> *** 2. The importance of domain knowledge<br /> ** D. Domain-specific languages<br /> <br /> * II. Example domains (need to be accompanied by concrete examples)<br /> ** A. Generating ADT code (catamorphism-type stuff)<br /> ** B. Building database programs (generating classes for db schemas)<br /> ** C. Scientific computing - FFT, matrix operations, simulation<br /> ** D. Language-based examples - lexical analysis, parsing, interpreters, compilers<br /> ** E. Building DSL's<br /> <br /> * III. Tools (need to be accompanied by programming exercises)<br /> ** A. Static, &quot;ad hoc&quot; program generation (e.g. using Ruby)<br /> *** i. Static reflection<br /> ** B. Dynamic program generation (e.g. using Jumbo)<br /> ** C. Program transformation tools (e.g. Stratego)<br /> ** D. Safe program generators (e.g. MetaOCaml)<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> --<br /> <br /> ==<br /> ----<br /> ++ Crista Lopes - Programming Language 2==<br /> <br /> I'm redesigning the course to have less stuff, but more of the things that stay in. It will be something like this:<br /> <br /> * Meta-circular interpreter (in Scheme)<br /> * Declarative programming<br /> ** SQL<br /> ** logic programming (in Scheme)<br /> * AOP (maybe?) (in Scheme)<br /> * OOP inside (Ruby)<br /> * Reflection (Ruby) -- this is the part that is more related to program generation<br /> * Markup languages<br /> <br /> This is a programming languages course, hence the focus on PLs.<br /> For a software engineering, enabler tools kind of course, I would do something different. I would have to think a lot more...<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> --<br /> <br /> ==<br /> ----<br /> ++ Paul Kelly==<br /> <br /> Proposal: Course in<br /> <br /> * Software Synthesis and Metaprogramming<br /> * Students: Master's level, with some industrial experience<br /> * Objectives: Students should gain an understanding of key principles in the application and design of software that generates and manipulates programs.<br /> <br /> This outline presents a large picture; the challenge is to identify from these topics the taxonomy, central theoretical ideas, and software engineering principles.<br /> <br /> * Introduction:<br /> ** Motivation via a small variety of compelling examples.<br /> ** Some large &quot;industrial scale&quot;, others open-source and available for hands-on experience and understanding.<br /> * Analysis:<br /> ** Reflection (eg in Java, Ruby),<br /> ** Code query languages (Codequest etc).<br /> * Aspects and aspect weavers:<br /> ** Pointcuts (as reflection, as queries),<br /> ** advice (as generation),<br /> ** safety; safety holes in AspectJ.<br /> ** Aspects as features.<br /> ** Aspect composition.<br /> * Generators:<br /> ** Macros,<br /> ** name capture.<br /> ** Static, dynamic: quoting and binding times<br /> ** Runtime generation.<br /> ** Type-safe program generation.<br /> ** Partial evaluation; on-line versus offline.<br /> ** Binding time analysis, binding-time improvement.<br /> ** Jones optimality?<br /> * Domain-specific generators, domain-specific languages:<br /> ** Language embedding;<br /> ** syntactic issues, types and binding issues.<br /> ** Single source, multiple interpretation.<br /> * Features, product lines, architectures and components:<br /> ** Feature mapping and refactoring.<br /> ** Feature interaction.<br /> ** Architecture description languages.<br /> ** Adaptive component architectures, reflective middleware.<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> --<br /> <br /> ==<br /> ----<br /> ++ Peter Sestoft==<br /> <br /> Outline of a course fragment on program generation<br /> Peter Sestoft 2006-10-27<br /> <br /> Course prerequisites: Prior to the course, students are assumed to<br /> know Java (or C#) and reflection.<br /> <br /> Some prerequisites filled by earlier modules of the course itself:<br /> <br /> * Abstract machines, including the JVM and/or .NET bytecode<br /> * Introductory Scheme<br /> <br /> Plan<br /> <br /> * Explain that program generation is used a lot (J2EE interfaces, Java Server Pages, PHP, object-relational mappers, ...).<br /> * Explain the main purposes:<br /> ** Avoid writing boilerplate code, and obtain performance (space, time) by generating specialized code.<br /> * Using small two-parameter examples (see below),<br /> ** introduce the concept of binding time (static and dynamic),<br /> ** where static computations can be performed early, in a generator,<br /> ** and dynamic operations are to be performed late, in the generated code.<br /> ** Mention the concept of a partial evaluator and generating extension,<br /> ** and that the generating extension of an interpreter is a compiler.<br /> ** Etc.<br /> * Show textual source code generation using print-statements, to demystify the concept.<br /> ** Explain that this is impractical.<br /> * Show code generation in Scheme using backquote and comma.<br /> ** Point out the challenges of always generating syntactically well-formed code and using only variables that are in scope.<br /> ** (Correct static typing of the generated code does not enter the picture in Scheme, only when generating bytecode below).<br /> * Show runtime code generation in Scheme using the above and eval.<br /> * Show runtime code generation in Java (or C#) using BCEL or .NET's System.Reflection.Emit.<br /> ** Point out that this is exactly analogous to runtime code generation in Scheme,<br /> ** only it looks far more complicated and is more difficult to debug.<br /> * Point out that there is a general idea in the above: Staged computation or two-level languages, and that there are many research prototypes of such languages: MetaOCaml, Jumbo, DynJava, Metaphor, ...<br /> <br /> Some simple motivating examples<br /> <br /> Polynomial evaluation c_0 + c_1 x + c_2 x^2 + ...<br /> &lt;pre&gt;<br /> double PolyEval(double[] cs, double x)<br /> &lt;/pre&gt;<br /> <br /> The power function x^n<br /> &lt;pre&gt;<br /> double Power(int n, double x)<br /> &lt;/pre&gt;<br /> <br /> Generating terms of the Taylor series for exp(x)<br /> <br /> AES (Rijndael) encryption algorithm<br /> &lt;pre&gt;<br /> byte[] Encrypt(Key key, byte[] block)<br /> &lt;/pre&gt;<br /> <br /> Sparse matrix multiplication<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> --<br /> <br /> ==<br /> ----<br /> ++ Martin Bravenboer==<br /> <br /> Program Generation<br /> <br /> I like the idea of modules provided by different people in the<br /> community. It probably won't happen, but it would be a good thing.<br /> <br /> * Introducing: motivating examples<br /> ** Lack of abstraction (Enterprise, boilerplate stuff)<br /> ** Lack of performance (creepy numerical stuff etc)<br /> ** Cross-cutting concerns<br /> ** Variability (Conditional code)<br /> * Design issues<br /> ** Patterns, when and how to develop DSLs<br /> ** Domain knowledge<br /> * Concepts and principles<br /> ** Static and dynamic reflection<br /> ** Code as input of program generation<br /> ** Attribute-oriented techniques<br /> ** Probably illustrated by Ruby<br /> ** Mirrors<br /> * Programming language concepts:<br /> ** Binding time<br /> ** Hygiene, scope, shadowing, etc<br /> ** Partial evaluation and multi-staging techniques<br /> * Syntax for abstractions: what's the input of a code generator?<br /> ** Domain-specific languages<br /> ** Models, meta-models<br /> ** Text, grammars<br /> ** Code: reflection<br /> * Solutions<br /> ** Unfortunately, there are far too many solutions, Ideally, the various angles of attack should be illustrated in a single language/environment to make comparision and comprehension easier. However, that will be difficult to realize.<br /> ** Macros, templates, C++, Scheme etc.<br /> ** Software transformation systems: rewriting rules<br /> ** Extensible compilers, Silver, Forwarding<br /> ** Template systems<br /> ** Embedded DSLs: Converge, Haskell, MetaBorg, etc<br /> ** Writing interpreters, compilers<br /> ** Run-time code generators, such as Jumbo, .NET compiler API, Java stuff etc.<br /> ** From Ruby to Jumbo to type-safe code generators<br /> ** Reflective systems, such as Ruby, Smalltalk, Reflex<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> <br /> ----<br /> -<br /> <br /> =<br /> ----<br /> <br /> ----<br /> -+ Notes from the Meeting=<br /> <br /> ==================================================<br /> Crista Lopes<br /> <br /> * Teaches course on Reflection<br /> ** Scheme for interpreters<br /> ** Ruby is highly recommended<br /> *** very cute<br /> *** meta-object architecture<br /> *** no environment<br /> *** untyped programming language<br /> * based on Ruby for reflection<br /> * assignment based on Ruby on Rails<br /> * Reflection versus AST<br /> ** Easier to teach then reflection<br /> ** Dynamic reflection (beyond static reflection)<br /> ** Mirrors paper based on OOPSLA based on Smalltalk (Bracha)<br /> * Using search engines for finding code<br /> ** Lopes: teach how to use other components/tools/libraries rather than learning all the details of how to do it yourself<br /> * Fit together<br /> * Paul: Let them play<br /> <br /> ==================================================<br /> Peter Sestoft<br /> <br /> * Teaches course on Programming Language Concepts<br /> ** Standard ML<br /> ** Scheme<br /> *** easier for students<br /> *** more versatile<br /> * Interpreters<br /> * Compilers<br /> * Code generation<br /> ** printf<br /> ** Scheme<br /> * Run-time code generation<br /> ** .NET<br /> ** JVM<br /> * Principles:<br /> ** Binding time<br /> * show in generator example<br /> <br /> ==================================================<br /> Paul Kelly<br /> <br /> * Teaches course on Compilers<br /> ** Compulsary with some motivation issues<br /> ** Based on Haskell<br /> ** Simple imperative language<br /> ** Optimization, back-end<br /> * Teaches course on Advanced Computer Architecture<br /> ** Numerical algorithms<br /> ** Optimization based on computer architure<br /> * Opinions:<br /> ** Program generation not necessarily difficult<br /> ** It's a means of learning students about programming languages<br /> * Principles:<br /> ** Variable capture, hygienic mcacros<br /> ** How are object-oriented languages implemented?<br /> <br /> ==================================================<br /> Sam Kamin<br /> <br /> * Teaches course on Programming Languages: Concepts and Implementation<br /> ** ML as meta-language<br /> ** Programming paradigms<br /> * Ideas for a course<br /> ** General concepts and motivation<br /> ** Examples from different domains<br /> * Tools: from Ruby, to Jumbo, to type-safe code generators<br /> ** Teach students about abstractions<br /> ** Programming patterns motivate DSLs<br /> ** ADTs<br /> ** Templates<br /> ** DSLs<br /> * Principles:<br /> ** Partial evaluation<br /> * Let students crash first, then: how to do it right.<br /> <br /> ==================================================<br /> Visser<br /> <br /> * Teaches course on Program Transformation<br /> ** Stratego<br /> ** Study various transformations<br /> ** Problem: not enough time for the concepts<br /> * Present examples of existing DSLs<br /> ** Sam: presenting polished DSLs does not illustrate the problems<br /> <br /> ==================================================<br /> Martin Bravenboer<br /> <br /> * Opinions<br /> ** Where do we actually produce code from?<br /> * Front-end:<br /> ** reflection<br /> ** modelling<br /> ** text, parsing, grammars<br /> <br /> ==================================================<br /> Czarnecki<br /> <br /> * When to develop a DSL?<br /> * Design issues is more important<br /> * Doing the actual program generation is a small task<br /> * Techniques and tools less important<br /> * Design patterns for DSLs<br /> * &quot;this could use some DSL&quot;<br /> <br /> ==================================================<br /> Walid<br /> <br /> * Suggestion<br /> ** Reuse modules created by experts<br /> * Should we teach crazy wacky ideas?<br /> ** Don't know if it is a good thing or bad thing<br /> ** Might be good<br /> * Courses on Program generation<br /> ** Martin Erwik (?)<br /> ** Program synthesis at Berkley<br /> * Julia Lawall<br /> ** Domain-specific languages<br /> * MSP course:<br /> ** Walid could contribute a module<br /> ** Don Batory<br /> ** Tim Sheard - staged computation<br /> * Courses Aspect-Oriented Programming:<br /> ** Probably too many<br /> ** Personal statement by Lopes: AspectJ sucks, so I don't want to give a course about it ;)<br /> * Principles:<br /> ** Kolmorov Complexity<br /> ** Binding time is an important concept to teach<br /> <br /> ==============================================<br /> Example domains<br /> <br /> * Spiral<br /> * Web programming (Ruby)<br /> * Performance things like loop unrolling, matrix multiplication, sorting<br /> * Enterprise, database, EJB<br /> ** e.g. Ruby on Rails<br /> * Interpreters and parsers<br /> ** regular expressions?<br /> * Funtional reatice programming: hascore / Pan / Fran / Lava, hardware synthesis<br /> * Javascript stuff: Google Web Toolkit / JSAN<br /> * ASP .NET, JSP, PHP</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/PdfVersions&diff=341 WG211/PdfVersions 2011-12-12T10:06:30Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> <br /> <br /> <br /> <br /> -- Main.EmirPasalic - 15 Jun 2008<br /> <br /> * [[Media:CFP_DSL.pdf | CFP_DSL.pdf ]]: CFP_DSL.pdf<br /> <br /> * [[Media:cfp.pdf | cfp.pdf ]]: cfp.pdf<br /> <br /> ==File Attachments== <br /> <br /> *[[Media:CFP_DSL.pdf | CFP_DSL.pdf]]<br /> *[[Media:cfp.pdf | cfp.pdf]]</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/MustRead&diff=335 WG211/MustRead 2011-12-12T10:06:30Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Must-read Papers=<br /> <br /> Dear all,<br /> <br /> Please enter below titles of papers (and, ideally, links to their source) of papers that you view as seminal or highly influential in the fields of program generation, domain-specific languages, and model-driven computation.<br /> <br /> Please:<br /> <br /> * Note the seperate headings for '''program generation''', '''DSLs''', and '''Model-driven computation'''.<br /> * Before you add a paper, please check that it is not there.<br /> * Use one bullet per paper that you add.<br /> <br /> Walid.<br /> <br /> ==Key Papers in Program Generation==<br /> <br /> * Eelco Visser: Program Transformation with Stratego/XT: Rules, Strategies, Tools, and Systems in Stratego/XT 0.9. Domain-Specific Program Generation 2003: 216-238<br /> * E. Kohlbecker, D. P. Friedman, M. Felleisen, and B. Duba. Hygienic macro expansion. In Proceedings of the 1986 ACM conference on LISP and functional programming, pages 151{161. ACM Press, 1986.<br /> * D.R. Smith, KIDS: a semiautomatic program development system, IEEE Trans. Softw. Eng., 16(9): 1024-1043, September 1990.<br /> * T.W. Reps and T. Teitelbaum, The Synthesizer Generator: A System for Constructing Language-Based Editors, Springer-Verlag, New York, 1988.<br /> * D. Zook, S. S. Huang, and Y. Smaragdakis. Generating AspectJ programs with Meta-AspectJ. In Proceedings of the 2004 Generative Progamming and Component Engineering (GPCE) Conference.<br /> * W. Taha and T. Sheard. Multi-stage programming with explicit annotations. In Partial Evaluation and Semantics-Based Program Manipulation, Amsterdam, The Netherlands, June 1997, pages 203{217. New York: ACM, 1997.<br /> * N. D. Jones and A. J. Glenstrup. Program generation, termination, and binding-time analysis. In Generative Programming and Component Engineering (GPCE) Conference, LNCS 2487, pages 1{31. Springer, 2002.<br /> * Walid Taha. A Gentle Introduction to Multi-stage Programming. In C. Lengauer et al. Domain-Specific Program Generation, LNCS 3016, pp.30-50, Springer-Verlag, 2004. Survey paper; [[http://www.springerlink.com/(fz4uci45ex0m0t2sqtxxwn45)/app/home/contribution.asp?referrer=parent&amp;backto=issue,3,18;journal,906,3807;linkingpublicationresults,1:105633,1 Springer-Link]]<br /> * K. Czarnecki and U. Eisenecker. Generative Programming: Methods, Techniques and Applications. Addison-Wesley Longman, 1999. (not a paper of course)<br /> * &quot;Aspect-Oriented Programming&quot;. Gregor Kiczales, John Lamping, Anurag, Mendhekar, Chris Maeda, Cristina Lopes, Jean-Marc Loingtier and John Irwin, ECOOP97. [[http://link.springer-ny.com/link/service/series/0558/bibs/1241/12410220.htm Springer Link]]<br /> * K. Czarnecki, U. W. Eisenecker, R. Gl&amp;uuml;ck, D. Vandevoorde, and T. Veldhuizen. Generative programming and active libraries (extended abstract). In M. Jazayeri, D. Musser, and R. Loos, editors, Generic Programming. Proceedings, LNCS 1766, Springer-Verlag, 2000, pages 25&amp;#8211;39.<br /> * Todd L. Veldhuizen. Template metaprograms. C++ Report, 7(4):36&amp;#8211;43, 1995.<br /> * Template metaprogramming for Haskell, by Tim Sheard and Simon Peyton Jones, May 2002. CM SIGPLAN Haskell Workshop 02 (http://www.haskell.org/th/) (is there a better reference?)<br /> * Y. Futamura. Partial evaluation of computation process - an approach to a compiler-compiler. Systems, Computers, Controls, 2(5):45-50, 1971.<br /> * C. Bastoul. Efficient code generation for automatic parallelization and optimization. ISPDC'2 IEEE International Symposium on Parallel and Distributed Computing, October 2003, Ljubjana, Slovenia.<br /> * R. Gl&amp;uuml;ck, J. J&amp;oslash;rgensen, An automatic program generator for multi-level specialization. In: Lisp and Symbolic Computation, 10(2): 113-158, 1997.<br /> * Smith, D.R., Constructing Specification Morphisms, Journal of Symbolic Computation, Special Issue on Automatic Programming, Vol 16, No 5-6, 1993, 571-606.<br /> * Douglas R. Smith, Eduardo A. Parra, and Stephen J. Westfold, Synthesis of Planning and Scheduling Software, in '''Advanced Planning Technology''', (Ed. A. Tate), AAAI Press, Menlo Park, California, 1996, 226-234.<br /> * Emic Pasalic and Nathan Linger, Meta-Programming with Typed Object-Language Representations. Presented at [[http://www.program-transformation.org/Gpce GPCE]], Vacouver B.C. Oct 2004.<br /> * ...<br /> <br /> <br /> ==Key Papers in Domain-specific Languages==<br /> <br /> * Don Batory. The Road to Utopia. In Christian Lengauer et al. Domain-Specific Program Generation, LNCS 3016, pp.1-18, Springer-Verlag, 2004. Survey paper; [[http://www.springerlink.com/(fz4uci45ex0m0t2sqtxxwn45)/app/home/contribution.asp?referrer=parent&amp;backto=issue,1,18;journal,906,3807;linkingpublicationresults,1:105633,1 Springer Link]]<br /> * C. Consel and R. Marlet. Architecturing software using a methodology for language development. In C. Palamidessi, H. Glaser, and K. Meinke, editors, Proceedings of the 10th International Symposium on Programming Language Implementation and Logic Programming, volume 1490 of Lecture Notes in Computer Science, Pisa, Italy, pages 170--194, September 1998 [[http://phoenix.labri.fr/publications/papers/plilp98.ps.gz pdf]]<br /> * R. Kieburtz, L. McKinney, J. Bell, J. Hook, A. Kotov, J. Lewis, D. Oliva, T. Sheard, I. Smith and L. Walton, A software engineering experiment in software component generation, Int. Conf. on Softw. Eng. (ICSE), 1996.<br /> * M. Pueschel and B. Singer and J. Xiong and J. Moura and J. Johnson and D. Padua and M. Veloso and R. W. Johnson. SPIRAL: A Generator for Platform-Adapted Libraries of Signal Processing Algorithms. Journal of High Performance Computing and Applications, special issue on Automatic Performance Tuning, 18 (1), pp. 21--45, 2004.<br /> * ...<br /> <br /> ==Key Papers in Model-driven Computation==<br /> <br /> * D. Batory and S. O&amp;#8217;Malley, &amp;#8220;The Design and Implementation of Hierarchical Software Systems with Reusable Components&amp;#8221;, ACM TOSEM, October 1992.<br /> * Y. Smaragdakis and D. Batory, &quot;Implementing Layered Designs with Mixin Layers&quot;, ECOOP 1998.<br /> * T. Biggerstaff, &amp;#8220;The Library Scaling Problem and the Limits of Concrete Component Reuse&amp;#8221;, International Conference on Software Reuse, 1994.<br /> * J. Neighbors, Draco: a method for engineering reusable software components. In T.J. Biggerstaff and A. Perlis (eds.), Software Reusability, Addison-Wesley/ACM Press, 1989.<br /> * D. HAREL, H. LACHOVER, A. NAAMAD, A. PNUELI, M. POLITI, R. SHERMAN, A. SHTULL-TRAURING, AND M. TRAKHTENBROT, &amp;#8220;STATEMATE: A Working Environment for the Development of Complex Reactive Systems,&amp;#8221; IEEE Transactions on Software Engineering 16 (April 1990), pp. 403&amp;#8211;14<br /> * D. HAREL, &amp;#8220;Biting the Silver Bullet,&amp;#8221; IEEE Computer 25 (January 1992), pp. 8&amp;#8211;20.<br /> * David Harel, Bernhard Rumpe: Meaningful Modeling: What's the Semantics of &quot;Semantics&quot;?. IEEE Computer 37(10): 64-72 (2004)<br /> * Rumpe, B.: &amp;#8220;A Note on Semantics (with an Emphasis on UML)&amp;#8221;; Second ECOOP Workshop on Precise Behavioral Semantics (with an Emphasis on OO Business Specifications) (1998).<br /> * Mosterman, P., Sztipanovits, J., Engell, S.: &amp;#8220;Computer-Automated Multi-Paradigm Modeling in Control Systems technology,&amp;#8221; IEEE Transactions on Control System Technology, Vol. 12, No. 2, pp. 223-234, March 2004<br /> * Horowitz, B.; Liebman, J.; Ma, C.; Koo, T.J.; Sangiovanni-Vincentelli, A.; Sastry, S.S.: &amp;#8220;Platform-based embedded software design and system integration for autonomous vehicles,&amp;#8221; Proceedings of the IEEE, Vol. 91, No.1., pp. 198-211, January, 2003</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/MeetingTwo&diff=333 WG211/MeetingTwo 2011-12-12T10:06:29Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> &lt;center&gt;<br /> =IFIP [[http://www.smart-generators.org/ Working Group 2.11]] Second Meeting=<br /> <br /> ==Schedule==<br /> <br /> March 6-9, 2005, Houston, Texas<br /> &lt;/center&gt;<br /> ----<br /> <br /> Talks will be 20 minutes in length, with 10 minutes for questions.<br /> There is information about getting [[http://www.smart-generators.org/MeetingTwo#FromAirports from the airport to the hotel]] and [[http://www.smart-generators.org/MeetingTwo#FromHotels from the hotel to the meeting location]] at the end of this page.<br /> <br /> ====Sunday 9:00-10:00====<br /> <br /> Session chair: Doug Smith<br /> <br /> [[http://www.smart-generators.org/M2Visser Towards Extensible Program Transformation Systems]] [[http://pub.smart-generators.org/MeetingTwo/Visser-WG211-2005.pdf [Presentation]]]<br /> ----<br /> Eelco Visser, Utrecht University<br /> <br /> [[http://www.smart-generators.org/M2Taha Regenerative Programming: A New Approach to Data Mining for Software Design]] [[http://pub.smart-generators.org/MeetingTwo/taha.pdf [Presentation]]]<br /> ----<br /> Walid Taha, Rice University<br /> <br /> ====Sunday 10:30-12:00====<br /> <br /> Session chair: Laurent Reveillere<br /> <br /> [[http://www.smart-generators.org/M2Smith Policy Enforcement]] [[http://pub.smart-generators.org/MeetingTwo/Policies%20050305.ppt [Presentation]]]<br /> ----<br /> Doug Smith, Kestrel Institute &lt;!--Sunday or Monday--&gt;<br /> <br /> [[http://www.smart-generators.org/M2Smaragdakis Statically Safe Meta-Programming]] [[http://pub.smart-generators.org/MeetingTwo/ifipwg-mar05-formatted.pdf [Presentation]]]<br /> ----<br /> Yannis Smaragdakis, Georgia Tech<br /> <br /> &lt;!--a href=&quot;&quot;--&gt;Maintaining Static Invariants using Generalized Algebraic Datatypes in Omega&lt;!--/a--&gt;[[http://pub.smart-generators.org/MeetingTwo/OmegaWG211March2005.pdf [Presentation]]]<br /> ----<br /> Tim Sheard, Portland State University<br /> <br /> ====Sunday 12:00-13:15====<br /> <br /> Lunch: Goode Company BBQ, 5109 Kirby Dr, phone: 713.522.2530<br /> <br /> ====Sunday 13:30-15:30====<br /> <br /> Session chair: Cristina Videira Lopes<br /> <br /> [[http://www.smart-generators.org/M2Reveillere Generative Programming from a DSL Viewpoint]] [[http://pub.smart-generators.org/MeetingTwo/Reveillere.pdf [Presentation]]]<br /> ----<br /> Laurent Reveillere, INRIA Futurs<br /> <br /> [[http://www.smart-generators.org/M2Pouzet Synchronizing Periodic Clocks in Kahn Networks]] [[http://pub.smart-generators.org/MeetingTwo/Pouzet.pdf [Presentation]]]<br /> ----<br /> Marc Pouzet, Universite Pierre et Marie Curie<br /> <br /> [[http://www.smart-generators.org/M2Ossher Concepts for Describing Composition of Software Artifacts]] [[http://pub.smart-generators.org/MeetingTwo/ossher.pdf [Presentation]]]<br /> ----<br /> Harold Ossher, IBM T.J. Watson Research Center<br /> <br /> [[http://www.smart-generators.org/M2Moggi Program Generation by Linking]]<br /> ----<br /> Eugenio Moggi, DISI, University of Genoa<br /> <br /> ====Sunday 16:00-17:30====<br /> <br /> Session chair: Paul H J Kelly<br /> <br /> [[http://www.smart-generators.org/M2Lopes1 Aspect-Specific Languages]] [[http://pub.smart-generators.org/MeetingTwo/lopes1.pdf [Presentation]]] and [[http://www.smart-generators.org/M2Lopes2 An Economics-Based Model for Assessing Program Modularity]] [[http://pub.smart-generators.org/MeetingTwo/lopes2.pdf [Presentation]]]<br /> ----<br /> Cristina Videira Lopes, University of California<br /> <br /> [[http://www.smart-generators.org/M2Lawall Tarantula: Killing Driver Bugs Before They Hatch]] [[http://pub.smart-generators.org/MeetingTwo/lawallslides.pdf [Presentation]]]<br /> ----<br /> Julia Lawall, University of Copenhagen<br /> <br /> [[http://www.smart-generators.org/M2Kamin Using Partial Evaluation to Optimize Run-Time Program Generation]] [[http://pub.smart-generators.org/MeetingTwo/Kamin.pdf [Presentation]]]<br /> ----<br /> Sam Kamin, University of Illinois<br /> <br /> ====Sunday 19:00-21:00====<br /> <br /> Dinner: Benjy's, 2424 Dunstan, phone: 713.522.7602.<br /> <br /> Bus to pick up at Best Western at 7:00 p.m. Bus to return to Best Western at 9:00 p.m.<br /> <br /> ====Monday 9:00-10:00====<br /> <br /> Session chair: Sam Kamin<br /> <br /> [[http://www.smart-generators.org/M2Kennedy Generation of High-Performance Domain-Specific Languages from Component Libraries]] [[http://pub.smart-generators.org/MeetingTwo/Kennedy.pdf [Presentation]]]<br /> ----<br /> Ken Kennedy, Rice University &lt;!--Sunday or Monday morning--&gt;<br /> <br /> [[http://www.smart-generators.org/M2Kelly Composition metaprogramming and component metadata]] [[http://pub.smart-generators.org/MeetingTwo/PaulKelly-CompositionMetaprogramming-2005-03.pdf [Presentation]]]<br /> ----<br /> Paul H J Kelly, Imperial College London<br /> <br /> ====Monday 10:30-12:00====<br /> <br /> Session chair: Kevin Hammond<br /> <br /> [[http://www.smart-generators.org/M2Cohen Persistent Intermediate Representations for Adaptive Global Optimization]] [[http://pub.smart-generators.org/MeetingTwo/ifip_cohen.pdf [Presentation]]]<br /> ----<br /> Albert Cohen, INRIA Futurs<br /> <br /> [[http://www.smart-generators.org/M2Herrmann Combining Abstraction and Performance by Metaprogramming]] [[http://pub.smart-generators.org/MeetingTwo/IFIP-2.11-Herrmann.pdf [Presentation]]]<br /> ----<br /> Christoph Armin Herrmann, University of Passau<br /> <br /> [[http://www.smart-generators.org/M2Lengauer The New EU Network of Excellence CoreGrid]] [[http://pub.smart-generators.org/MeetingTwo/Lengauer-wg2005.ps.gz [Presentation]]]<br /> ----<br /> Christian Lengauer, University of Passau<br /> <br /> ====Monday 12:00-13:15====<br /> <br /> Lunch: Amazon Grill, 5114 Kirby Dr., phone: 713.522.5888<br /> <br /> Bus Pick-up at 12:00 p.m. outside Duncan Hall. Board bus at 13:15 p.m. to return to Duncan Hall.<br /> <br /> ====Monday 13:30-15:00====<br /> <br /> Session chair: Krzysztof Czarnecki<br /> <br /> [[http://www.smart-generators.org/M2Hammond Hume: a Domain-Specific Language for Real-Time Embedded Systems]] [[http://pub.smart-generators.org/MeetingTwo/Hammond-Hume-WG2.11-2005.pdf [Presentation]]]<br /> ----<br /> Kevin Hammond, University of St. Andrews<br /> <br /> [[http://www.smart-generators.org/M2Fischer Certifying Automatically Generated Code]] [[http://pub.smart-generators.org/MeetingTwo/WG-2.11%20Fischer.pdf [Presentation]]]<br /> ----<br /> Bernd Fischer, NASA Ames (demo?)<br /> <br /> [[http://www.smart-generators.org/M2Demoor Adding tracecuts to AspectJ]]<br /> ----<br /> Oege de Moor, Oxford University<br /> <br /> ====Monday 15:30-17:30====<br /> <br /> Discussion<br /> <br /> ====Monday 19:30====<br /> <br /> Dinner: Julia's Bistro, 3722 Main Street, phone: 713.807.0090.<br /> <br /> Take the light rail (boarding station is across the street from Best Western) and exit at the HCC/Ensemble station stop. Walk one block south on West Alabama. Use the light rail to return to Best Western<br /> <br /> ====Tuesday 9:00-10:30====<br /> <br /> Session chair: Don Batory<br /> <br /> [[http://www.smart-generators.org/M2Vardi A Game-Theoretic Approach to Automated Program Generation]] [[http://pub.smart-generators.org/MeetingTwo/vardi.pdf [Presentation]]]<br /> ----<br /> Moshe Vardi, Rice University<br /> <br /> [[http://www.smart-generators.org/M2Czarnecki Feature Modeling in Generative Software Development]] [[http://pub.smart-generators.org/MeetingTwo/czarnecki.pdf [Presentation]]]<br /> ----<br /> Krzysztof Czarnecki, University of Waterloo<br /> <br /> [[http://www.smart-generators.org/M2Consel A Domain-Specific Language for Telephony Services - A Progress Report]] [[http://pub.smart-generators.org/MeetingTwo/consel.pdf [Presentation]]]<br /> ----<br /> Charles Consel, INRIA Futurs<br /> <br /> ====Tuesday 11:00-12:00====<br /> <br /> Session chair: Eelco Visser<br /> <br /> [[http://www.smart-generators.org/M2Batory Improving Incremental Development in AspectJ by Bounding Quantification]] [[http://pub.smart-generators.org/MeetingTwo/batory.pdf [Presentation]]]<br /> ----<br /> Don Batory, University of Texas<br /> <br /> [[http://www.smart-generators.org/M2Ball A Theory of Predicate-Complete Test Coverage and Generation]] [[http://pub.smart-generators.org/MeetingTwo/ball.pdf [Presentation]]]<br /> ----<br /> Thomas Ball, Microsoft Research<br /> <br /> ====Tuesday 12:00-13:15====<br /> <br /> Lunch: Kubo's Japanese Grill at 2414 University Dr., phone: 713.528.7878<br /> <br /> Bus Pick-up at 12:00 p.m. outside Duncan Hall. Board bus at 13:15 p.m. to go to the Museum of Natural Science at One Hermann Circle Drive. Bus Pick up outside Museum at 5:00 p.m. to go to the Best Western.<br /> <br /> ====Tuesday 13:15-17:00====<br /> <br /> Excursion<br /> <br /> ====Tuesday 19:30====<br /> <br /> Dinner: T'afia, 3701 Travis Street, phone: 713.524.6922.<br /> <br /> Take the light rail (boarding station is across the street from Best Western) and exit at the HCC/Ensemble station stop. Walk south towards West Alabama. Take a right on Winbern and head towards Travis Street. T'afia is between Winbern and West Alabama. Use the light rail to return to the Best Western.<br /> <br /> ====Wednesday 9:00-10:00====<br /> <br /> Discussion<br /> <br /> ====Wednesday 10:30-12:00====<br /> <br /> Discussion<br /> <br /> ====Wednesday 12:00-13:15====<br /> <br /> Lunch: Jalapenos Restaurant, 2702 Kirby Drive, phone: 713.524.1668<br /> <br /> Bus Pick-up at 12:00 p.m. outside Hermann Brown Hall. Board bus at 13:15 p.m. to return to Hermann Brown Hall.<br /> <br /> #FromAirports<br /> ===From Houston airports to the hotels===<br /> <br /> The &quot;Medical Center Area&quot; is where Rice is and where the hotels are. If you arrive at either of the two main airports (Bush IAH or Houston Hobby), you can get into this area by either the &quot;Express Shuttle&quot; (713) 523-8888 or a taxi. If you are traveling alone, the Express Shuttle is the best way to get here. From Bush IAH it will cost $20 (instead of $50+ for a taxi), and from Hobby it will cost $15. You can find out the most recent prices [[http://www.airportexpresshouston.com/fares.html here]].<br /> <br /> If you take the shuttle, ask them to drop you off either at your hotel (Hilton/Holiday Inn/Warwick/Best Western/etc.) or at the Medical Center. Please make sure that you say &quot;Medical Center&quot;, as that is the name of the area! From Bush IAH it should be about a 35-45 minute ride. From Houston Hobby it should be about a 20 minute ride.<br /> <br /> If you are coming directly to Rice, you can also ask the shuttle to drop you off at Entrance 16 to Rice. Once you are there, you pretty much walk straight into the university until you get to Duncan Hall. This is the computer science building.<br /> <br /> #FromHotels<br /> ===From the hotels to the meeting location===<br /> <br /> All meetings will take place in DH 3076 except on Wednesday, when all meetings will take place in conference room 223 in Herman Brown.<br /> <br /> The Medical Center Best Western (6700 South Main Street) has a shuttle that can bring visitors to Duncan Hall at Rice. It's only a 15 passenger van, but they are happy to make two trips. Rice is about five minutes away so groups of guests should count on staggering the trip by about 15 minutes.<br /> <br /> A printable map is available [[http://www.rice.edu/maps/ here]] and an interactive map is available [[http://www.rice.edu/maps/buildings.html here]].<br /> <br /> ===Meeting coordinator===<br /> <br /> Emir Pasalic: e-mail: [[mailto:pasalic@cs.rice.edu pasalic@cs.rice.edu]]</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/MeetingOne&diff=331 WG211/MeetingOne 2011-12-12T10:06:29Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> &lt;center&gt;<br /> =IFIP [[http://www.smart-generators.org/ Working Group 2.11]] Kickoff Meeting=<br /> <br /> ==Preliminary Schedule==<br /> <br /> May 16-18, 2004, St. Emilion, France<br /> &lt;/center&gt;<br /> ====Sunday 10:00====<br /> <br /> Departure from Bordeaux. Departure from the bus stop on allees de Munich aux Quinconces (2 minutes walk from the hotel). Bus company &quot;VOYAGES ARRIVE&quot;.<br /> <br /> ====Sunday 1:30-3:45====<br /> <br /> Feature interactions in feature oriented programming <br /> ----<br /> Don Batory<br /> <br /> [[http://www.cs.rice.edu/%7Etaha/wg2.11/m-1/schedule/cohen.html Revisiting optimization for compute-intensive codes in the context of program generation and adaptive libraries.]]<br /> ----<br /> Albert Cohen, INRIA Futurs<br /> <br /> [[http://www.cs.rice.edu/%7Etaha/wg2.11/m-1/schedule/consel.html A DSL for telephony services ]]<br /> ----<br /> Charles Consel, INRIA Futurs<br /> <br /> [[http://www.cs.rice.edu/~taha/wg2.11/m-1/schedule/hammond.html Analyzing Stack and Heap Bounds for Primitive Recursive Programs in PR-Hume ]]<br /> ----<br /> Kevin Hammond, University of St Andrews<br /> <br /> ====Sunday 4:15-6:45====<br /> <br /> [[http://www.cs.rice.edu/%7Etaha/wg2.11/m-1/schedule/beckmann.html TaskGraph Library: A Metaprogramming Tool for Specifying Optimisation as a Separate Concern]]<br /> ----<br /> Olav Beckmann, Imperial College of Science<br /> <br /> [[http://www.cs.rice.edu/~taha/wg2.11/m-1/schedule/kamin.html Jumbo: Run-time Program Generation for Java]]<br /> ----<br /> Samuel Kamin, University of Illinois<br /> <br /> [[http://www.cs.rice.edu/%7Etaha/wg2.11/m-1/schedule/kelly.html Veneer: a dynamic domain-specific optimisation framework for Java ]]<br /> ----<br /> Paul H J Kelly, Imperial College London<br /> <br /> [[http://www.cs.rice.edu/~taha/wg2.11/m-1/schedule/lawall.html A language-based approach to the development of safe operating system extensions ]]<br /> ----<br /> Julia Lawall, University of Copenhagen (demo)<br /> <br /> ====Sunday 8:00====<br /> <br /> Dinner.<br /> <br /> ====Monday 8:45-10:30====<br /> <br /> [[http://www.cs.rice.edu/%7Etaha/wg2.11/m-1/schedule/lengauer.html WG 2.11 Activities at the University of Passau]]<br /> ----<br /> Christian Lengauer, Universit't of Passau<br /> <br /> [[http://www.cs.rice.edu/%7Etaha/wg2.11/m-1/schedule/lopes.html Aspects and Beyond]]<br /> ----<br /> Cristina Lopes, University of California<br /> <br /> [[http://www.cs.rice.edu/%7Etaha/wg2.11/m-1/schedule/moggi.html Monadic Metalanguages for Staging and Name Management]]<br /> ----<br /> Eugenio Moggi, DISI, Univ. di Genova<br /> <br /> ====Monday 11-12:15====<br /> <br /> [[http://www.cs.rice.edu/%7Etaha/wg2.11/m-1/schedule/odonnell.html Tools for Equational Reasoning in Haskell]]<br /> ----<br /> John O'Donnell, University of Glasgow<br /> <br /> [[http://www.cs.rice.edu/%7Etaha/wg2.11/m-1/schedule/ossher.html The Concern Manipulation Environment]]<br /> ----<br /> Harold Ossher, IBM T.J. Watson Research Center (demo)<br /> <br /> ====Monday 1:45-3:45====<br /> <br /> [[http://www.cs.rice.edu/~taha/wg2.11/m-1/schedule/paulin.html Generation of programs with proofs]]<br /> ----<br /> Christine Paulin, Universit' Paris Sud<br /> <br /> TBA <br /> ----<br /> Marc Pouzet<br /> <br /> [[http://www.cs.rice.edu/%7Etaha/wg2.11/m-1/schedule/sheard.html Towards combining Programming Languages and Logics ]]<br /> ----<br /> Tim Sheard, OGI /OHSU (demo)<br /> <br /> ====Monday 4:15-6:00====<br /> <br /> [[http://www.cs.rice.edu/%7Etaha/wg2.11/m-1/schedule/smaragdakis.html Generating AspectJ Programs with Meta-AspectJ]]<br /> ----<br /> Yannis Smaragdakis, Georgia Tech<br /> <br /> [[http://www.cs.rice.edu/~taha/wg2.11/m-1/schedule/taha.html MetaOCaml: Putting multi-stage annotations to work]]<br /> ----<br /> Walid Taha, Rice University<br /> <br /> Compilers for active libraries <br /> ----<br /> Todd Veldhuizen, Chalmers University<br /> <br /> ====Monday 6:30====<br /> <br /> Tour of St. Emilion.<br /> <br /> ====Monday 8:00====<br /> <br /> Dinner.<br /> <br /> ====Tuesday 9-11:30====<br /> <br /> Discussion<br /> <br /> ====Tuesday 12:00====<br /> <br /> Lunch will begin at 12:00 sharp.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M9Westbrook&diff=327 WG211/M9Westbrook 2011-12-12T10:06:29Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Towards a Generalization of Specialization=<br /> ==Edwin Westbrook==<br /> <br /> Code specialization is a powerful technique for optimizing programs in general-purpose languages. Unfortunately, specialization faces many challenges when applied to domain-specific languages (DSLs). Automatic specialization (AS) techniques, such as partial evaluation and supercompilation, require monolithic implementations that are difficult to understand and modify, making it hard for domain experts <br /> ----<br /> who often are not AS experts <br /> ----<br /> to use them effectively and to add support for domain-specific optimizations. Existing techniques in manual specialization, that is, techniques that apply multi-stage programming (MSP), are often ad-hoc, making them difficult to apply to new domain-specific optimizations and difficult to prove correct.&lt;br /&gt;&lt;br /&gt;In this talk, we describe ongoing work on a generalized theory of code specialization, called staging functors, which we believe can overcome these difficulties. A staging functor gives a disciplined way to transform dynamic code fragments into partially static data that captures semantic information about the code. Further, any valid staging functor is guaranteed to be correct. Staging functors can be given with a small set of rules that can then be applied automatically, thus yielding user-customizable AS. Staging functors can also be applied manually, giving a new, disciplined, provably correct approach technique for MSP. Finally, we believe staging functors can be used for many useful domain-specific optimizations. As an example, we show how load elimination, an optimization for pointer programs, can be implemented as a staging functor.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M9Taha&diff=325 WG211/M9Taha 2011-12-12T10:06:29Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Globally Parallel, Locally Sequential=<br /> ==Walid Taha==<br /> <br /> A broad and important and resource-intensive class of computations codes are simulators for physical (or &quot;natural'') systems. Too often, such&lt;br /&gt;simulation codes are written in general purpose languages that promote a programming style that is too centered on the details of how the computation is performed, rather than the model itself. In addition, general purpose programming languages do not generally encourage the programmer (or engineer) to pay attention to programming choices that can lead to high resource costs at runtime.&lt;br /&gt;&lt;br /&gt;This report presents our preliminary results with the design of Acumen, a physical modeling language that we are designing with a specific goal of promoting writing codes that can easily be mapped to highly parallel execution platforms. The key features underlying the language's design are promoting a programming style that supports a &quot;globally parallel, locally imperative'' view of the world, as well as preserving deterministic execution even when the underlying computation is performed on a highly parallel platform. The approach appears to be promising, although it is still too early to say whether or not it can be useful in practice.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M9Sloane&diff=323 WG211/M9Sloane 2011-12-12T10:06:29Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Profile-based analysis of attribute evaluation patterns=<br /> ==Anthony M. Sloane==<br /> <br /> Attribute grammars enable complex algorithms to be defined on tree structures using simple local equations, but a full understanding of the algorithms can be hard to discern from the individual equations. We present a method of analysing attribute equations where patterns are automatically derived from a profile of attribute evaluation. The patterns can be used to aid comprehension, abstraction and refactoring of the equations. In particular, they can form the basis of higher-order reusable attribute decorators that simplify the equations.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M9Schedule&diff=321 WG211/M9Schedule 2011-12-12T10:06:29Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =IFIP Working Group 2.11, Ninth Meeting=<br /> ==December 1-3, 2010, Waterloo, Canada==<br /> ===Venue===<br /> <br /> &lt;br /&gt;The meeting will be held in the Davis Center (DC) Building on the campus of the University of Waterloo (see the DC Building on the [[http://www.uwaterloo.ca/map/index.php campus map]]). The registration will be in the Fishbowl room in the DC Building. The room has a circular glass wall<br /> ----<br /> you cannot miss it when you enter the building. The closest visitor parking in Lot N; the fee is $3 per day. See http://www.uwaterloo.ca/map/index.php#parking for more information. If parking Lot N is full, then you can try parking Lot M, which is nearby and always has spaces. Note however that parking Lot M costs a dollar more ($4 instead of $3), and accepts only coin payments (by contrast, Lot N also takes credit cards).<br /> ===Travel===<br /> <br /> Arriving by air, you will fly into the [[http://www.gtaa.com/en/home/ Toronto Pearson International Airport]] (YYZ). Waterloo is about one hour drive from the airport. The most convenient way to get from the airport to the hotel is to take the Airways Transit Shuttle. You should pre-book the door-to-door service by visiting their [[http://www.airwaystransit.com/ website]]. The website has directions for the shuttle registration desk at the airport terminal; you should report at the desk after arrival for pick-up. One-way fare for the shuttle is $83 for a single person. You can save money if you book for a party of two or more. For example, one-way fare for two adults is $118; see their [[http://www.airwaystransit.com/fare.shtml fare calculator]]. [[http://www.waterlootaxi.ca/ Waterloo Taxi]] has a flat fee of $90 per cab (not per person) with no other guests picked up.<br /> ===Ride Sharing===<br /> <br /> Chris Lengauer will arrive on Tuesday, November 30, at 21:15 on Air Canada from Montreal<br /> <br /> Bernd Fischer will arrive on Tuesday, November 30, 15:05, with Air Canada from London Heathrow. He may rent a car.<br /> <br /> Yannis Smaragdakis will arrive on Tuesday, November 30, at 8pm from NY-JFK (Delta flight 4068), and leaves on Dec. 4 at 11:40am.<br /> <br /> Eddy Westbrook will arrive on Tuesday, November 30, at 8:34 pm from Chicago (Continental flight 6972), and leaves on Dec. 3 at 6:20pm.<br /> <br /> Christian K�stner will arrive on Tuesday, November 30, at 12:30 on Air Canada AC873 from Frankfurt<br /> ===Registration===<br /> <br /> '''The registration deadline is November 15.''' The registration fee is CAD $238. In order to register for the meeting, please fill out and sign the registration form below and fax it or e-mail a scanned version (the fax number and e-mail address are specified on the form). We accept major credit cards or cheque payments.<br /> <br /> * [[Media:IFIPRegistration.pdf | IFIPRegistration.pdf ]]: Registration form (pdf)<br /> * [[Media:IFIPRegistration.doc | IFIPRegistration.doc ]]: Registration form (word)<br /> <br /> The fee covers all meals during the meetings (breakfasts, morning coffee breaks, lunches, afternoon snacks and two dinners<br /> ----<br /> one on Wednesday at [[http://www.sole.ca Sole]] and the other on Thursday at [[http://www.charcoalgroup.ca Wildcraft]]. We will organize a group dinner for those who will stay in Waterloo on Friday (not included in the registration).<br /> <br /> The recommended hotel is the [[http://www.waterlooinn.com Waterloo Inn]]. Please make your own reservation by calling the hotel at +1 (519) 884-0220 or toll-free at 1-800-361-4708. We reserved a block of rooms at the special rate of CAD $143 plus applicable taxes per night. To receive this room rate, please mention that you are with the University of Waterloo attending the IFIP meeting. The block of hotel rooms is on hold until November 1, 2010. Please make sure to make the reservation before then. It is possible to stay in the hotel at the given rate until Sunday, December 5.&lt;br /&gt;&lt;br /&gt;The Waterloo Inn has a free shuttle to the University running every 30 minutes. A taxi drive is about $10.<br /> ===Attendees===<br /> <br /> Baris Aktemur, Jo Atlee, Kacper Bak, Emilie Balland, Thiago Bartolomei, Jacques Carette, Charles Consel, Derek Drayside, Bernd Fischer, Christian Kaestner, Oleg Kiselyov, Ralf Laemmel, Chris Lengauer, Ken Shan, Tony Sloane, Yannis Smaragdakis, Walid Taha, Eddy Westbrook<br /> ===Talks===<br /> <br /> Talk slots are 45 minutes. Although the slots are fairly long, the goal is to provide time for discussion. Thus you should limit your speaking time to 25 or at most 30 minutes.<br /> <br /> Breakfast will be provided, starting at 8:00. Dinner will begin at 6:30 on Wednesday and Thursday.<br /> =====Wednesday=====<br /> <br /> 9:00-9:45: [[http://resource-aware.org/do/view/WG211/M9Smaragdakis* What Can the GC Compute Efficiently? A Language for Heap Assertions at GC Time]] Yannis Smaragdakis<br /> <br /> 9:45-10:45: [[http://resource-aware.org/do/view/WG211/M9Taha* Globally Parallel, Locally Sequential]] Walid Taha<br /> <br /> 11:15-12:00: [[http://resource-aware.org/do/view/WG211/M9Rayside* Synthesizing executable code from declarative abstraction functions]] Derek Rayside<br /> <br /> 1:30-2:15: [[http://resource-aware.org/do/view/WG211/M9Balland* Open Platforms: New Challenges for Software Engineering]] Emilie Balland<br /> <br /> 2:15-3:00: [[http://resource-aware.org/do/view/WG211/M9Bartolomei* Migration of Applications across Object-Oriented APIs]] Thiago Bartolomei<br /> <br /> 3:30-5:00: Discussion<br /> <br /> 6:30: Dinner<br /> =====Thursday=====<br /> <br /> 9:00-9:45: [[http://resource-aware.org/do/view/WG211/M9Kaestner* Variability Analysis of Legacy C Code: Parsing and Type-Checking Millions of Product Line Variants]] Christian Kaestner<br /> <br /> 9:45-10:30: [[http://resource-aware.org/do/view/WG211/M9Bak* Software Product Lines in Clafer]] Kacper Bak<br /> <br /> 11:00-11:45: [[http://resource-aware.org/do/view/WG211/M9Consel* DiaSuite: Paradigm-Oriented Software Development Approach]] Charles Consel<br /> <br /> 1:00-1:45: [[http://resource-aware.org/do/view/WG211/M9Kiselyov* Ask-by-need: generating multiple-answer RPC/web requests]] Oleg Kiselyov<br /> <br /> 1:45-2:30: [[http://resource-aware.org/do/view/WG211/M9Carette* The structure of typed generic code generators]] Jacques Carette<br /> <br /> 3:00-3:45: Motivations for working on open-source software, Michael Terry<br /> <br /> 3:45-4:30: Discussion<br /> <br /> 4:30-5:30: Business meeting (members only)<br /> <br /> 6:30: Dinner<br /> =====Friday=====<br /> <br /> 9:00-9:45: [[http://resource-aware.org/do/view/WG211/M9Sloane* Language Processing in Kiama]] Tony Sloane<br /> <br /> 9:45-10:30: [[http://resource-aware.org/do/view/WG211/M9Westbrook* Towards a Generalization of Specialization]] Eddy Westbrook<br /> <br /> 11:00-11:45 [[http://resource-aware.org/do/view/WG211/M9KiselyovShan* The MetaOCaml files: Status report and research proposal]] Oleg Kiselyov and Chung-Chieh Shan<br /> <br /> 1:15-2:00: [[http://resource-aware.org/do/view/WG211/M9Fischer* Extending code generators by transforming generated code]] Bernd Fischer<br /> <br /> 2:00-2:30: [[http://resource-aware.org/do/view/WG211/M9Laemmel* Modeling Programming Technologies]] Ralf L�mmel<br /> <br /> 3:00-3:30: Towards Combining Runtime Program Generation with Empirical Optimization, Baris Aktemur<br /> <br /> 3:30-5:00: Discussion<br /> <br /> ==File Attachments== <br /> <br /> *[[Media:IFIPRegistration.pdf | IFIPRegistration.pdf]]<br /> *[[Media:IFIPRegistration.doc | IFIPRegistration.doc]]</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M9Rayside&diff=319 WG211/M9Rayside 2011-12-12T10:06:29Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Synthesizing executable code from declarative abstraction functions=<br /> ==Derek Rayside==<br /> <br /> Data abstraction has been the dominant structuring paradigm for programs for decades. The essence of a data abstraction is the abstraction function, which relates the concrete program representation to its abstract meaning. However, abstraction functions are not generally considered to be a part of the executing program. We propose that making abstraction functions an executable part of the program can enable programmers to write clearer and more concise programs with fewer errors. &lt;br /&gt; &lt;br /&gt;In particular, we show that the object equality and hashing operations (which programmers are required to write), can often be expressed more clearly and more concisely in terms of the abstract state of the object. Getting these methods right has proven to be difficult for programmers at all skill levels, from novice through expert. In a case study of the standard Java libraries we show that rewriting the code with explicit declarative abstraction functions (and generating equality and hashing methods automatically) removed object-contract compliance faults previously found by Pacheco et al.&lt;br /&gt; &lt;br /&gt;To make abstraction functions part of the executing program we develop four techniques for the dynamic evaluation of abstraction functions written in a declarative first-order logic with relations and transitive closure. We observe that the abstraction functions programmers write in practice may often be viewed as navigation queries on the heap, and two of our techniques exploit this insight to synthesize executable code from declarative abstraction functions. The performance of our research prototype is within striking distance of hand-written code.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M9Laemmel&diff=317 WG211/M9Laemmel 2011-12-12T10:06:29Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Modeling Programming Technologies=<br /> ==Ralf L�mmel==<br /> <br /> I will present preliminary results of an effort on understanding programming technologies at an ontological and megamodeling level. The idea is to capture technologies at a high level of abstraction so that their architecture, the potential intentions for their use, and the characteristics of their actual use in projects are comprehensible without detailed knowledge of the technologies--also in a manner that comparisons across technologies are meaningful and approachable.&lt;br /&gt;&lt;br /&gt;This is joint work with&lt;br /&gt;Jean-Marie Favre (OneTree Technologies, Luxembourg) and Dragan Gasevic (Athabasca University, Canada).</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M9KiselyovShan&diff=315 WG211/M9KiselyovShan 2011-12-12T10:06:29Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> ==The MetaOCaml files==<br /> ==Oleg Kiselyov, Chung-chieh Shan==<br /> <br /> MetaOCaml, a dialect of OCaml, is the best-developed way today to write custom code generators and assure them type-safe across multiple stages of computation. We report on the status of the ongoing MetaOCaml project, focusing on the gap between theory and practice and the difficulties that arise in a full-featured staged language rather than an idealized calculus. It is not clear, even in theory, how staging interacts with effects, polymorphism, user-defined data types, and the module system. We highlight foundational problems in type soundness and cross-stage persistence that demand investigation.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M9Kiselyov&diff=313 WG211/M9Kiselyov 2011-12-12T10:06:29Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> ==Ask-by-need: generating multiple-answer RPC/web requests==<br /> ===Oleg Kiselyov===<br /> <br /> At the 2009 meeting of WG2.11, William Cook presented a new remote procedure call (RPC) mechanism, relying on packaging several calls into one RPC request to minimize the communication overhead. We report an earlier and independent development of request bundling, taking advantage of (simulated) lazy evaluation to automatically discover the RPC calls to bundle. Delaying and bundling input requests becomes especially beneficial when communicating with a user through a web browser. The difference is then between asking for several pieces of data on separate web forms, or on one form. We describe the implementation in a strict language, as an OCaml library for Web programming.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M9Kaestner&diff=311 WG211/M9Kaestner 2011-12-12T10:06:29Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> ==Variability Analysis of Legacy C Code: Parsing and Type-Checking Millions of Product Line Variants==<br /> ==Christian Kaestner==<br /> <br /> Despite much research on sophisticated programming languages and generators to implement software product lines, practitioners still implement variability in most industrial product lines with the C preprocessor. The ad-hoc nature and undisciplined use of file inclusion, macro substitution and conditional compilation on text level makes analysis difficult. While product-line-aware type systems and safe generators have been developed for novel languages, product lines implemented with the C preprocessor must still be checked by checking the (potentially millions of) generated variants instead of checking the generator. We present an approach to parse, analyze, and type check unpreprocessed C code including all #ifdef variability. To that end, we are developing a partial preprocessor, a specialized feature-aware parser, and a product-line-aware type system for C. Our long term goal is to type check all variants of the Linux kernel with its over 8000 features.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M9Fischer&diff=309 WG211/M9Fischer 2011-12-12T10:06:29Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Extending code generators by transforming generated code=<br /> ==Bernd Fischer==<br /> <br /> Code generated from high-level specifications often requires modification before deployment, but no approach exists that allows an application programmer to make these modifications in a safe, reliable, and systematic way. Hence, incomplete or incorrect generators cannot be changed easily, domain evolution is not supported, and experimenting with new features is not possible. In this talk, I'll show how to modify and extend code generators indirectly, by automatically transforming the generated code. Two related techniques to enable automatic code customizations are explored: i) syntactic customization patches, whose implementation required Stratego to be extended to allow the embedding of concrete syntax in concrete syntax and ii) semantic join points, implemented as Java annotations and weaved into the generated code using AspectJ. Both approaches are based on ideas from aspect-oriented programming, but have opposite characteristics. Customization patches do not require changes to the underlying code generator, but can suffer from the fragile point-cut problem, while semantic join points are stable but require support from the generator. I will describe and evaluate the application of these techniques in the customization of WebDSL, a domain-specific language for modeling dynamic, data-rich web applications.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M9Carette&diff=307 WG211/M9Carette 2011-12-12T10:06:29Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =The structure of typed generic code generators=<br /> ==Jacques Carette==<br /> <br /> Now that the feasibility of writing complex typed code generators has been established, along with the creation of a toolset for writing typed code generators, we need to understand how to structure and modularize these new programs. Through the investigation of several program families (generally arising from mathematical software), we have built up a methodology for this task. This methodology will be outlined, as well as several of the key ingredients which make this feasible: abstract interpretation, abstract algebra, partial evaluation, and compile-time symbolic computation. One important feature of our approach is that it relies on (carefully) mixing existing techniques rather than on ``new'' tools.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M9Bartolomei&diff=305 WG211/M9Bartolomei 2011-12-12T10:06:29Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Migration of Applications across Object-Oriented APIs=<br /> ==Thiago Tonelli Bartolomei==<br /> <br /> Evolving requirements may necessitate API migration: re-engineering an application to replace its dependence on one API with dependencies on another API for the same domain. In this talk we give an overview of our efforts towards mastering API migration for object-oriented APIs. We start with the results of case studies we conducted on applying a wrapping approach to API migration in practice. We show that wrappers around realistic object-oriented APIs must account for their deep inheritance hierarchies, various multiplicities of type mappings and other non-trivial API mismatches. We follow with our current work on Pitta, a domain specific language for API migration. Pitta's main goals are to support developers in uncovering and managing API mismatches, to free developers from error-prone boilerplate wrapping code, and to enable client application analyses to be derived from the specifications. All that while still looking familiar to regular developers (Pitta constructs are implemented on top of Java). Finally, we describe our plans for applying Pitta as a transformation specification and skim through the challenges that lie ahead.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M9Balland&diff=303 WG211/M9Balland 2011-12-12T10:06:29Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> ==Open Platforms: New Challenges for Software Engineering==<br /> ===Emilie Balland===<br /> <br /> Recently, platforms running third-party applications have become very popular, in particular due to the explosion of the smartphone market. These open platforms propose a rich stream of applications, targeting general-purpose as well as customized user needs. Developing applications for such target platforms introduces new requirements and raises new challenges. After an overview of the existing approaches, we identify the challenges for the next generation of open platforms.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M9Bak&diff=301 WG211/M9Bak 2011-12-12T10:06:29Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Software product lines in Clafer=<br /> ==Kacper Bak==<br /> <br /> Clafer is a meta-modeling language with first-class support for feature modeling. It can model various aspects of software product lines and allows for performing non-trivial analyses on them. We designed Clafer as a concise notation for meta-models, feature models, mixtures of meta- and feature models (such as components with options), and models that couple feature models and meta-models via constraints (such as mapping feature configurations to component configurations or model templates). Clafer also allows arranging models into multiple specialization and extension layers via constraints and inheritance. We identify four key mechanisms allowing a meta-modeling language to express feature models concisely and show that Clafer meets its design objectives using a sample product line. We evaluated Clafer and how it lends itself to analysis on sample feature models, meta-models, and model templates of an E-Commerce platform.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M8Westbrook&diff=299 WG211/M8Westbrook 2011-12-12T10:06:29Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Mint: Java Multi-stage Programming Using Weak Separability=<br /> ==Ed Westbrook==<br /> <br /> Multi-stage programming (MSP) provides a disciplined approach to run-time code generation. In the purely functional setting, it has been shown how MSP can be used to reduce the overhead of abstractions, allowing clean, maintainable code without paying performance penalties. Unfortunately, MSP is difficult to combine with imperative features, which are prevalent in mainstream languages. The central difficulty is scope extrusion, wherein free variables can inadvertently be moved outside the scopes of their binders. This paper proposes a new approach to combining MSP with imperative features that occupies a &quot;sweet spot&quot; in the design space in terms of how well useful MSP applications can be expressed and how easy it is for programmers to understand. The key insight is that escapes (or &quot;anti-quotes&quot;) must be weakly separable from the rest of the code, i.e. the computational effects occurring inside an escape that are visible outside the escape are guaranteed to not contain code. To demonstrate the feasibility of this approach, we formalize a type system based on Lightweight Java which we prove sound, and we also provide an implementation, called Mint, to validate both the expressivity of the type system and the effect of staging on the performance of Java programs.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M8Visser&diff=297 WG211/M8Visser 2011-12-12T10:06:29Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> Building IDEs for Domain-Specific Languages with Spoofax/IMP<br /> <br /> Eelco Visser<br /> <br /> Domain-specific languages are a key component of program generation. While we have ample experience building code generators and compilers, modern software developers expect integrated development environments such as Eclipse and Visual Studio to boost their productivity. To achieve the productivity gain promised by domain-specific languages, it is required that they come with strong IDE support. Since the production of DSLs cannot afford the effort that is put into IDEs for general-purpose languages, better tools are needed.&lt;br /&gt;&lt;br /&gt;In this talk I present Spoofax/IMP, an Eclipse plugin for creating Eclipse plugins for custom (domain-specific) languages. Spoofax integrates several domain-specific languages for language definition. SDF supports modular, declarative definition of syntax with arbitrary context-free grammars integrating lexical syntax. A new implementation of the SGLR parser for SDF supports sophisticated error recovery. Stratego supports model transformation, code generation, static analysis, and refactoring with rewrite rules and programmable strategies. Editor service DSLs support declaration and customization of syntactic editor services such as syntax highlighting, folding, outline views, and semantic editor services such as error checking, cross references, content completion, and refactorings.&lt;br /&gt;&lt;br /&gt;I'll introduce Spoofax by discussing a definition for a subset of the WebDSL web programming language. The talk will be partly slides and&lt;br /&gt;partly demonstration.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M8VanWyk&diff=295 WG211/M8VanWyk 2011-12-12T10:06:29Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Bidirectional Attribute Grammars and their use in Extensible Languages=<br /> ==Eric Van Wyk==<br /> <br /> We discuss how bidirectional transformations can be realized in higher order attribute grammars. In this approach, as in other means for realizing bidirectional transformations, a mapping from a source language to a target language (called the &quot;get&quot; function in bidirectional parlance) is used to generate a function from the target back to the source (called the &quot;put&quot; function). When possible the put function uses the original source language phrase to map the generated target language phrase back to the same source language phrase. When the source phrase is not available the put function should generate source phrases that exhibit desirable properties; for example, expressions that have the minimal number of required parenthesis. Such transformations are useful in extensible languages; for example in generating a host language program from one containing domain specific language extensions, non-transformed source constructs should be recognizable to the programmer. This is joint work with Jo\~ao Saraiva.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M8Schultz&diff=293 WG211/M8Schultz 2011-12-12T10:06:29Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Language Support for Robust and Reversible Self-Reconfiguration=<br /> ==Ulrik Schultz==<br /> <br /> Modular, self-reconfigurable robots are robots that can change their own shape by physically rearranging the modules from which they are built. Self-reconfiguration can be controlled by e.g. an off-line planner, but numerous implementation issues hamper the actual self-reconfiguration process: the continuous evolution of the communication topology increases the risk of communications failure, generating code that correctly controls the self-reconfiguration process is non-trivial, and hand-tuning the self-reconfiguration process is tedious and error-prone.&lt;br /&gt;&lt;br /&gt;To address these issues, we have developed a distributed scripting language that controls self-reconfiguration of the ATRON robot using a robust communication scheme that relies on local broadcast of shared state. This language can be used as the target of a planner, offers direct support for parallelization of independent operations while maintaining correct sequentiality of dependent operations, and compiles to a robust and efficient implementation. Moreover, a novel feature of this language is its reversibility: once a self-reconfiguration sequence is described the reverse sequence is automatically available to the programmer, significantly reducing the amount of work needed to deploy self-reconfiguration in larger scenarios.&lt;br /&gt;&lt;br /&gt;In this talk I will give an overview of our approach and discuss issues related to the continued development of a general-purpose&lt;br /&gt;scripting language for embedded systems and the role of reversible sequences in a general-purpose language.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M8Schedule&diff=291 WG211/M8Schedule 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =IFIP Working Group 2.11, Eighth Meeting=<br /> ==March 1-3, 2010, St. Andrews Scotland==<br /> <br /> =Organizers=<br /> <br /> {kh,ch} at cs dot st hyphen andrews dot ac dot uk<br /> <br /> =Registration=<br /> <br /> [[https://onlineshop.st-andrews.ac.uk/browse/product.asp?catid=18&amp;modid=2&amp;compid=1 Register here]]<br /> <br /> =Meeting location=<br /> <br /> The meeting will take place in the center of town, in the Parliament Hall, which is on South Street.<br /> <br /> More information about the meeting location is available [[http://www-fp.cs.st-andrews.ac.uk/wg211-meeting/ here]].<br /> <br /> =Meeting schedule=<br /> <br /> The meeting will take place over three full days. Plan on leaving on the night of March 3, or on March 4.<br /> <br /> =Accomodations=<br /> <br /> Here are some links for bed and breakfasts:<br /> <br /> [[http://www.thealbanystandrews.co.uk/]]<br /> <br /> [[http://www.aboutscotland.co.uk/fife/queensterrace.html]]<br /> <br /> [[http://www.deveronhouse.com/1.html]]<br /> <br /> [[http://www.5pilmourplace.com/]]<br /> <br /> [[http://www.nethan-standrews.com/Nethan_Guest_House/Welcome.html]]<br /> <br /> [[http://www.brownlees.co.uk/]]<br /> <br /> More information about accomodations is available [[http://www-fp.cs.st-andrews.ac.uk/wg211-meeting/ here]].<br /> <br /> The price range is roughly 50-70 pounds per person per night based on two sharing. Single occupancy of double/twin rooms might be possible with some extra charge. Special offers might be possible for several days, e.g. named &quot;Winter Breaks&quot; at the Albany Hotel based on two people sharing.<br /> <br /> More bed and breakfasts are available &lt;a &quot;href=http://www.stayinstandrews.co.uk/&quot;&gt;here&lt;/a&gt;<br /> <br /> The nearest airport is Edinburgh, another convenient alternative is Glasgow International. Glasgow Prestwick might be an alternative if you travel Ryanair, but the train journey can take roughly 4 hours and you need to switch train stations in Glasgow, so it is recommended only if you arrive on Sunday afternoon not too late. You can find train connections [[http://www.scotrail.co.uk/ here]]<br /> <br /> St Andrews train station is in a small town &quot;Leuchars&quot; a few miles outside St Andrews. From there you can take a scheduled bus until about 10pm. Taxis are available as well for roughly 12-15. If you arrive at Edinburgh Airport, there is a bus into Edinburgh city centre where you get access to the train line via Haymarket (best) or Waverley station. If you need to arrive late on Sunday, please contact the organizers so they can arrange a shuttle bus.<br /> <br /> =Ride sharing=<br /> <br /> A taxi from the Edinburgh airport to St Andrews would cost roughly 50 to 70 pounds if booked in advance. The organizers will collect travel dates in February and then negotiate shuttle transport or taxi with the University's travel service.<br /> <br /> More information about ride sharing is available [[http://www-fp.cs.st-andrews.ac.uk/wg211-meeting/ here]].<br /> <br /> =Attendees=<br /> <br /> Baris Aktemur, Sven Apel, Edwin Brady, William Cook, Ewen Denney, Simon Dobson, Bernd Fischer, Robert Gl�ck, Kevin Hammond, Christoph Herrmann, Chris Jefferson, Steffen Jost, Christian K�stner, Paul Kelly, Ralf L�mmel, Julia Lawall, Anne Fran�oise Le Meur, Christian Lengauer, Graham Markall, Greg Michaelson, Ian Miguel, John O'Donnell, Ina Schaefer, Ulrik Schultz, Eric Van Wyk, Eelco Visser, Stephanie Weirich, Ed Westbrook<br /> =Program=<br /> <br /> To enter your title and abstract, instantiate a copy of the code below, removing the &quot;-&quot;s between the [ [ and ] ], and filling in your name and the talk title. If you click on the link, it should give you the option to create a page on which you can enter your abstract.<br /> <br /> [-[http://resource-aware.org/do/view/WG211/M8Name*][Talk title]-] Name<br /> <br /> [[http://resource-aware.org/do/view/WG211/M8Kaestner* Virtual separation of concerns - Toward preprocessors 2.0]] [[Media:Kaestner_M8_slides.pdf | (slides) ]] Christian Kaestner<br /> <br /> [[http://resource-aware.org/do/view/WG211/M8Glueck* An experiment with the fourth Futamura projection]] Robert Glueck<br /> <br /> [[http://resource-aware.org/do/view/WG211/M8Apel* Safe Generation in Feature-Oriented Software Development]] [[Media:Apel_M8_slides.pdf | (slides) ]] Sven Apel<br /> <br /> [[http://resource-aware.org/do/view/WG211/M8Michaelson* Costing by Construction for Box-based System Development]] [[Media:Michaelson_M8_slides.ppt | (slides) ]] Greg Michaelson<br /> <br /> [[http://resource-aware.org/do/view/WG211/M8Dobson* Programming for adaptive sensor networks: back to the future]] [[Media:Dobson_M8_slides.pdf | (slides) ]] Simon Dobson<br /> <br /> [[http://resource-aware.org/do/view/WG211/M8Cook* Online Partial Evaluation of Model Interpreters in Java]] William Cook<br /> <br /> [[http://resource-aware.org/do/view/WG211/M8Aktemur* Relating Staged Computation to the Record Calculus]] [[Media:Aktemur_M8_slides.pdf | (slides) ]] Baris Aktemur<br /> <br /> [[http://resource-aware.org/do/view/WG211/M8Schaeffer* Software Product Lines]] [[Media:Schaefer_M8_slides.pdf | (slides) ]] Ina Schaefer<br /> <br /> [[http://resource-aware.org/do/view/WG211/M8ODonnell* Datapath and control correspond to language and program]] John O'Donnell<br /> <br /> [[http://resource-aware.org/do/view/WG211/M8Hack* AnySL: Efficient and Portable Multi-Language Shading]] Sebastian Hack<br /> <br /> [[http://resource-aware.org/do/view/WG211/M8Hermann* An embedded DSL for the parameterised specification, resource analysis and scheduling of systems composed of functional building blocks]] [[Media:Hermann_M8_slides.pdf | (slides) ]] Christoph Hermann<br /> <br /> [[http://resource-aware.org/do/view/WG211/M8Visser* Building IDEs for Domain-Specific Languages with Spoofax/IMP]] Eelco Visser<br /> <br /> [[http://resource-aware.org/do/view/WG211/M8Weirich* Generic programming with dependent types]] [[Media:Weirich_M8_slides.pptx | (slides) ]] Stephanie Weirich<br /> <br /> [[http://resource-aware.org/do/view/WG211/M8VanWyk* Bidirectional Attribute Grammars and their use in Extensible Languages]] [[Media:VanWyk_M8_slides.pdf | (slides) ]] Eric Van Wyk<br /> <br /> [[http://resource-aware.org/do/view/WG211/M8Jefferson* DoMinion : Generating Efficient Constraint Programming Solvers]] Christopher Jefferson<br /> <br /> [[http://resource-aware.org/do/view/WG211/M8Markall* Generating optimised multiplatform finite element solvers from high-level representations]] [[Media:Markhall_M8_slides.pdf | (slides) ]] Graham Markall<br /> <br /> [[http://resource-aware.org/do/view/WG211/M8Westbrook* Mint: Java Multi-stage Programming Using Weak Separability]] [[Media:Westbrook_M8_slides.pdf | (slides) ]] Ed Westbrook<br /> <br /> [[http://resource-aware.org/do/view/WG211/M8Schultz* Language Support for Robust and Reversible Self-Reconfiguration]] Ulrik Schultz<br /> <br /> [[http://resource-aware.org/do/view/WG211/M8Brady* Implementing Domain Specific Languages using Dependent Types and Partial Evaluation]] Ed Brady<br /> <br /> Discussion on teaching DSLs/program generation: Ulrik Schultz<br /> <br /> Presentation of the German Research Priority Programme Proposal &quot;Manycore&quot;: Chris Lengauer<br /> <br /> Presentation of [[http://researchr.org/ researchr.org]]: Eelco Visser<br /> <br /> =Schedule=<br /> &lt;table align=&quot;left&quot; style=&quot;width: 850px; height: 244px;&quot; border=&quot;0&quot;&gt; &lt;tbody&gt; &lt;tr&gt; &lt;td&gt; &lt;/td&gt; &lt;td&gt;Monday&lt;/td&gt; &lt;td&gt;Tuesday&lt;/td&gt; &lt;td&gt;Wednesday&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &lt;td&gt;9:00&lt;/td&gt; &lt;td&gt;[[http://resource-aware.org/do/view/WG211/M8Kaestner''' Kaestner]]&lt;/td&gt; &lt;td&gt;[[http://resource-aware.org/do/view/WG211/M8Weirich''' Weirich]]&lt;/td&gt; &lt;td&gt;[[http://resource-aware.org/do/view/WG211/M8Dobson''' Dobson]]&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &lt;td&gt;9:45&lt;/td&gt; &lt;td&gt;[[http://resource-aware.org/do/view/WG211/M8Apel''' Apel]]&lt;/td&gt; &lt;td&gt;[[http://resource-aware.org/do/view/WG211/M8Brady''' Brady]]&lt;/td&gt; &lt;td&gt;[[http://resource-aware.org/do/view/WG211/M8Jefferson''' Jefferson]]&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &lt;td&gt;10:30&lt;/td&gt; &lt;td&gt;Break&lt;/td&gt; &lt;td&gt;Break&lt;/td&gt; &lt;td&gt;Break&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &lt;td&gt;11:00&lt;/td&gt; &lt;td&gt;[[http://resource-aware.org/do/view/WG211/M8Schaeffer''' Schaefer]]&lt;/td&gt; &lt;td&gt;[[http://resource-aware.org/do/view/WG211/M8Michaelson''' Michaelson]]&lt;/td&gt; &lt;td&gt;[[http://resource-aware.org/do/view/WG211/M8ODonnell''' O'Donnell]]&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &lt;td&gt;11:45&lt;/td&gt; &lt;td&gt;[[http://resource-aware.org/do/view/WG211/M8Markall''' Markall]]&lt;/td&gt; &lt;td&gt;[[http://resource-aware.org/do/view/WG211/M8Aktemur''' Aktemur]]&lt;/td&gt; &lt;td&gt;Short presentations by Lengauer and Cook&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &lt;td&gt;12:30&lt;/td&gt; &lt;td&gt;Lunch&lt;/td&gt; &lt;td&gt;Lunch&lt;/td&gt; &lt;td&gt;Lunch&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &lt;td&gt;14:00&lt;/td&gt; &lt;td&gt;[[http://resource-aware.org/do/view/WG211/M8Glueck''' Glueck]]&lt;/td&gt; &lt;td&gt;Excursion&lt;/td&gt; &lt;td&gt;[[http://resource-aware.org/do/view/WG211/M8Discuss''' Discussion on teaching program generation and DSLs]]&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &lt;td&gt;14:45&lt;/td&gt; &lt;td&gt;[[http://resource-aware.org/do/view/WG211/M8Cook''' Cook]]&lt;/td&gt; &lt;td&gt;Excursion&lt;/td&gt; &lt;td&gt;[[http://resource-aware.org/do/view/WG211/M8Hermann''' Hermann]]&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &lt;td&gt;15:30&lt;/td&gt; &lt;td&gt;Break&lt;/td&gt; &lt;td&gt;Short presentation by Visser&lt;/td&gt; &lt;td&gt;Break&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &lt;td&gt;16:00&lt;/td&gt; &lt;td&gt;[[http://resource-aware.org/do/view/WG211/M8Laemmel''' Laemmel]]&lt;/td&gt; &lt;td&gt;[[http://resource-aware.org/do/view/WG211/M8Schultz''' Schultz]]&lt;/td&gt; &lt;td&gt;[[http://resource-aware.org/do/view/WG211/M8VanWyk''' Van Wyk]]&lt;br /&gt;&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &lt;td&gt;16:45&lt;/td&gt; &lt;td&gt;[[http://resource-aware.org/do/view/WG211/M8Westbrook''' Westbrook]]&lt;/td&gt; &lt;td&gt;[[http://resource-aware.org/do/view/WG211/M8Visser''' Visser]]&lt;/td&gt; &lt;td&gt;17:00 Departure&lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &lt;td&gt;17:30&lt;/td&gt; &lt;td&gt;Business Meeting&lt;/td&gt; &lt;td&gt;&lt;/td&gt; &lt;td&gt; &lt;/td&gt; &lt;/tr&gt; &lt;tr&gt; &lt;td&gt;19:00&lt;/td&gt; &lt;td&gt;Departure&lt;/td&gt; &lt;td&gt;Departure&lt;/td&gt; &lt;td&gt; &lt;/td&gt; &lt;/tr&gt; &lt;/tbody&gt; &lt;/table&gt;<br /> <br /> ==File Attachments== <br /> <br /> *[[Media:Weirich_M8_slides.pptx | Weirich_M8_slides.pptx]]<br /> *[[Media:Dobson_M8_slides.pdf | Dobson_M8_slides.pdf]]<br /> *[[Media:Aktemur_M8_slides.pdf | Aktemur_M8_slides.pdf]]<br /> *[[Media:Michaelson_M8_slides.ppt | Michaelson_M8_slides.ppt]]<br /> *[[Media:Hermann_M8_slides.pdf | Hermann_M8_slides.pdf]]<br /> *[[Media:Markhall_M8_slides.pdf | Markhall_M8_slides.pdf]]<br /> *[[Media:Schaefer_M8_slides.pdf | Schaefer_M8_slides.pdf]]<br /> *[[Media:Kaestner_M8_slides.pdf | Kaestner_M8_slides.pdf]]<br /> *[[Media:Westbrook_M8_slides.ppt | Westbrook_M8_slides.ppt]]<br /> *[[Media:Apel_M8_slides.pdf | Apel_M8_slides.pdf]]<br /> *[[Media:VanWyk_M8_slides.pdf | VanWyk_M8_slides.pdf]]</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M8Schaeffer&diff=289 WG211/M8Schaeffer 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Software Product Lines=<br /> ==Ina Schaeffer==<br /> <br /> A software product line is a set of systems with well-defined commonalities and variabilities. Because of the huge number of possible configurations, it is crucial to guarantee critical system requirements. However, it is infeasible to formally verify each system in isolation. Instead, verification artifacts, i.e., properties and their proofs, should be reused in same way as other development artifacts.&lt;br /&gt;&lt;br /&gt;In this talk, I present the concept of proof reuse for the efficient verification of software product lines. The presented approach is based on delta-modeling, a general technique to capture feature-based variability of software product lines. A set of systems is represented by a core system and a set of system deltas modifying the core to create other systems. The delta-modeling structure can be exploited to determine the reuse potential for proofs of system properties. This will be illustrated using the KeY verification system for Java.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M8ODonnell&diff=287 WG211/M8ODonnell 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Datapath and control correspond to language and program=<br /> ==John O'Donnell==<br /> <br /> &lt;br /&gt;Complex digital circuits are usually organised in two sections: datapath and control. Traditional circuit design methodology views these sections as just hardware systems, but they can also be understood using language terminology: the datapath provides a set of constructs, while the control expresses an algorithm in terms of those constructs. Thus a datapath defines a domain specific language, while the control is a program in that language. This correspondence can be exploited to clarify the design of processors.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M8Markall&diff=285 WG211/M8Markall 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Generating optimised multiplatform finite element solvers from high-level representations=<br /> ==Graham Markall==<br /> <br /> High-performance implementations of finite element methods on different targets typically are implemented using different algorithms that provide the best fit for the target architecture. This presents a problem for application developers, as it complicates the task of maintaining multiple implementations for different targets. The Unified Form Language (UFL) from the FEniCS project can be used to address this issue as it permits a high-level, platform-independent specification of a method to be given. We show that optimal implementations of a finite element solver written for a Graphics Processing Unit and a multicore CPU require the use of different algorithms and data formats that are embodied by the UFL representation.&lt;br /&gt;&lt;br /&gt;UFL sources are converted to low-level implementations by a UFL compiler. We outline the operation of two implementations of prototype compilers for UFL that generate CUDA code. The first, a proof-of-concept, demonstrates the feasibility of generating low-level implementations for multiple targets. The second implementation, a work in progress, generates optimised code by making problem-dependent implementation choices. Future work involves targeting OpenCL and x86/SSE, as well as exploring algorithmic choices that depend upon problem parameters.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M8Laemmel&diff=283 WG211/M8Laemmel 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Recovering Grammar Relationships for the Java Language Specification=<br /> ==Ralf L�mmel==<br /> <br /> We describe a refined method for grammar convergence, and we use it in a major study, where we recover the relationships between all the grammars that occur in the different versions of the Java Language Specification (JLS). The relationships are represented as grammar transformation chains that capture all accidental or intended differences between the JLS grammars. This method is mechanized and driven by nominal and structural differences between pairs of grammars that are subject to asymmetric, binary convergence steps. We present the underlying operator suite for grammar transformation in detail, and we illustrate the suite with many examples of transformations on the JLS grammars. We also describe the extraction effort, which was needed to make the JLS grammars amenable to automated processing. We include substantial metadata about the convergence process for the JLS so that the effort becomes reproducible and transparent.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M8Kaestner&diff=281 WG211/M8Kaestner 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Virtual separation of concerns - Toward preprocessors 2.0=<br /> ==Christian Kaestner==<br /> <br /> Conditional compilation with preprocessors like cpp is a simple but effective means to implement variability. By annotating code fragments with emph #ifdef and emph #endif directives, different program variants with or without these fragments can be created, which can be used (among others) to implement software product lines. Although, preprocessors are frequently used in practice, they are often criticized for their negative effect on code quality and maintainability. In contrast to modularized implementations, for example using components or aspects, preprocessors neglect separation of concerns, are prone to introduce subtle errors, can entirely obfuscate the source code, and limit reuse. Our aim is to rehabilitate the preprocessor by showing how simple tool support can address these problems and emulate some benefits of modularized implementations. At the same time we emphasize unique benefits of preprocessors, like simplicity and language independence. Although we do not have a definitive answer on how to implement variability, we want highlight opportunities to improve preprocessors and encourage research toward novel preprocessor-based approaches.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M8Jefferson&diff=279 WG211/M8Jefferson 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =DoMinion : Generating Efficient Constraint Programming Solvers=<br /> ==Christopher Jefferson==<br /> <br /> Constraint Programming is a field where the efficiency of software tools is paramount. The Minion constraint solver was developed at St. Andrews and has been carefully tuned to have high performance over as many problems as possible.&lt;br /&gt;&lt;br /&gt;This talk will present preliminary research in our new solver, DoMinion, which aims to generate a custom-solver for a given problem, using a large range of component parts. Our aim is to allow as generic a system as possible, while ensuring the resulting solvers are as fast as custom-written ones.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M8Hermann&diff=277 WG211/M8Hermann 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =An embedded DSL for the parameterised specification, resource analysis and scheduling of systems composed of functional building blocks=<br /> ==Christoph Hermann==</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M8Hack&diff=275 WG211/M8Hack 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =AnySL: Efficient and Portable Multi-Language Shading=<br /> ==Sebastian Hack==<br /> <br /> In graphics, shaders have become a key part of 3D scene descriptions -- especially since programmable GPUs also made them available for realtime graphics. While a number of different shading languages have been developed, none of them is broadly supported across the variety of rendering systems, making it hard, if not impossible, to create portable scene descriptions.<br /> <br /> AnySL attacks the issue from multiple directions: We compile shaders from different languages into a common, portable representation, which uses subroutine threaded code consisting of calls to a virtual shader interpreter. We further simplify the implementation of this virtual interpreter for a specific renderer by providing a generic shading library that implements common shading functionality in terms of abstract data types.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M8Glueck&diff=273 WG211/M8Glueck 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =An experiment with the fourth Futamura projection=<br /> ==Robert Glueck==<br /> <br /> We have experimentally validated the theoretical insight, that a compiler generator is a generating extension of a program specializer, by showing that an existing offline partial evaluator can perform the fourth Futamura projection. Specifically, an online and an offline partial evaluator for an imperative flowchart language were transformed into two new compiler generators by Romanenko's classical partial evaluator Unmix. The two partial evaluators are described, as is a novel recursive method for polyvariant specialization. These results strongly indicate that existing partial evaluation techniques can be put to work on several new applications.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M8Dobson&diff=271 WG211/M8Dobson 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Programming for adaptive sensor networks: back to the future=<br /> ==Simon Dobson==<br /> <br /> &lt;br /&gt;Programming for sensor networks sometimes seems to combine the entire history of computer science into one single challenge: fitting a modern, advanced, robust, adaptive distributed system onto platforms with the computational power of a mid-1980's home computer. If we're to make such networks behave correctly in the face of changing environments and tasks, we need radically to re-think how we develop code for them. Treating the network as a whole, and generating as much of the code as possible according to a higher-level description of its behaviour, seems like the only way forward.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M8Discuss&diff=269 WG211/M8Discuss 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Discussion on teaching program generation and DSLs=<br /> ==Ulrik Schultz==<br /> <br /> The goal of this discussion is to share experience regarding teaching program generation and domain-specific languages. The goal is to establish a shared repository of knowledge e.g. stored on the wiki. We will split into a number of smaller groups that will discuss specific topics, at the end each group will summarize their results and provide a complete account on the&lt;br /&gt;wiki. Suggested topics are<br /> * successful approaches to teaching program generation or domain-specific languages (prepare a 5-minute account of what works well, or alternatively 1-minute account of what not to do if it did not work so well)<br /> * motivating examples, both perspectives and exercises (e.g., code generation for Airbus is a perspective whereas GUI generation could be an exercise)<br /> * literature list: seminal papers, useful textbooks, exciting papers<br /> <br /> Please email Ulrik (ups@mmmi.sdu.dk) if you have more suggestions.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M8Cook&diff=267 WG211/M8Cook 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Online Partial Evaluation of Model Interpreters in Java=<br /> ==William Cook==<br /> <br /> I'll about my ongoing work to implement model compilers by partial evaluation of model interpreters. My team is now building a new online partial evaluator for Java. It is implemented in JastAdd and support supercompilation. I will discuss our current status and experiments applying the system to the ModelTalk and WebDSL modeling languages.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M8Brady&diff=265 WG211/M8Brady 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Implementing Domain Specific Languages using Dependent Types and Partial Evaluation=<br /> ==Ed Brady==<br /> <br /> In this talk, I will describe the efficient implementation of domain specific languages (DSLs) in Idris, a dependently typed functional&lt;br /&gt;programming language. I will show how Idris can be used to implement a verified network transport protocol, as a DSL. I will present experimental evidence that partial evaluation of such programs yields efficient residual programs whose performance is competitive with their Java and C equivalents and which are also, through the use of dependent types, verifiably type- and resource-safe.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M8Apel&diff=263 WG211/M8Apel 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Safe Generation in Feature-Oriented Software Development=<br /> ==Sven Apel==<br /> <br /> Feature-oriented software development (FOSD) is an emerging paradigm that provides a multitude of formalisms, methods, languages, and tools for building well-structured, customizable, and extensible software systems. The idea is to decompose software along its end-user visible features and to generate tailored software systems based on feature selections of users. The set of valid feature combinations of a domain is called a software product line.&lt;br /&gt;&lt;br /&gt;In this talk, I will give an overview of some recent developments in this field. Especially, I will concentrate on recent attempts to ensure correctness properties throughout the FOSD process. This includes work on type checking, formal verification, and feature interaction analysis of feature-oriented software product lines.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M8Aktemur&diff=261 WG211/M8Aktemur 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> =Relating Staged Computation to the Record Calculus=<br /> ==Baris Aktemur==<br /> <br /> It has been previously shown that there is a close relation between record calculus and program generation (e.g. Lisp-like quasiquotations): A translation has been defined to convert staged expressions to record calculus expressions, and it has been shown that the call-by-value semantics of the staged and the record calculi are equivalent, modulo the translation and admin reductions. This relation has led to the result that a record calculus type system can be used to type-check staged expressions. In this work-in-progess, we investigate the relation further. The contributions are twofold: &lt;br /&gt;&lt;br /&gt;(1) We fine-tune the previously found relation between the two operational semantics, and obtain more precise results. In particular, we show that three kinds of admin reductions suffice, and these reductions can be applied exhaustively.&lt;br /&gt;&lt;br /&gt;(2) We define a reverse translation that converts record calculus expressions back to the staged calculus, allowing us to go back and forth between the two calculi. As a result, taking a step of evaluation in the staged calculus is equal to first translating the staged expression to a record expression, then taking a step of evaluation in the record calculus followed by exhaustive admin reductions, and finally translating the resulting record expression back to the staged calculus.&lt;br /&gt;&lt;br /&gt;We believe that this result is an important step towards reusing already-existing record calculus static analyses <br /> ----<br /> not only type checking <br /> ----<br /> to reason about staged expressions.</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M7Weirich2&diff=259 WG211/M7Weirich2 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> &lt;h1&gt;LNgen: Tool Support for Locally Nameless Representations&lt;/h1&gt;<br /> &lt;h3&gt;Stephanie Weirich and Brian Aydemir&lt;/h3&gt;<br /> <br /> Abstract: Given the complexity of the metatheoretic reasoning involved<br /> with current programming languages and their type systems, techniques<br /> for mechanical formalization and checking of the metatheory have<br /> received much recent attention. In previous work [1], we advocated a<br /> combination of locally nameless representation and cofinite<br /> quantification as a lightweight style for carrying out such<br /> formalizations in the Coq proof assistant. As part of the<br /> presentation of that methodology, we described a number of operations<br /> associated with variable binding and listed a number of properties,<br /> called ``infrastructure lemmas,'' about those operations that needed<br /> to be shown. The proofs of these infrastructure lemmas are generally<br /> straightforward, given a specification of the binding structure of the<br /> language.<br /> <br /> In this work, we present LNgen [2], a prototype tool for automatically<br /> generating these definitions, lemmas, and proofs from Ott-like<br /> language specifications [3]. Furthermore, the tool also generates a<br /> recursion scheme for defining functions over syntax, which was not<br /> available in our previous work. We also show the soundness and<br /> completeness of our tool's output. For untyped lambda terms, we prove<br /> the adequacy of our representation with respect to a fully concrete<br /> representation, and we argue that the representation is complete<br /> ----<br /> that we generate the right set of lemmas<br /> ----<br /> with respect to Gordon and<br /> Melham's ``Five Axioms of Alpha-Conversion.'' Finally, we claim that<br /> our recursion scheme is simpler to work with than either Gordon and<br /> Melham's recursion scheme or the recursion scheme of Nominal Logic.<br /> <br /> [1] Engineering Formal Metatheory, POPL '08. With Arthur Chargu�raud,<br /> Benjamin C. Pierce, Randy Pollack, and Stephanie Weirich.&lt;br&gt;<br /> [2] http://www.cis.upenn.edu/~baydemir/papers/lngen/&lt;br&gt;<br /> [3] http://www.cl.cam.ac.uk/~pes20/ott/</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M7Weirich1&diff=257 WG211/M7Weirich1 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> &lt;h1&gt;Adventures in Dependently-Typed Metatheory&lt;/h1&gt;<br /> &lt;h3&gt;Stephanie Weirich with Limin Jia, Jianzhou Zhao, Vilhelm Sj&quot;oberg&lt;/h3&gt;<br /> <br /> Work-in-progress report<br /> <br /> Dependent type systems allow users to include computations in<br /> types, thereby allowing arbitrary expression of program properties.<br /> Because types include computations, the type system of such<br /> language must include a definition of program equivalence. For example,<br /> the type checker might reduce computations to some normal form to<br /> determine if they are the same. However, there are many ways to define<br /> equivalence for programs, and if we change our mind about what<br /> sort of equivalence to use, we must do all of the metatheory of<br /> the dependently-typed language over. For example, some definitions<br /> of equivalence may choose to ignore computationally-irrelevant terms,<br /> others may or may not be decidable if the computation language<br /> includes non-termination.<br /> <br /> In this talk, I will report on initial progress to define a language<br /> where the definition of equivalence is held abstract. Instead, we seek<br /> to determine the properties of the equivalence relation that are<br /> necessary to show that the language is type sound.<br /> <br /> * [[Media:211-deptyp.pdf | 211-deptyp.pdf ]]: Slides<br /> <br /> ==File Attachments== <br /> <br /> *[[Media:211-deptyp.pdf | 211-deptyp.pdf]]</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M7VanWyk&diff=255 WG211/M7VanWyk 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> &lt;h1&gt;Verifiable Composition of Grammars&lt;/h1&gt;<br /> <br /> &lt;h3&gt;August Schwerdfeger and Eric Van Wyk&lt;/h3&gt;<br /> <br /> Abstract:<br /> <br /> One challenge in extensible languages arises in the composition of the<br /> concrete syntax specifications for a host language and a collection of<br /> (domain-specific) language extensions. For this talk, these<br /> specifications consist, as is to be expected, of context-free grammars<br /> with each terminal symbol mapped to a regular expression, from which a<br /> slightly-modified LALR(1) parser and context-aware scanner are<br /> generated. Traditionally, conflicts are detected in the parse-table<br /> of the composed grammar when it is constructed, but this comes too<br /> late as it may be a non-expert programmer that directs the language<br /> tools to compose an eclectic set of language extensions chosen by the<br /> programmer for a particular task.<br /> <br /> In this talk we discuss a modular analysis that is performed<br /> independently by each extension designer on her extension (composed<br /> alone with the host language). If each extension passes this modular<br /> analysis, then the language composed later by the non-expert<br /> programmer will compile with no conflicts or lexical ambiguities.<br /> Thus, extension writers can verify that their extension will safely<br /> compose with others and, if not, fix the specification so that it<br /> will. This is possible due to the context-aware scanner's lexical<br /> disambiguation and a set of reasonable restrictions limiting the sort<br /> of constructs that can be introduced by a language extension. The<br /> restrictions ensure that the states in the parse table can be<br /> partitioned so that each state can be attributed to the host language<br /> or a single language extension.<br /> <br /> * [[Media:vanwyk-wg09.pdf | vanwyk-wg09.pdf ]]: Slides<br /> <br /> ==File Attachments== <br /> <br /> *[[Media:vanwyk-wg09.pdf | vanwyk-wg09.pdf]]</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M7Taha&diff=253 WG211/M7Taha 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> &lt;h1&gt;Java Mint&lt;/h1&gt;<br /> <br /> &lt;h3&gt;Walid Taha&lt;/h3&gt;<br /> <br /> <br /> * [[Media:taha-wg09.ppt | taha-wg09.ppt ]]: Slides<br /> <br /> ==File Attachments== <br /> <br /> *[[Media:taha-wg09.ppt | taha-wg09.ppt]]</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M7Stump&diff=251 WG211/M7Stump 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> &lt;h1&gt;Purifying Natural Deduction Using Sequent Calculus&lt;/h1&gt;<br /> &lt;h3&gt;Aaron Stump&lt;/h3&gt;<br /> <br /> The Curry-Howard isomorphism has proved a very fruitful<br /> connection between programming languages and logic for the past 30<br /> years or so. Proofs in intuitionistic natural deduction are<br /> identified with terms in typed lambda calculus, and various notions of<br /> reduction and equivalence of terms can then be exchanged between the<br /> logical and computational views. The case of disjunction (sum types)<br /> and existentials has not worked out so cleanly, however, requiring<br /> so-called commuting conversions. In this talk, I show how to remove<br /> the difficulties for disjunctions and existentials, by introducing new<br /> lambda calculus terms. These terms arise from a new and more direct<br /> term assignment to proofs in sequent calculus. The result is a type<br /> system for which we can easily adapt Girard's reducibility candidates<br /> to show strong normalization, and for which notions of extensionality<br /> for sum types and existentials become natural to state and accomodate<br /> in our notions of term reduction and equivalence. Both these results<br /> have been problematic with the traditional terms for disjunctions and<br /> existentials.<br /> <br /> * [[Media:stump-wg09.pdf | stump-wg09.pdf ]]: Slides<br /> <br /> ==File Attachments== <br /> <br /> *[[Media:stump-wg09.pdf | stump-wg09.pdf]]</div> Admin http://mw.hh.se/wg211/index.php?title=WG211/M7Smith2&diff=249 WG211/M7Smith2 2011-12-12T10:06:28Z <p>Admin: 1 revision</p> <hr /> <div>[[Category:WG211]]<br /> <br /> <br /> &lt;h1&gt;Automated Synthesis of Propositional Satisfiability Solvers&lt;/h1&gt;<br /> &lt;h3&gt;Doug Smith&lt;/h3&gt;<br /> <br /> Last year we carried out automated derivations of several<br /> SAT solvers using Kestrel's Specware system. We were able to<br /> recapitulate many of the key design features of modern DPLL SAT<br /> solvers using abstract and reusable design concepts: the Global Search<br /> and Constraint Propagation algorithm paradigms, expression<br /> simplification, finite differencing, and datatype refinement. I'll<br /> survey two forms of knowledge needed to derive these SAT solvers: (1)<br /> General and domain-specific laws needed to reason about the domain of<br /> propositional satisfiability; (2) Design knowledge, including abstract<br /> algorithmic, data structuring, and optimization concepts. From a<br /> formal specification of the SAT problem, these two forms of knowledge<br /> are combined via a metaprogram (or derivation script) that specifies<br /> how to calculate the code. Specware automatically carries out the<br /> derivation script, resulting in fast, correct executable code.</div> Admin