Verifying Parameterized taDOM+ Lock Managers

DOI10.1007/978-3-540-77566-9_40zbMath1132.68482OpenAlexW1582600793MaRDI QIDQ5448673

Antti Siirtola, Michal Valenta

Publication date: 7 March 2008

Published in: SOFSEM 2008: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77566-9_40

zbMATH Keywords

model checkingcase studyVerificationXML databasesparameterized systems

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approach to automating the verification of compact parallel coordination programs. I
• Defining liveness
• A structural induction theorem for processes
• Reasoning about systems with many processes
• Computer Science Logic
• Appendix
• Correct Hardware Design and Verification Methods
• Automatic verification of parameterized networks of processes

This page was built for publication: Verifying Parameterized taDOM+ Lock Managers