Nombre de documents

37

prova


Article dans une revue15 documents

  • Paolo Baldan, Filippo Bonchi, Fabio Gadducci, Valentina Monreale. Modular encoding of synchronous and asynchronous interactions using open Petri nets. Science of Computer Programming, Elsevier, 2016, <10.1016/j.scico.2014.11.019>. <hal-01284925>
  • Filippo Bonchi, Fabio Zanasi. Bialgebraic Semantics for Logic Programming. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2016, <10.2168/LMCS-11(1:14)2015>. <hal-01284910>
  • Filippo Bonchi, Fabio Gadducci, Paolo Baldan, Valentina Monreale. Concurrency cannot be observed, asynchronously. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2015, <10.1017/S0960129513000108>. <hal-01284912>
  • Filippo Bonchi, Stefan Milius, Alexandra Silva, Fabio Zanasi. Killing epsilons with a dagger: A coalgebraic study of systems with algebraic label structure. Theoretical Computer Science, Elsevier, 2015, 604, pp. 102-126. <10.1016/j.tcs.2015.03.024>. <hal-01284933>
  • Luis Fernando Pino Duque, Filippo Bonchi, Frank Valencia. Efficient Algorithms for Program Equivalence for Confluent Concurrent Constraint Programming. Science of Computer Programming, Elsevier, 2015, 111, pp.135-155. <10.1016/j.scico.2014.12.003>. <hal-01098502>
  • Luis Pino, Andres Aristizabal, Filippo Bonchi, Frank Valencia. Weak CCP bisimilarity with strong procedures. Science of Computer Programming, Elsevier, 2015, 100, pp.84-104. <10.1016/j.scico.2014.09.007>. <hal-00976768v2>
  • Jurriaan Rot, Filippo Bonchi, Marcello Bonsangue, Damien Pous, Jan Rutten, et al.. Enhanced coalgebraic bisimulation. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2015, <10.1017/S0960129515000523>. <hal-01288960>
  • Filippo Bonchi, Damien Pous. Hacking nondeterminism with induction and coinduction. . Communications- ACM, Association for Computing Machinery, 2015, 58 (2), pp.87-95. <10.1145/2713167>. <hal-01284907>
  • Filippo Bonchi, Marcello Bonsangue, Hansen Helle Hvid, Prakash Panangaden, Jan Rutten, et al.. Algebra-Coalgebra Duality in Brzozowski's Minimization Algorithm. ACM Transactions on Computational Logic, Association for Computing Machinery, 2014, To appear. <hal-00909426>
  • Alexandra Silva, Filippo Bonchi, Marcello Bonsangue, Jan Rutten. Generalizing determinization from automata to coalgebras.. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2013, 9 (1), pp.9(1). <10.2168/LMCS-9(1:9)2013>. <hal-00909339>
  • Filippo Bonchi, Marcello Bonsangue, Michele Boreale, Jan Rutten, Alexandra Silva. A Coalgebraic Perspective on Linear Weighted Automata. Information and Computation, Elsevier, 2012, 211, pp.77-105. <hal-00576921>
  • Filippo Bonchi, Buscemi Maria Grazia, Ciancia Vincenzo, Fabio Gadducci. A Presheaf Environment for the Explicit Fusion Calculus. Journal of Automated Reasoning, Springer Verlag, 2012, 49 (2), pp.161-183. <hal-00777522>
  • Filippo Bonchi, Ugo Montanari. Symbolic and Asynchronous Semantics via Normalized Coalgebras. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2012, 7 (2-7), pp.1-53. <10.2168/LMCS-7(2:7)2011>. <hal-00777552>
  • Filippo Bonchi, Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König. A lattice-theoretical perspective on adhesive categories. Journal of Symbolic Computation, Elsevier, 2011, 46 (3), pp.222-245. <hal-00777564>
  • Filippo Bonchi, Marcello Bonsangue, Jan Rutten, Alexandra Silva. Quantitative Kleene coalgebras. Information and Computation, Elsevier, 2011, 209 (5), pp.822-849. <hal-00777557>

Communication dans un congrès20 documents

  • Paolo Baldan, Filippo Bonchi, Fabio Gadducci, Valentina Monreale. Asynchronous Traces and Open Petri Nets. Programming Languages with Applications to Biology and Security - Essays Dedicated to Pierpaolo Degano on the Occasion of His 65th Birthday, Jun 2015, Pisa, Italy. pp.86-102, 2015, <10.1007/978-3-319-25527-9_8>. <hal-01285297>
  • Paolo Baldan, Filippo Bonchi, Kerstan Henning, Barbara König. Towards Trace Metrics via Functor Lifting. 6th Conference on Algebra and Coalgebra in Computer Science, CALCO 2015, Jun 2015, Nijmegen, Netherlands. <10.4230/LIPIcs.CALCO.2015.35>. <hal-01285298>
  • Filippo Bonchi, Fabio Zanasi, Pawel Sobocinski. Full Abstraction for Signal Flow Graphs. Proceedings of the 42nd Annual Symposium on Principles of Programming Languages, 2015, , Jan 2015, Mumbai, India. <10.1145/2676726.2676993>. <hal-01178437v2>
  • Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot. Lax Bialgebras and Up-To Techniques for Weak Bisimulations. 26th International Conference on Concurrency Theory (CONCUR), Sep 2015, Madrid, Spain. 2015, Leibniz International Proceedings in Informatics (LIPIcs). <10.4230/LIPIcs.CONCUR.2015.240>. <hal-01285299>
  • Luis Fernando Pino Duque, Filippo Bonchi, Frank D. Valencia. A Behavioral Congruence for Concurrent Constraint Programming with Non-deterministic Choice. Gabriel Ciobanu and Dominique Méry. ICTAC 2014 - 11th International Colloquium on Theoretical Aspects of Computing, Sep 2014, Bucarest, Romania. Springer, 8687, pp.351-368, Lecture Notes in Computer Science. <10.1007/978-3-319-10882-7_21>. <hal-01006382v2>
  • Filippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot. Coinduction up to in a fibrational setting. CSL-LICS, Jul 2014, Vienne, Austria. ACM, pp.1-12, 2014, <10.1145/2603088.2603149>. <hal-00936488v2>
  • Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi. Interacting Bialgebras are Frobenius. FoSSaCS 2014, Apr 2014, Grenoble, France. 8412, pp.351-365, 2014. <hal-00989174>
  • Filippo Bonchi, Stefan Milius, Alexandra Silva, Fabio Zanasi. How to Kill Epsilons with a Dagger - A Coalgebraic Take on Systems with Algebraic Label Structure. CMCS 2014, Apr 2014, Grenoble, France. pp.478-487, 2014. <hal-00989197>
  • Filippo Bonchi, Fabio Zanasi. Saturated Semantics for Coalgebraic Logic Programming. CALCO, Sep 2013, Warsaw, Poland. pp.80-94, 2013. <hal-00909353>
  • Luis Pino, Filippo Bonchi, Frank D. Valencia. Efficient computation of program equivalence for confluent concurrent constraint programming. Ricardo Peña and Tom Schrijvers. PPDP 2013 - 15th International Symposium on Principles and Practice of Declarative Programming, Sep 2013, Madrid, Spain. ACM, pp.263-274, 2013, <10.1145/2505879.2505902>. <hal-00909394>
  • Filippo Bonchi, Damien Pous. Checking NFA equivalence with bisimulations up to congruence. Principle of Programming Languages (POPL), Jan 2013, Roma, Italy. ACM, pp.457-468, 2013, <10.1145/2429069.2429124>. <hal-00639716v5>
  • Filippo Bonchi, Georgiana Caltais, Damien Pous, Alexandra Silva. Brzozowski's and Up-To Algorithms for Must Testing. 11th Asian Symposium on Programming Languages and Systems (APLAS), Dec 2013, Melbourne, Australia. Springer, 8301, pp.1-16, 2013, LNCS. <10.1007/978-3-319-03542-0_1>. <hal-00966072>
  • Filippo Bonchi, Marcello Bonsangue, Jan Rutten, Alexandra Silva. Final Semantics for Decorated Traces.. Twenty-eighth Conference on the Mathematical Foundations of Programming Semantics, Jun 2012, United Kingdom. 286, pp.73-86, 2012. <hal-00798060>
  • Jirí Adámek, Filippo Bonchi, Mathias Hulsbusch, Barbara König, Stefan Milius, et al.. A Coalgebraic Perspective on Minimization and Determinization.. Foundations of Software Science and Computational Structures - 15th International Conference, FOSSACS 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings, 2012, Estonia. Springer, 7213, pp.58-73, 2012. <hal-00798063>
  • Filippo Bonchi, Marcello Bonsangue, Jan Rutten, Alexandra Silva. Brzozowski's Algorithm (Co)Algebraically.. Logic and Program Semantics: 60 Birthday Dexter Kozen, 2012, United States. 7230, pp.12-23, 2012. <hal-00798062>
  • Filippo Bonchi, Fabio Gadducci, Valentina Monreale. Towards a General Theory of Barbs, Contexts and Labels.. Springer. Programming Languages and Systems - 9th Asian Symposium, APLAS 2011, 2012, Taiwan. 7078, pp.289-304, 2011, Lecture Notes in Computer Science. <hal-00798068>
  • Andrés Aristizábal, Filippo Bonchi, Luis Pino, Frank D. Valencia. Reducing Weak to Strong Bisimilarity in CCP. Marco Carbone, Ivan Lanese, Alexandra Silva, Ana Sokolova. Fifth Interaction and Concurrency Experience, Jun 2012, Stockholm, Sweden. Open Publishing Association, 104, pp.2-16, 2012, Electronic Proceedings in Theoretical Computer Science. <10.4204/EPTCS.104>. <hal-00761611>
  • Andrés Aristizábal, Filippo Bonchi, Luis Pino, Frank Valencia. Partition Refinement for Bisimilarity in CCP. 27th ACM Symposium On Applied Computing, Mar 2012, Trento, Italy. pp.88-93, 2012. <hal-00641408v3>
  • Andrés Aristizábal, Filippo Bonchi, Catuscia Palamidessi, Luis Pino, Frank Valencia. Deriving Labels and Bisimilarity for Concurrent Constraint Programming. Martin Hofmann. FOSSACS 2011 : 14th International Conference on Foundations of Software Science and Computational Structures, Mar 2011, Saarbrücken, Germany. Springer, 6604, pp.138-152, 2011, Lecture Notes in Computer Science. <10.1007/ISBN 978-3-642-19804-5>. <hal-00546722>
  • Filippo Bonchi, Paolo Baldan, Fabio Gadducci, Valentina Monreale. Concurrency Can't Be Observed, Asynchronously. Programming Languages and Systems - 8th Asian Symposium, APLAS 2010, Nov 2010, Shanghai, China. 6461, pp.424-438, 2010, Lecture Notes in Computer Science. <hal-00573020>

Direction d'ouvrage, Proceedings1 document

  • Filippo Bonchi, Bartek Klin, Sibylle B. Fröschle, Daniele Gorla. Mathematical Structures in Computer Science Preface to special issue: EXPRESS, ICE and SOS 2009.. Cambridge Journal, pp.123-124, 2012. <hal-00798061>

Rapport1 document

  • Filippo Bonchi, Fabio Gadducci, Valentina Monreale. RPO Semantics for Mobile Ambients. 2011. <hal-00573001>