Bisimulation

Results: 117



#Item
31Semantics for core Concurrent ML using computation types Alan Jeffrey Abstract This paper presents two typed higher-order concurrent functional programming languages, based on Reppy’s Concurrent ML. The first is a simp

Semantics for core Concurrent ML using computation types Alan Jeffrey Abstract This paper presents two typed higher-order concurrent functional programming languages, based on Reppy’s Concurrent ML. The first is a simp

Add to Reading List

Source URL: ect.bell-labs.com

Language: English - Date: 2010-12-15 21:39:09
32Weak Bisimulation Up to Elaboration Damien Pous ENS Lyon Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that e

Weak Bisimulation Up to Elaboration Damien Pous ENS Lyon Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that e

Add to Reading List

Source URL: perso.ens-lyon.fr

Language: English - Date: 2012-10-03 08:42:33
    33Symbolic Bisimulation for the Applied Pi Calculus ∗ St´ephanie Delaune1

    Symbolic Bisimulation for the Applied Pi Calculus ∗ St´ephanie Delaune1

    Add to Reading List

    Source URL: www.cs.bham.ac.uk.

    Language: English - Date: 2009-06-30 03:41:27
      34Using Bisimulation Proof Techniques for the Analysis of Distributed Abstract Machines Damien Pous ∗ ENS Lyon, France.

      Using Bisimulation Proof Techniques for the Analysis of Distributed Abstract Machines Damien Pous ∗ ENS Lyon, France.

      Add to Reading List

      Source URL: perso.ens-lyon.fr

      Language: English - Date: 2012-10-03 08:42:33
        35Robin Milner, Concurrency: interaction, bisimulation, naming Alan Jeffrey Bell Labs, Enabling Computing Technologies Research January 2011, ACM Principles of Programming Languages

        Robin Milner, Concurrency: interaction, bisimulation, naming Alan Jeffrey Bell Labs, Enabling Computing Technologies Research January 2011, ACM Principles of Programming Languages

        Add to Reading List

        Source URL: ect.bell-labs.com

        Language: English - Date: 2011-01-28 15:15:59
        36On Bisimulation Proofs for the Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France Abstract. We illustrate the use of recent, non-trivial proof techniques

        On Bisimulation Proofs for the Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France Abstract. We illustrate the use of recent, non-trivial proof techniques

        Add to Reading List

        Source URL: perso.ens-lyon.fr

        Language: English - Date: 2012-10-03 08:42:33
          37Bisimulation Equivalence for First-Order Grammars Petr Janˇcar Techn. Univ. Ostrava, Czech Republic; url: http://www.cs.vsb.cz/jancar/ 8 Mare.g. for trying to derive more results about the complexity

          Bisimulation Equivalence for First-Order Grammars Petr Janˇcar Techn. Univ. Ostrava, Czech Republic; url: http://www.cs.vsb.cz/jancar/ 8 Mare.g. for trying to derive more results about the complexity

          Add to Reading List

          Source URL: www.cs.vsb.cz

          Language: English - Date: 2012-03-09 05:05:26
            38Up-to Techniques for Weak Bisimulation Damien Pous ENS Lyon Abstract. Up-to techniques have been introduced to enhance the bisimulation proof method for establishing bisimilarity results. While up-to techniques for stron

            Up-to Techniques for Weak Bisimulation Damien Pous ENS Lyon Abstract. Up-to techniques have been introduced to enhance the bisimulation proof method for establishing bisimilarity results. While up-to techniques for stron

            Add to Reading List

            Source URL: perso.ens-lyon.fr

            Language: English - Date: 2012-10-03 08:42:33
              39A Comparison of Succinctly Represented Finite-state Systems ⋆ Romain Brenguier1 , Stefan G¨oller2 , and Ocan Sankur1 1 2

              A Comparison of Succinctly Represented Finite-state Systems ⋆ Romain Brenguier1 , Stefan G¨oller2 , and Ocan Sankur1 1 2

              Add to Reading List

              Source URL: www.informatik.uni-bremen.de

              Language: English - Date: 2012-09-12 07:18:02
              40Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization Diego Figueira CNRS, LaBRI, France & University of Edinburgh, UK Santiago Figueira

              Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization Diego Figueira CNRS, LaBRI, France & University of Edinburgh, UK Santiago Figueira

              Add to Reading List

              Source URL: www.glyc.dc.uba.ar

              Language: English - Date: 2015-05-26 20:54:57