Verifying Parameterized taDOM+ Lock Managers

DOI10.1007/978-3-540-77566-9_40zbMATH Open1132.68482OpenAlexW1582600793MaRDI QIDQ5448673FDOQ5448673

Authors: 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

Recommendations

• Monotonic Abstraction in Action
• scientific article; zbMATH DE number 1796121
• Handling Parameterized Systems with Non-atomic Global Conditions
• Transformational Verification of Parameterized Protocols Using Array Formulas
• Model checking transactional memories

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

• Introduction to algorithms
• Title not available (Why is that?)
• Reasoning about systems with many processes
• Defining liveness
• Automatic verification of parameterized networks of processes
• A structural induction theorem for processes
• Computer Science Logic
• Exact and efficient verification of parameterized cache coherence protocols
• An approach to automating the verification of compact parallel coordination programs. I
• Title not available (Why is that?)
• Title not available (Why is that?)
• Appendix

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

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