Automatic temporal verification of buffer systems

DOI10.1007/3-540-55179-4_7MaRDI QIDQ6493518zbMATH OpenFDO

Authors A. Prasad Sistla, Lenore D. Zuck

Publication date 29 April 2024

Full work available at URL https://doi.org/10.1007/3-540-55179-4_7

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cites work

• scientific article; zbMATH DE number 4110131 (Why is no real title available?)
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Can message buffers be axiomatized in linear temporal logic?
• Proving Liveness Properties of Concurrent Programs
• Reasoning in a restricted temporal logic
• Specifying Concurrent Program Modules

This page was built for publication: Automatic temporal verification of buffer systems

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