BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
reachability
Google reachability

Tag #reachability

264 papers:

FMFM-2019-TranLMYNXJ #analysis #network
Star-Based Reachability Analysis of Deep Neural Networks (HDT, DML, PM, XY, LVN, WX, TTJ), pp. 670–686.
IFM-2019-BoerH #axiom #concurrent
Axiomatic Characterization of Trace Reachability for Concurrent Objects (FSdB, HDAH), pp. 157–174.
OOPSLAOOPSLA-2019-Ter-GabrielyanS #composition #logic #verification
Modular verification of heap reachability properties in separation logic (ATG, AJS, PM0), p. 28.
PLDIPLDI-2019-ShullHT #framework #java #named
AutoPersist: an easy-to-use Java NVM framework based on reachability (TS, JH0, JT), pp. 316–332.
CAVCAV-2019-BackesBCDGHKKKK #analysis #network
Reachability Analysis for AWS-Based Networks (JB, SB, BC, CD, AG, AJH, TK, BK, EK, JK, SM, JR0, NR, JS, MAS, PS, PS, CV, BW), pp. 231–241.
VMCAIVMCAI-2019-FoxSH #partial order #probability
Syntactic Partial Order Compression for Probabilistic Reachability (GF, DS, HH), pp. 446–467.
DLTDLT-2018-GonzeJ #automaton #on the #set
On Completely Reachable Automata and Subset Reachability (FG, RMJ), pp. 330–341.
DLTDLT-2018-KoNP #integer #nondeterminism #polynomial #problem
Reachability Problems in Nondeterministic Polynomial Maps on the Integers (SKK, RN, IP), pp. 465–477.
POPLPOPL-2018-ChatterjeeCP #alias #analysis #data flow
Optimal Dyck reachability for data-dependence and alias analysis (KC, BC, AP), p. 30.
CAVCAV-2018-LiDPRV #approximate #named #performance
SimpleCAR: An Efficient Bug-Finding Tool Based on Approximate Reachability (JL, RD, GP, KYR, MYV), pp. 37–44.
IJCARIJCAR-2018-CiobacaL #approach #induction #proving #term rewriting
A Coinductive Approach to Proving Reachability Properties in Logically Constrained Term Rewriting Systems (SC, DL), pp. 295–311.
LOPSTRLOPSTR-2017-SkeirikSM #logic
A Constructor-Based Reachability Logic for Rewrite Theories (SS, AS, JM), pp. 201–217.
POPLPOPL-2017-ZhangS #analysis #data flow #linear
Context-sensitive data-dependence analysis via linear conjunctive language reachability (QZ, ZS), pp. 344–358.
QAPLQAPL-2017-SchuppNA #analysis #divide and conquer #hybrid #set
Divide and Conquer: Variable Set Separation in Hybrid Systems Reachability Analysis (SS, JN, ), pp. 1–14.
ASEASE-2017-WangZJS0S #optimisation #static analysis
A static analysis tool with optimizations for reachability determination (YW, MZ0, YJ0, XS, MG0, JS), pp. 925–930.
CASECASE-2017-AziziKBK #analysis #geometry
Geometric reachability analysis for grasp planning in cluttered scenes for varying end-effectors (VA0, AK, KEB, MK), pp. 764–769.
ESOPESOP-2017-TangWXZW0 #analysis #library #performance #summary
Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization (HT, DW, YX, LZ, XW, LZ0), pp. 880–908.
CAVCAV-2017-BakD #linear #scalability
Simulation-Equivalent Reachability of Large Linear Systems with Inputs (SB, PSD), pp. 401–420.
VMCAIVMCAI-2017-FrumkinFLPSS #concurrent #fault #proving
Property Directed Reachability for Proving Absence of Concurrent Modification Errors (AF, YMYF, OL, OP, MS, SS), pp. 209–227.
VMCAIVMCAI-2017-MuschollSW #parametricity #process
Reachability for Dynamic Parametric Processes (AM, HS, IW), pp. 424–441.
FMFM-2016-AntoninoGR #analysis
Tighter Reachability Criteria for Deadlock-Freedom Analysis (PRGA, TGR, AWR), pp. 43–59.
IFM-2016-BendispostoKLMP #analysis
Symbolic Reachability Analysis of B Through ProB and LTSmin (JB, PK, ML, JM, JvdP, HT, JW), pp. 275–291.
CIKMCIKM-2016-JiangYCZY #network #privacy #query
Privacy-Preserving Reachability Query Services for Massive Networks (JJ, PY, BC, ZZ, XY0), pp. 145–154.
POPLPOPL-2016-KoskinenY
Reducing crash recoverability to reachability (EK, JY), pp. 97–108.
CCCC-2016-Pottier #fault #lr #parsing
Reachability and error diagnosis in LR(1) parsers (FP), pp. 88–98.
CAVCAV-2016-BouyerCM #automaton
Symbolic Optimal Reachability in Weighted Timed Automata (PB, MC, NM), pp. 513–530.
CAVCAV-2016-FanQM0D #analysis #automation #hybrid #modelling
Automatic Reachability Analysis for Nonlinear Hybrid Models with C2E2 (CF, BQ, SM, MV0, PSD), pp. 531–538.
VMCAIVMCAI-2016-HashemiH0 #bound #nondeterminism #probability
Reward-Bounded Reachability Probability for Uncertain Weighted MDPs (VH, HH, LS0), pp. 351–371.
ICALPICALP-v1-2015-HenzingerKN #algorithm #graph
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs (MH, SK, DN), pp. 725–736.
ICALPICALP-v2-2015-BouajjaniEEH #on the
On Reducing Linearizability to State Reachability (AB, ME, CE, JH), pp. 95–107.
ICALPICALP-v2-2015-DattaKMSZ
Reachability is in DynFO (SD, RK, AM, TS, TZ), pp. 159–170.
ICALPICALP-v2-2015-EtessamiSY #branch #equation #fixpoint #markov #polynomial #probability #process
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes (KE, AS, MY), pp. 184–196.
LATALATA-2015-KrishnaMT #automaton #bound #decidability #problem #recursion
Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable (SNK, LM, AT), pp. 237–248.
LATALATA-2015-VerdierR #constraints #specification
Quotient of Acceptance Specifications Under Reachability Constraints (GV, JBR), pp. 299–311.
RTARTA-2015-GenetS #analysis
Reachability Analysis of Innermost Rewriting (TG, YS), pp. 177–193.
ICGTICGT-2015-Oliveira #graph transformation #slicing
Reachability in Graph Transformation Systems and Slice Languages (MdOO), pp. 121–137.
ECIRECIR-2015-SabetghadamLBR #analysis #graph
Reachability Analysis of Graph Modelled Collections (SS, ML, RB, AR), pp. 370–381.
SIGIRSIGIR-2015-Li #image #interactive #ranking #retrieval
Reachability based Ranking in Interactive Image Retrieval (JL), pp. 867–870.
POPLPOPL-2015-BastaniAA #context-free grammar #specification #using
Specification Inference Using Context-Free Language Reachability (OB, SA, AA), pp. 553–566.
CCCC-2015-HollingumS #context-free grammar #framework #scalability #towards
Towards a Scalable Framework for Context-Free Language Reachability (NH, BS), pp. 193–211.
FASEFASE-2015-BouajjaniCDM #lazy evaluation
Lazy TSO Reachability (AB, GC, ED, RM), pp. 267–282.
TACASTACAS-2015-Immler #analysis
Verified Reachability Analysis of Continuous Systems (FI), pp. 37–51.
CSLCSL-2015-BrihayeBMR
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability (TB, VB, NM, JFR), pp. 504–518.
CSLCSL-2015-ClementeL #analysis #automaton #first-order
Reachability Analysis of First-order Definable Pushdown Systems (LC, SL), pp. 244–259.
LICSLICS-2015-BlondinFGHM #2d
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete (MB, AF, SG, CH, PM), pp. 32–43.
LICSLICS-2015-LerouxS
Demystifying Reachability in Vector Addition Systems (JL, SS), pp. 56–67.
SIGMODSIGMOD-2014-ZhuLWX #approach #graph #order #query #scalability
Reachability queries on large dynamic graphs: a total order approach (ADZ, WL, SW, XX), pp. 1323–1334.
VLDBVLDB-2014-WeiYLJ #approach #independence #permutation #query
Reachability Querying: An Independent Permutation Labeling Approach (HW, JXY, CL, RJ), pp. 1191–1202.
ICALPICALP-v1-2014-DattaHK #complexity #problem
Dynamic Complexity of Directed Reachability and Other Problems (SD, WH, RK), pp. 356–367.
LATALATA-2014-AbdullaAS #automaton
Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata (PAA, MFA, JS), pp. 62–75.
LATALATA-2014-FelgenhauerT #analysis #automaton
Reachability Analysis with State-Compatible Automata (BF, RT), pp. 347–359.
FMFM-2014-LakshmiAK #analysis #liveness #using
Checking Liveness Properties of Presburger Counter Systems Using Reachability Analysis (KVL, AA, RK), pp. 335–350.
RTARTA-TLCA-2014-StefanescuCMMSR #logic
All-Path Reachability Logic (AS, SC, RM, BMM, TFS, GR), pp. 425–440.
SASSAS-2014-MadsenM #analysis #data flow #pointer
Sparse Dataflow Analysis with Pointers and Reachability (MM, AM), pp. 201–218.
SACSAC-2014-YoonKHKRC #metric #similarity
Reachability vectors: features for link-based similarity measures (SHY, JSK, JH, SWK, MR, HJC), pp. 594–597.
CASECASE-2014-GargSYPCHPAG #analysis #automation
Exact reachability analysis for planning skew-line needle arrangements for automated brachytherapy (AG, TS, GY, SP, JAMC, ICH, JP, AA, KYG), pp. 524–531.
DACDAC-2014-LinL #analysis #parallel #verification
Parallel Hierarchical Reachability Analysis for Analog Verification (HL, PL), p. 6.
DATEDATE-2014-CabodiPQV #approximate #satisfiability
Tightening BDD-based approximate reachability with SAT-based clause generalization∗ (GC, PP, SQ, DV), pp. 1–6.
FoSSaCSFoSSaCS-2014-Fu #bound #markov #probability #process
Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision Processes (HF), pp. 73–87.
FoSSaCSFoSSaCS-2014-Lang #automaton #game studies #graph
Resource Reachability Games on Pushdown Graphs (ML0), pp. 195–209.
STOCSTOC-2014-HenzingerKN #algorithm #graph
Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs (MH, SK, DN), pp. 674–683.
TACASTACAS-2014-AdzkiyaSA
Forward Reachability Computation for Autonomous Max-Plus-Linear Systems (DA, BDS, AA), pp. 248–262.
CAVCAV-2014-Hagemann #analysis #hybrid #orthogonal #using
Reachability Analysis of Hybrid Systems Using Symbolic Orthogonal Projections (WH), pp. 407–423.
CAVCAV-2014-LeeS #abstraction #approximate #bound #scalability #verification
Unbounded Scalable Verification Based on Approximate Property-Directed Reachability and Datapath Abstraction (SL, KAS), pp. 849–865.
CAVCAV-2014-VizelG
Interpolating Property Directed Reachability (YV, AG), pp. 260–276.
IJCARIJCAR-2014-AvniKT #game studies #specification
From Reachability to Temporal Specifications in Cost-Sharing Games (GA, OK, TT), pp. 1–15.
IJCARIJCAR-2014-HorbachS #axiom #locality
Locality Transfer: From Constrained Axiomatizations to Reachability Predicates (MH, VSS), pp. 192–207.
VMCAIVMCAI-2014-Chang
Refuting Heap Reachability (BYEC), pp. 137–141.
VMCAIVMCAI-2014-WangH #concurrent
Precisely Deciding Control State Reachability in Concurrent Traces with Limited Observability (CW, KH), pp. 376–394.
SIGMODSIGMOD-2013-ChengHWF #graph #named #query #scalability
TF-Label: a topological-folding labeling scheme for reachability querying in a large graph (JC, SH, HW, AWCF), pp. 193–204.
VLDBVLDB-2013-JinW #performance #scalability
Simple, Fast, and Scalable Reachability Oracle (RJ, GW), pp. 1978–1989.
VLDBVLDB-2013-SarwatEHM #declarative #distributed #graph #query
Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs (MS, SE, YH, MFM), pp. 1918–1929.
CIAACIAA-2013-DreyfusHK #analysis #approximate
Enhancing Approximations for Regular Reachability Analysis (AD, PCH, OK), pp. 331–339.
ICALPICALP-v2-2013-FearnleyJ #automaton
Reachability in Two-Clock Timed Automata Is PSPACE-Complete (JF, MJ), pp. 212–223.
IFMIFM-2013-Song00LD #analysis #divide and conquer
Improved Reachability Analysis in DTMC via Divide and Conquer (SS, LG, JS, YL, JSD), pp. 162–176.
GRAPHITEGRAPHITE-2013-Majster-CederbaumS #architecture #constraints #operating system
Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete (MEMC, NS), pp. 1–11.
CIKMCIKM-2013-MullangiR #named #performance #query #scalability
SCISSOR: scalable and efficient reachability query processing in time-evolving hierarchies (PRM, LR), pp. 799–804.
SEKESEKE-2013-ChaoY #analysis #order #scalability
A Best Method to Synthesize Very Large K-th Order Systems without Reachability Analysis (DYC, THY), pp. 417–420.
PLDIPLDI-2013-BlackshearCS #named #precise
Thresher: precise refutations for heap reachability (SB, BYEC, MS), pp. 275–286.
CASECASE-2013-LiK #automation #generative #novel #reduction #testing
Reduction of automated test generation for Simulink/Stateflow to reachability and its novel resolution (ML, RK), pp. 1089–1094.
CASECASE-2013-WuCY #analysis #policy
A control policy for γ-nets without reachability analysis and siphon enumeration (WW, DYC, FY), pp. 1133–1138.
DACDAC-2013-LinLM #analysis #hybrid #kernel #verification
Verification of digitally-intensive analog circuits via kernel ridge regression and hybrid reachability analysis (HL, PL, CJM), p. 6.
DATEDATE-2013-AhmadyanV #analysis #reduction #set
Reachability analysis of nonlinear analog circuits through iterative reachable set reduction (SNA, SV), pp. 1436–1441.
DATEDATE-2013-BackesR #using
Using cubes of non-state variables with property directed reachability (JDB, MDR), pp. 807–810.
DATEDATE-2013-WelpK #model checking
QF BV model checking with property directed reachability (TW, AK), pp. 791–796.
PDPPDP-2013-BasileCLP #analysis #security
Improved Reachability Analysis for Security Management (CB, DC, AL, CP), pp. 534–541.
ESOPESOP-2013-BeyerHTV #analysis #multi #reuse
Information Reuse for Multi-goal Reachability Analyses (DB, AH, MT, HV), pp. 472–491.
FoSSaCSFoSSaCS-2013-ClementeHSS #communication #process
Reachability of Communicating Timed Processes (LC, FH, AS, GS), pp. 81–96.
TACASTACAS-2013-VizelGS #analysis #using
Intertwined Forward-Backward Reachability Analysis Using Interpolants (YV, OG, SS), pp. 308–323.
CAVCAV-2013-ClaessenFIPW #model checking #network #set
Model-Checking Signal Transduction Networks through Decreasing Reachability Sets (KC, JF, SI, NP, QW), pp. 85–100.
CAVCAV-2013-ItzhakyBINS #data type #effectiveness #linked data #open data #reasoning
Effectively-Propositional Reasoning about Reachability in Linked Data Structures (SI, AB, NI, AN, MS), pp. 756–772.
CAVCAV-2013-PauleveAK #approximate #automaton #network #scalability #set
Under-Approximating Cut Sets for Reachability in Large Scale Automata Networks (LP, GA, HK), pp. 69–84.
LICSLICS-2013-RosuSCM #logic
One-Path Reachability Logic (GR, AS, SC, BMM), pp. 358–367.
SIGMODSIGMOD-2012-JinRDY #graph #named #scalability
SCARAB: scaling reachability computation on large graphs (RJ, NR, SD, JXY), pp. 169–180.
VLDBVLDB-2012-FanWW #distributed #performance #query
Performance Guarantees for Distributed Reachability Queries (WF, XW, YW), pp. 1304–1315.
VLDBVLDB-2012-Shirani-MehrKS #dataset #evaluation #performance #query #scalability
Efficient Reachability Query Evaluation in Large Spatiotemporal Contact Datasets (HSM, FBK, CS), pp. 848–859.
ICALPICALP-v2-2012-BouyerMS #approach #automaton #game studies #robust
Robust Reachability in Timed Automata: A Game-Based Approach (PB, NM, OS), pp. 128–140.
LATALATA-2012-AbdullaAS #automaton #low cost #problem
The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems (PAA, MFA, JS), pp. 58–69.
FMFM-2012-MinamideM #analysis #html #parsing #specification #testing
Reachability Analysis of the HTML5 Parser Specification and Its Application to Compatibility Testing (YM, SM), pp. 293–307.
FMFM-2012-RosuS #hoare #logic
From Hoare Logic to Matching Logic Reachability (GR, AS), pp. 387–402.
RTARTA-2012-BertrandDKSS #decidability #graph transformation #on the
On the Decidability Status of Reachability and Coverability in Graph Transformation Systems (NB, GD, BK, AS, JS), pp. 101–116.
GRAPHITEGRAPHITE-2012-Cormie-Bowins #comparison #gpu #implementation
A Comparison of Sequential and GPU Implementations of Iterative Methods to Compute Reachability Probabilities (ECB), pp. 20–34.
SEKESEKE-2012-QiXW #concurrent #graph #interprocedural #slicing #source code
Slicing Concurrent Interprocedural Programs Based on Program Reachability Graphs (XQ, XX, PW), pp. 293–298.
OOPSLAOOPSLA-2012-RosuS #logic #using
Checking reachability using matching logic (GR, AS), pp. 555–574.
SASSAS-2012-Ledesma-GarzaR #analysis #functional #higher-order #source code
Binary Reachability Analysis of Higher Order Functional Programs (RLG, AR), pp. 388–404.
FoSSaCSFoSSaCS-2012-BrihayeBPG #game studies
Subgame Perfection for Equilibria in Quantitative Reachability Games (TB, VB, JDP, HG), pp. 286–300.
TACASTACAS-2012-ChadhaMV
Reachability under Contextual Locking (RC, PM, MV), pp. 437–450.
TACASTACAS-2012-HolzerKSTV #contest #proving #using
Proving Reachability Using FShell — (Competition Contribution) (AH, DK, CS, MT, HV), pp. 538–541.
CAVCAV-2012-BogomolovFGLPW #analysis #distance
A Box-Based Distance between Regions for Guiding the Reachability Analysis of SpaceEx (SB, GF, RG, HL, AP, MW), pp. 479–494.
CAVCAV-2012-LalQL #modulo theories
A Solver for Reachability Modulo Theories (AL, SQ, SKL), pp. 427–443.
IJCARIJCAR-2012-NikolicS #analysis
Reachability Analysis of Program Variables (DN, FS), pp. 423–438.
ISSTAISSTA-2012-TombF #analysis #consistency #detection #nondeterminism
Detecting inconsistencies via universal reachability analysis (AT, CF), pp. 287–297.
ICSTSAT-2012-HoderB
Generalized Property Directed Reachability (KH, NB), pp. 157–171.
SMTSMT-2012-AlbertiBGRS #library #modulo theories
Reachability Modulo Theory Library (FA, RB, SG, SR, NS), pp. 67–76.
SIGMODSIGMOD-2011-SchaikM #data type #memory management #performance
A memory efficient reachability data structure through bit vector compression (SJvS, OdM), pp. 913–924.
VLDBVLDB-2011-JinLDW #constraints #graph #nondeterminism
Distance-Constraint Reachability Computation in Uncertain Graphs (RJ, LL, BD, HW), pp. 551–562.
ICALPICALP-v2-2011-BrihayeDGORW #automaton #bound #hybrid #on the
On Reachability for Hybrid Automata over Bounded Time (TB, LD, GG, JO, JFR, JW), pp. 416–427.
LATALATA-2011-Leroux #problem #proving #self
Vector Addition System Reachability Problem: A Short Self-contained Proof (JL), pp. 41–64.
RTARTA-2011-DuranEEMT #maude #unification
Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6 (FD, SE, SE, JM, CLT), pp. 31–40.
RTARTA-2011-KochemsO #analysis #functional #linear #using
Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars (JK, CHLO), pp. 187–202.
CIKMCIKM-2011-DengLPCX #ad hoc #database #graph #predict #query
Predicting the optimal ad-hoc index for reachability queries on graph databases (JD, FL, YP, BC, JX), pp. 2357–2360.
CIKMCIKM-2011-LeeJL #web
Assisting web search users by destination reachability (CHL, AJ, LL), pp. 719–728.
CIKMCIKM-2011-XuZYCXZ #constraints #graph #scalability
Answering label-constraint reachability in large graphs (KX, LZ, JXY, LC, YX, DZ), pp. 1595–1600.
SEKESEKE-2011-SouzaSMCSZ #concurrent #quality #testing #using
Using Coverage and Reachability Testing to Improve Concurrent Program Testing Quality (SdRSdS, PSLdS, MCCM, MSC, AdSS, EZ), pp. 207–212.
POPLPOPL-2011-Leroux #problem #proving #self
Vector addition system reachability problem: a short self-contained proof (JL), pp. 307–316.
SACSAC-2011-MammarFD #approach #verification
A proof-based approach to verifying reachability properties (AM, MF, FD), pp. 1651–1657.
CASECASE-2011-LemattreDFPS #analysis #architecture #design
Designing operational control architectures of critical systems by reachability analysis (TL, BD, JMF, JFP, PS), pp. 12–18.
CCCC-2011-JenistaED #parallel #using
Using Disjoint Reachability for Parallelization (JCJ, YHE, BD), pp. 198–224.
DACDAC-2011-KuoSR #analysis #performance #source code #using
Efficient WCRT analysis of synchronous programs using reachability (MMYK, RS, PSR), pp. 480–485.
VMCAIVMCAI-2011-GawlitzaLMSW #analysis #concurrent #process #source code
Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation (TMG, PL, MMO, HS, AW), pp. 199–213.
SIGMODSIGMOD-2010-JinHWRX #constraints #database #graph
Computing label-constraint reachability in graph databases (RJ, HH, HW, NR, YX), pp. 123–134.
VLDBVLDB-2010-YildirimCZ #graph #named #scalability
GRAIL: Scalable Reachability Index for Large Graphs (HY, VC, MJZ), pp. 276–284.
SCAMSCAM-2010-EdvinssonLL #analysis #parallel
Parallel Reachability and Escape Analyses (ME, JL, WL), pp. 125–134.
CIAACIAA-2010-Neider #automation #game studies #graph
Reachability Games on Automatic Graphs (DN), pp. 222–230.
ICALPICALP-v2-2010-BrazdilJK #game studies
Reachability Games on Extended Vector Addition Systems with States (TB, PJ, AK), pp. 478–489.
CIKMCIKM-2010-CaiP #graph #named #query #scalability
Path-hop: efficiently indexing large graphs for reachability queries (JC, CKP), pp. 119–128.
CIKMCIKM-2010-DeyJ #approach #database #graph #query #scalability
A hierarchical approach to reachability query answering in very large graph databases (SKD, HMJ), pp. 1377–1380.
ICSEICSE-2010-LaTozaM #developer
Developers ask reachability questions (TDL, BAM), pp. 185–194.
SACSAC-2010-HansenS #analysis #implementation #optimisation
Reachability analysis of GSPDIs: theory, optimization, and implementation (HAH, GS), pp. 2511–2516.
DATEDATE-2010-BuLWCL #bound #composition #hybrid #linear
BACH 2 : Bounded reachability checker for compositional linear hybrid systems (LB, YL, LW, XC, XL), pp. 1512–1517.
FoSSaCSFoSSaCS-2010-HeussnerLMS #analysis #automaton #communication
Reachability Analysis of Communicating Pushdown Systems (AH, JL, AM, GS), pp. 267–281.
CAVCAV-2010-BlomPW #distributed #named
LTSmin: Distributed and Symbolic Reachability (SB, JvdP, MW), pp. 354–359.
CAVCAV-2010-LiXBL #analysis #automaton #hardware #performance
Efficient Reachability Analysis of Büchi Pushdown Systems for Hardware/Software Co-verification (JL, FX, TB, VL), pp. 339–353.
CAVCAV-2010-Seth #automaton #bound #multi
Global Reachability in Bounded Phase Multi-stack Pushdown Systems (AS), pp. 615–628.
VMCAIVMCAI-2010-BuZL #automaton #hybrid #programming #using #verification
Path-Oriented Reachability Verification of a Class of Nonlinear Hybrid Automata Using Convex Programming (LB, JZ, XL), pp. 78–94.
VMCAIVMCAI-2010-Dubrovin #bound
Checking Bounded Reachability in Asynchronous Systems by Symbolic Event Tracing (JD), pp. 146–162.
SIGMODSIGMOD-2009-JinXRF #named #query
3-HOP: a high-compression indexing scheme for reachability query (RJ, YX, NR, DF), pp. 813–826.
ICALPICALP-v2-2009-BouyerF #game studies #probability
Reachability in Stochastic Timed Games (PB, VF), pp. 103–114.
ESOPESOP-2009-YuanE #algorithm #performance #problem
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees (HY, PTE), pp. 175–189.
FoSSaCSFoSSaCS-2009-AbdullaM #low cost #petri net
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets (PAA, RM), pp. 348–363.
CAVCAV-2009-GuernicG #analysis #hybrid #using
Reachability Analysis of Hybrid Systems Using Support Functions (CLG, AG), pp. 540–554.
CAVCAV-2009-TorreMP #bound #concurrent
Reducing Context-Bounded Concurrent Reachability to Sequential Reachability (SLT, PM, GP), pp. 477–492.
LICSLICS-2009-HansenKM #concurrent #game studies
Winning Concurrent Reachability Games Requires Doubly-Exponential Patience (KAH, MK, PBM), pp. 332–341.
LICSLICS-2009-HofmannS #pointer #source code
Pointer Programs and Undirected Reachability (MH, US), pp. 133–142.
LICSLICS-2009-Leroux #induction #invariant #problem
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants (JL), pp. 4–13.
LICSLICS-2009-OngT #functional
Functional Reachability (CHLO, NT), pp. 286–295.
LICSLICS-2009-Tan #automaton #graph #infinity
Graph Reachability and Pebble Automata over Infinite Alphabets (TT), pp. 157–166.
SIGMODSIGMOD-2008-JinXRW #graph #query #scalability
Efficiently answering reachability queries on very large directed graphs (RJ, YX, NR, HW), pp. 595–608.
SCAMSCAM-2008-ScholzZC #analysis #dependence #graph
User-Input Dependence Analysis via Graph Reachability (BS, CZ, CC), pp. 25–34.
DLTDLT-2008-CsimaK #decidability #question
When Is Reachability Intrinsically Decidable? (BFC, BK), pp. 216–227.
RTARTA-2008-KojimaS #decidability #linear #term rewriting
Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems (YK, MS), pp. 187–201.
SACSAC-2008-AbedMS #analysis #graph #multi #proving #theorem proving #using
Reachability analysis using multiway decision graphs in the HOL theorem prover (SA, OAM, GAS), pp. 333–338.
SACSAC-2008-Schneider #analysis #hybrid
Reachability analysis of generalized polygonal hybrid systems (GS), pp. 327–332.
LICSLICS-2008-Murawski #game studies #nondeterminism #semantics #source code
Reachability Games and Game Semantics: Comparing Nondeterministic Programs (ASM), pp. 353–363.
FATESTestCom-FATES-2008-GrozLPS #analysis #composition #testing #verification
Modular System Verification by Inference, Testing and Reachability Analysis (RG, KL, AP, MS), pp. 216–233.
ICALPICALP-2007-BrihayeHPR #game studies
Minimum-Time Reachability in Timed Games (TB, TAH, VSP, JFR), pp. 825–837.
WRLAWRLA-J-2004-MeseguerT07 #analysis #encryption #protocol #using #verification
Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (JM, PT), pp. 123–160.
TACASTACAS-2007-ChatterjeeLQR #bytecode #low level
A Reachability Predicate for Analyzing Low-Level Software (SC, SKL, SQ, ZR), pp. 19–33.
TACASTACAS-2007-YuCL #bound #diagrams #using
Bounded Reachability Checking of Asynchronous Systems Using Decision Diagrams (AJY, GC, GL), pp. 648–663.
CAVCAV-2007-WangYGI #precise #using
Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra (CW, ZY, AG, FI), pp. 352–365.
CIAACIAA-2006-Luttenberger #analysis #integer #source code
Reachability Analysis of Procedural Programs with Affine Integer Arithmetic (ML), pp. 281–282.
SASSAS-2006-CalcagnoDOY #abstraction #pointer
Beyond Reachability: Shape Abstraction in the Presence of Pointer Arithmetic (CC, DD, PWO, HY), pp. 182–203.
SASSAS-2006-PratikakisFH
Existential Label Flow Inference Via CFL Reachability (PP, JSF, MH), pp. 88–106.
TACASTACAS-2006-ThomasCP #performance #using
Efficient Guided Symbolic Reachability Using Reachability Expressions (DT, SC, PKP), pp. 120–134.
RTARTA-2005-BouajjaniT #on the #process #set #term rewriting
On Computing Reachability Sets of Process Rewrite Systems (AB, TT), pp. 484–499.
CIKMCIKM-2005-HeWYY
Compact reachability labeling for graph-structured data (HH, HW, JY, PSY), pp. 594–601.
ECOOPECOOP-2005-LuP #type system
A Type System for Reachability and Acyclicity (YL, JP), pp. 479–503.
ASEASE-2005-KashyapG #detection #performance
Exploiting predicate structure for efficient reachability detection (SK, VKG), pp. 4–13.
DACDAC-2005-SahooJIDE #concurrent #multi #thread
Multi-threaded reachability (DS, JJ, SKI, DLD, EAE), pp. 467–470.
WRLAWRLA-2004-MeseguerT05 #analysis #encryption #protocol #using #verification
Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols (JM, PT), pp. 153–182.
ESOPESOP-2005-BusiZ #mobile
Deciding Reachability in Mobile Ambients (NB, GZ), pp. 248–262.
FoSSaCSFoSSaCS-2005-LarsenR #automaton #multi
Optimal Conditional Reachability for Multi-priced Timed Automata (KGL, JIR), pp. 234–249.
TACASTACAS-2005-AlurCEM #detection #on the fly #recursion #state machine
On-the-Fly Reachability and Cycle Detection for Recursive State Machines (RA, SC, KE, PM), pp. 61–76.
CADECADE-2005-Lev-AmiIRSSY #data type #first-order #linked data #logic #open data #simulation #using #verification
Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures (TLA, NI, TWR, SS, SS, GY), pp. 99–115.
CAVCAV-2005-BradleyMS #linear #ranking
Linear Ranking with Reachability (ARB, ZM, HBS), pp. 491–504.
DLTDLT-2004-Potapov #automaton #matrix #multi #problem
From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata (IP), pp. 345–356.
ICALPICALP-2004-AlurBM #game studies
Optimal Reachability for Weighted Timed Games (RA, MB, PM), pp. 122–133.
IFMIFM-2004-WangRL #csp #independence
Relating Data Independent Trace Checks in CSP with UNITY Reachability under a Normality Assumption (XW, AWR, RL), pp. 247–266.
PLDIPLDI-2004-KodumalA #constraints #set
The set constraint/CFL reachability connection in practice (JK, AA), pp. 207–218.
ASEASE-2004-LeowKLS #automation #generative #heuristic #source code #testing
Heuristic Search with Reachability Tests for Automated Generation of Test Programs (WKL, SCK, THL, VS), pp. 282–285.
DACDAC-2004-HungSYYP #analysis #logic #quantum #synthesis
Quantum logic synthesis by symbolic reachability analysis (WNNH, XS, GY, JY, MAP), pp. 838–841.
STOCSTOC-2004-RodittyZ #algorithm #graph #linear
A fully dynamic reachability algorithm for directed graphs with an almost linear update time (LR, UZ), pp. 184–191.
TACASTACAS-2004-BaierHHK #bound #markov #performance #process
Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision Processes (CB, BRH, HH, JPK), pp. 61–76.
TACASTACAS-2004-MailundW #graph #using
Obtaining Memory-Efficient Reachability Graph Representations Using the Sweep-Line Method (TM, MW), pp. 177–191.
SCAMSCAM-2003-BinkleyH #algorithm #analysis #graph #optimisation #performance #scalability #source code
Results from a Large-Scale Study of Performance Optimization Techniques for Source Code Analyses Based on Graph Reachability Algorithms (DB, MH), p. 203–?.
SASSAS-2003-McMillan #analysis
Craig Interpolation and Reachability Analysis (KLM), p. 336.
DATEDATE-2003-GoelB #analysis #functional #set
Set Manipulation with Boolean Functional Vectors for Symbolic Reachability Analysis (AG, REB), pp. 10816–10821.
CAVCAV-2003-GrumbergHS #algorithm #analysis #distributed
A Work-Efficient Distributed Algorithm for Reachability Analysis (OG, TH, AS), pp. 54–66.
CSMRCSMR-2002-RaysideK #algorithm #graph #problem #program analysis
A Generic Worklist Algorithm for Graph Reachability Problems in Program Analysis (DR, KK), pp. 67–76.
ICALPICALP-2002-Colcombet #decidability #first-order #graph #on the #product line
On Families of Graphs Having a Decidable First Order Theory with Reachability (TC), pp. 98–109.
FoSSaCSFoSSaCS-2002-BidoitH #concept #integration #on the
On the Integration of Observability and Reachability Concepts (MB, RH), pp. 21–36.
FoSSaCSFoSSaCS-2002-Cirstea #algebra #logic #on the #specification
On Specification Logics for Algebra-Coalgebra Structures: Reconciling Reachability and Observability (CC), pp. 82–97.
TACASTACAS-2002-JinKS #analysis #scheduling
Fine-Grain Conjunction Scheduling for Symbolic Reachability Analysis (HJ, AK, FS), pp. 312–326.
LICSLICS-2002-Dima #automaton
Computing Reachability Relations in Timed Automata (CD), p. 177–?.
ICTSSTestCom-2002-CastanetR #analysis #proving #testing #theorem proving
Generate Certified Test Cases by Combining Theorem Proving and Reachability Analysis (RC, DR), pp. 249–266.
FMFME-2001-Beyer #analysis #automaton
Improvements in BDD-Based Reachability Analysis of Timed Automata (DB0), pp. 318–343.
FoSSaCSFoSSaCS-2001-BidoitHK #on the
On the Duality between Observability and Reachability (MB, RH, AK), pp. 72–87.
CAVCAV-2001-AnnichiniBS #analysis #named
TReX: A Tool for Reachability Analysis of Complex Systems (AA, AB, MS), pp. 368–372.
CAVCAV-2001-Dang #analysis #automaton
Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks (ZD), pp. 506–518.
CAVCAV-2001-LarsenBBFHPR #automaton #performance
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata (KGL, GB, EB, AF, TH, PP, JR), pp. 493–505.
PODSPODS-2000-BenediktGLS #constraints #database #query
Reachability and Connectivity Queries in Constraint Databases (MB, MG, LL, LS), pp. 104–115.
CIAACIAA-2000-Ibarra #queue #safety
Reachability and Safety in Queue Systems (OHI), pp. 145–156.
TACASTACAS-2000-AbdullaBE #analysis
Symbolic Reachability Analysis Based on SAT-Solvers (PAA, PB, NE), pp. 411–425.
TACASTACAS-2000-Schmidt #analysis #low level #symmetry
Integrating Low Level Symmetries into Reachability Analysis (KS0), pp. 315–330.
CAVCAV-2000-AlurGM #analysis #performance
Efficient Reachability Analysis of Hierarchical Reactive Machines (RA, RG, MM), pp. 280–295.
CAVCAV-2000-DangIBKS #analysis #automaton
Binary Reachability Analysis of Discrete Pushdown Timed Automata (ZD, OHI, TB, RAK, JS), pp. 69–84.
CAVCAV-2000-FraerKZVF #analysis #performance #traversal #verification
Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification (RF, GK, BZ, MYV, LF), pp. 389–402.
CAVCAV-2000-HeymanGGS #analysis #parallel #scalability
Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits (TH, DG, OG, AS), pp. 20–35.
ICALPICALP-1999-CortierGJV #decidability
Decidable Fragments of Simultaneous Rigid Reachability (VC, HG, FJ, MV), pp. 250–260.
FMFM-v1-1999-HusbergM #industrial #named
Emma: Developing an Industrial Reachability Analyser for SDL (NH, TM), pp. 642–661.
DACDAC-1999-GovindarajuDB #approximate #using
Improved Approximate Reachability Using Auxiliary State Variables (SGG, DLD, JPB), pp. 312–316.
DATEDATE-1999-HongB #analysis #finite #scalability #state machine #using
Symbolic Reachability Analysis of Large Finite State Machines Using Don’t Cares (YH, PAB), p. 13–?.
DATEDATE-1999-MakrisO #behaviour #synthesis
Channel-Based Behavioral Test Synthesis for Improved Module Reachability (YM, AO), pp. 283–288.
TACASTACAS-1999-Heljanko #concurrent #logic programming #petri net #problem #semantics #source code #using
Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets (KH), pp. 240–254.
TACASTACAS-1999-Tripakis
Timed Diagnostics for Reachability Properties (ST), pp. 59–73.
CAVCAV-1999-AbdullaABBHL #abstraction #analysis #infinity #verification
Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis (PAA, AA, SB, AB, PH, YL), pp. 146–159.
CAVCAV-1999-BehrmannLPWY #analysis #diagrams #difference #performance #using
Efficient Timed Reachability Analysis Using Clock Difference Diagrams (GB, KGL, JP, CW, WY), pp. 341–353.
CSLCSL-1999-Marcinkowski #game studies
Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games (JM), pp. 338–349.
DACDAC-1998-GovindarajuDHH #approximate #using
Approximate Reachability with BDDs Using Overlapping Projections (SGG, DLD, AJH, MH), pp. 451–456.
TACASTACAS-1998-AcetoBL #automaton #model checking #testing
Model Checking via Reachability Testing for Timed Automata (LA, AB, KGL), pp. 263–280.
TACASTACAS-1998-DawsT #abstraction #model checking #realtime #using
Model Checking of Real-Time Reachability Properties Using Abstractions (CD, ST), pp. 313–329.
CAVCAV-1998-ShipleKR #comparison
A Comparison of Presburger Engines for EFSM Reachability (TRS, JHK, RKR), pp. 280–292.
ICALPICALP-1997-BouajjaniH #analysis #set
Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (AB, PH), pp. 560–570.
PEPMPEPM-1997-MelskiR #constraints #context-free grammar #set
Interconveritibility of Set Constraints and Context-Free Language Reachability (DM, TWR), pp. 74–89.
ESECESEC-FSE-1997-ChenGK #analysis #c++ #detection
A C++ Data Model Supporting Reachability Analysis and Dead Code Detection (YFC, ERG, EK), pp. 414–431.
ESECESEC-FSE-1997-CheungGK #analysis #composition #liveness #using #verification
Verification of Liveness Properties Using Compositional Reachability Analysis (SCC, DG, JK), pp. 227–243.
TACASTACAS-1997-ParashkevovY #analysis #performance #pseudo #using
Space Efficient Reachability Analysis Through Use of Pseudo-Root States (ANP, JY), pp. 50–64.
TAPSOFTTAPSOFT-1997-IlieA #graph #model checking
Model Checking Through Symbolic Reachability Graph (JMI, KA), pp. 213–224.
CAVCAV-1997-BoigelotBR #analysis #hybrid #linear
An Improved Reachability Analysis Method for Strongly Linear Hybrid Systems (BB, LB, SR), pp. 167–178.
CAVCAV-1997-VarpaaniemiHL #analysis #performance
prod 3.2: An Advanced Tool for Efficient Reachability Analysis (KV, KH, JL), pp. 472–475.
ICLPILPS-1997-Reps #graph #program analysis
Program Analysis via Graph Reachability (TWR), pp. 5–19.
ICSEICSE-1996-CheungK #analysis #composition #safety
Checking Subsystem Safety Properties in Compositional Reachability Analysis (SCC, JK), pp. 144–154.
ISSTAISSTA-1996-PomakisA #analysis #feature model #interactive
Reachability Analysis of Feature Interactions: A Progress Report (KPP, JMA), pp. 216–223.
POPLPOPL-1995-RepsHS #analysis #data flow #graph #interprocedural #precise
Precise Interprocedural Dataflow Analysis via Graph Reachability (TWR, SH, SS), pp. 49–61.
ESECESEC-1995-Chamillard #analysis #case study #metric #performance #predict
An Exploratory Study of Program Metrics as Predictors of Reachability Analysis Performance (ATC), pp. 343–361.
FSEFSE-1995-CheungK #analysis #composition #constraints #distributed #finite
Compositional Reachability Analysis of Finite-State Distributed Systems with User-Specified Constraints (SCC, JK), pp. 140–150.
FMFME-1993-ValmariKCL #analysis
Putting Advanced Reachability Analysis Techniques Together: the “ARA” Tool (AV, JK, MC, ML), pp. 597–616.
LOPSTRLOPSTR-1993-Neugebauer #analysis
Reachability Analysis for the Extension Procedure — A Topological Result (GN), pp. 32–44.
FSEFSE-1993-CheungK #analysis #composition #constraints
Enhancing Compositional Reachability Analysis with Context Constraints (SCC, JK), pp. 115–125.
TAPSOFTTAPSOFT-1993-DiehlJR #analysis #distributed
Reachability Analysis on Distributed Executions (CD, CJ, JXR), pp. 629–643.
CAVCAV-1993-Krishnakumar #composition #finite #state machine
Reachability and Recurrence in Extended Finite State Machines: Modular Vector Addition Systems (ASK), pp. 110–122.
CAVCAV-1993-MalerP #analysis #multi
Reachability Analysis of Planar Multi-limear Systems (OM, AP), pp. 194–209.
SASWSA-1992-Ayers #analysis #performance
Efficient Closure Analysis with Reachability (AEA), pp. 126–134.
ISSTATAV-1991-YehY #algebra #analysis #composition #process #using
Compositional Reachability Analysis Using Process Algebra (WJY, MY), pp. 49–59.
CAVCAV-1990-JanickiK #graph #simulation #using
Using Optimal Simulations to Reduce Reachability Graphs (RJ, MK), pp. 166–175.
TAPSOFTCAAP-1989-DeruyverG #problem
The Reachability Problem for Ground TRS and Some Extensions (AD, RG), pp. 227–243.
ICLPNACLP-1989-Winsborough #analysis #multi
Path-Dependent Reachability Analysis for Multiple Specialization (WHW), pp. 133–153.
ICALPICALP-1987-HowellR #equivalence
Completeness Rules for Reachability, Containment, and Equivalence, with Respect to Conflict-Free Vector Replacement Systems (RRH, LER), pp. 509–520.
POPLPOPL-1983-Nelson #invariant #verification
Verifying Reachability Invariants of Linked Structures (GN), pp. 38–47.
STOCSTOC-1982-Kosaraju #decidability
Decidability of Reachability in Vector Addition Systems (SRK), pp. 267–281.
STOCSTOC-1981-Mayr #algorithm #petri net #problem
An Algorithm for the General Petri Net Reachability Problem (EWM), pp. 238–246.
STOCSTOC-1981-MullerS #automaton #graph #higher-order #logic #problem
Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems (DEM, PES), pp. 46–54.
STOCSTOC-1977-SacerdoteT #decidability #problem
The Decidability of the Reachability Problem for Vector Addition Systems (GSS, RLT), pp. 61–76.
STOCSTOC-1976-HuntS #problem
Dichotomization, Reachability, and the Forbidden Subgraph Problem (HBHI, TGS), pp. 126–134.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.