activity
20152021
most citedA CEGAR-like Approach for Cost LTL Bounds

1 citations · 2 across the 5 of their papers we have counts for

collaborators

6 papers

cs.PL2021

Native Implementation of Mutable Value Semantics

Dimitri Racordon, Denys Shabalin, Daniel Zheng +2

Unrestricted mutation of shared state is a source of many well-known problems. The predominant safe solutions are pure functional programming, which bans mutation outright, and flo…

cs.PL2021

Fuel: A Compiler Framework for Safe Memory Management

Dimitri Racordon, Aurélien Coet, Didier Buchs

Flow-sensitive type systems offer an elegant way to ensure memory-safety in programming languages. Unfortunately, their adoption in new or existing languages is often hindered by a…

cs.PL2019

Explicit and Controllable Assignment Semantics

Dimitri Racordon, Didier Buchs

Despite the plethora of powerful software to spot bugs, identify performance bottlenecks or simply improve the overall quality of code, programming languages remain the first and m…

cs.PL20181 cited

Coroutines with Higher Order Functions

Dimitri Racordon

Coroutines are non-preemptive concurrent subroutines that, unlike preemptive threads, voluntarily transfer control between each others. Introduced in the 60s before loosing in popu…

cs.PL2017

Extracting Formal Specifications to Strenghten Type Behaviour Testing

Dimitri Racordon, Didier Buchs

Testing has become an indispensable activity of software development, yet writing good and relevant tests remains a quite challenging task. One well-known problem is that it often…

cs.LO20151 cited

A CEGAR-like Approach for Cost LTL Bounds

Maximilien Colange, Dimitri Racordon, Didier Buchs

Qualitative formal verification, that seeks boolean answers about the behavior of a system, is often insufficient for practical purposes. Observing quantitative information is of i…