Skip to main content
SpringerLink
Log in
SpringerLink
Log in

The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy

Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday

  • Book
  • © 2019

Overview

Editors:
  1. Mário S. Alvim

    1. Universidade Federal de Minas Gerais, Belo Horizonte, Brazil

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Kostas Chatzikokolakis

    1. University of Athens, Athens, Greece

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Carlos Olarte

    1. Federal University of Rio Grande do Norte - UFRN, Natal, Brazil

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Frank Valencia

    1. CNRS & University Javeriana Cali, Palaiseau, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 11760)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (25 chapters)

  1. Front Matter

    Pages i-xxxiv
    Download chapter PDF

  2. Concurrency

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Variations of the Itai-Rodeh Algorithm for Computing Anonymous Ring Size

      • Wan Fokkink, Guus Samsom
      Pages 3-13

    3. Axiomatizing Team Equivalence for Finite-State Machines

      • Roberto Gorrieri
      Pages 14-32

    4. Asynchronous \(\pi \)-calculus at Work: The Call-by-Need Strategy

      • Davide Sangiorgi
      Pages 33-49

    5. Deadlock Analysis of Wait-Notify Coordination

      • Cosimo Laneve, Luca Padovani
      Pages 50-67

    6. Enhancing Reaction Systems: A Process Algebraic Approach

      • Linda Brodo, Roberto Bruni, Moreno Falaschi
      Pages 68-85

    7. Checking the Expressivity of Firewall Languages

      • Lorenzo Ceragioli, Pierpaolo Degano, Letterio Galletta
      Pages 86-100

    8. Polymorphic Session Processes as Morphisms

      • Bernardo Toninho, Nobuko Yoshida
      Pages 101-117

    9. Guess Who’s Coming: Runtime Inclusion of Participants in Choreographies

      • Maurizio Gabbrielli, Saverio Giallorenzo, Ivan Lanese, Jacopo Mauro
      Pages 118-138

    10. A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice

      • Rob J. van Glabbeek, Jan Friso Groote, Erik P. de Vink
      Pages 139-162

    11. Walking Through the Semantics of Exclusive and Event-Based Gateways in BPMN Choreographies

      • Flavio Corradini, Andrea Morichetta, Barbara Re, Francesco Tiezzi
      Pages 163-181

    12. Stronger Validity Criteria for Encoding Synchrony

      • Rob van Glabbeek, Ursula Goltz, Christopher Lippert, Stephan Mennicke
      Pages 182-205

    13. Confluence of the Chinese Monoid

      • Jörg Endrullis, Jan Willem Klop
      Pages 206-220

  3. Logic and Constraint Programming

    1. Front Matter

      Pages 221-221
      Download chapter PDF

    2. A Coalgebraic Approach to Unification Semantics of Logic Programming

      • Roberto Bruni, Ugo Montanari, Giorgio Mossa
      Pages 223-240

    3. Polyadic Soft Constraints

      • Filippo Bonchi, Laura Bussi, Fabio Gadducci, Francesco Santini
      Pages 241-257

  4. Security and Privacy

    1. Front Matter

      Pages 259-259
      Download chapter PDF

    2. Core-concavity, Gain Functions and Axioms for Information Leakage

      • Arthur Américo, M. H. R. Khouzani, Pasquale Malacaria
      Pages 261-275

    3. Formalisation of Probabilistic Testing Semantics in Coq

      • Yuxin Deng, Jean-Francois Monin
      Pages 276-292
Back to top

Keywords

About this book

​​This Festschrift was published in honor of Catuscia Palamidessi on the occasion of her 60th birthday.

It features 6 laudations, which are available in the front matter of the volume, and 25 papers by close collaborators and friends. The papers are organized in topical sections named: concurrency; logic and constraint programming; security and privacy; and models and puzzles.

These contributions are a tribute to Catuscia Palamidessi’s intellectual depth, vision, passion for science, and tenacity in solving technical problems. They also reflect the breadth and impact of her work. Her scientific interests include, in chronological order, principles of programming languages, concurrency theory, security, and privacy.

Editors and Affiliations

  • Universidade Federal de Minas Gerais, Belo Horizonte, Brazil

    Mário S. Alvim

  • University of Athens, Athens, Greece

    Kostas Chatzikokolakis

  • Federal University of Rio Grande do Norte - UFRN, Natal, Brazil

    Carlos Olarte

  • CNRS & University Javeriana Cali, Palaiseau, France

    Frank Valencia

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation