Publications by Mikaël Mayer | EPFL Graph Search

Related publications (9)

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper we contribute t ...

2017

Interactive Programming by Example

Mikaël Mayer

As of today, programming has never been so accessible. Yet, it remains a challenge for end-users: students, non-technical employees, experts in their domains outside of computer science, and so on. With its forecast potential for solving problems by only o ...

EPFL2017

A Scala Library for Testing Student Assignments on Concurrent Programming

Mikaël Mayer, Ravichandhran Kandhadai Madhavan

We present a lightweight library for testing concurrent Scala programs by systematically exploring multiple interleavings between user-specified operations on shared objects. Our library is targeted at beginners of concurrent programming in Scala, runs on ...

Assoc Computing Machinery2016

Comfusy: A Tool for Complete Functional Synthesis

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac, Mikaël Mayer

Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. We present Comfusy, a tool that extends the compiler for the general-purpose programming language Scala with (non-reactive) functional synthesi ...

Springer2010

Game Programming by Demonstration

Viktor Kuncak, Mikaël Mayer

The increasing adoption of smartphones and tablets has provided tens of millions of users with substantial resources for computation, communication and sensing. The availability of these resources has a huge potential to positively transform our society an ...

2013

Automating Grammar Comparison

Viktor Kuncak, Mikaël Mayer, Ravichandhran Kandhadai Madhavan

We consider from a practical perspective the problem of checking equivalence of context-free grammars. We present techniques for proving equivalence, as well as techniques for finding counter-examples that establish non-equivalence. Among the key building ...

2015

Roombots-Towards Decentralized Reconfiguration with Self-Reconfiguring Modular Robotic Metamodules

Auke Ijspeert, Alexander Spröwitz, Mikaël Mayer, Rico Möckel, Pierre-André Mudry, Stéphane Bonardi

This paper presents our work towards a decentralized reconfiguration strategy for self-reconfiguring modular robots, assembling furniture-like structures from Roombots metamodules. We explore how reconfiguration by locomotion from a configuration A to a co ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Software Synthesis Procedures

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac, Mikaël Mayer

Automated synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, software synthesis algorithms should behave in a predictable way: they should succ ...

2012

Complete Functional Synthesis

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac, Mikaël Mayer

2010