Unfold/fold transformations for automated verification of parameterized concurrent systems

DOI10.1007/978-3-540-25951-0_9MaRDI QIDQ5712550zbMATH OpenOpenAlexFDO

Authors Abhik Roychoudhury, C. R. Ramakrishnan

Publication date 23 December 2005

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

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

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

• Verification of parameterized systems using logic program transformations
• Automated inductive verification of parameterized protocols
• Transformational Verification of Parameterized Protocols Using Array Formulas
• Verification of sets of infinite state processes using program transformation
• Verification of concurrent programs using Petri net unfoldings

Cited in

(8)

• Asynchronous unfold/fold transformation for fixpoint logic
• Temporal Verification of Fault-Tolerant Protocols
• Automated inductive verification of parameterized protocols
• Verification of sets of infinite state processes using program transformation
• Fold/unfold transformations for fixpoint logic
• Transformational Verification of Parameterized Protocols Using Array Formulas
• Correct Hardware Design and Verification Methods
• Automatic proofs of protocols via program transformation

Describes a project that uses

Uses Software

• ECCE

This page was built for publication: Unfold/fold transformations for automated verification of parameterized concurrent systems

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