Data communicating processes with unreliable channels

DOI10.1145/2933575.2934535zbMATH Open1401.68179OpenAlexW2530081660MaRDI QIDQ4635872FDOQ4635872

Authors: C. Aiswarya, Mohamed Faouzi Atig, Parosh A. Abdulla 

Publication date: 23 April 2018

Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2933575.2934535

Recommendations

• Undecidable verification problems for programs with unreliable channels
• Undecidable verification problems for programs with unreliable channels
• Timed lossy channel systems
• Verifying programs with unreliable channels
• scientific article; zbMATH DE number 1929967

zbMATH Keywords

reachability problemlossy channel systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (7)

• Analysis of message passing programs using SMT-solvers
• On reachability for unidirectional channel systems extended with regular tests
• Timed lossy channel systems
• Tolerating corrupted communication
• Comparing channel restrictions of communicating state machines, high-level message sequence charts, and multiparty session types
• Complete multiparty session type projection with automata
• Mixing Lossy and Perfect Fifo Channels

This page was built for publication: Data communicating processes with unreliable channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635872)