default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID60th Birthday: Catuscia Palamidessi 2019
- Mário S. Alvim, Kostas Chatzikokolakis, Carlos Olarte
, Frank Valencia:
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. Lecture Notes in Computer Science 11760, Springer 2019, ISBN 978-3-030-31174-2
Concurrency
- Wan J. Fokkink, Guus Samsom:
Variations of the Itai-Rodeh Algorithm for Computing Anonymous Ring Size. 3-13 - Roberto Gorrieri:
Axiomatizing Team Equivalence for Finite-State Machines. 14-32 - Davide Sangiorgi:
Asynchronous \pi -calculus at Work: The Call-by-Need Strategy. 33-49 - Cosimo Laneve, Luca Padovani:
Deadlock Analysis of Wait-Notify Coordination. 50-67 - Linda Brodo, Roberto Bruni, Moreno Falaschi:
Enhancing Reaction Systems: A Process Algebraic Approach. 68-85 - Lorenzo Ceragioli, Pierpaolo Degano, Letterio Galletta:
Checking the Expressivity of Firewall Languages. 86-100 - Bernardo Toninho, Nobuko Yoshida:
Polymorphic Session Processes as Morphisms. 101-117 - Maurizio Gabbrielli, Saverio Giallorenzo, Ivan Lanese, Jacopo Mauro:
Guess Who's Coming: Runtime Inclusion of Participants in Choreographies. 118-138 - Rob J. van Glabbeek, Jan Friso Groote, Erik P. de Vink:
A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice - (Extended Abstract). 139-162 - Flavio Corradini, Andrea Morichetta, Barbara Re, Francesco Tiezzi:
Walking Through the Semantics of Exclusive and Event-Based Gateways in BPMN Choreographies. 163-181 - Rob van Glabbeek, Ursula Goltz, Christopher Lippert, Stephan Mennicke:
Stronger Validity Criteria for Encoding Synchrony. 182-205 - Jörg Endrullis, Jan Willem Klop:
Confluence of the Chinese Monoid. 206-220
Logic and Constraint Programming
- Roberto Bruni, Ugo Montanari, Giorgio Mossa:
A Coalgebraic Approach to Unification Semantics of Logic Programming. 223-240 - Filippo Bonchi, Laura Bussi, Fabio Gadducci, Francesco Santini:
Polyadic Soft Constraints. 241-257
Security and Privacy
- Arthur Américo, M. H. R. Khouzani, Pasquale Malacaria:
Core-concavity, Gain Functions and Axioms for Information Leakage. 261-275 - Yuxin Deng, Jean-François Monin:
Formalisation of Probabilistic Testing Semantics in Coq. 276-292 - Valentina Castiglioni, Ruggero Lanotte, Simone Tini:
Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics. 293-312 - Jean Goubault-Larrecq:
Fooling the Parallel or Tester with Probability 8/27. 313-328 - Tahiry M. Rabehaja, Annabelle McIver, Carroll Morgan, Georg Struth:
Categorical Information Flow. 329-343 - Yusuke Kawamoto:
Statistical Epistemic Logic. 344-362 - Michele Boreale, Daniele Gorla:
Approximate Model Counting, Sparse XOR Constraints and Minimum Distance. 363-378 - Marta Kwiatkowska, Gethin Norman, David Parker:
Verification and Control of Turn-Based Probabilistic Real-Time Games. 379-396 - Konstantinos Chatzikokolakis, Geoffrey Smith:
Refinement Metrics for Quantitative Information Flow. 397-416
Models and Puzzles
- Mário S. Alvim, Sophia Knight, Frank Valencia:
Toward a Formal Model for Group Polarization in Social Networks. 419-441 - Nicolás Aristizabal, Carlos Pinzón, Camilo Rueda, Frank Valencia:
Make Puzzles Great Again. 442-459
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-20 22:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
