Publication

Offer semantics: Achieving compositionality, flattening and full expressiveness for the glue operators in BIP

Publications associées (18)

Orthologic with Axioms

We study the proof theory and algorithms for orthologic, a logical system based on ortholattices, which have shown practical relevance in simplification and normalization of verification conditions. Ortholattices weaken Boolean algebras while having polyno ...

Association for Computing Machinery2024

Cross-Platform Language Design

Sébastien Jean R Doeraene

Programming languages are increasingly compiled to multiple runtimes, each featuring their own rich structures such as their object model. Furthermore, they need to interact with other languages targeting said runtimes. A language targeting only one runtim ...

EPFL2018

Simplicitly: Foundations and Applications of Implicit Function Types

Martin Odersky, Heather Christine Klug, Fengyun Liu, Sandro Stucki, Olivier Eric Paul Blanvillain

Understanding a program entails understanding its context; dependencies, configurations and even implementations are all forms of contexts. Modern programming languages and theorem provers offer an array of constructs to define contexts, implicitly. Scala ...

2017

Type Soundness Proofs with Definitional Interpreters

Tiark Rompf, Nada Amin

While type soundness proofs are taught in every graduate PL class, the gap between realistic languages and what is accessible to formal proofs is large. In the case of Scala, it has been shown that its formal model, the Dependent Object Types (DOT) calculu ...

Assoc Computing Machinery2017

A Historical Review of Diachrony and Semantic Dimensions of Trace in Neurosciences and Lacanian Psychoanalysis

Pierre Magistretti

Experience leaves a trace in the nervous system through plasticity. However, the exact meaning of the mnesic trace is poorly defined in current literature. This article provides a historical review of the term trace in neuroscience and psychoanalysis liter ...

Frontiers Media2017

Higher-Order Subtyping with Type Intervals

Sandro Stucki

Modern, statically typed programming languages provide various abstraction facilities at both the term- and type-level. Common abstraction mechanisms for types include parametric polymorphism -- a hallmark of functional languages -- and subtyping -- which ...

EPFL2017

Context and Semantic Aware Location Privacy

Berker Agir

With ever-increasing computational power, and improved sensing and communication capabilities, smart devices have altered and enhanced the way we process, perceive and interact with information. Personal and contextual data is tracked and stored extensivel ...

EPFL2016

Semantic Data Layers in Air Quality Monitoring for Smarter Cities

Karl Aberer, Jean Paul Calbimonte Perez, Julien Eberle

Air pollution is one of the key indicators for quality of life in urban environments, and is also the subject of global health concern, given the number of mortal diseases associated to exposure to pollutants. Assessing and monitoring air quality is an imp ...

2015

RSP-QL Semantics: a Unifying Query Model to Explain Heterogeneity of RDF Stream Processing Systems

Jean Paul Calbimonte Perez

RDF and SPARQL are established standards for data interchange and querying on the Web. While they have been shown to be useful and applicable in many scenarios, they are not sufficiently adequate for dealing with streams of data and their intrinsic continu ...

2014

Prototyping Symbolic Execution Engines for Interpreted Languages

George Candea, Johannes Kinder, Stefan Bucur

Symbolic execution is being successfully used to automatically test statically compiled code. However, increasingly more systems and applications are written in dynamic interpreted languages like Python. Building a new symbolic execution engine is a monume ...

ACM2014