Travelled to:1 × Austria
1 × Brazil
1 × Estonia
1 × France
1 × Germany
1 × Hungary
1 × India
1 × Spain
1 × The Netherlands
1 × USA
2 × Italy
3 × United Kingdom
Collaborated with:U.Montanari F.Gadducci P.Sobocinski F.Zanasi B.König L.F.Pino F.D.Valencia D.Pous G.V.Monreale ∅ A.Aristizábal T.Heindel J.Seeber D.Petrisan J.Rot C.Palamidessi A.Kissinger Joshua Holland Robin Piedeleu J.Adámek M.Hülsbusch S.Milius A.Silva
Talks about:system (4) semant (4) bisimilar (3) program (3) concurr (3) constraint (2) abstract (2) reactiv (2) graphic (2) equival (2)
Person: Filippo Bonchi
DBLP: Bonchi:Filippo
Contributed to:
2015
2014
20142013
20132012
20122011
2010
2009200920082008200620062017
20182019Wrote 19 papers:
- POPL-2015-BonchiSZ #abstraction #graph
- Full Abstraction for Signal Flow Graphs (FB, PS, FZ), pp. 515–526.
- FoSSaCS-2014-BonchiSZ #algebra
- Interacting Bialgebras Are Frobenius (FB, PS, FZ), pp. 351–365.
- LICS-CSL-2014-BonchiPPR #induction
- Coinduction up-to in a fibrational setting (FB, DP, DP, JR), p. 9.
- POPL-2013-BonchiP #automaton #bisimulation #congruence #equivalence #nondeterminism
- Checking NFA equivalence with bisimulations up to congruence (FB, DP), pp. 457–468.
- PPDP-2013-PinoBV #concurrent #confluence #constraints #equivalence #performance #programming
- Efficient computation of program equivalence for confluent concurrent constraint programming (LFP, FB, FDV), pp. 263–274.
- FoSSaCS-2012-AdamekBHKMS #algebra
- A Coalgebraic Perspective on Minimization and Determinization (JA, FB, MH, BK, SM, AS), pp. 58–73.
- SAC-2012-AristizabalBVP #refinement #similarity
- Partition refinement for bisimilarity in CCP (AA, FB, FDV, LFP), pp. 88–93.
- FoSSaCS-2011-AristizabalBPPV #concurrent #constraints #programming #similarity
- Deriving Labels and Bisimilarity for Concurrent Constraint Programming (AA, FB, CP, LFP, FDV), pp. 138–152.
- ICGT-2010-BonchiGMM #lts #term rewriting
- Saturated LTSs for Adhesive Rewriting Systems (FB, FG, GVM, UM), pp. 123–138.
- ESOP-2009-BonchiM #algorithm #similarity
- Minimization Algorithm for Symbolic Bisimilarity (FB, UM), pp. 267–284.
- FoSSaCS-2009-BonchiGM #mobile #semantics
- Reactive Systems, Barbed Semantics, and the Mobile Ambients (FB, FG, GVM), pp. 272–287.
- FoSSaCS-2008-BonchiM #revisited #semantics
- Symbolic Semantics Revisited (FB, UM), pp. 395–412.
- ICGT-2008-Bonchi #semantics
- Abstract Semantics by Observable Contexts (FB), pp. 478–480.
- ICGT-2008-BonchiGH #independence #parallel
- Parallel and Sequential Independence for Borrowed Contexts (FB, FG, TH), pp. 226–241.
- ICGT-2006-BonchiGK #bisimulation #encoding #process #visual notation
- Process Bisimulation Via a Graphical Encoding (FB, FG, BK), pp. 168–183.
- LICS-2006-BonchiKM #semantics
- Saturated Semantics for Reactive Systems (FB, BK, UM), pp. 69–80.
- ESOP-2017-BonchiGKSZ #confluence #graph grammar #interface
- Confluence of Graph Rewriting with Interfaces (FB, FG, AK, PS, FZ), pp. 141–169.
- CSL-2018-BonchiSS #query #visual notation
- Graphical Conjunctive Queries (FB, JS, PS), p. 23.
- POPL-2019-BonchiHPSZ #algebra #concurrent #diagrams #linear
- Diagrammatic algebra: from linear to concurrent systems (FB, JH, RP, PS, FZ), p. 28.