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...
Saved in:
| Published in: | Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science pp. 116 - 125 |
|---|---|
| Main Authors: | , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
New York, NY, USA
ACM
05.07.2016
|
| Series: | ACM Conferences |
| Subjects: |
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
|
| ISBN: | 9781450343916, 1450343910 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | 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 behaviours to be admitted, which in turn allows the algorithms implementing quiescent consistent objects to be more efficient (when executed in a multithreaded environment).
Quiescent consistency of an implementation object is defined in terms of a corresponding abstract specification. This gives rise to two important verification questions: membership (checking whether a behaviour of the implementation is allowed by the specification) and correctness (checking whether all behaviours of the implementation are allowed by the specification). In this paper, we consider the membership and correctness conditions for quiescent consistency, as well as a restricted form that assumes an upper limit on the number of events between two quiescent states. We show that the membership problem for unrestricted quiescent consistency is NP-complete and that the correctness problem is decidable, coNEXPTIME-hard, and in EXPSPACE. For the restricted form, we show that membership is in PTIME, while correctness is PSPACE-complete. |
|---|---|
| AbstractList | 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 behaviours to be admitted, which in turn allows the algorithms implementing quiescent consistent objects to be more efficient (when executed in a multithreaded environment).
Quiescent consistency of an implementation object is defined in terms of a corresponding abstract specification. This gives rise to two important verification questions: membership (checking whether a behaviour of the implementation is allowed by the specification) and correctness (checking whether all behaviours of the implementation are allowed by the specification). In this paper, we consider the membership and correctness conditions for quiescent consistency, as well as a restricted form that assumes an upper limit on the number of events between two quiescent states. We show that the membership problem for unrestricted quiescent consistency is NP-complete and that the correctness problem is decidable, coNEXPTIME-hard, and in EXPSPACE. For the restricted form, we show that membership is in PTIME, while correctness is PSPACE-complete. |
| Author | Hierons, Robert M. Dongol, Brijesh |
| Author_xml | – sequence: 1 givenname: Brijesh surname: Dongol fullname: Dongol, Brijesh email: brijesh.dongol@brunel.ac.uk organization: Department of Computer Science, Brunel University London, UK – sequence: 2 givenname: Robert M. surname: Hierons fullname: Hierons, Robert M. email: robert.hierons@brunel.ac.uk organization: Department of Computer Science, Brunel University London, UK |
| BookMark | eNqNj09LxDAUxAMqqGvPXnv00pq8NE1zlPoXFkTYPYc0eYVoN5FNBffbm2X7ATz93jDDY-aanIcYkJBbRmvGGnEPinMhRX1ie0YKJbtsUN5wxdpLUqT0SSkFJjtF2RURj2i9M4Of_HwoTXBlH3ffE_4e5Rj35cePx2QxzNkIyacZgz3ckIvRTAmLhSuyfX7a9K_V-v3lrX9YVwZAztXQyM5Kl5sZZgC5GS0azpi0HR2Fyqca0AI40SkA5bgARINCIggqWslX5O7019idHmL8SppRfVyql6UL2xyt_xnVw97jyP8A2gJVoA |
| ContentType | Conference Proceeding |
| Copyright | 2016 ACM |
| Copyright_xml | – notice: 2016 ACM |
| DOI | 10.1145/2933575.2933576 |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EndPage | 125 |
| GroupedDBID | 6IE 6IF 6IG 6IL 6IN AAJGR ACM ADPZR ALMA_UNASSIGNED_HOLDINGS APO BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK GUFHI IEGSK IJVOP OCL RIB RIC RIE RIL RIO |
| ID | FETCH-LOGICAL-a227t-b478c7d114a1a2e3afcea3117c80f59a319bec22d589229d352eeae57e2505673 |
| ISBN | 9781450343916 1450343910 |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000387609200012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Jan 31 06:44:04 EST 2024 Wed Jan 31 06:49:57 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Keywords | Quiescent consistency decidability concurrent objects Mazurkiewicz Trace Theory |
| Language | English |
| License | Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org |
| LinkModel | OpenURL |
| MeetingName | LICS '16: 31st Annual ACM/IEEE Symposium on Logic in Computer Science |
| MergedId | FETCHMERGED-LOGICAL-a227t-b478c7d114a1a2e3afcea3117c80f59a319bec22d589229d352eeae57e2505673 |
| PageCount | 10 |
| ParticipantIDs | acm_books_10_1145_2933575_2933576 acm_books_10_1145_2933575_2933576_brief |
| PublicationCentury | 2000 |
| PublicationDate | 20160705 |
| PublicationDateYYYYMMDD | 2016-07-05 |
| PublicationDate_xml | – month: 07 year: 2016 text: 20160705 day: 05 |
| PublicationDecade | 2010 |
| PublicationPlace | New York, NY, USA |
| PublicationPlace_xml | – name: New York, NY, USA |
| PublicationSeriesTitle | ACM Conferences |
| PublicationTitle | Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science |
| PublicationYear | 2016 |
| Publisher | ACM |
| Publisher_xml | – name: ACM |
| SSID | ssj0002178901 |
| Score | 1.9843557 |
| Snippet | 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... |
| SourceID | acm |
| SourceType | Publisher |
| StartPage | 116 |
| SubjectTerms | 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 |
| Title | Decidability and Complexity for Quiescent Consistency |
| WOSCitedRecordID | wos000387609200012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3PT9swFLYG2oETbGOCwVCQJu1QBepftXPcWiYOa1UESNwq13lBRWo6NS2C_57n2E3TMgk40EPiWNFL0u_F_uz4fY-QHwoEFWAhziyDWGjBYpPiYdpy2uUybYqs1Jn9q3o9fXOT9EO--6JMJ6DyXD88JP_eFWqsQ7Bd6Owb4K6MYgWWEXTcIuy4XWPE_-18-lVlsfj-z2kxawQh_V_tLpp2Q7zG5ePYLdmaj90HA5dz2foQQJ_mYfHW132qA3aUemFvL9vkTnaKmmHZ58V85NWhfB7QwvHxasq-M8lvfTqv39PRHRTVPPQ59swTT-f9Ou9G98Q3dk6EuUBv6dYCE1fmKWirXNMqa57VXRm6UiGbvAz7rTWfNBz5npj6kOjnjbxwehjIUzhyzRO_b22QDaWaPoCvmmTD8ZZGwlMG9IXLVTpfi8sHvSesOF0z6QiLHdfoxtUO2V0-b7QE9BP5APlnsr2AKAoQfSGyjkyEyERLZCJEJqqQiWrI7JLrP2dX7fM4JMSIDWNqFg-F0laleK-GGgbcZBYMp1RZ3cxkgsUEX0nGUqkTxpIUyTWAAamgJLqKfyWb-SSHPRKhCWOlViZhWBziT4DKuAbGeWZTuk-O8dkHzq-LgQ9el4Pw_4R9a5_8fPGcwRA9Jfv2CmsHZGvpNodkczadw3fy0d7PRsX0qMT1CaQtUF8 |
| linkProvider | IEEE |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+31st+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science&rft.atitle=Decidability+and+Complexity+for+Quiescent+Consistency&rft.au=Dongol%2C+Brijesh&rft.au=Hierons%2C+Robert+M.&rft.series=ACM+Conferences&rft.date=2016-07-05&rft.pub=ACM&rft.isbn=9781450343916&rft.spage=116&rft.epage=125&rft_id=info:doi/10.1145%2F2933575.2933576 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450343916/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450343916/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450343916/sc.gif&client=summon&freeimage=true |