Daniel Hirschkoff

Proceedings of the Proceedings Combined 30th International Workshop on Expressiveness in Concurrency and 20th Workshop on Structural Operational Semantics, 2023

Deciding Contextual Equivalence of ν-Calculus with Effectful Contexts.

[BibT_eX]

[DOI]

Guilhem Jaber

Proceedings of the Foundations of Software Science and Computation Structures, 2023

2022

Eager functions as processes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Eager Functions as Processes (long version).

[BibT_eX]

[DOI]

CoRR, 2022

2021

On sequentiality and well-bracketing in the π-calculus.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

2020

Towards 'up to context' reasoning about higher-order processes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

On the Representation of References in the Pi-Calculus.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

Divergence and unique solution of equations.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2019

Modeling Imperative Constructs in the Pi-Calculus.

[BibT_eX]

[DOI]

Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

2016

Termination in a π-calculus with subtyping.

[BibT_eX]

[DOI]

Ioana Cristescu

Math. Struct. Comput. Sci., 2016

Name-passing calculi: From fusions to preorders and types.

[BibT_eX]

[DOI]

Inf. Comput., 2016

2015

A behavioural theory for a π-calculus with preorders.

[BibT_eX]

[DOI]

Xian Xu

J. Log. Algebraic Methods Program., 2015

2014

Symmetries and Dualities in Name-Passing Process Calculi.

[BibT_eX]

[DOI]

Proceedings of the Computing with New Resources, 2014

2012

Duality and i/o-Types in the π-Calculus.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011

Termination in a Pi-calculus with Subtyping

[BibT_eX]

[DOI]

Ioana Cristescu

Proceedings of the Proceedings 18th International Workshop on Expressiveness in Concurrency, 2011

Strong Normalisation in λ-Calculi with References.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

2010

Termination in higher-order concurrent calculi.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2010

On Bisimilarity and Substitution in Presence of Replication.

[BibT_eX]

[DOI]

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

Termination in Impure Concurrent Languages.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009

Mobile Processes and Termination.

[BibT_eX]

[DOI]

Proceedings of the Semantics and Algebraic Specification, 2009

Calculs de processus: observations et inspections. (Process calculi: observations, inspections).

[BibT_eX]

[DOI]

, 2009

2008

Separability in the Ambient Logic.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2008

A Distribution Law for CCS and a New Congruence Result for the p-calculus.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2008

Encapsulation and Dynamic Modularity in the pi-calculus.

[BibT_eX]

[DOI]

Proceedings of the First Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software, 2008

On characterising strong bisimilarity in a fragment of CCS with replication

[BibT_eX]

[DOI]

CoRR, 2008

Static and dynamic typing for the termination of mobile processes.

[BibT_eX]

[DOI]

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

2007

An efficient abstract machine for Safe Ambients.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2007

On the Complexity of Termination Inference for Processes.

[BibT_eX]

[DOI]

Proceedings of the Trustworthy Global Computing, Third Symposium, 2007

A Distribution Law for CCS and a New Congruence Result for the <i>pi</i>-Calculus.

[BibT_eX]

[DOI]

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

2006

On the Expressiveness of the Ambient Logic.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2006

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

[BibT_eX]

[DOI]

CoRR, 2006

2005

On the representation of McCarthy's amb in the Pi-calculus.

[BibT_eX]

[DOI]

Arnaud Carayol

Theor. Comput. Sci., 2005

Component-Oriented Programming with Sharing: Containment is Not Ownership.

[BibT_eX]

[DOI]

Proceedings of the Generative Programming and Component Engineering, 2005

A Correct Abstract Machine for Safe Ambients.

[BibT_eX]

[DOI]

Proceedings of the Coordination Models and Languages, 7th International Conference, 2005

2004

Using ambients to control resources.

[BibT_eX]

[DOI]

David Teller

Pascal Zimmer

Int. J. Inf. Sec., 2004

An Extensional Spatial Logic for Mobile Processes.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003

A fully adequate shallow embedding of the [pi]-calculus in Isabelle/HOL with mechanized syntax analysis.

[BibT_eX]

[DOI]

Christine Röckl

J. Funct. Program., 2003

On the Representation of McCarthy's <i>amb</i> in the π-calculus.

[BibT_eX]

[DOI]

Arnaud Carayol

Proceedings of the 10th International Workshop on Expressiveness in Concurrency, 2003

Minimality Results for the Spatial Logics.

[BibT_eX]

[DOI]

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002

Separability, Expressiveness, and Decidability in the Ambient Logic.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

2001

Bisimulation verification using the up to techniques.

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2001

Incremental Inference of Partial Types.

[BibT_eX]

[DOI]

Mario Coppo

Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the pi-Calculus and Mechanizing the Theory of Contexts.

[BibT_eX]

[DOI]

Christine Röckl

Stefan Berghofer

Proceedings of the Foundations of Software Science and Computation Structures, 2001

1999

On the way to certify Computer Algebra Systems.

[BibT_eX]

[DOI]

Sylvain Boulmé

Thérèse Hardin

Valérie Ménissier-Morain

Renaud Rioboo

Proceedings of the Systems for Integrated Computation and Deduction, 1999

On the Benefits of Using the Up-To Techniques for Bisimulation Verification.

[BibT_eX]

[DOI]

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

1998

Automatically Proving Up-to Bisimulation.

[BibT_eX]

[DOI]

Proceedings of the MFCS '98 Workshop on Concurrency, 1998

1997

A Full Formalisation of pi-Calculus Theory in the Calculus of Constructions.

[BibT_eX]

[DOI]