| Checking NFA equivalence with bisimulations up to congruence F Bonchi, D Pous Principles of Programming Languages 48 (1), 457-468, 2013 | 182 | 2013 |
| Enhancements of the bisimulation proof method D Pous, D Sangiorgi Advanced Topics in Bisimulation and Coinduction, 2012 | 80 | 2012 |
| Coinduction up to in a fibrational setting F Bonchi, D Petrisan, D Pous, J Rot CSL-LICS, 20, 2014 | 61 | 2014 |
| An efficient Coq tactic for deciding Kleene algebras T Braibant, D Pous Interactive Theorem Proving, 163-178, 2010 | 61 | 2010 |
| Complete lattices and up-to techniques D Pous Asian Symposium on Programming Languages and Systems, 351-366, 2007 | 60 | 2007 |
| Robust reconfigurations of component assemblies F Boyer, O Gruber, D Pous International Conference on Software Engineering, 13-22, 2013 | 57 | 2013 |
| Coinduction all the way up D Pous 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-10, 2016 | 52 | 2016 |
| Deciding Kleene algebras in Coq T Braibant, D Pous Logical Methods in Computer Science 8 (1:16), 1-42, 2011 | 52 | 2011 |
| Kleene algebra with tests and Coq tools for while programs D Pous International Conference on Interactive Theorem Proving, 180-196, 2013 | 43 | 2013 |
| A general account of coinduction up-to F Bonchi, D Petrişan, D Pous, J Rot Acta Informatica 54 (2), 127-190, 2017 | 39 | 2017 |
| 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 | 34 | 2017 |
| Enhanced coalgebraic bisimulation J Rot, F Bonchi, M Bonsangue, D Pous, J Rutten, A Silva to appear in MSCS, 2014 | 31 | 2014 |
| Enhancements of the coinductive proof method D Pous, D Sangiorgi, J Rutten Advanced Topics in Bisimulation and Coinduction 52, 2011 | 31 | 2011 |
| Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests D Pous POPL'15, 2015 | 29 | 2015 |
| 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 | 27 | 2018 |
| Hacking nondeterminism with induction and coinduction F Bonchi, D Pous Communications of the ACM 58 (2), 87-95, 2015 | 27 | 2015 |
| 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 | 25 | 2008 |
| Bisimulations up-to: beyond first-order transition systems JM Madiot, D Pous, D Sangiorgi CONCUR'14 8704, 93-108, 2014 | 24 | 2014 |
Filippo BonchiCNRS ENS-LyonVerified email at ens-lyon.fr
