Damien Pous

According to our database1, Damien Pous
  • authored at least 64 papers between 2005 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
A robust reconfiguration protocol for the dynamic update of component-based software systems.
Softw., Pract. Exper., 2017

Enhanced coalgebraic bisimulation.
Mathematical Structures in Computer Science, 2017

Petri Automata.
CoRR, 2017

A general account of coinduction up-to.
Acta Inf., 2017

CoInductive Automata Algorithms.
Proceedings of the Implementation and Application of Automata, 2017

A Cut-Free Cyclic Proof System for Kleene Algebra.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2017

K4-free Graphs as a Free Algebra.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Fully abstract encodings of λ-calculus in HOcore through abstract machines.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Companions, Codensity and Causality.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

On Decidability of Concurrent Kleene Algebra.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

Monoidal Company for Accessible Functors.
Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science, 2017

2016
Algorithms for Kleene algebra with converse.
J. Log. Algebr. Meth. Program., 2016

A Formal Exploration of Nominal Kleene Algebra.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Coinduction All the Way Up.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Cardinalities of Finite Relations in Coq.
Proceedings of the Interactive Theorem Proving - 7th International Conference, 2016

Automata for relation algebra and formal proofs.
, 2016

2015
Hilbert-Post completeness for the state and the exception effects.
CoRR, 2015

Hacking nondeterminism with induction and coinduction.
Commun. ACM, 2015

Coinductive techniques, from automata to coalgebra.
Proceedings of the Programming Languages Mentoring Workshop, 2015

Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Relative Hilbert-Post Completeness for Exceptions.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

Petri Automata for Kleene Allegories.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Lax Bialgebras and Up-To Techniques for Weak Bisimulations.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests.
CoRR, 2014

Program certification with computational effects.
CoRR, 2014

Coinduction up to in a fibrational setting.
CoRR, 2014

De la KAM avec un Processus d'Ordre Supe'rieur.
Proceedings of the 25. Journées francophones des langages applicatifs, 2014

Formal verification in Coq of program properties involving the global state effect.
Proceedings of the 25. Journées francophones des langages applicatifs, 2014

Coinduction up-to in a fibrational setting.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Bisimulations Up-to: Beyond First-Order Transition Systems.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Kleene Algebra with Converse.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2014

2013
Kleene Algebra with Tests and Coq Tools for While Programs
CoRR, 2013

Formal verification in Coq of program properties involving the global state effect.
CoRR, 2013

Checking NFA equivalence with bisimulations up to congruence.
Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

Kleene Algebra with Tests and Coq Tools for while Programs.
Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013

Robust reconfigurations of component assemblies.
Proceedings of the 35th International Conference on Software Engineering, 2013

Coalgebraic Up-to Techniques.
Proceedings of the Algebra and Coalgebra in Computer Science, 2013

Brzozowski's and Up-To Algorithms for Must Testing.
Proceedings of the Programming Languages and Systems - 11th Asian Symposium, 2013

2012
Innocent Strategies as Presheaves and Interactive Equivalences for CCS.
Sci. Ann. Comp. Sci., 2012

Untyping Typed Algebras and Colouring Cyclic Linear Logic
Logical Methods in Computer Science, 2012

Deciding Kleene Algebras in Coq
Logical Methods in Computer Science, 2012

2011
Strategies as sheaves and interactive equivalences for CCS
CoRR, 2011

Innocent strategies as presheaves and interactive equivalences for CCS
Proceedings of the Proceedings Fourth Interaction and Concurrency Experience, 2011

Tactics for Reasoning modulo AC in Coq
CoRR, 2011

Tactics for Reasoning Modulo AC in Coq.
Proceedings of the Certified Programs and Proofs - First International Conference, 2011

2010
An Efficient Coq Tactic for Deciding Kleene Algebras.
Proceedings of the Interactive Theorem Proving, First International Conference, 2010

On Bisimilarity and Substitution in Presence of Replication.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic.
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009
Encapsulation and Dynamic Modularity in the pi-calculus.
Electr. Notes Theor. Comput. Sci., 2009

Encapsulation and Dynamic Modularity in the Pi-Calculus
CoRR, 2009

2008
Techniques modulo pour les bisimulations. (Up to techniques for bisimulations).
PhD thesis, 2008

Using bisimulation proof techniques for the analysis of distributed abstract machines.
Theor. Comput. Sci., 2008

A Distribution Law for CCS and a New Congruence Result for the p-calculus.
Logical Methods in Computer Science, 2008

On characterising strong bisimilarity in a fragment of CCS with replication
CoRR, 2008

2007
New up-to techniques for weak bisimulation.
Theor. Comput. Sci., 2007

An efficient abstract machine for Safe Ambients.
J. Log. Algebr. Program., 2007

A Distribution Law for CCS and a New Congruence Result for the pi-Calculus.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

Complete Lattices and Up-To Techniques.
Proceedings of the Programming Languages and Systems, 5th Asian Symposium, 2007

2006
A Distribution Law for CCS and a New Congruence Result for the pi-calculus
CoRR, 2006

On Bisimulation Proofs for the Analysis of Distributed Abstract Machines.
Proceedings of the Trustworthy Global Computing, Second Symposium, 2006

Weak Bisimulation Up to Elaboration.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005
Up-to Techniques for Weak Bisimulation.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Component-Oriented Programming with Sharing: Containment is Not Ownership.
Proceedings of the Generative Programming and Component Engineering, 2005

A Correct Abstract Machine for Safe Ambients.
Proceedings of the Coordination Models and Languages, 7th International Conference, 2005


  Loading...