 | 2009 |
|---|
| 68 |       | Rogério de Lemos,
Jean-Charles Fabre,
Cristina Gacek,
Fabio Gadducci,
Maurice H. ter Beek:
Architecting Dependable Systems VI
Springer 2009 |
| 67 | | Paolo Baldan,
Filippo Bonchi,
Fabio Gadducci:
Encoding Asynchronous Interactions Using Open Petri Nets.
CONCUR 2009: 99-114 |
| 66 | | Filippo Bonchi,
Fabio Gadducci,
Giacoma Valentina Monreale:
Reactive Systems, Barbed Semantics, and the Mobile Ambients.
FOSSACS 2009: 272-287 |
| 65 | | Alessandro Aldini,
Maurice H. ter Beek,
Fabio Gadducci:
Preface.
Electr. Notes Theor. Comput. Sci. 236: 1-3 (2009) |
| 64 | | Filippo Bonchi,
Fabio Gadducci,
Giacoma Valentina Monreale:
Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding).
Electr. Notes Theor. Comput. Sci. 242(1): 73-98 (2009) |
| 63 | | Fabio Gadducci:
A Note on an Old-Fashioned Algebra for (Disconnected) Graphs.
Electr. Notes Theor. Comput. Sci. 253(4): 3-15 (2009) |
| 62 | | Filippo Bonchi,
Fabio Gadducci,
Barbara König:
Synthesising CCS bisimulation using graph rewriting.
Inf. Comput. 207(1): 14-40 (2009) |
| 2008 |
|---|
| 61 | | Paolo Baldan,
Fabio Gadducci:
Petri Nets Are Dioids.
AMAST 2008: 51-66 |
| 60 | | Filippo Bonchi,
Maria Grazia Buscemi,
Vincenzo Ciancia,
Fabio Gadducci:
A Category of Explicit Fusions.
Concurrency, Graphs and Models 2008: 544-562 |
| 59 | | Fabio Gadducci:
Ugo Montanari and Friends.
Concurrency, Graphs and Models 2008: 743-746 |
| 58 | | Fabio Gadducci,
Giacoma Valentina Monreale:
A Decentralized Implementation of Mobile Ambients.
ICGT 2008: 115-130 |
| 57 | | Filippo Bonchi,
Fabio Gadducci,
Tobias Heindel:
Parallel and Sequential Independence for Borrowed Contexts.
ICGT 2008: 226-241 |
| 56 | | Stefano Bistarelli,
Fabio Gadducci,
Javier Larrosa,
Emma Rollon:
A Soft Approach to Multi-objective Optimization.
ICLP 2008: 764-768 |
| 55 | | Filippo Bonchi,
Antonio Brogi,
Sara Corfini,
Fabio Gadducci:
Compositional Specification of Web Services Via Behavioural Equivalence of Nets: A Case Study.
Petri Nets 2008: 52-71 |
| 54 | | Fabio Gadducci:
A Term-Graph Syntax for Algebras over Multisets.
WADT 2008: 152-165 |
| 53 | | Maurice H. ter Beek,
Fabio Gadducci,
Dirk Janssens:
A Calculus for Team Automata.
Electr. Notes Theor. Comput. Sci. 195: 41-55 (2008) |
| 52 | | Paolo Baldan,
Andrea Corradini,
Fernando Luís Dotti,
Luciana Foss,
Fabio Gadducci,
Leila Ribeiro:
Towards a Notion of Transaction in Graph Rewriting.
Electr. Notes Theor. Comput. Sci. 211: 39-50 (2008) |
| 51 | | Filippo Bonchi,
Antonio Brogi,
Sara Corfini,
Fabio Gadducci:
On the Use of Behavioural Equivalences for Web Services' Development.
Fundam. Inform. 89(4): 479-510 (2008) |
| 2007 |
|---|
| 50 | | Fabio Gadducci,
Alberto Lluch-Lafuente:
Graphical Encoding of a Spatial Logic for the pi -Calculus.
CALCO 2007: 209-225 |
| 49 | | Filippo Bonchi,
Antonio Brogi,
Sara Corfini,
Fabio Gadducci:
A Behavioural Congruence for Web Services.
FSEN 2007: 240-256 |
| 48 | | Maurice H. ter Beek,
Fabio Gadducci:
Preface.
Electr. Notes Theor. Comput. Sci. 168: 1-3 (2007) |
| 47 | | Paolo Baldan,
Fabio Gadducci,
Ugo Montanari:
Modelling Calculi with Name Mobility using Graphs with Equivalences.
Electr. Notes Theor. Comput. Sci. 176(1): 85-97 (2007) |
| 46 | | Andrea Corradini,
Fabio Gadducci,
Wolfram Kahl,
Barbara König:
Inequational Deduction as Term Graph Rewriting.
Electr. Notes Theor. Comput. Sci. 72(1): 31-44 (2007) |
| 45 | | Fabio Gadducci:
Graph rewriting for the pi-calculus.
Mathematical Structures in Computer Science 17(3): 407-437 (2007) |
| 2006 |
|---|
| 44 | | Paolo Baldan,
Fabio Gadducci,
Ugo Montanari:
Concurrent Rewriting for Graphs with Equivalences.
CONCUR 2006: 279-294 |
| 43 |  | Stefano Bistarelli,
Fabio Gadducci:
Enhancing Constraints Manipulation in Semiring-Based Formalisms.
ECAI 2006: 63-67 |
| 42 | | Filippo Bonchi,
Fabio Gadducci,
Barbara König:
Process Bisimulation Via a Graphical Encoding.
ICGT 2006: 168-183 |
| 41 | | Paolo Baldan,
Andrea Corradini,
Luciana Foss,
Fabio Gadducci:
Graph Transactions as Processes.
ICGT 2006: 199-214 |
| 40 | | Maurice H. ter Beek,
Fabio Gadducci:
Preface.
Electr. Notes Theor. Comput. Sci. 142: 1-3 (2006) |
| 39 | | Fabio Gadducci,
Alberto Lluch-Lafuente:
Graphical Verification of a Spatial Logic for the pi-calculus.
Electr. Notes Theor. Comput. Sci. 154(2): 31-46 (2006) |
| 38 | | Fabio Gadducci,
Marino Miculan,
Ugo Montanari:
About permutation algebras, (pre)sheaves and named sets.
Higher-Order and Symbolic Computation 19(2-3): 283-304 (2006) |
| 37 | | Michele Boreale,
Fabio Gadducci:
Processes as formal power series: A coinductive approach to denotational semantics.
Theor. Comput. Sci. 360(1-3): 440-458 (2006) |
| 2005 |
|---|
| 36 | | Roberto Bruni,
Fabio Gadducci,
Ugo Montanari,
Pawel Sobocinski:
Deriving Weak Bisimulation Congruences from Reduction Systems.
CONCUR 2005: 293-307 |
| 35 | | Fabio Gadducci,
Ugo Montanari:
Graph Processes with Fusions: Concurrency by Colimits, Again.
Formal Methods in Software and Systems Modeling 2005: 84-100 |
| 34 | | Fabio Gadducci,
Ugo Montanari:
Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes.
Processes, Terms and Cycles 2005: 106-126 |
| 33 | | Andrea Corradini,
Fabio Gadducci:
On Term Graphs as an Adhesive Category.
Electr. Notes Theor. Comput. Sci. 127(5): 43-56 (2005) |
| 2004 |
|---|
| 32 | | Paolo Baldan,
Andrea Corradini,
Fabio Gadducci:
Specifying and Verifying UML Activity Diagrams Via Graph Transformation.
Global Computing 2004: 18-33 |
| 31 | | Fabio Gadducci,
Marino Miculan,
Ugo Montanari:
Some Characterization Results for Permutation Algebras.
Electr. Notes Theor. Comput. Sci. 104: 129-147 (2004) |
| 2003 |
|---|
| 30 | | Fabio Gadducci:
Term Graph Rewriting for the pi-Calculus.
APLAS 2003: 37-54 |
| 29 | | Pierpaolo Degano,
Fabio Gadducci,
Corrado Priami:
Causality and Replication in Concurrent Processes.
Ershov Memorial Conference 2003: 307-318 |
| 28 | | Michele Boreale,
Fabio Gadducci:
Denotational Testing Semantics in Coinductive Form.
MFCS 2003: 279-289 |
| 2002 |
|---|
| 27 | | Luis Filipe Andrade,
Paolo Baldan,
Hubert Baumeister,
Roberto Bruni,
Andrea Corradini,
Rocco De Nicola,
José Luiz Fiadeiro,
Fabio Gadducci,
Stefania Gnesi,
Piotr Hoffman,
Nora Koch,
Piotr Kosiuczenko,
Alessandro Lapadula,
Diego Latella,
Antónia Lopes,
Michele Loreti,
Mieke Massink,
Franco Mazzanti,
Ugo Montanari,
Cristóvão Oliveira,
Rosario Pugliese,
Andrzej Tarlecki,
Michel Wermelinger,
Martin Wirsing,
Artur Zawlocki:
AGILE: Software Architecture for Mobility.
WADT 2002: 1-33 |
| 26 | | Matteo Coccia,
Fabio Gadducci,
Ugo Montanari:
GS.Lambda Theories: A Syntax for Higher-Order Graphs.
Electr. Notes Theor. Comput. Sci. 69: (2002) |
| 25 | | Fabio Gadducci,
Ugo Montanari:
Preface - WRLA 2002, Rewriting Logic and Its Applications, Pisa, Italy, 19-21 September 2002.
Electr. Notes Theor. Comput. Sci. 71: 1-2 (2002) |
| 24 | | Pierpaolo Degano,
Fabio Gadducci,
Corrado Priami:
A causal semantics for CCS via rewriting logic.
Theor. Comput. Sci. 275(1-2): 259-282 (2002) |
| 23 | | Fabio Gadducci,
Ugo Montanari:
Comparing logics for rewriting: rewriting logic, action calculi and tile logic.
Theor. Comput. Sci. 285(2): 319-358 (2002) |
| 22 | | Roberto Bruni,
Fabio Gadducci,
Ugo Montanari:
Normal forms for algebras of connection.
Theor. Comput. Sci. 286(2): 247-292 (2002) |
| 21 | | Andrea Corradini,
Fabio Gadducci:
A functorial semantics for multi-algebras and partial algebras, with applications to syntax.
Theor. Comput. Sci. 286(2): 293-322 (2002) |
| 2001 |
|---|
| 20 | | Roberto Bruni,
Fabio Gadducci:
Some algebraic laws for spans.
Electr. Notes Theor. Comput. Sci. 44(3): (2001) |
| 19 | | Fabio Gadducci,
Ugo Montanari:
A Concurrent Graph Semantics for Mobile Ambients.
Electr. Notes Theor. Comput. Sci. 45: (2001) |
| 18 | | Andrea Corradini,
Fabio Gadducci:
Categorical rewriting of term-like structures.
Electr. Notes Theor. Comput. Sci. 51: (2001) |
| 17 | | Fabio Gadducci,
Piergiulio Katis,
Ugo Montanari,
Nicoletta Sabadini,
Robert F. C. Walters:
Comparing cospan-spans and tiles via a Hoare-style process calculus.
Electr. Notes Theor. Comput. Sci. 62: (2001) |
| 2000 |
|---|
| 16 | | Fabio Gadducci,
Ugo Montanari:
The tile model.
Proof, Language, and Interaction 2000: 133-166 |
| 1999 |
|---|
| 15 | | Andrea Corradini,
Fabio Gadducci:
An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories.
Applied Categorical Structures 7(4): 299-331 (1999) |
| 14 | | Fabio Gadducci,
Reiko Heckel,
Mercè Llabrés:
A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting.
Electr. Notes Theor. Comput. Sci. 29: (1999) |
| 13 | | Andrea Corradini,
Fabio Gadducci:
Rewriting on cyclic structures: Equivalence between the operational and the categorical description.
ITA 33(4/5): 467-493 (1999) |
| 1998 |
|---|
| 12 | | Andrea Corradini,
Fabio Gadducci:
Rational Term Rewriting.
FoSSaCS 1998: 156-171 |
| 11 | | Fabio Gadducci,
Ugo Montanari:
Axioms for Contextual Net Processes.
ICALP 1998: 296-308 |
| 10 | | Fabio Gadducci,
Reiko Heckel,
Manuel Koch:
A Fully Abstract Model for Graph-Interpreted Temporal Logic.
TAGT 1998: 310-322 |
| 9 | | Roberto Bruni,
Fabio Gadducci,
Ugo Montanari:
Normal Forms for Partitions and Relations.
WADT 1998: 31-47 |
| 8 | | Andrea Corradini,
Fabio Gadducci:
Functorial Semantics for Multi-algebras.
WADT 1998: 79-91 |
| 7 | | Georgia Carabetta,
Pierpaolo Degano,
Fabio Gadducci:
CCS semantics via proved transition systems and rewriting logic.
Electr. Notes Theor. Comput. Sci. 15: (1998) |
| 1997 |
|---|
| 6 | | Andrea Corradini,
Fabio Gadducci:
A 2-Categorical Presentation of Term Graph Rewriting.
Category Theory and Computer Science 1997: 87-105 |
| 5 | | Fabio Gadducci,
Reiko Heckel:
An inductive view of graph transformation.
WADT 1997: 223-237 |
| 1996 |
|---|
| 4 | | Fabio Gadducci,
Ugo Montanari:
Tiles, rewriting rules and CCS.
Electr. Notes Theor. Comput. Sci. 4: (1996) |
| 1995 |
|---|
| 3 | | Andrea Corradini,
Fabio Gadducci:
CPO Models for Infinite Term Rewriting.
AMAST 1995: 368-384 |
| 2 | | Marino Miculan,
Fabio Gadducci:
Modal mu-Types for Processes
LICS 1995: 221-231 |
| 1 | | Andrea Corradini,
Fabio Gadducci,
Ugo Montanari:
Relating Two Categorial Models of Term Rewriting.
RTA 1995: 225-240 |
