Fabio Gadducci

Orcid: 0000-0003-0690-3051

Affiliations:
  • University of Pisa, Italy


According to our database1, Fabio Gadducci authored at least 154 papers between 1995 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A simple criterion for M,N-adhesivity.
Theor. Comput. Sci., January, 2024

Quantum Bisimilarity via Barbs and Contexts: Curbing the Power of Non-deterministic Observers.
Proc. ACM Program. Lang., January, 2024

2023
Specification and modelling of computing systems through graphs and graph transformation.
J. Log. Algebraic Methods Program., October, 2023

From Gs-monoidal to Oplax Cartesian Categories: Constructions and Functorial Completeness.
Appl. Categorical Struct., October, 2023

Specification and verification of a linear-time logic for graph transformation.
CoRR, 2023

Weakly affine monads.
CoRR, 2023

Specification and Verification of a Linear-Time Temporal Logic for Graph Transformation.
Proceedings of the Graph Transformation - 16th International Conference, 2023

A Spatial Logic with Time and Quantifiers.
Proceedings of the Dynamic Logic. New Trends and Applications - 5th International Workshop, 2023

Weakly Markov Categories and Weakly Affine Monads.
Proceedings of the 10th Conference on Algebra and Coalgebra in Computer Science, 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

Categorical specification and implementation of Replicated Data Types.
Theor. Comput. Sci., 2022

Special issue on Theoretical Topics in Graph Transformation.
Theor. Comput. Sci., 2022

Special issue on Application-oriented aspects of graphs and graph transformation (ICGT 2020).
Sci. Comput. Program., 2022

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

Distributivity and residuation for lexicographic orders.
Inf. Process. Lett., 2022

Completeness and expressiveness for gs-monoidal categories.
CoRR, 2022

A new criterion for M, N-adhesivity, with an application to hierarchical graphs.
CoRR, 2022

On Binding in the Spatial Logics for Closure Spaces.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Verification Principles, 2022

Graph Rewriting Components.
Proceedings of the Graph Transformation - 15th International Conference, 2022

A new criterion for <i>M</i>, <i>N</i>-adhesivity, with an application to hierarchical graphs.
Proceedings of the Foundations of Software Science and Computation Structures, 2022

Soft Concurrent Constraint Programming with Local Variables.
Proceedings of the Coordination Models and Languages, 2022

A Presheaf Semantics for Quantified Temporal Logics.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2022

2021
Soft constraint automata with memory.
J. Log. Algebraic Methods Program., 2021

Concurrent semantics for fusions: Weak prime domains and connected event structures.
Inf. Comput., 2021

Residuation for Soft Constraints: Lexicographic Orders and Approximation Techniques.
Proceedings of the Logics in Artificial Intelligence - 17th European Conference, 2021

Towards a Spatial Model Checker on GPU.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2021

Towards Model Checking Video Streams Using VoxLogicA on GPUs.
Proceedings of the From Data to Models and Back, 2021

2020
A spatial model checker in GPU (extended version).
CoRR, 2020

Pisa, 1954-1961: Assessing Key Stages of a Seminal Italian Project.
IEEE Ann. Hist. Comput., 2020

Implementation Correctness for Replicated Data Types, Categorically.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2020 - 17th International Colloquium, Macau, China, November 30, 2020

2019
Retracing and assessing the CEP project.
CoRR, 2019

Petri nets are dioids: a new algebraic foundation for non-deterministic net theory.
Acta Informatica, 2019

A Categorical Account of Replicated Data Types.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Data-Driven Choreographies à la Klaim.
Proceedings of the Models, Languages, and Tools for Concurrent and Distributed Programming, 2019

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

2018
On the semantics and implementation of replicated data types.
Sci. Comput. Program., 2018

Event Structures for Petri nets with Persistence.
Log. Methods Comput. Sci., 2018

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

Soft Constraint Automata with Memory.
Proceedings of the It's All About Coordination, 2018

2017
Observational and behavioural equivalences for soft concurrent constraint programming.
J. Log. Algebraic Methods Program., 2017

Residuation for bipolar preferences in soft constraints.
Inf. Process. Lett., 2017

Domains and event structures for fusions.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

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

A Denotational View of Replicated Data Types.
Proceedings of the Coordination Models and Languages, 2017

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

2015
Reconciling White-Box and Black-Box Perspectives on Behavioral Self-adaptation.
Proceedings of the Software Engineering for Collective Autonomic Systems, 2015

Modelling and analyzing adaptive self-assembly strategies with Maude.
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

Verification of Evolving Graph Structures (Dagstuhl Seminar 15451).
Dagstuhl Reports, 2015

A Labelled Semantics for Soft Concurrent Constraint Programming.
Proceedings of the Coordination Models and Languages, 2015

A White Box Perspective on Behavioural Adaptation.
Proceedings of the Software, 2015

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

Awareness and Control in Adaptable Transition Systems.
Proceedings of the International Workshop on Petri Nets and Software Engineering (PNSE'15), 2015

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

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

A Virtual Experience on the Very First Italian Computer.
ACM Journal on Computing and Cultural Heritage, 2014

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

2013
Adaptation is a Game.
Tiny Trans. Comput. Sci., 2013

Soft Constraints for Lexicographic Orders.
Proceedings of the Advances in Artificial Intelligence and Its Applications, 2013

Validating reconfigurations of reo circuits in an e-Banking scenario.
Proceedings of the 4th international ACM Sigsoft symposium on Architecting critical systems, 2013

Using Old Computers for Teaching Computer Science.
Proceedings of the Making the History of Computing Relevant, 2013

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

Counterpart Semantics for a Second-Order μ-Calculus.
Fundam. Informaticae, 2012

Local arc consistency for non-invertible semirings, with an application to multi-objective optimization.
Expert Syst. Appl., 2012

Barbed Semantics for Open Reactive Systems.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2012

Adaptable Transition Systems.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2012

A Modular LTS for Open Reactive Systems.
Proceedings of the Theoretical Computer Science, 2012

Exploiting Over- and Under-Approximations for Infinite-State Counterpart Models.
Proceedings of the Graph Transformations - 6th International Conference, 2012

A Conceptual Framework for Adaptation.
Proceedings of the Fundamental Approaches to Software Engineering, 2012

2011
A decentralised graphical implementation of mobile ambients.
J. Log. Algebraic Methods Program., 2011

Preface.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2011

Adhesivity Is Not Enough: Local Church-Rosser Revisited.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

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

Hierarchical Models for Service-Oriented Systems.
Proceedings of the Rigorous Software Engineering for Service-Oriented Systems, 2011

2010
From Petri Nets to Graph Transformation Systems.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010

An Algebra of Hierarchical Graphs and its Application to Structural Encoding.
Sci. Ann. Comput. Sci., 2010

An Institution for Graph Transformation.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2010

An Algebra of Hierarchical Graphs.
Proceedings of the Trustworthly Global Computing - 5th International Symposium, 2010

Extending Soft Arc Consistency Algorithms to Non-invertible Semirings.
Proceedings of the Advances in Artificial Intelligence, 2010

Counterpart Semantics for a Second-Order <i>µ</i>-Calculus.
Proceedings of the Graph Transformations - 5th International Conference, 2010

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

On GS-Monoidal Theories for Graphs with Nesting.
Proceedings of the Graph Transformations and Model-Driven Engineering, 2010

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

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

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

A Note on an Old-Fashioned Algebra for (Disconnected) Graphs.
Proceedings of the Fifth International Workshop on Computing with Terms and Graphs, 2009

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

A Graph Syntax for Processes and Services.
Proceedings of the Web Services and Formal Methods, 6th International Workshop, 2009

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

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

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

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

Preface.
Proceedings of the 3rd International Workshop on Views On Designing Complex Architectures, 2008

A Term-Graph Syntax for Algebras over Multisets.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2008

A Soft Approach to Multi-objective Optimization.
Proceedings of the Logic Programming, 24th International Conference, 2008

A Decentralized Implementation of Mobile Ambients.
Proceedings of the Graph Transformations, 4th International Conference, 2008

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

Ugo Montanari and Friends.
Proceedings of the Concurrency, 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

Petri Nets Are Dioids.
Proceedings of the Algebraic Methodology and Software Technology, 2008

2007
Graph rewriting for the pi-calculus.
Math. Struct. Comput. Sci., 2007

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

Graphical Encoding of a Spatial Logic for the <i>pi</i> -Calculus.
Proceedings of the Algebra and Coalgebra in Computer Science, 2007

2006
Processes as formal power series: A coinductive approach to denotational semantics.
Theor. Comput. Sci., 2006

About permutation algebras, (pre)sheaves and named sets.
High. Order Symb. Comput., 2006

A Calculus for Team Automata.
Proceedings of the Brazilian Symposium on Formal Methods, 2006

Preface.
Proceedings of the Second International Workshop on Views on Designing Complex Architectures, 2006

Modelling Calculi with Name Mobility using Graphs with Equivalences.
Proceedings of the Third International Workshop on Term Graph Rewriting, 2006

Towards a Notion of Transaction in Graph Rewriting.
Proceedings of the Fifth International Workshop on Graph Transformation and Visual Modeling Techniques, 2006

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

Graph Transactions as Processes.
Proceedings of the Graph Transformations, Third International Conference, 2006

Enhancing Constraints Manipulation in Semiring-Based Formalisms.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

Concurrent Rewriting for Graphs with Equivalences.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005
Graphical Verification of a Spatial Logic for the <i>pi</i>-calculus.
Proceedings of the Workshop on Graph Transformation for Verification and Concurrency, 2005

Deriving Weak Bisimulation Congruences from Reduction Systems.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Observing Reductions in Nominal Calculi <i>Via</i> a Graphical Encoding of Processes.
Proceedings of the Processes, 2005

Graph Processes with Fusions: Concurrency by Colimits, Again.
Proceedings of the Formal Methods in Software and Systems Modeling, 2005

2004
On Term Graphs as an Adhesive Category.
Proceedings of the 2nd International Workshop on Term Graph Rewriting, 2004

Specifying and Verifying UML Activity Diagrams Via Graph Transformation.
Proceedings of the Global Computing, IST/FET International Workshop, 2004

2003
Some Characterization Results for Permutation Algebras.
Proceedings of the Workshop of the COMETA Project on Computational Metamodels, 2003

Denotational Testing Semantics in Coinductive Form.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Causality and Replication in Concurrent Processes.
Proceedings of the Perspectives of Systems Informatics, 2003

Term Graph Rewriting for the pi-Calculus.
Proceedings of the Programming Languages and Systems, First Asian Symposium, 2003

2002
Comparing logics for rewriting: rewriting logic, action calculi and tile logic.
Theor. Comput. Sci., 2002

A causal semantics for CCS via rewriting logic.
Theor. Comput. Sci., 2002

A functorial semantics for multi-algebras and partial algebras, with applications to syntax.
Theor. Comput. Sci., 2002

Normal forms for algebras of connection.
Theor. Comput. Sci., 2002

Preface - WRLA 2002, Rewriting Logic and Its Applications, Pisa, Italy, 19-21 September 2002.
Proceedings of the Fourth International Workshop on Rewriting logic and Its Applications, 2002

Inequational Deduction as Term Graph Rewriting.
Proceedings of the First International Workshop on Term Graph Rewriting, 2002

GS.Lambda Theories: A Syntax for Higher-Order Graphs.
Proceedings of the Category Theory and Computer Science, 2002


2001
A Concurrent Graph Semantics for Mobile Ambients.
Proceedings of the Seventeenth Conference on the Mathematical Foundations of Programming Semantics, 2001

Comparing cospan-spans and tiles via a Hoare-style process calculus.
Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001

Categorical rewriting of term-like structures.
Proceedings of the GETGRATS Closing Workshop 2001, Bordeaux, France, June 22-23, 2001, 2001

Some algebraic laws for spans.
Proceedings of the First International Workshop on Relational Methods in Software, 2001

2000
The tile model.
Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999
A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting.
Proceedings of the Conference on Category Theory and Computer Science, 1999

Rewriting on cyclic structures: Equivalence between the operational and the categorical description.
RAIRO Theor. Informatics Appl., 1999

An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories.
Appl. Categorical Struct., 1999

1998
CCS semantics via proved transition systems and rewriting logic.
Proceedings of the 1998 International Workshop on Rewriting Logic and its Applications, 1998

Functorial Semantics for Multi-algebras.
Proceedings of the Recent Trends in Algebraic Development Techniques, 1998

Normal Forms for Partitions and Relations.
Proceedings of the Recent Trends in Algebraic Development Techniques, 1998

A Fully Abstract Model for Graph-Interpreted Temporal Logic.
Proceedings of the Theory and Application of Graph Transformations, 1998

Axioms for Contextual Net Processes.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Rational Term Rewriting.
Proceedings of the Foundations of Software Science and Computation Structure, 1998

1997
An inductive view of graph transformation.
Proceedings of the Recent Trends in Algebraic Development Techniques, 1997

A 2-Categorical Presentation of Term Graph Rewriting.
Proceedings of the Category Theory and Computer Science, 7th International Conference, 1997

1996
Tiles, rewriting rules and CCS.
Proceedings of the First International Workshop on Rewriting Logic and its Applications, 1996

1995
Relating Two Categorial Models of Term Rewriting.
Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

Modal mu-Types for Processes
Proceedings of the Proceedings, 1995

CPO Models for Infinite Term Rewriting.
Proceedings of the Algebraic Methodology and Software Technology, 1995


  Loading...