Damien Pous
Damien Pous
CNRS
Adresse e-mail validée de ens-lyon.fr - Page d'accueil
Titre
Citée par
Citée par
Année
Why'nearshore'means that distance matters
E Carmel, P Abbott
Communications of the ACM 50 (10), 40-46, 2007
2102007
Checking NFA equivalence with bisimulations up to congruence
F Bonchi, D Pous
Principles of Programming Languages 48 (1), 457-468, 2013
1672013
The magazine archive includes every article published in Communications of the ACM for over the past 50 years.
PJ Denning
Communications of the ACM 55 (12), 33-35, 2012
76*2012
Enhancements of the bisimulation proof method
D Pous, D Sangiorgi
Advanced Topics in Bisimulation and Coinduction, 2012
722012
An efficient Coq tactic for deciding Kleene algebras
T Braibant, D Pous
Interactive Theorem Proving, 163-178, 2010
582010
Robust reconfigurations of component assemblies
F Boyer, O Gruber, D Pous
International Conference on Software Engineering, 13-22, 2013
552013
Coinduction up to in a fibrational setting
F Bonchi, D Petrisan, D Pous, J Rot
CSL-LICS, 20, 2014
502014
Deciding Kleene algebras in Coq
T Braibant, D Pous
Logical Methods in Computer Science 8 (1:16), 1-42, 2011
492011
Complete lattices and up-to techniques
D Pous
Asian Symposium on Programming Languages and Systems, 351-366, 2007
492007
Coinduction all the way up
D Pous
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-10, 2016
442016
Kleene algebra with tests and Coq tools for while programs
D Pous
International Conference on Interactive Theorem Proving, 180-196, 2013
392013
Tactics for reasoning modulo AC in Coq
T Braibant, D Pous
International Conference on Certified Programs and Proofs, 167-182, 2011
38*2011
A general account of coinduction up-to
F Bonchi, D Petrişan, D Pous, J Rot
Acta Informatica 54 (2), 127-190, 2017
332017
Enhanced coalgebraic bisimulation
J Rot, F Bonchi, M Bonsangue, D Pous, J Rutten, A Silva
to appear in MSCS, 2014
292014
Innocent strategies as presheaves and interactive equivalences for CCS
T Hirschowitz, D Pous
Scientific Annals of Computer Science 22 (1), 147-199, 2012
28*2012
Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests
D Pous
POPL'15, 2015
262015
Hacking nondeterminism with induction and coinduction
F Bonchi, D Pous
Communications of the ACM 58 (2), 87-95, 2015
242015
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
242008
A distribution law for CCS and a new congruence result for the π-calculus
D Hirschkoff, D Pous
Foundations of Software Science and Computational Structures, 228-242, 2007
242007
A cut-free cyclic proof system for Kleene algebra
A Das, D Pous
International Conference on Automated Reasoning with Analytic Tableaux and …, 2017
232017
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20