Compositional verification of synchronous networks

DOI10.1007/3-540-45352-0_18MaRDI QIDQ2766652zbMATH OpenFDO

Authors Leszek Holenderski

Publication date 17 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45352-0_18

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 3903940
• The semantic foundations of a compositional proof method for synchronously communicating processes
• scientific article; zbMATH DE number 222692
• Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings
• scientific article; zbMATH DE number 3991420

Cited in

(2)

• Synchronization synthesis for network programs
• Induction-oriented formal verification in symmetric interconnection networks

This page was built for publication: Compositional verification of synchronous networks

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