Damien Pous
Damien Pous
CNRS
Verifierad e-postadress på ens-lyon.fr - Startsida
TitelCiteras avÅr
Why'nearshore'means that distance matters
E Carmel, P Abbott
Communications of the ACM 50 (10), 40-46, 2007
1982007
Checking NFA equivalence with bisimulations up to congruence
F Bonchi, D Pous
Principles of Programming Languages 48 (1), 457-468, 2013
1502013
Enhancements of the bisimulation proof method
D Pous, D Sangiorgi
612012
The magazine archive includes every article published in Communications of the ACM for over the past 50 years.
PJ Denning
Communications of the ACM 60 (12), 20-23, 2017
60*2017
An efficient Coq tactic for deciding Kleene algebras
T Braibant, D Pous
Interactive Theorem Proving, 163-178, 2010
542010
Robust reconfigurations of component assemblies
F Boyer, O Gruber, D Pous
International Conference on Software Engineering, 13-22, 2013
512013
Deciding Kleene algebras in Coq
T Braibant, D Pous
Logical Methods in Computer Science 8 (1:16), 1-42, 2011
452011
Coinduction up to in a fibrational setting
F Bonchi, D Petrisan, D Pous, J Rot
CSL-LICS, 20, 2014
432014
Complete lattices and up-to techniques
D Pous
Asian Symposium on Programming Languages and Systems, 351-366, 2007
392007
Tactics for reasoning modulo AC in Coq
T Braibant, D Pous
International Conference on Certified Programs and Proofs, 167-182, 2011
37*2011
Kleene algebra with tests and Coq tools for while programs
D Pous
International Conference on Interactive Theorem Proving, 180-196, 2013
362013
Coinduction all the way up
D Pous
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-10, 2016
332016
Innocent strategies as presheaves and interactive equivalences for CCS
T Hirschowitz, D Pous
Scientific Annals of Computer Science 22 (1), 147-199, 2012
262012
Enhanced coalgebraic bisimulation
J Rot, F Bonchi, M Bonsangue, D Pous, J Rutten, A Silva
to appear in MSCS, 2014
252014
Enhancements of the coinductive proof method
D Pous, D Sangiorgi, J Rutten
Advanced Topics in Bisimulation and Coinduction 52, 2011
252011
Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests
D Pous
POPL'15, 2015
232015
A general account of coinduction up-to
F Bonchi, D Petrişan, D Pous, J Rot
Acta Informatica 54 (2), 127-190, 2017
202017
New up-to techniques for weak bisimulation
D Pous
Theoretical Computer Science 380 (1-2), 164-180, 2007
192007
Up-to techniques for weak bisimulation
D Pous
International Colloquium on Automata, Languages, and Programming, 730-741, 2005
192005
Component-oriented programming with sharing: Containment is not ownership
D Hirschkoff, T Hirschowitz, D Pous, A Schmitt, JB Stefani
International Conference on Generative Programming and Component Engineering …, 2005
182005
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20