Concept

Confluence (abstract rewriting)

Related publications (36)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Quoted Staged Rewriting: A Practical Approach to Library-Defined Optimizations

Christoph Koch, Amir Shaikhha, Lionel Emile Vincent Parreaux

Staging has proved a successful technique for programmatically removing code abstractions, thereby allowing for faster program execution while retaining a high-level interface for the programmer. Unfortunately, techniques based on staging suffer from a num ...

ACM2017

Moment Semantics for Reversible Rule-Based Systems

Sandro Stucki

We develop a notion of stochastic rewriting over marked graphs – i.e. directed multigraphs with degree constraints. The approach is based on double-pushout (DPO) graph rewriting. Marked graphs are expressive enough to internalize the ‘no-dangling-edge’ con ...

Springer International Publishing2015

This paper deals with asymptotic bifurcation, first in the abstract setting of an equation G(u) = lambda u, where G acts between real Hilbert spaces and lambda is an element of R, and then for square-integrable solutions of a second order non-linear ellipt ...

Elsevier Science Bv2015

On the Symbiosis of People and Building

Sytse de Maat

Controversies continue to exist between architects and the public about what is a good building. High-style modern architecture is often disliked by the public. Moreover, in everyday life people blame the architect for everything they find impractical in a ...

EPFL2015

Additional Material for "Unifying Data Representation Transformations"

Vlad Ureche

This report shows an attempt to formalize the data representation transformation mechanism in the ``Unifying Data Representation Transformations'' paper. Since the mechanism described in the paper is targeted at the Scala programming language and the speci ...

2014

Spiral in Scala: Towards the Systematic Construction of Generators for Performance Libraries

Martin Odersky, Tiark Rompf, Alen Stojanov

Program generators for high performance libraries are an appealing solution to the recurring problem of porting and optimizing code with every new processor generation, but only few such generators exist to date. This is due to not only the difficulty of t ...

Assoc Computing Machinery2014

Complex trend of magnetic order in Fe clusters on 4d transition-metal surfaces. I. Experimental evidence and Monte Carlo simulations

Klaus Kern, Violetta Sessi

We demonstrate the occurrence of compensated spin configurations in Fe clusters and monolayers on Ru(0001) and Rh(111) by a combination of x-ray magnetic circular dichroism experiments, first-principles calculations, and Monte Carlo simulations. Our result ...

Amer Physical Soc2014

Reducing auto moiré in discrete line juxtaposed halftoning

Roger Hersch, Vahid Babaei

Discrete line juxtaposed halftoning creates color halftones with discrete colorant lines of freely selectable rational thicknesses laid-out side by side. Screen elements are made of parallelogram screen tiles incorporating the discrete colorant lines. The ...

Spie-Int Soc Optical Engineering2013

Partitioned Solution of Geometrical Multiscale Problems for the Cardiovascular System

Adelmo Cristiano Innocenza Malossi

The aim of this work is the development of a geometrical multiscale framework for the simulation of the human cardiovascular system under either physiological or pathological conditions. More precisely, we devise numerical algorithms for the partitioned so ...

EPFL2012

Ordered Sets in the Calculus of Data Structures

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac

Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints with a rich set of operations. A key challenge is to define such classes of ...

Springer2010