77 citations
- Université Paris-Est CréteilFR14 papers
- Centre National de la Recherche ScientifiqueFR7 papers
- Laboratoire d'Informatique Algorithmique: Fondements et ApplicationsFR5 papers
- Paris-Est SupFR5 papers
- Institute of Mathematics and Computer ScienceMD3 papers
- Université Paris DiderotFR3 papers
- Åbo Akademi UniversityFI2 papers
- Institut de Mécanique et d'Ingénierie de BordeauxFR2 papers
- Institut national de recherche en sciences et technologies du numériqueFR2 papers
- Laboratoire d'Informatique de Paris-NordFR2 papers
- Laboratoire d'Informatique Gaspard-MongeFR2 papers
- Laboratoire Spécification et VérificationFR2 papers
15 papers · 1 filter
Proceedings Joint Workshop on Handling IMPlicit and EXplicit knowledge in formal system development (IMPEX) and Formal and Model-Driven Techniques for Developing Trustworthy Systems (FM&MDD)
Régine Laleau, Dominique Méry, Shin Nakajima +1
This volume contains the joint proceedings of IMPEX 2017, the first workshop on Handling IMPlicit and EXplicit knowledge in formal system development and FM&MDD, the second worksho…
Contextual equivalences in configuration structures and reversibility
Clément Aubert, Ioana Cristescu
Contextual equivalence equate terms that have the same observable behaviour in any context. A standard contextual equivalence for CCS is the strong barbed congruence. Configuration…
Reversible Barbed Congruence on Configuration Structures
Clément Aubert, Ioana Cristescu
A standard contextual equivalence for process algebras is strong barbed congruence. Configuration structures are a denotational semantics for processes in which one can define equi…
Non-normal modalities in variants of Linear Logic
Daniele Porello, Nicolas Troquard
This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of Linear Logic with one minimal non-normal modality. In earlier work, w…
An in-between "implicit" and "explicit" complexity: Automata
Clément Aubert
Implicit Computational Complexity makes two aspects implicit, by manipulating programming languages rather than models of com-putation, and by internalizing the bounds rather than…
Memoization for Unary Logic Programming: Characterizing PTIME
Clément Aubert, Marc Bagnol, Thomas Seiller
We give a characterization of deterministic polynomial time computation based on an algebraic structure called the resolution semiring, whose elements can be understood as logic pr…