Honesty by Typing
From MaRDI portal
Publication:2974791
DOI10.2168/LMCS-12(4:7)2016zbMath1448.68327arXiv1211.2609MaRDI QIDQ2974791
Alceste Scalas, Massimo Bartoletti, Roberto Zunino, Emilio Tuosto
Publication date: 11 April 2017
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.2609
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (4)
Declarative choreographies and liveness ⋮ Honesty by Typing ⋮ On the Undecidability of Asynchronous Session Subtyping ⋮ A fixed-points based framework for compliance of behavioural contracts
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Verifiable abstractions for contract-oriented systems
- Fundamentals of session types
- Verifying identical communicating processes is undecidable
- Timed runtime monitoring for multiparty conversations
- Verification of programs with half-duplex communication
- From Communicating Machines to Graphical Choreographies
- Compliance and Subtyping in Timed Session Types
- On the Realizability of Contracts in Dishonest Systems
- Synthesising Choreographies from Local Session Types
- Honesty by Typing
- Multiparty asynchronous session types
- Using Higher-Order Contracts to Model Session Types (Extended Abstract)
- A Semantic Deconstruction of Session Types
- Compliance in Behavioural Contracts: A Brief Survey
- Global Progress in Dynamically Interleaved Multiparty Sessions
- On Communicating Finite-State Machines
- An Algorithm for the General Petri Net Reachability Problem
- A finite equational base for CCS with left merge and communication merge
- Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types
- Sub-behaviour relations for session-based client/server systems
- Global progress for dynamically interleaved multiparty sessions
- A New Type System for Deadlock-Free Processes
This page was built for publication: Honesty by Typing