Decidability and Complexity for Quiescent Consistency

Quiescent consistency is a notion of correctness for a concurrent object that gives meaning to the object's behaviours in quiescent states, i.e., states in which none of the object's operations are being executed. The condition enables greater flexibility in object design by allowing more...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science pp. 116 - 125
Main Authors:	Dongol, Brijesh, Hierons, Robert M.
Format:	Conference Proceeding
Language:	English
Published:	New York, NY, USA ACM 05.07.2016
Series:	ACM Conferences
Subjects:	General and reference > Cross-computing tools and techniques > Verification Information systems > Data management systems > Database management system engines Software and its engineering > Software creation and management > Software development process management Software and its engineering > Software creation and management > Software verification and validation > Formal software verification Software and its engineering > Software notations and tools > Formal language definitions > Semantics Software and its engineering > Software organization and properties > Software functional properties > Formal methods > Software verification Theory of computation > Logic > Programming logic Theory of computation > Models of computation > Concurrency Theory of computation > Models of computation > Concurrency > Parallel computing models Theory of computation > Semantics and reasoning Theory of computation > Semantics and reasoning > Program reasoning Theory of computation > Semantics and reasoning > Program reasoning > Program verification Theory of computation > Semantics and reasoning > Program semantics Quiescent consistency decidability concurrent objects Mazurkiewicz Trace Theory
ISBN:	9781450343916, 1450343910
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!