211 citations
- Université Grenoble AlpesFR49 papers
- Centre National de la Recherche ScientifiqueFR44 papers
- Institut polytechnique de GrenobleFR12 papers
- Université Joseph FourierFR7 papers
- FortissDE4 papers
- Institut des langues et cultures d'Europe, Amérique, Afrique, Asie et AustralieFR4 papers
- Institut national de recherche en sciences et technologies du numériqueFR4 papers
- Aalto UniversityFI3 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR3 papers
- École Polytechnique Fédérale de LausanneCH3 papers
- Laboratoire d'Informatique de GrenobleFR3 papers
- LIP6FR3 papers
8 papers · 1 filter
Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs
Fuad Abujarad, Borzoo Bonakdarpour, Sandeep S. Kulkarni
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs: (1) generation of fault-span, the set of states reacha…
Symbolic Implementation of Connectors in BIP
Mohamad Jaber, Ananda Basu, Simon Bliudze
BIP is a component framework for constructing systems by superposing three layers of modeling: Behavior, Interaction, and Priority. Behavior is represented by labeled transition sy…
Automatic modular abstractions for template numerical constraints
David Monniaux
We propose a method for automatically generating abstract transformers for static analysis by abstract interpretation. The method focuses on linear constraints on programs operatin…
Gentzen-Prawitz Natural Deduction as a Teaching Tool
Jean-François Monin, Cristian Ene, Michaël Périn
We report a four-years experiment in teaching reasoning to undergraduate students, ranging from weak to gifted, using Gentzen-Prawitz's style natural deduction. We argue that this…
On using floating-point computations to help an exact linear arithmetic decision procedure
David Monniaux
We consider the decision problem for quantifier-free formulas whose atoms are linear inequalities interpreted over the reals or rationals. This problem may be decided using satisfi…
Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots
Stéphane Devismes, Franck Petit, Sébastien Tixeuil
We consider a team of identical, oblivious, asynchronous mobile robots that are able to sense (\emph{i.e.}, view) their environment, yet are unable to communicate, and evolve o…