Automatic verification of pointer data-structure systems for all numbers of processes

DOI10.1007/3-540-48119-2_20MaRDI QIDQ4493884zbMATH OpenFDO

Authors Farn Wang

Publication date 19 February 2001

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

Full work available at URL https://doi.org/10.1007/3-540-48119-2_20

zbMATH Keywords

collective image setdynamic network configurations

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Safety and Liveness in Concurrent Pointer Programs
• scientific article; zbMATH DE number 1973975
• An integrated specification and verification technique for highly concurrent data structures
• Automatic verification for a class of distributed systems
• Verifying concurrent data structures by simulation

Cited in

(4)

• Safety and Liveness in Concurrent Pointer Programs
• scientific article; zbMATH DE number 1973975 (Why is no real title available?)
• Correctness of Pointer Manipulating Algorithms Illustrated by a Verified BDD Construction
• Programming Languages and Systems

This page was built for publication: Automatic verification of pointer data-structure systems for all numbers of processes

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