Filippo Bonchi

Orcid: 0000-0002-3433-723X

Affiliations:
  • University of Pisa, Italy


According to our database1, Filippo Bonchi authored at least 118 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Diagrammatic Algebra of First Order Logic.
CoRR, 2024

2023
Deconstructing the Calculus of Relations with Tape Diagrams.
Proc. ACM Program. Lang., January, 2023

Up-to techniques for behavioural metrics via fibrations.
Math. Struct. Comput. Sci., 2023

Exploiting Adjoints in Property Directed Reachability Analysis.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022
String diagram rewrite theory III: Confluence with and without Frobenius.
Math. Struct. Comput. Sci., August, 2022

String diagram rewrite theory II: Rewriting with symmetric monoidal structure.
Math. Struct. Comput. Sci., April, 2022

The Theory of Traces for Systems with Nondeterminism, Probability, and Termination.
Log. Methods Comput. Sci., 2022

Convexity via Weak Distributive Laws.
Log. Methods Comput. Sci., 2022

String Diagram Rewrite Theory I: Rewriting with Frobenius Structure.
J. ACM, 2022

2021
A Survey of Compositional Signal Flow Theory.
Proceedings of the Advancing Research in Information and Communication Technology, 2021

Distribution Bisimilarity via the Power of Convex Algebras.
Log. Methods Comput. Sci., 2021

Bialgebraic foundations for the operational semantics of string diagrams.
Inf. Comput., 2021

Diagrammatic Polyhedral Algebra.
CoRR, 2021

Diagrammatic Polyhedral Algebra.
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Combining Semilattices and Semimodules.
Proceedings of the Foundations of Software Science and Computation Structures, 2021

Presenting Convex Sets of Probability Distributions by Convex Semilattices and Unique Bases ((Co)algebraic pearls).
Proceedings of the 9th Conference on Algebra and Coalgebra in Computer Science, 2021

On Doctrines and Cartesian Bicategories.
Proceedings of the 9th Conference on Algebra and Coalgebra in Computer Science, 2021

From Farkas' Lemma to Linear Programming: an Exercise in Diagrammatic Algebra ((Co)algebraic pearls).
Proceedings of the 9th Conference on Algebra and Coalgebra in Computer Science, 2021

2020
Presenting convex sets of probability distributions by convex semilattices and unique bases.
CoRR, 2020

Cartesian bicategories with choice.
CoRR, 2020

Contextual Equivalence for Signal Flow Graphs.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

2019
Bisimilarity of open terms in stream GSOS.
Sci. Comput. Program., 2019

Diagrammatic algebra: from linear to concurrent systems.
Proc. ACM Program. Lang., 2019

The Theory of Traces for Systems with Nondeterminism and Probability.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

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

Interacting Hopf Algebras: the Theory of Linear Systems (text not included).
Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Bialgebraic Semantics for String Diagrams.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

The Axiom of Choice in Cartesian Bicategories.
Proceedings of the 8th Conference on Algebra and Coalgebra in Computer Science, 2019

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

2018
Simulation-based matching of cloud applications.
Sci. Comput. Program., 2018

Coalgebraic Behavioral Metrics.
Log. Methods Comput. Sci., 2018

Deconstructing Lawvere with distributive laws.
J. Log. Algebraic Methods Program., 2018

Trace Semantics for Nondeterministic Probabilistic Automata via Determinization.
CoRR, 2018

Rewriting with Frobenius.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Sound up-to techniques and Complete abstract domains.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Graphical Conjunctive Queries.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2017
Enhanced coalgebraic bisimulation.
Math. Struct. Comput. Sci., 2017

The Calculus of Signal Flow Diagrams I: Linear relations on streams.
Inf. Comput., 2017

Functorial Semantics for Relational Theories.
CoRR, 2017

Up-To Techniques for Weighted Systems (Extended Version).
CoRR, 2017

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

Up-To Techniques for Weighted Systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Bisimilarity of Open Terms in Stream GSOS.
Proceedings of the Fundamentals of Software Engineering - 7th International Conference, 2017

Confluence of Graph Rewriting with Interfaces.
Proceedings of the Programming Languages and Systems, 2017

Refinement for Signal Flow Graphs.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

The Power of Convex Algebras.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
A coalgebraic view on decorated traces.
Math. Struct. Comput. Sci., 2016

Behaviour-Aware Matching of Cloud Applications.
Proceedings of the 10th International Symposium on Theoretical Aspects of Software Engineering, 2016

Rewriting modulo symmetric monoidal structure.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Lawvere Categories as Composed PROPs.
Proceedings of the Coalgebraic Methods in Computer Science, 2016

2015
Killing epsilons with a dagger: A coalgebraic study of systems with algebraic label structure.
Theor. Comput. Sci., 2015

Weak CCP bisimilarity with strong procedures.
Sci. Comput. Program., 2015

Efficient algorithms for program equivalence for confluent concurrent constraint programming.
Sci. Comput. Program., 2015

Modular encoding of synchronous and asynchronous interactions using open Petri nets.
Sci. Comput. Program., 2015

Concurrency cannot be observed, asynchronously.
Math. Struct. Comput. Sci., 2015

Bialgebraic Semantics for Logic Programming.
Log. Methods Comput. Sci., 2015

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

Full Abstraction for Signal Flow Graphs.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

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

Towards Trace Metrics via Functor Lifting.
Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

Asynchronous Traces and Open Petri Nets.
Proceedings of the Programming Languages with Applications to Biology and Security, 2015

2014
A General Theory of Barbs, Contexts, and Labels.
ACM Trans. Comput. Log., 2014

Algebra-coalgebra duality in Brzozowski's minimization algorithm.
ACM Trans. Comput. Log., 2014

RPO semantics for mobile ambients.
Math. Struct. Comput. Sci., 2014

Interacting Hopf Algebras.
CoRR, 2014

A Behavioral Congruence for Concurrent Constraint Programming with Nondeterministic Choice.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2014, 2014

Behavioral Metrics via Functor Lifting.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Interacting Bialgebras Are Frobenius.
Proceedings of the Foundations of Software Science and Computation Structures, 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

Encoding Synchronous Interactions Using Labelled Petri Nets.
Proceedings of the Coordination Models and Languages, 2014

A Categorical Semantics of Signal Flow Graphs.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

How to Kill Epsilons with a Dagger - A Coalgebraic Take on Systems with Algebraic Label Structure.
Proceedings of the Coalgebraic Methods in Computer Science, 2014

2013
Generalizing determinization from automata to coalgebras
Log. Methods Comput. Sci., 2013

Efficient computation of program equivalence for confluent concurrent constraint programming.
Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

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

Saturated Semantics for Coalgebraic Logic Programming.
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
Preface to special issue: EXPRESS, ICE and SOS 2009.
Math. Struct. Comput. Sci., 2012

A Presheaf Environment for the Explicit Fusion Calculus.
J. Autom. Reason., 2012

A coalgebraic perspective on linear weighted automata.
Inf. Comput., 2012

Final Semantics for Decorated Traces.
Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012

Reducing Weak to Strong Bisimilarity in CCP
Proceedings of the Proceedings Fifth Interaction and Concurrency Experience, 2012

Partition refinement for bisimilarity in CCP.
Proceedings of the ACM Symposium on Applied Computing, 2012

A Coalgebraic Perspective on Minimization and Determinization.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

Brzozowski's Algorithm (Co)Algebraically.
Proceedings of the Logic and Program Semantics, 2012

2011
A lattice-theoretical perspective on adhesive categories.
J. Symb. Comput., 2011

Quantitative Kleene coalgebras.
Inf. Comput., 2011

Symbolic and Asynchronous Semantics via Normalized Coalgebras
Log. Methods Comput. Sci., 2011

Deriving Labels and Bisimilarity for Concurrent Constraint Programming.
Proceedings of the Foundations of Software Science and Computational Structures, 2011

Towards a General Theory of Barbs, Contexts and Labels.
Proceedings of the Programming Languages and Systems - 9th Asian Symposium, 2011

2010
Saturated LTSs for Adhesive Rewriting Systems.
Proceedings of the Graph Transformations - 5th International Conference, 2010

Generalizing the powerset construction, coalgebraically.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Concurrency Can't Be Observed, Asynchronously.
Proceedings of the Programming Languages and Systems - 8th Asian Symposium, 2010

2009
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves.
Theor. Comput. Sci., 2009

Synthesising CCS bisimulation using graph rewriting.
Inf. Comput., 2009

A Net-based Approach to Web Services Publication and Replaceability.
Fundam. Informaticae, 2009

On Barbs and Labels in Reactive Systems
Proceedings of the Proceedings Sixth Workshop on Structural Operational Semantics, 2009

Reactive Systems, Barbed Semantics, and the Mobile Ambients.
Proceedings of the Foundations of Software Science and Computational Structures, 2009

Minimization Algorithm for Symbolic Bisimilarity.
Proceedings of the Programming Languages and Systems, 2009

Deriving Syntax and Axioms for Quantitative Regular Behaviours.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

Encoding Asynchronous Interactions Using Open Petri Nets.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

Coalgebraic Symbolic Semantics.
Proceedings of the Algebra and Coalgebra in Computer Science, 2009

2008
Abstract Semantics by Observable Contexts.
PhD thesis, 2008

On the Use of Behavioural Equivalences for Web Services' Development.
Fundam. Informaticae, 2008

Preface.
Proceedings of the First Interaction and Concurrency Experiences Workshop, 2008

Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding).
Proceedings of the 15th Workshop on Expressiveness in Concurrency, 2008

Parallel and Sequential Independence for Borrowed Contexts.
Proceedings of the Graph Transformations, 4th International Conference, 2008

Abstract Semantics by Observable Contexts.
Proceedings of the Graph Transformations, 4th International Conference, 2008

Symbolic Semantics Revisited.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

A Category of Explicit Fusions.
Proceedings of the Concurrency, 2008

Compositional Specification of Web Services Via Behavioural Equivalence of Nets: A Case Study.
Proceedings of the Applications and Theory of Petri Nets, 29th International Conference, 2008

2007
G-Reactive Systems as Coalgebras.
Proceedings of the Second Workshop on Applied and Computational Category Theory, 2007

A Behavioural Congruence for Web Services.
Proceedings of the International Symposium on Fundamentals of Software Engineering, 2007

Coalgebraic Models for Reactive Systems.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006
A Coalgebraic Theory of Reactive Systems.
Proceedings of the LIX Colloquium on Emerging Trends in Concurrency Theory, 2006

Adhesive DPO Parallelism for Monic Matches.
Proceedings of the Workshop on Graph Transformation for Concurrency and Verification, 2006

Saturated Semantics for Reactive Systems.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

Process Bisimulation <i>Via</i> a Graphical Encoding.
Proceedings of the Graph Transformations, Third International Conference, 2006


  Loading...