Automated verification of concurrent linked lists with counters

DOI10.1007/3-540-45789-5_8MaRDI QIDQ4411951zbMATH OpenFDO

Authors Tuba Yavuz-Kahveci, Tevfik Bultan

Publication date 13 July 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2477/24770069.htm

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• An integrated specification and verification technique for highly concurrent data structures
• Fragment abstraction for concurrent shape analysis
• Safety and Liveness in Concurrent Pointer Programs
• Programs with Lists Are Counter Automata
• Automatically verifying concurrent queue algorithms

Cited in

(7)

• Generalised multi-pattern-based verification of programs with linear linked structures
• Highly dependable concurrent programming using design for verification
• Safety and Liveness in Concurrent Pointer Programs
• An integrated specification and verification technique for highly concurrent data structures
• Programs with lists are counter automata
• Monotonic Abstraction in Action
• Action language verifier: An infinite-state model checker for reactive software specifications

This page was built for publication: Automated verification of concurrent linked lists with counters

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