Jean Goubault-Larrecq

Log. Methods Comput. Sci., 2024

Weak Distributive Laws between Monads of Continuous Valuations and of Non-Deterministic Choice.

[BibT_eX]

[DOI]

CoRR, 2024

The Ackermann Award 2023.

[BibT_eX]

[DOI]

Maribel Fernández

Delia Kesner

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023

A Domain-theoretic Approach to Statistical Programming Languages.

[BibT_eX]

[DOI]

Clément Théron

J. ACM, October, 2023

2022

Continuous R-valuations.

[BibT_eX]

[DOI]

Proceedings of the 9th International Symposium on Domain Theory and Its Applications, 2022

On Weakly Hausdorff Spaces and Locally Strongly Sober Spaces.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Separating minimal valuations, point-continuous valuations, and continuous valuations.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2021

Products and projective limits of continuous valuations on T0 spaces.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2021

2020

Forward analysis for WSTS, part I: completions.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2020

Forward Analysis for WSTS, Part III: Karp-Miller Trees.

[BibT_eX]

[DOI]

Michael Blondin

Log. Methods Comput. Sci., 2020

29th EACSL Annual Conference on Computer Science Logic (CSL 2021).

[BibT_eX]

[DOI]

Bull. EATCS, 2020

2019

A semantics for nabla.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2019

Algebras of the Extended Probabilistic Powerdomain Monad.

[BibT_eX]

[DOI]

Proceedings of the 8th International Symposium on Domain Theory and Its Applications, 2019

Domain-complete and LCS-complete Spaces.

[BibT_eX]

[DOI]

Matthew de Brecht

Zhenchao Lyu

Proceedings of the 8th International Symposium on Domain Theory and Its Applications, 2019

The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering.

[BibT_eX]

[DOI]

CoRR, 2019

A Probabilistic and Non-Deterministic Call-by-Push-Value Language.

[BibT_eX]

[DOI]

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Fooling the Parallel or Tester with Probability 8/27.

[BibT_eX]

[DOI]

Proceedings of the Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy, 2019

2018

The Ho-Zhao Problem.

[BibT_eX]

[DOI]

Weng Kin Ho

Achim Jung

Xiaoyong Xi

Log. Methods Comput. Sci., 2018

On the complexity of monitoring Orchids signatures, and recurrence equations.

[BibT_eX]

[DOI]

Jean-Philippe Lachance

Formal Methods Syst. Des., 2018

2017

Isomorphism theorems between models of mixed choice.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2017

A Few Notes on Formal Balls.

[BibT_eX]

[DOI]

Kok Min Ng

Log. Methods Comput. Sci., 2017

Directed Homology Theories and Eilenberg-Steenrod Axioms.

[BibT_eX]

[DOI]

Appl. Categorical Struct., 2017

2016

Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031).

[BibT_eX]

[DOI]

Monika Seisenberger

Victor L. Selivanov

Andreas Weiermann

Dagstuhl Reports, 2016

On the Complexity of Monitoring Orchids Signatures.

[BibT_eX]

[DOI]

Jean-Philippe Lachance

Proceedings of the Runtime Verification - 16th International Conference, 2016

Deciding Piecewise Testable Separability for Regular Tree Languages.

[BibT_eX]

[DOI]

Sylvain Schmitz

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

The Directed Homotopy Hypothesis.

[BibT_eX]

[DOI]

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

Bisimulations and Unfolding in P-Accessible Categorical Models.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015

A short proof of the Schröder-Simpson Theorem.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2015

Full abstraction for non-deterministic and probabilistic extensions of PCF I: The angelic cases.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2015

Natural Homology.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

QRB, QFS, and the Probabilistic Powerdomain.

[BibT_eX]

[DOI]

Achim Jung

Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics, 2014

Exponentiable Streams and Prestreams.

[BibT_eX]

[DOI]

Appl. Categorical Struct., 2014

Random Measurable Selections.

[BibT_eX]

[DOI]

Roberto Segala

Proceedings of the Horizons of the Mind. A Tribute to Prakash Panangaden, 2014

2013

Static Analysis of Programs with Imprecise Probabilistic Inputs.

[BibT_eX]

[DOI]

Assalé Adjé

Olivier Bouissou

Sylvie Putot

Proceedings of the Verified Software: Theories, Tools, Experiments, 2013

A Constructive Proof of the Topological Kruskal Theorem.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

On the Efficiency of Mathematics in Intrusion Detection: The NetEntropy Case.

[BibT_eX]

[DOI]

Julien Olivain

Proceedings of the Foundations and Practice of Security - 6th International Symposium, 2013

The Blossom of Finite Semantic Trees.

[BibT_eX]

[DOI]

Jean-Pierre Jouannaud

Proceedings of the Programming Logics - Essays in Memory of Harald Ganzinger, 2013

Non-Hausdorff Topology and Domain Theory - Selected Topics in Point-Set Topology.

[BibT_eX]

[DOI]

New Mathematical Monographs 22, Cambridge University Press, ISBN: 978-1-107-03413-6, 2013

2012

Concrete Semantics of Programs with Non-Deterministic and Random Inputs

[BibT_eX]

[DOI]

Assalé Adjé

CoRR, 2012

Forward Analysis for WSTS, Part II: Complete WSTS

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

QRB-Domains and the Probabilistic Powerdomain

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

A generalization of p-boxes to affine arithmetic.

[BibT_eX]

[DOI]

Olivier Bouissou

Sylvie Putot

Computing, 2012

The Theory of WSTS: The Case of Complete WSTS.

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets - 33rd International Conference, 2012

2011

Musings around the geometry of interaction, and coherence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Choquet-Kendall-Matheron theorems for non-Hausdorff spaces.

[BibT_eX]

[DOI]

Klaus Keimel

Math. Struct. Comput. Sci., 2011

Continuous Random Variables.

[BibT_eX]

[DOI]

Daniele Varacca

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010

De Groot duality and models of choice: angels, demons and nature.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2010

Finite models for formal security proofs.

[BibT_eX]

[DOI]

J. Comput. Secur., 2010

omega-QRB-Domains and the Probabilistic Powerdomain.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

Noetherian Spaces in Verification.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Some Ideas on Virtualized System Security, and Monitors.

[BibT_eX]

[DOI]

Hedi Benzina

Proceedings of the Data Privacy Management and Autonomous Spontaneous Security, 2010

2009

"Logic Wins!".

[BibT_eX]

[DOI]

Proceedings of the Advances in Computer Science, 2009

2008

Logical relations for monadic types.

[BibT_eX]

[DOI]

Slawomir Lasota

David Nowak

Math. Struct. Comput. Sci., 2008

A Smell of Orchids.

[BibT_eX]

[DOI]

Julien Olivain

Proceedings of the Runtime Verification, 8th International Workshop, 2008

Prevision Domains and Convex Powercones.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2008

Simulation Hemi-metrics between Infinite-State Stochastic Games.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2008

Towards Producing Formally Checkable Security Proofs, Automatically.

[BibT_eX]

[DOI]

Proceedings of the 21st IEEE Computer Security Foundations Symposium, 2008

2007

Alternating two-way AC-tree automata.

[BibT_eX]

[DOI]

Inf. Comput., 2007

On Noetherian Spaces.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Continuous Capacities on Continuous State Spaces.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Continuous Previsions.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

A Logical Framework for Evaluating Network Resilience Against Faults and Attacks.

[BibT_eX]

[DOI]

Elie Bursztein

Proceedings of the Advances in Computer Science, 2007

A Probabilistic Applied Pi-Calculus.

[BibT_eX]

[DOI]

Catuscia Palamidessi

Angelo Troina

Proceedings of the Programming Languages and Systems, 5th Asian Symposium, 2007

2005

Extensions of valuations.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2005

Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automatically.

[BibT_eX]

[DOI]

Muriel Roger

J. Log. Algebraic Methods Program., 2005

Deciding <i>H</i><sub>1</sub> by resolution.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Karp-Miller Trees for a Branching Extension of VASS.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2005

Cryptographic Protocol Analysis on Real C Code.

[BibT_eX]

[DOI]

Fabrice Parrennes

Proceedings of the Verification, 2005

The Orchids Intrusion Detection Tool.

[BibT_eX]

[DOI]

Julien Olivain

Proceedings of the Computer Aided Verification, 17th International Conference, 2005

2004

Complete Lax Logical Relations for Cryptographic Lambda-Calculi.

[BibT_eX]

[DOI]

Slawomir Lasota

David Nowak

Yu Zhang

Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2002

Higher-Order Positive Set Constraints.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001

Preface.

[BibT_eX]

[DOI]

Proceedings of the Logical Aspects of Cryptographic Protocol Verification, 2001

Experiments with Finite Tree Automata in Coq.

[BibT_eX]

[DOI]

Xavier Rival

Proceedings of the Theorem Proving in Higher Order Logics, 14th International Conference, 2001

Well-Founded Recursive Relations.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 15th International Workshop, 2001

Log Auditing through Model-Checking.

[BibT_eX]

[DOI]

Muriel Roger

Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14 2001), 2001

2000

Sequent combinators: a Hilbert system for the lambda calculus.

[BibT_eX]

[DOI]

Healfdene Goguen

Math. Struct. Comput. Sci., 2000

A Method for Automatic Cryptographic Protocol Verification.

[BibT_eX]

[DOI]

Proceedings of the Parallel and Distributed Processing, 2000

Reflecting BDDs in Coq.

[BibT_eX]

[DOI]

Sanjiva Prasad

S. Arun-Kumar

Proceedings of the Advances in Computing Science, 2000

1999

A Simple Sequent System for First-Order Logic with Free Constructors.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1999

1998

Conjunctive Types and SKInT.

[BibT_eX]

[DOI]

Proceedings of the Types for Proofs and Programs, 1998

1997

A Tableau System for Linear-TIME Temporal Logic.

[BibT_eX]

[DOI]

Peter H. Schmitt

Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1997

Ramified Higher-Order Unification.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

1996

A Proof of Weak Termination of Typed lambda-sigma-Calculi.

[BibT_eX]

[DOI]

Proceedings of the Types for Proofs and Programs, 1996

1995

A BDD-Based Simplification and Skolemization Procedure.

[BibT_eX]

[DOI]

Log. J. IGPL, 1995

1994

The Complexity of Resource-Bounded First-Order Classical Logic.

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

Generalized Boxings, Congruences and Partial Inlining.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, First International Static Analysis Symposium, 1994

Higher-Order Rigid E-Unification.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Automated Reasoning, 5th International Conference, 1994

Rigid E-Unifiability is DEXPTIME-Complete

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

BDDs and Automated Deduction.

[BibT_eX]

[DOI]

Joachim Posegga

Proceedings of the Methodologies for Intelligent Systems, 8th International Symposium, 1994

Proving with BDDs and Control of Information.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994

1993

A Rule-based Algorithm for Rigid E-Unification.

[BibT_eX]

[DOI]