Reachability

Results: 243



#Item
131Complexity classes / Graph connectivity / Reachability / Connected component / Transitive closure / SL / FO / Configuration graph / Connectivity / Theoretical computer science / Graph theory / Mathematics

Subcubic Algorithms for Recursive State Machines Swarat Chaudhuri Pennsylvania State University University Park, PA 16802, USA

Add to Reading List

Source URL: www.cs.rice.edu

Language: English - Date: 2008-03-07 16:10:53
132Quantification / Program logic / Formal methods / Predicate transformer semantics / Entailment / Assertion / C / Existential quantification / FO / Logic / Software engineering / Theoretical computer science

Detecting Inconsistencies via Universal Reachability Analysis Aaron Tomb Cormac Flanagan Galois, Inc., USA

Add to Reading List

Source URL: galois.com

Language: English - Date: 2014-07-17 17:29:46
133Electronic design automation / Formal methods / Logic in computer science / NP-complete problems / Vehicle Identification Number / Satisfiability Modulo Theories / FO / Kripke semantics / Theoretical computer science / Mathematical logic / Logic

Resourceful Reachability as HORN-LA Josh Berdine, Nikolaj Bjørner, Samin Ishtiaq, Jael E. Kriener, and Christoph M. Wintersteiger Microsoft Research, University of Kent Abstract. The program verification tool SLAyer us

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2014-05-07 12:02:15
134Database theory / Data management / Peer-to-peer / Software / Database / Reachability / Scalability / ANts P2P / Database management systems / File sharing networks / Computing

Case study: Scoop for partial read from P2P database Farnoush Banaei-Kashani and Cyrus Shahabi Abstract In this paper we propose Scoop, a mechanism to implement the “partial read operation” for peer-to-peer databases

Add to Reading List

Source URL: infolab.usc.edu

Language: English - Date: 2009-11-05 01:09:02
135Database management systems / SQL / Query optimizer / Search algorithms / Reachability / Graph partition / Query plan / Breadth-first search / FO / Graph theory / Theoretical computer science / Mathematics

Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs Mohamed Sarwat1 1 Sameh Elnikety2

Add to Reading List

Source URL: www-users.cs.umn.edu

Language: English - Date: 2015-04-07 00:37:53
136Network theory / Graph connectivity / Reachability / R-tree / Routing / Shortest path problem / Pruning / Distributed data storage / Bx-tree / Graph theory / Mathematics / Theoretical computer science

iRoad: A Framework For Scalable Predictive Query Processing On Road Networks ∗ Abdeltawab M. Hendawi

Add to Reading List

Source URL: www-users.cs.umn.edu

Language: English - Date: 2015-04-07 01:41:51
137C programming language / Cross-platform software / Programming language implementation / Procedural programming languages / Punctuation / C preprocessor / Maria / Preprocessor / C / Software engineering / Computing / Computer programming

Maria Modular Reachability Analyzer for Algebraic System Nets 20 June 2003, Maria Versionby Marko M¨ akel¨

Add to Reading List

Source URL: www.tcs.hut.fi

Language: English - Date: 2003-06-20 09:48:18
138Network architecture / Internet protocols / Internet standards / Border Gateway Protocol / Reachability / Ping / Internet / Routing protocols / Computing

Studying Black Holes on the Internet with Hubble Ethan Katz-Bassett, Harsha V. Madhyastha, John P. John, Arvind Krishnamurthy, David Wetherall, Thomas Anderson University of Washington

Add to Reading List

Source URL: www.caida.org

Language: English - Date: 2015-02-02 18:46:17
139Graph connectivity / Reachability / S0

Formal Verification of Computer Narratives Christopher J.F. Pickett School of Computer Science, McGill University Montr´eal, Qu´ebec, Canada H3A 2A7

Add to Reading List

Source URL: www.sable.mcgill.ca

Language: English - Date: 2009-06-10 18:11:01
140Connected component / SPQR tree / Biconnected graph / Directed acyclic graph / Series-parallel graph / Reachability / Tree decomposition / Tree / K-vertex-connected graph / Graph theory / Graph connectivity / Biconnected component

Reachability in K3,3-free and K5-free Graphs is in Unambiguous Logspace

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2014-04-18 22:07:45
UPDATE