Method and Case Study of Model Checking Concurrent Systems That Use Unbounded Timestamps
Parallel and distributed algorithms, including those for fault tolerance, often use timestamps to coordinate the behaviors of processes. These algorithms are hard to correctly design and often subject to subtle design faults. Model checking, which is a state exploration-based verification method, ha...
Uložené v:
| Vydané v: | Proceedings (IEEE Pacific Rim International Symposium on Dependable Computing) s. 261 - 266 |
|---|---|
| Hlavní autori: | , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
01.01.2017
|
| Predmet: | |
| ISSN: | 2473-3105 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Parallel and distributed algorithms, including those for fault tolerance, often use timestamps to coordinate the behaviors of processes. These algorithms are hard to correctly design and often subject to subtle design faults. Model checking, which is a state exploration-based verification method, has been very successful in finding design faults in many practical systems. However model checking of timestamp-based algorithms is difficult when the values of timestamps are not bounded, because then the state space is infinite. This paper addresses the problem of infinite state space by proposing a data abstraction technique for timestamps. This technique transforms the infinite-state algorithm to a finite-state abstract model which simulates the original algorithm. The applicability of this approach is demonstrated through a case study where Lamport's bakery algorithm is verified in the absence and presence of process failures. |
|---|---|
| AbstractList | Parallel and distributed algorithms, including those for fault tolerance, often use timestamps to coordinate the behaviors of processes. These algorithms are hard to correctly design and often subject to subtle design faults. Model checking, which is a state exploration-based verification method, has been very successful in finding design faults in many practical systems. However model checking of timestamp-based algorithms is difficult when the values of timestamps are not bounded, because then the state space is infinite. This paper addresses the problem of infinite state space by proposing a data abstraction technique for timestamps. This technique transforms the infinite-state algorithm to a finite-state abstract model which simulates the original algorithm. The applicability of this approach is demonstrated through a case study where Lamport's bakery algorithm is verified in the absence and presence of process failures. |
| Author | Tsuchiya, Tatsuhiro Nakano, Shinya |
| Author_xml | – sequence: 1 givenname: Shinya surname: Nakano fullname: Nakano, Shinya email: s-nakano@ist.osaka-u.ac.jp organization: Grad. Sch. of Inf. Sci. & Technol., Osaka Univ., Suita, Japan – sequence: 2 givenname: Tatsuhiro surname: Tsuchiya fullname: Tsuchiya, Tatsuhiro email: t-tutiya@osaka-u.ac.jp organization: Grad. Sch. of Inf. Sci. & Technol., Osaka Univ., Suita, Japan |
| BookMark | eNotzLtOwzAUgGGDQKItbGwsfoGUc3xLM6JwlVqBaCuxVY59TAONU8Xu0LcHCaZ_-v4xO4t9JMauEaaIUN2-vd_XUwFYTjWcsDFqqEAbLfCUjYQqZSER9AUbp_QFoCXOYMQ-FpS3vec2el7bRHyZD_7I-8AXvacdr7fkvtv4yes-usMwUMx8eUyZusRXW5v5-tesY9MfoifPV21HKdtuny7ZebC7RFf_nbD148Oqfi7mr08v9d28aLHUuRBoSBhtnXJaWq08YBXELDgTAgCBapQj5dCgL5UphfSzBgV40wTpKqvkhN38fVsi2uyHtrPDcVNWAowE-QPPglGX |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/PRDC.2017.50 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 1509056521 9781509056521 |
| EISSN | 2473-3105 |
| EndPage | 266 |
| ExternalDocumentID | 7920630 |
| Genre | orig-research |
| GroupedDBID | 29O 6IE 6IF 6IK 6IL 6IN AAJGR AAWTH ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK OCL RIE RIL |
| ID | FETCH-LOGICAL-i175t-216e265ac4c53a54d019f28fc6ff00e04b4ce4c161d746723d8b120d6bf3c9a43 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000403396000040&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:14:58 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i175t-216e265ac4c53a54d019f28fc6ff00e04b4ce4c161d746723d8b120d6bf3c9a43 |
| PageCount | 6 |
| ParticipantIDs | ieee_primary_7920630 |
| PublicationCentury | 2000 |
| PublicationDate | 2017-Jan. |
| PublicationDateYYYYMMDD | 2017-01-01 |
| PublicationDate_xml | – month: 01 year: 2017 text: 2017-Jan. |
| PublicationDecade | 2010 |
| PublicationTitle | Proceedings (IEEE Pacific Rim International Symposium on Dependable Computing) |
| PublicationTitleAbbrev | PRDC |
| PublicationYear | 2017 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0053180 |
| Score | 1.9867599 |
| Snippet | Parallel and distributed algorithms, including those for fault tolerance, often use timestamps to coordinate the behaviors of processes. These algorithms are... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 261 |
| SubjectTerms | Algorithm design and analysis bakery algorithm data abstraction Distributed algorithms Electronic mail Fault tolerance Fault tolerant systems Information science Model checking SPIN timestamp |
| Title | Method and Case Study of Model Checking Concurrent Systems That Use Unbounded Timestamps |
| URI | https://ieeexplore.ieee.org/document/7920630 |
| WOSCitedRecordID | wos000403396000040&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/eLvHCXMwlV07b8IwED4B6tCJtlD1LQ8dGzCJE8dzWtSlCFUgsSE_BVIbEASk_vuek0A7dOlmWX5IPvvudL7vPoBHj8XEh-ACk6o4YFxJ1IPSBqGIqYkT1JtWlmQTfDRKZzMxbsDTEQtjrS2Tz2zPN8u_fLPSOx8q63MR-hJRTWhyzius1kHr4lVK6TGxXfTH78-ZT9ziPY-o_0WcUtqNYft_O55B9weAR8ZH03IODZtfQPvAwEDqB9mB2VtJAE1kbkiG9oj4tMAvsnLEc5x9kGxhtY-FE1xXV5WYSF2jnEwWsiBTnDPNledWsoaUeJBCfq63XZgOXybZa1BzJQRLdACKIBwkNkxiqZmOIxkzg66bC1OnE-cotZQppi3T6N8ZTzASRiibQUhNolykhWTRJbTyVW6vgKDLJ3CSRi3OGI6TaSIUF1JHVCqq6TV0_EHN11U5jHl9Rjd_d9_CqRdDFbW4g1ax2dl7ONH7YrndPJQy_AY9CZ5_ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEJ4gmugJFYxve_DoQul2Hz2vEoxAiIGEG-m23UCCC4HFxH_vdHdBD168NU0fSaedmUznmw_g0WIx8SEkjg5jz-FBLFEPSuMw4VHt-ag3jczJJoLBIJxMxLACT3ssjDEmTz4zTdvM__L1Um1tqKwVCGZLRB3Aocc5axdorZ3excsU0n1qu2gN358jm7oVNC2m_hd1Sm45OrX_7XkKjR8IHhnujcsZVEx6DrUdBwMpn2QdJv2cAprIVJMILRKxiYFfZJkQy3K2INHMKBsNJ7iuKmoxkbJKORnNZEbGOGecxpZdyWiSI0Iy-bHaNGDceRlFXadkS3Dm6AJkDmv7hvmeVFx5rvS4RuctYWGi_CSh1FAec2W4Qg9PW4oR5qJ02oxqP05cJSR3L6CaLlNzCQSdPoGTFOpxznGcDH0RB0Iql8qYKnoFdXtQ01VREGNantH1390PcNwd9XvT3uvg7QZOrEiKGMYtVLP11tzBkfrM5pv1fS7Pb6k7ocY |
| 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%3Ajournal&rft.genre=proceeding&rft.title=Proceedings+%28IEEE+Pacific+Rim+International+Symposium+on+Dependable+Computing%29&rft.atitle=Method+and+Case+Study+of+Model+Checking+Concurrent+Systems+That+Use+Unbounded+Timestamps&rft.au=Nakano%2C+Shinya&rft.au=Tsuchiya%2C+Tatsuhiro&rft.date=2017-01-01&rft.pub=IEEE&rft.eissn=2473-3105&rft.spage=261&rft.epage=266&rft_id=info:doi/10.1109%2FPRDC.2017.50&rft.externalDocID=7920630 |