39
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Computable fixpoints in well-structured symbolic model checking

      ,
      Formal Methods in System Design
      Springer Nature

      Read this article at

      ScienceOpenPublisher
      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.

          Related collections

          Most cited references69

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

          Well-structured transition systems everywhere!

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

            Verifying Programs with Unreliable Channels

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

              The theory of well-quasi-ordering: A frequently discovered concept

                Bookmark

                Author and article information

                Journal
                Formal Methods in System Design
                Form Methods Syst Des
                Springer Nature
                0925-9856
                1572-8102
                October 2013
                August 4 2012
                October 2013
                : 43
                : 2
                : 233-267
                Article
                10.1007/s10703-012-0168-y
                7bad9780-d6a3-440b-b751-88704aaffdde
                © 2013
                History

                Comments

                Comment on this article