Transformational Verification of Parameterized Protocols Using Array Formulas

DOI10.1007/11680093_3MaRDI QIDQ5302878zbMATH OpenOpenAlexFDO

Authors Alberto Pettorossi, Maurizio Proietti, Valerio Senni

Publication date 15 January 2009

Published in Logic Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11680093_3

Mathematics Subject Classification ID

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

• Program Development in Computational Logic
• scientific article; zbMATH DE number 1796121
• scientific article; zbMATH DE number 2222694
• scientific article; zbMATH DE number 1538039
• Verification of parameterized protocols

Cited in

(10)

• scientific article; zbMATH DE number 1796121 (Why is no real title available?)
• Verifying Array Programs by Transforming Verification Conditions
• scientific article; zbMATH DE number 1538039 (Why is no real title available?)
• Verifying Parameterized taDOM+ Lock Managers
• Ping-pong protocols as prefix grammars: modelling and verification via program transformation
• Parameterized verification of leader/follower systems via first-order temporal logic
• Simplifying the Verification of Quantified Array Assertions via Code Transformation
• Program Development in Computational Logic
• scientific article; zbMATH DE number 2222694 (Why is no real title available?)
• scientific article; zbMATH DE number 6687732 (Why is no real title available?)

This page was built for publication: Transformational Verification of Parameterized Protocols Using Array Formulas

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