Folgen
Damien Pous
Damien Pous
CNRS
Bestätigte E-Mail-Adresse bei ens-lyon.fr - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Checking NFA equivalence with bisimulations up to congruence
F Bonchi, D Pous
Principles of Programming Languages 48 (1), 457-468, 2013
1892013
Enhancements of the bisimulation proof method
D Pous, D Sangiorgi
Advanced Topics in Bisimulation and Coinduction, 2012
802012
Complete lattices and up-to techniques
D Pous
Programming Languages and Systems: 5th Asian Symposium, APLAS 2007 …, 2007
642007
An efficient Coq tactic for deciding Kleene algebras
T Braibant, D Pous
Interactive Theorem Proving, 163-178, 2010
632010
Coinduction up to in a fibrational setting
F Bonchi, D Petrisan, D Pous, J Rot
CSL-LICS, 20, 2014
612014
Robust reconfigurations of component assemblies
F Boyer, O Gruber, D Pous
International Conference on Software Engineering, 13-22, 2013
582013
Coinduction all the way up
D Pous
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016
552016
Deciding Kleene algebras in Coq
T Braibant, D Pous
Logical Methods in Computer Science 8 (1:16), 1-42, 2011
542011
Kleene algebra with tests and Coq tools for while programs
D Pous
Interactive Theorem Proving: 4th International Conference, ITP 2013, Rennes …, 2013
462013
A general account of coinduction up-to
F Bonchi, D Petrişan, D Pous, J Rot
Acta Informatica 54, 127-190, 2017
402017
Tactics for reasoning modulo AC in Coq
T Braibant, D Pous
Certified Programs and Proofs: First International Conference, CPP 2011 …, 2011
38*2011
A cut-free cyclic proof system for Kleene algebra
A Das, D Pous
Automated Reasoning with Analytic Tableaux and Related Methods: 26th …, 2017
372017
Enhancements of the coinductive proof method
D Pous, D Sangiorgi, J Rutten
Advanced Topics in Bisimulation and Coinduction 52, 2011
342011
Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests
D Pous
POPL'15, 2015
332015
Enhanced coalgebraic bisimulation
J Rot, F Bonchi, M Bonsangue, D Pous, J Rutten, A Silva
to appear in MSCS, 2014
322014
Non-wellfounded proof theory for (Kleene+ action)(algebras+ lattices)
A Das, D Pous
292018
Innocent strategies as presheaves and interactive equivalences for CCS
T Hirschowitz, D Pous
Scientific Annals of Computer Science 22 (1), 147-199, 2012
29*2012
Hacking nondeterminism with induction and coinduction
F Bonchi, D Pous
Communications of the ACM 58 (2), 87-95, 2015
282015
A distribution law for CCS and a new congruence result for the π-calculus
D Hirschkoff, D Pous
Logical Methods in Computer Science 4 (2:4), 1-20, 2008
262008
Bisimulations up-to: beyond first-order transition systems
JM Madiot, D Pous, D Sangiorgi
CONCUR'14 8704, 93-108, 2014
242014
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20