7
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Eternity variables to prove simulation of specifications

      Preprint

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Simulations of specifications are introduced as a unification and generalization of refinement mappings, history variables, forward simulations, prophecy variables, and backward simulations. A specification implements another specification if and only if there is a simulation from the first one to the second one that satisfies a certain condition. By adding stutterings, the formalism allows that the concrete behaviours take more (or possibly less) steps than the abstract ones. Eternity variables are introduced as a more powerful alternative for prophecy variables and backward simulations. This formalism is semantically complete: every simulation that preserves quiescence is a composition of a forward simulation, an extension with eternity variables, and a refinement mapping. This result does not need finite invisible nondeterminism and machine closure as in the Abadi-Lamport Theorem. Internal continuity is weakened to preservation of quiescence.

          Related collections

          Most cited references7

          • Record: found
          • Abstract: not found
          • Article: not found

          The temporal logic of actions

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            An axiomatic proof technique for parallel programs I

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Reduction: a method of proving properties of parallel programs

                Bookmark

                Author and article information

                Journal
                2002-07-29
                2003-08-27
                Article
                cs/0207095
                f669fd58-f3aa-4469-9ba2-905033e24db6
                History
                Custom metadata
                ACM Trans. on Computational Logic 6 (2005) 175-201.
                28 pages, to appear in ACM-TOCL
                cs.DC cs.LO

                Theoretical computer science,Networking & Internet architecture
                Theoretical computer science, Networking & Internet architecture

                Comments

                Comment on this article