skip to main content
research-article

Analyzing divergence in bisimulation semantics

Authors Info & Claims
Published:01 January 2017Publication History
Skip Abstract Section

Abstract

Some bisimulation based abstract equivalence relations may equate divergent systems with non-divergent ones, examples including weak bisimulation equivalence and branching bisimulation equivalence. Thus extra efforts are needed to analyze divergence for the compared systems. In this paper we propose a new method for analyzing divergence in bisimulation semantics, which relies only on simple observations of individual transitions. We show that this method can verify several typical divergence preserving bisimulation equivalences including two well-known ones. As an application case study, we use the proposed method to verify the HSY collision stack to draw the conclusion that the stack implementation is correct in terms of linearizability with lock-free progress condition.

References

  1. M. Hennessy and G. Plotkin. A term model for CCS, Lecture notes in computer science, Vol.88, Springer-Verlag, 1980. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. David Park: Concurrency and automata on infinite sequences. Lecture Notes in Computer Science 104,1981. Proceedings of 5th GI Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. van Benthem. Modal Logic and Classic Logic. Bibliopolis, 1983.Google ScholarGoogle Scholar
  4. R. Milner: A complete axiomatisation for observational congruence of finite-state behaviours. Inf. Comput. 81(1989)227-247. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D.J. Walker. Bisimulation and divergence, Information and Computation, vol. 85, pp. 212-241, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Rob J. van Glabbeek: The Linear Time - Branching Time Spectrum II. CONCUR 1993: 66-81. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Rob J. van Glabbeek, Peter Weijland: Branching time and abstraction in bisimulation semantics. J. ACM 43(3):555-600.1996 Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. D. Hendler, N. Shavit, and L. Yerushalmi: A scalable lock-free stack algorithm. In SPAA 2004: Proceedings of the sixteenth annual ACM symposium on Parallel Algorithms, June 27-30, 2004, Barcelona, Spain, pages 206-215, 2004 Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. R. Colvin, L. Groves. A Scalable lock-free stack algorithm and its verification. fifth IEEE International conference on software engineering and formal methods. 2007 Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Rob J. van Glabbeek, Bas Luttik, Nikola Trcka: Branching Bisimilarity with Explicit Divergence. Fundam. Inform. 93(4): 371-392. 2009 Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Rob J. van Glabbeek, Bas Luttik, Nikola Trcka: Computation tree logic with deadlock detection. Logical Methods in Computer Science. Vol.5(4:5) 2009, pages 1-24.Google ScholarGoogle Scholar
  12. K. S. Namjoshi. A simple characterization of stuttering bisimulation. In 17th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 1346 of Lecture Notes in Computer Science, pages 284-296. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. M. Herlihy, J. Wing, H. Hermanns: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463-492(1990) Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. M. Lohrey, P. R. D’Argenio, H. Hermanns: Axiomatising divergence. Inf. Comput. 203(2005)115-144. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. I. Filipovic, P. O’Hearn, N.Rinetzky, H. Yang: Abstraction for concurrent objects. Theor. Comput. Sci. (2010). Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Hongjin Liang, Jan Hoffmann, Xinyu Feng, Zhong Shao: Characterizing Progress Properties of Concurrent Objects via Contextual Refinements. CONCUR 2013: 227-241. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Hongjin Liang, Xinyu Feng, Zhong Shao: Compositional verification of termination-preserving refinement of concurrent programs. CSLLICS 2014: 65:1-10. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Alexey Gotsman, Hongseok Yang: Liveness-Preserving Atomicity Abstraction. ICALP (2) 2011: 453-465. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. X. Yang, J. Katoen, H. Lin, H. Wu: Proving linearizability via branching bisimulation. CoRR abs/1609.07546(2016)Google ScholarGoogle Scholar

Index Terms

  1. Analyzing divergence in bisimulation semantics

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              Full Access

              • Published in

                cover image ACM SIGPLAN Notices
                ACM SIGPLAN Notices  Volume 52, Issue 1
                POPL '17
                January 2017
                901 pages
                ISSN:0362-1340
                EISSN:1558-1160
                DOI:10.1145/3093333
                Issue’s Table of Contents
                • cover image ACM Conferences
                  POPL '17: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages
                  January 2017
                  901 pages
                  ISBN:9781450346603
                  DOI:10.1145/3009837

                Copyright © 2017 ACM

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 January 2017

                Check for updates

                Qualifiers

                • research-article

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader
              About Cookies On This Site

              We use cookies to ensure that we give you the best experience on our website.

              Learn more

              Got it!