Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols

DOI10.1007/11901914_31MaRDI QIDQ3522925zbMATH OpenOpenAlexFDO

Authors Giorgio Delzanno, Javier Esparza, Jiří Srba

Publication date 4 September 2008

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11901914_31

Mathematics Subject Classification ID

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

Recommendations

• Decidability issues for extended ping-pong protocols
• Ping-pong protocols as prefix grammars: modelling and verification via program transformation
• SOFSEM 2005: Theory and Practice of Computer Science
• scientific article; zbMATH DE number 1754629
• On the security of ping-pong protocols

Cited in

(3)

• SOFSEM 2005: Theory and Practice of Computer Science
• Ping-pong protocols as prefix grammars: modelling and verification via program transformation
• Decidability issues for extended ping-pong protocols

This page was built for publication: Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols

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