GPCE 2021
who it's for
programming languages researchers, software engineering researchers, domain specific language designers, model driven engineers, metaprogramming practitioners, compiler and code-generation engineers, software product-line engineers, tool builders
topics
low-code platform metamodeling; variability DSLs; pattern-match in-place compilation; ILP scheduling for moves; Haskell embedded DSLs; variational database management; lifted termination analysis; multistage generative macros; digital twins for IoT; on-stack replacement for generators; type-safe module generation; metaprogramming for secure MPC
| title | author | length |
|---|---|---|
| Towards Supporting SPL Engineering in Low-Code Platforms using a DSL Approach | Alexandre Bragança, Isabel Azevedo, Nuno Bettencourt, Carlos Morais, Diogo Teixeira, David Caetano | 13m |
Presents a non‑intrusive, partially automated pipeline that deduces a platform metamodel from exported models and generates a low‑code DSL (Xtext) plus an… | ||
| Compiling pattern matching to in-place modifications | Paul Iannetta, Laure Gonnord, Gabriel Radanne | 08m |
Prototype compiles pattern-match rewrite rules on tree-shaped ADTs stored as arrays only into in-place memory moves, not pointer rewrites. It cuts trees into… | ||
| A DSL for Explanatory Decision Making | Martin Erwig, Prashant Kumar | 15m |
A Haskell-embedded DSL called Mad Max encodes multi-attribute, multi-layer (AHP) decisions and produces numeric justifications: it normalizes attributes to… | ||
| A Variational Database Management System | Parisa Ataei, Fariba Khan, Eric Walkingshaw | 16m |
Framework encodes any structural or content variation using a Boolean feature space and stores all variants in one Haskell-built VDBMS layer over an RDBMS… | ||
| Lifted Termination Analysis by Abstract Interpretation and its Applications | Aleksandar S. Dimovski | 14m |
A lifted termination analyzer, SPLFuncTion, implements a lifted decision tree domain on top of the FuncTion single‑program analyzer (OCaml, APRON numeric… | ||
| Multi-Stage Programming with Generative and Analytical Macros | Nicolas Stucki, Jonathan Immanuel Brachthäuser, Martin Odersky | 12m |
Defines a formal lambda-triangle calculus that models generative and analytical macros, quote patterns, and separate compilation; implements it in Scala 3… | ||
| Understanding and Improving Model-Driven IoT Systems Through Accompanying Digital Twins | Jörg Christian Kirchhof, Lukas Malcher, Bernhard Rumpe | 14m |
Model-driven instrumentation generates MontiThings code that records external inputs, network delays and computation latencies via DDS topics and uses… | ||
| On-Stack Replacement for Program Generators and Source-to-Source Compilers | Gregory Essertel, Ruby Tahboub, Tiark Rompf | 14m |
Implements a source-level OSR pattern that swaps loop bodies at iteration boundaries so generated C can start with a fast-to-compile version and trampoline to… | ||
| Type-safe generation of modules in applicative and generative styles | Yuhi Sato, Yukiyoshi Kameyama | 15m |
Defines two staged ML-like languages, lambda-G and lambda-A, with a type-preserving translation and implementation into plain MetaOCaml using a genlet… | ||
| HACCLE: Metaprogramming for Secure Multi-Party Computation | Yuyan Bao, Kirshanthan Sundararajah, Raghav Malik, Qianchuan Ye, Christopher Wagner, Nouraldin Jaber, Fei Wang, Mohammad Hassan Ameri, Donghang Lu, Alexander Seto, Benjamin Delaware, Roopsha Samanta, Aniket Kate, Christina Garman, Jeremiah Blocki, Pierre-David Letourneau, Benoit Meister, Jonathan Springer, Tiark Rompf, Milind Kul | 15m |
HACCLE is a compiler toolchain that embeds a DSL (Harpoon) in Scala, uses LMS metaprogramming to lower code to a protocol‑independent acyclic circuit IR (HIR)… | ||
| The Life Cycle of Features in Highly-Configurable Software Systems Evolving in Space and Time | Gabriela Karoline Michelon, Wesley Assunção, David Obermann, Lukas Linsbauer, Paul Grünbacher, Alexander Egyed | 15m |
An automated mining approach processes full Git histories of four preprocessor-based HCSSs (13–20 years, 37,500 commits) to map features defined by external… | ||
| Live Programming and Programming by Example: Better Together | Sorin Lerner | 25m |
Live visualization of runtime values via Projection Boxes feeds concrete examples to a synthesizer, implemented as SnipPy, and extended to loop-aware synthesis… | ||
| Leveraging Relational Concept Analysis for Automated Feature Location in Software Product Lines | Nicolas Hlad, Bérénice Lemoine, Marianne Huchard, Abdelhak Seriai | 15m |
Proposes a concrete pipeline that takes two formal contexts (features-per-product and artefacts-per-product), builds FCA AOC-posets, links them with Relational… | ||
| Delta-based Verification of Software Product Families | Marco Scaletta, Reiner Hähnle, Dominic Steinhöfel, Richard Bubel | 15m |
Delta-based verification represents original calls as abstract execution statements and requires methods to be refactored into a Shallow Single Original Normal… | ||
| Metaprogramming with Combinators | Mahshid Shahmohammadian, Geoffrey Mainland | 15m |
Haskell generators use quasiquotation and a mixed shallow/deep embedding plus a MonadCg codegen monad and scoped combinators to emit VHDL for Xilinx FPGAs. A… | ||
| nothing matches | ||