Reachability

Results: 243



#Item
31Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking Kazuhide Yasukata, Naoki Kobayashi and Kazutaka Matsuda The University of Tokyo

Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking Kazuhide Yasukata, Naoki Kobayashi and Kazutaka Matsuda The University of Tokyo

Add to Reading List

Source URL: www-kb.is.s.u-tokyo.ac.jp

Language: English - Date: 2015-10-01 02:54:54
    32Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States . Michael Blondin

    Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States . Michael Blondin

    Add to Reading List

    Source URL: www7.in.tum.de

    Language: English - Date: 2017-06-20 13:30:06
      33Tree Automata for Reachability in Rewriting Thomas Genet http://people.irisa.fr/Thomas.Genet/ IRISA, Universit´e de Rennes 1 1

      Tree Automata for Reachability in Rewriting Thomas Genet http://people.irisa.fr/Thomas.Genet/ IRISA, Universit´e de Rennes 1 1

      Add to Reading List

      Source URL: www.win.tue.nl

      - Date: 2017-02-02 02:41:59
        34Reachability-Based Memory Accounting Adam Wick Matthew Flatt

        Reachability-Based Memory Accounting Adam Wick Matthew Flatt

        Add to Reading List

        Source URL: www.cs.utah.edu

        - Date: 2004-01-06 16:41:09
          35Divide and Conquer: Variable Set Separation in Hybrid Systems Reachability Analysis∗ Stefan Schupp Johanna Nellen

          Divide and Conquer: Variable Set Separation in Hybrid Systems Reachability Analysis∗ Stefan Schupp Johanna Nellen

          Add to Reading List

          Source URL: qapl17.doc.ic.ac.uk

          - Date: 2017-04-20 09:16:43
            36A Constructor-Based Reachability Logic for Rewrite Theories Stephen Skeirik, Andrei Stefanescu, Jose Meseguer October 10th, 2017

            A Constructor-Based Reachability Logic for Rewrite Theories Stephen Skeirik, Andrei Stefanescu, Jose Meseguer October 10th, 2017

            Add to Reading List

            Source URL: www.sci.unich.it

            - Date: 2017-10-23 05:15:05
              37Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis Guoqing Xu1 , Atanas Rountev1 , and Manu Sridharan2 2

              Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis Guoqing Xu1 , Atanas Rountev1 , and Manu Sridharan2 2

              Add to Reading List

              Source URL: manu.sridharan.net

              - Date: 2018-02-03 20:39:22
                38Thresher: Precise Refutations for Heap Reachability Sam Blackshear Bor-Yuh Evan Chang Manu Sridharan

                Thresher: Precise Refutations for Heap Reachability Sam Blackshear Bor-Yuh Evan Chang Manu Sridharan

                Add to Reading List

                Source URL: manu.sridharan.net

                - Date: 2018-02-03 20:39:22
                  39Finding Fix Locations for CFL-Reachability Analyses via Minimum Cuts Andrei Marian Dan1 , Manu Sridharan2? , Satish Chandra2?? , Jean-Baptiste Jeannin2 , and Martin Vechev1 1

                  Finding Fix Locations for CFL-Reachability Analyses via Minimum Cuts Andrei Marian Dan1 , Manu Sridharan2? , Satish Chandra2?? , Jean-Baptiste Jeannin2 , and Martin Vechev1 1

                  Add to Reading List

                  Source URL: manu.sridharan.net

                  - Date: 2018-02-03 20:39:22
                    40Bidirectional reachability-based modules Riku Nortje1,2 , Katarina Britz1,2 , and Thomas Meyer1,3 1 CSIR Meraka Institute, Pretoria, South Africa University of South Africa, Pretoria, South Africa

                    Bidirectional reachability-based modules Riku Nortje1,2 , Katarina Britz1,2 , and Thomas Meyer1,3 1 CSIR Meraka Institute, Pretoria, South Africa University of South Africa, Pretoria, South Africa

                    Add to Reading List

                    Source URL: ceur-ws.org

                    - Date: 2011-06-26 10:22:15