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 /

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; lo...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Alvim, Mário S. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Chatzikokolakis, Kostas (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Olarte, Carlos (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Valencia, Frank (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2019.
Έκδοση:1st ed. 2019.
Σειρά:Theoretical Computer Science and General Issues ; 11760
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
Πίνακας περιεχομένων:
  • Concurrency
  • Variations of the Itai-Rodeh Algorithm for Computing Anonymous Ring Size
  • Axiomatizing Team Equivalence for Finite-State Machines
  • Asynchronous pi-calculus at work: the call-by-need strategy
  • Deadlock Analysis of Wait-Notify Coordination
  • Enhancing reaction systems: a process algebraic approach
  • Checking the Expressivity of Firewall Languages
  • Polymorphic Session Processes as Morphisms
  • Guess Who's Coming: Runtime Inclusion of Participants in Choreographies
  • A Complete Axiomatizion of Branching Bisimulation for a Simple Process Language with Probabilistic Choice
  • Walking Through the Semantics of Exclusive and Event-Based Gateways in BPMN Choreographies
  • Stronger Validity Criteria for Encoding Synchrony
  • Confluence of the Chinese Monoid
  • Logic and Constraint Programming
  • A coalgebraic approach to unification semantics of logic programming
  • Polyadic Soft Constraints
  • Security and Privacy
  • Core-concavity, Gain Functions and Axioms for Information Leakage
  • Formalisation of Probabilistic Testing Semantics in Coq
  • Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics
  • Fooling the Parallel Or Tester with Probability 8/27
  • Categorical information flow
  • Statistical Epistemic Logic
  • Approximate model counting, sparse XOR constraints and minimum distance
  • Verification and Control of Turn-Based Probabilistic Real-Time Games
  • Refinement Metrics for Quantitative Information Flow
  • Models and Puzzles
  • Toward a Formal Model for Group Polarization in Social Networks
  • Make Puzzles Great Again.