Follow
Damien Pous
Damien Pous
CNRS
Verified email at ens-lyon.fr - Homepage
Title
Cited by
Cited by
Year
Checking NFA equivalence with bisimulations up to congruence
F Bonchi, D Pous
Principles of Programming Languages 48 (1), 457-468, 2013
1802013
Enhancements of the bisimulation proof method
D Pous, D Sangiorgi
Advanced Topics in Bisimulation and Coinduction, 2012
802012
An efficient Coq tactic for deciding Kleene algebras
T Braibant, D Pous
Interactive Theorem Proving, 163-178, 2010
612010
Coinduction up to in a fibrational setting
F Bonchi, D Petrisan, D Pous, J Rot
CSL-LICS, 20, 2014
592014
Robust reconfigurations of component assemblies
F Boyer, O Gruber, D Pous
International Conference on Software Engineering, 13-22, 2013
572013
Complete lattices and up-to techniques
D Pous
Asian Symposium on Programming Languages and Systems, 351-366, 2007
572007
Deciding Kleene algebras in Coq
T Braibant, D Pous
Logical Methods in Computer Science 8 (1:16), 1-42, 2011
522011
Coinduction all the way up
D Pous
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-10, 2016
502016
Kleene algebra with tests and Coq tools for while programs
D Pous
International Conference on Interactive Theorem Proving, 180-196, 2013
432013
A general account of coinduction up-to
F Bonchi, D Petrişan, D Pous, J Rot
Acta Informatica 54 (2), 127-190, 2017
392017
Tactics for reasoning modulo AC in Coq
T Braibant, D Pous
International Conference on Certified Programs and Proofs, 167-182, 2011
39*2011
A cut-free cyclic proof system for Kleene algebra
A Das, D Pous
International Conference on Automated Reasoning with Analytic Tableaux and …, 2017
332017
Enhanced coalgebraic bisimulation
J Rot, F Bonchi, M Bonsangue, D Pous, J Rutten, A Silva
to appear in MSCS, 2014
312014
Enhancements of the coinductive proof method
D Pous, D Sangiorgi, J Rutten
Advanced Topics in Bisimulation and Coinduction 52, 2011
312011
Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests
D Pous
POPL'15, 2015
292015
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
Non-wellfounded proof theory for (Kleene+ action)(algebras+ lattices)
A Das, D Pous
Computer Science Logic (CSL), 2018
272018
Hacking nondeterminism with induction and coinduction
F Bonchi, D Pous
Communications of the ACM 58 (2), 87-95, 2015
272015
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
252008
Bisimulations up-to: beyond first-order transition systems
JM Madiot, D Pous, D Sangiorgi
CONCUR'14 8704, 93-108, 2014
232014
The system can't perform the operation now. Try again later.
Articles 1–20