Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Induction of regular languages

Related publications (8)

From C/C plus plus Code to High-Performance Dataflow Circuits

Paolo Ienne, Andrea Guerrieri, Lana Josipovic

High-level synthesis (HLS) tools typically generate statically scheduled datapaths. Static scheduling implies that the resulting circuits have a hard time exploiting parallelism in code with potential memory dependences, with control dependences, or where ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Free Boundary Regularity for Almost Every Solution to the Signorini Problem

Xavier Fernandez-Real Girona

We investigate the regularity of the free boundary for the Signorini problem in Rn+1. It is known that regular points are (n−1)-dimensional and C∞. However, even for C∞ obstacles φ, the set of non-regular (or degenerate) points could be very large—e.g. wit ...

2021

Deductive Synthesis and Repair

Etienne Kneuss

In this thesis, we explore techniques for the development of recursive functional programs over unbounded domains that are proved correct according to their high-level specifications. We present algorithms for automatically synthesizing executable code, st ...

EPFL2016

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings

Andrew Joseph Reynolds

We prove that the quantifier-free fragment of the theory of character strings with regular language membership constraints and linear integer constraints over string lengths is decidable. We do that by describing a sound, complete and terminating tableaux ...

Springer-Verlag Berlin2015

Effect Analysis for Programs with Callbacks

Viktor Kuncak, Philippe Paul Henri Suter, Etienne Kneuss

We introduce a precise interprocedural effect analysis for programs with mutable state, dynamic object allocation, and dynamic dispatch. Our analysis is precise even in the presence of dynamic dispatch where the context-insensitive estimate on the number o ...

Springer Berlin Heidelberg2013

SpeakUp – A Mobile App Facilitating Audience Interaction

Adrian Christian Holzer, Andrii Vozniuk, Sten Govaerts

A dynamic student-teacher interaction during class is an important part of the learning experience. However, in regular class settings and especially in large classrooms, it is a challenging task to encourage students to participate as they tend to be inti ...

2013

A Cognitive Reference Based Model for Learning Compositional Hierarchies with Whole-Composite Tags

Alain Wegmann, Anshuman Bahadur Saxena, Ashish Kishore Bindal

A compositional hierarchy is the default organization of knowledge acquired for the purpose of specifying the design requirements of a service. Existing methods for learning compositional hierarchies from natural language text, interpret composition as an ...

2013

Symbolic execution of Reo circuits using constraint automata

Hossein Hojjat

Reo is a coordination language that can be used to model different systems. We propose a technique for symbolic execution of Reo circuits using the symbolic representation of data constraints in Constraint Automata. This technique enables us to obtain the ...

2012