Stem path$ (all stems)

903 papers:

CASE-2015-KaoLJ #mobile

Application of potential field method and optimal path planning to mobile robot control (CCK, CML, JGJ), pp. 1552–1554.

CASE-2015-Michalek #bound #standard

Motion control with minimization of a boundary off-track for non-Standard N-trailers along forward-followed paths (MMM), pp. 1564–1569.

CASE-2015-QiuZL #modelling

Visible light communication-based indoor environment modeling and metric-free path planning (KQ, FZ, ML), pp. 200–205.

CASE-2015-Yen #realtime #using

Optimize the flight path for airlines using real-time information (JRY), p. 1649.

DAC-2015-LiBTO #communication #energy #performance

Complementary communication path for energy efficient on-chip optical interconnects (HL, SLB, YT, IO), p. 6.

DATE-2015-GorevUD #fault #parallel #simulation

Fault simulation with parallel exact critical path tracing in multiple core environment (MG, RU, SD), pp. 1180–1185.

DATE-2015-RajendranRadhika

Path selection based acceleration of conditionals in CGRAs (SR, AS, MH), pp. 121–126.

DATE-2015-ShulakerWSWWM #3d #concept #integration

Monolithic 3D integration: a path from concept to reality (MMS, TFW, MMS, HW, HSPW, SM), pp. 1197–1202.

DATE-2015-WaqasGKSBSVC #heuristic #online #scalability #scheduling

A re-entrant flowshop heuristic for online scheduling of the paper path in a large scale printer (UW, MG, JK, LJS, TB, SS, PV, HC), pp. 573–578.

VLDB-2015-DyresonBG #dependence #query

Virtual eXist-db: Liberating Hierarchical Queries from the Shackles of Access Path Dependence (CED, SSB, RG), pp. 1932–1943.

CIAA-J-2013-DebarbieuxGNSZ15 #automaton #query #word #xml #xpath

Early nested word automata for XPath query answering on XML streams (DD, OG, JN, TS, MZ), pp. 100–125.

DLT-2015-FengLQ #word

Path Checking for MTL and TPTL over Data Words (SF, ML, KQ), pp. 326–339.

ICALP-v1-2015-DisserKL #bidirectional #scheduling

Scheduling Bidirectional Traffic on a Path (YD, MK, EL), pp. 406–418.

ICALP-v1-2015-GrosseGKSS #algorithm #performance

Fast Algorithms for Diameter-Optimally Augmenting Paths (UG, JG, CK, MHMS, FS), pp. 678–688.

ICALP-v1-2015-KawaseKY #graph

Finding a Path in Group-Labeled Graphs with Two Labels Forbidden (YK, YK, YY), pp. 797–809.

ICALP-v1-2015-MitchellPSW #algorithm

An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains (JSBM, VP, MS, HW), pp. 947–959.

ICALP-v1-2015-MouawadNPR #configuration management

Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (AEM, NN, VP, VR), pp. 985–996.

SEFM-2015-HusterBELRKR #performance #testing

Efficient Testing of Different Loop Paths (SH, SB, HE, JL, JR, TK, WR), pp. 117–131.

CHI-2015-HanrahanP #email #interactive

Lost in Email: Pulling Users Down a Path of Interaction (BVH, MAPQ), pp. 3981–3984.

CHI-2015-OmirouMSS #3d #composition #named #visualisation

LeviPath: Modular Acoustic Levitation for 3D Path Visualisations (TO, AM, SAS, SS), pp. 309–312.

CSCW-2015-ArazyONYB #functional #wiki

Functional Roles and Career Paths in Wikipedia (OA, FO, ON, MLY, AB), pp. 1092–1105.

CSCW-2015-ProstMT #design #energy #towards #using

From Awareness to Empowerment: Using Design Fiction to Explore Paths towards a Sustainable Energy Future (SP, EEM, MT), pp. 1649–1658.

ICEIS-v1-2015-FuD #graph #named #scalability #social

ROBE — Knitting a Tight Hub for Shortest Path Discovery in Large Social Graphs (LF, JD), pp. 97–107.

ICEIS-v1-2015-VaroneA #multi #using

Multi-modal Transportation with Public Transport and Ride-sharing — Multi-modal Transportation using a Path-based Method (SV, KA), pp. 479–486.

ICEIS-v2-2015-BandyszakRWP #analysis #information management #specification #validation

Supporting the Validation of Structured Analysis Specifications in the Engineering of Information Systems by Test Path Exploration (TB, MR, TW, KP), pp. 252–259.

ICML-2015-AsterisKDYC #graph

Stay on path: PCA along graph paths (MA, ATK, AGD, HGY, BC), pp. 1728–1736.

ICML-2015-GuL #algorithm #fault

A New Generalized Error Path Algorithm for Model Selection (BG, CXL), pp. 2549–2558.

KDD-2015-ZhouLB #analysis #clustering #graph

Integrating Vertex-centric Clustering with Edge-centric Clustering for Meta Path Graph Analysis (YZ, LL, DB), pp. 1563–1572.

MLDM-2015-Perner #automation #feature model #image #mining

Automatic Cell Tracking and Kinetic Feature Description of Cell Paths for Image Mining (PP), pp. 441–451.

POPL-2015-ChatterjeeIPG #algebra #algorithm #constant #performance #recursion #state machine

Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth (KC, RIJ, AP, PG), pp. 97–109.

SAC-2015-BritoE #branch #named #performance #query

BranchGuide: an indexing technique for efficient, lossless processing of branching path queries (TBV, GEdS), pp. 1086–1092.

SAC-2015-GoldnerVSG #2d #algorithm

A shortest path algorithm for 2D seismic horizon tracking (ELG, CNV, PMS, MG), pp. 80–85.

SAC-2015-RychnovskyH #generative #query #xml #xpath

Generating XML data for XPath queries (DR, IH), pp. 724–731.

SAC-2015-SilvaMR #algorithm #approach #problem #using

An approach to the MOGAS initialization problem using an algorithm based on path relinking (TGNdS, JEBM, LSR), pp. 118–124.

ESEC-FSE-2015-AfrazSK #named #profiling

P3: partitioned path profiling (MA, DS, AK), pp. 485–495.

ESEC-FSE-2015-BangAB #automation #complexity #source code

Automatically computing path complexity of programs (LB, AA, TB), pp. 61–72.

ESEC-FSE-2015-EichbergHMG

Hidden truths in dead software paths (ME, BH, MM, LG), pp. 474–484.

ESEC-FSE-2015-Konopka #dependence #eye tracking #identification #navigation

Combining eye tracking with navigation paths for identification of cross-language code dependencies (MK), pp. 1057–1059.

ESEC-FSE-2015-SenNGC #execution #multi #named #summary #symbolic computation #using

MultiSE: multi-path symbolic execution using value summaries (KS, GCN, LG, WC), pp. 842–853.

CAV-2015-ErezN #automation #bound #graph #smt #using

Finding Bounded Path in Graph Using SMT for Automatic Clock Routing (AE, AN), pp. 20–36.

ICST-2015-CastillosWW #approach

Show Me New Counterexamples: A Path-Based Approach (KCC, HW, VW), pp. 1–10.

LICS-2015-FigueiraL #graph #logic #performance #query

Path Logics for Querying Graphs: Combining Expressiveness and Efficiency (DF, LL), pp. 329–340.

VMCAI-2015-NagarS #analysis #using

Path Sensitive Cache Analysis Using Cache Miss Paths (KN, YNS), pp. 43–60.

VMCAI-2015-RandourRS #probability #problem

Variations on the Stochastic Shortest Path Problem (MR, JFR, OS), pp. 1–18.

CASE-2014-FeyzabadiC #markov #process #using

Risk-aware path planning using hirerachical constrained Markov Decision Processes (SF, SC), pp. 297–303.

CASE-2014-KanagarajPL #algorithm #optimisation #process

Application of a hybridized cuckoo search-genetic algorithm to path optimization for PCB holes drilling process (GK, SGP, WCEL), pp. 373–378.

DAC-2014-ChenWLWSC #design #monitoring #scalability

Critical Path Monitor Enabled Dynamic Voltage Scaling for Graceful Degradation in Sub-Threshold Designs (YGC, TW, KYL, WYW, YS, SCC), p. 6.

DATE-2014-AdlerAABG #debugging #logic

Facilitating timing debug by logic path correspondence (OA, EA, IA, IB, IG), pp. 1–6.

DATE-2014-Pomeranz14a #fault

Substituting transition faults with path delay faults as a basic delay fault model (IP), pp. 1–6.

HT-2014-QuerciaSA #recommendation

The shortest path to happiness: recommending beautiful, quiet, and happy routes in the city (DQ, RS, LMA), pp. 116–125.

VLDB-2014-FunkeNS #on the

On k-Path Covers and their Applications (SF, AN, SS), pp. 893–902.

VLDB-2014-WuCHKLX #graph #problem

Path Problems in Temporal Graphs (HW, JC, SH, YK, YL, YX), pp. 721–732.

VLDB-2014-YangGYL #constraints #graph

Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs (YY, HG, JXY, JL), pp. 673–684.

VLDB-2014-ZhangTC

Where To: Crowd-Aided Path Selection (CJZ, YT, LC), pp. 2005–2016.

CSEET-2014-Wong #challenge #education #experience #lessons learnt #re-engineering

Experience of teaching Executive Master’s program in Software Engineering: Challenges, lessons learned, and path forward (WEW), pp. 186–187.

ESOP-2014-MatosGR #fault #named #using

REAP: Reporting Errors Using Alternative Paths (JM, JG, PR), pp. 453–472.

FASE-2014-MudduluruR #abstraction #incremental #performance #static analysis #using

Efficient Incremental Static Analysis Using Path Abstraction (RM, MKR), pp. 125–139.

CSMR-WCRE-2014-Kamiya #algorithm #execution #keyword

An algorithm for keyword search on an execution path (TK), pp. 328–332.

CSMR-WCRE-2014-PerscheidFH #debugging #execution

Follow the path: Debugging state anomalies along execution histories (MP, TF, RH), pp. 124–133.

CSMR-WCRE-2014-PerscheidH #debugging #fault #navigation #testing #tool support

Follow the path: Debugging tools for test-driven fault navigation (MP, RH), pp. 446–449.

ICPC-2014-MatsumuraIKI #execution #java #performance #visualisation

Repeatedly-executed-method viewer for efficient visualization of execution paths and states in Java (TM, TI, YK, KI), pp. 253–257.

STOC-2014-ChengJ

Shortest paths on polyhedral surfaces and terrains (SWC, JJ), pp. 373–382.

STOC-2014-HenzingerKN #algorithm #graph #reachability

Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs (MH, SK, DN), pp. 674–683.

STOC-2014-KawarabayashiKK #graph #grid #problem #theorem

An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem (KiK, YK, SK), pp. 70–78.

STOC-2014-Nanongkai #algorithm #approximate #distributed

Distributed approximation algorithms for weighted shortest paths (DN), pp. 565–573.

STOC-2014-Williams14a #complexity #performance

Faster all-pairs shortest paths via circuit complexity (RW), pp. 664–673.

ICALP-v1-2014-BjorklundH #polynomial

Shortest Two Disjoint Paths in Polynomial Time (AB, TH), pp. 211–222.

ICALP-v2-2014-Bojanczyk14a #infinity #quantifier

Weak MSO+U with Path Quantifiers over Infinite Trees (MB), pp. 38–49.

ICALP-v2-2014-BundalaO #complexity #on the

On the Complexity of Temporal-Logic Path Checking (DB, JO), pp. 86–97.

DHM-2014-Kull #using

Using the Critical Path Method in Analyzing the Interdependencies of Critical Services — Feasibility Study (AK), pp. 620–629.

HIMI-DE-2014-KoltzRRVMSB #feedback

Effects of Type and Strength of Force Feedback on the Path of Movement in a Target Selection Task (MTK, RCR, JR, KPLV, PM, TZS, VB), pp. 217–225.

LCT-NLE-2014-TaraghiSES #classification #learning #markov #multi

Markov Chain and Classification of Difficulty Levels Enhances the Learning Path in One Digit Multiplication (BT, AS, ME, MS), pp. 322–333.

ICEIS-v2-2014-MahmoudBAG #approach #learning

A New Approach Based on Learning Services to Generate Appropriate Learning Paths (CBM, FB, MHA, FG), pp. 643–646.

CIKM-2014-LiuYGS #feedback #graph #pseudo #ranking #recommendation

Meta-Path-Based Ranking with Pseudo Relevance Feedback on Heterogeneous Graph for Citation Recommendation (XL, YY, CG, YS), pp. 121–130.

ECIR-2014-LuoGWL #algorithm #classification #named #network #novel

HetPathMine: A Novel Transductive Classification Algorithm on Heterogeneous Information Networks (CL, RG, ZW, CL), pp. 210–221.

ICML-c2-2014-GiesenLW #kernel #performance #robust

Robust and Efficient Kernel Hyperparameter Paths with Guarantees (JG, SL, PW), pp. 1296–1304.

ICML-c2-2014-JawanpuriaVN #feature model #kernel #learning #multi #on the

On p-norm Path Following in Multiple Kernel Learning for Non-linear Feature Selection (PJ, MV, JSN), pp. 118–126.

ICML-c2-2014-SuzumuraOST #algorithm #robust

Outlier Path: A Homotopy Algorithm for Robust SVM (SS, KO, MS, IT), pp. 1098–1106.

ICPR-2014-BuiNLYK #detection #order #statistics #using

Boosted Stable Path for Staff-Line Detection Using Order Statistic Downscaling and Coarse-to-Fine Technique (HNB, ISN, GL, HJY, SHK), pp. 522–526.

ICPR-2014-GuptaP #adaptation

Adaptive-Threshold Region Merging via Path Scanning (GG, AP), pp. 948–953.

ICPR-2014-JinIHS #approach #using

A New Approach of Arc Skeletonization for Tree-like Objects Using Minimum Cost Path (DJ, KSI, EAH, PKS), pp. 942–947.

ICPR-2014-LandgrenOH #image #segmentation #using

A Measure of Septum Shape Using Shortest Path Segmentation in Echocardiographic Images of LVAD Patients (ML, NCO, AH), pp. 3398–3403.

ICPR-2014-RosaCJPFT #clustering #network #on the #using

On the Training of Artificial Neural Networks with Radial Basis Function Using Optimum-Path Forest Clustering (GHR, KAPC, LAPJ, JPP, AXF, JMRST), pp. 1472–1477.

ICPR-2014-SaitoAFRSGC #learning #using

Active Semi-supervised Learning Using Optimum-Path Forest (PTMS, WPA, AXF, PJdR, CTNS, JFG, MHdC), pp. 3798–3803.

KDD-2014-WangZX #estimation #using

Travel time estimation of a path using sparse trajectories (YW, YZ, YX), pp. 25–34.

KDD-2014-ZhangYZ #multi #predict

Meta-path based multi-network collective link prediction (JZ, PSY, ZHZ), pp. 1286–1295.

KDIR-2014-NielandtMBT #induction #xpath

Wrapper Induction by XPath Alignment (JN, RDM, AB, GDT), pp. 492–500.

KR-2014-BienvenuCOS #logic #query

Nested Regular Path Queries in Description Logics (MB, DC, MO, MS).

MLDM-2014-AlshdaifatCD #classification #multi

A Multi-path Strategy for Hierarchical Ensemble Classification (EA, FC, KD), pp. 198–212.

MLDM-2014-JayabalR #clustering #modelling #performance #student

Clustering Students Based on Student’s Performance — A Partial Least Squares Path Modeling (PLS-PM) Study (YJ, CR), pp. 393–407.

SIGIR-2014-KabaryS #retrieval #sketching #video

Enhancing sketch-based sport video retrieval by suggesting relevant motion paths (IAK, HS), pp. 1227–1230.

OOPSLA-2014-AminRO #dependent type

Foundations of path-dependent types (NA, TR, MO), pp. 233–249.

POPL-2014-ItzhakyBILNS #composition #effectiveness #reasoning

Modular reasoning about heap paths via effectively propositional formulas (SI, AB, NI, OL, AN, MS), pp. 385–396.

SAC-2014-HuangLD #analysis #modelling #multi #network #performance

Modeling and analysis on network performance for cloud service delivery with multiple paths (JH, JL, QD), pp. 667–673.

FSE-2014-DingesA #heuristic

Solving complex path conditions through heuristic search on induced polytopes (PD, GAA), pp. 425–436.

FSE-2014-JaffarM #control flow #graph #slicing

A path-sensitively sliced control flow graph (JJ, VM), pp. 133–143.

ICSE-2014-VakilianJ #problem #refactoring #usability

Alternate refactoring paths reveal usability problems (MV, REJ), pp. 1106–1116.

CGO-2014-ChabbiLM #tool support

Call Paths for Pin Tools (MC, XL, JMMC), p. 76.

CGO-2014-WangWP #optimisation #reduction #virtual machine

Optimizing R VM: Allocation Removal and Path Length Reduction via Interpreter-level Specialization (HW, PW, DAP), p. 295.

CGO-2014-ZengR0AJ0 #encoding #named #precise #scalability

DeltaPath: Precise and Scalable Calling Context Encoding (QZ, JR, HZ, NA, GJ, PL), p. 109.

HPCA-2014-ElTantawyMOA #architecture #control flow #gpu #multi #performance #scalability

A scalable multi-path microarchitecture for efficient GPU control flow (AE, JWM, MO, TMA), pp. 248–259.

ICTSS-2014-DwarakanathJ #test coverage

Minimum Number of Test Paths for Prime Path and Other Structural Coverage Criteria (AD, AJ), pp. 63–79.

RTA-TLCA-2014-StefanescuCMMSR #logic #reachability

All-Path Reachability Logic (AS, SC, RM, BMM, TFS, GR), pp. 425–440.

CASE-2013-FerreiraL #generative #multi #tool support #using

A method for generating tool paths for milling pockets in prismatic parts using multiple tools (JCEF, RAL), pp. 528–533.

CASE-2013-HoC #contest #design #game studies

Stackelberg game formulation of prize competition design for seeking shortest path solutions (TYH, SCC), pp. 374–379.

CASE-2013-SpensieriBC #coordination

Coordination of robot paths for cycle time minimization (DS, RB, JSC), pp. 522–527.

DAC-2013-Ghosh #memory management

Path to a TeraByte of on-chip memory for petabit per second bandwidth with < 5watts of power (SG), p. 2.

DATE-2013-ChaG #approach #detection #effectiveness #metric

Trojan detection via delay measurements: a new approach to select paths and vectors to maximize effectiveness and minimize cost (BC, SKG), pp. 1265–1270.

DATE-2013-EbrahimiDP #3d #algorithm #fault tolerance #using

Fault-tolerant routing algorithm for 3D NoC using Hamiltonian path strategy (ME, MD, JP), pp. 1601–1604.

DATE-2013-SauerRSPB #performance #satisfiability

Efficient SAT-based dynamic compaction and relaxation for longest sensitizable paths (MS, SR, TS, IP, BB), pp. 448–453.

DATE-2013-TuHC

Co-synthesis of data paths and clock control paths for minimum-period clock gating (WPT, SHH, CHC), pp. 1831–1836.

DATE-2013-ZhangYH0 #testing

Capturing post-silicon variation by layout-aware path-delay testing (XZ, JY, YH, XL), pp. 288–291.

DocEng-2013-SilvaSMB #on the #performance #xpath

On the performance of the position() XPath function (LAMdS, LLNdSJ, MM, VB), pp. 229–230.

PODS-2013-BaganBG #graph #query

A trichotomy for regular simple path queries on graphs (GB, AB, BG), pp. 261–272.

PODS-2013-Figueira #on the #testing #transitive #xpath

On XPath with transitive axes and data tests (DF), pp. 249–260.

SIGMOD-2013-AkibaIY #distance #network #performance #query #scalability

Fast exact shortest-path distance queries on large networks by pruned landmark labeling (TA, YI, YY), pp. 349–360.

SIGMOD-2013-LuoT0N

Finding time period-based most frequent path in big trajectory data (WL, HT, LC, LMN), pp. 713–724.

SIGMOD-2013-VianaM #named #network #realtime #social

FriendRouter: real-time path finder in social networks (WV, MMM), pp. 1281–1282.

SIGMOD-2013-ZhuMXLTZ #distance #network #query #theory and practice #towards

Shortest path and distance queries on road networks: towards bridging theory and practice (ADZ, HM, XX, SL, YT, SZ), pp. 857–868.

VLDB-2013-ZhouTWN #2d #learning #named #predict #probability

R2-D2: a System to Support Probabilistic Path Prediction in Dynamic Environments via “Semi-Lazy” Learning (JZ, AKHT, WW, WSN), pp. 1366–1369.

VLDB-2014-KaulWYJ13

Finding Shortest Paths on Terrains by Killing Two Birds with One Stone (MK, RCWW, BY, CSJ), pp. 73–84.

CSEET-2013-WongDFH #challenge #research

Undergraduates and research: Motivations, challenges, and the path forward (WEW, JD, GF, CH), pp. 341–345.

PLDI-2013-SankaranarayananCG #probability #source code #static analysis

Static analysis for probabilistic programs: inferring whole program properties from finitely many paths (SS, AC, SG), pp. 447–458.

STOC-2013-Bernstein #graph #maintenance

Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract] (AB), pp. 725–734.

STOC-2013-EisenstatK #algorithm #graph #linear #multi

Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs (DE, PNK), pp. 735–744.

CIAA-2013-DebarbieuxGNSZ #automaton #query #word #xml #xpath

Early Nested Word Automata for XPath Query Answering on XML Streams (DD, OG, JN, TS, MZ), pp. 292–305.

ICALP-v1-2013-BrunschR #algorithm

Finding Short Paths on Polytopes by the Shadow Vertex Algorithm (TB, HR), pp. 279–290.

ICALP-v1-2013-ChekuriNS #graph

Maximum Edge-Disjoint Paths in k-Sums of Graphs (CC, GN, FBS), pp. 328–339.

ICALP-v2-2013-BecchettiBDKM #bound #complexity #convergence #proving

Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds (LB, VB, MD, AK, KM), pp. 472–483.

LATA-2013-AlurKTY #complexity #graph #on the #problem

On the Complexity of Shortest Path Problems on Discounted Cost Graphs (RA, SK, KT, YY), pp. 44–55.

CSCW-2013-AliSN #sequence

Photographer paths: sequence alignment of geotagged photos for exploration-based route planning (AEA, SNAvS, FN), pp. 985–994.

CSCW-2013-BurtMB #network

Path dependent network advantage (RSB, JLM, JGB), pp. 1–2.

ICEIS-J-2013-DiefenthalerB13a #architecture #enterprise

From Gaps to Transformation Paths in Enterprise Architecture Planning (PD, BB), pp. 474–489.

CIKM-2013-LikhyaniB #estimation

Label constrained shortest path estimation (AL, SJB), pp. 1177–1180.

CIKM-2013-ZhangJSCDZ #classification #detection

Short text classification by detecting information path (SZ, XJ, DS, BC, XD, XZ), pp. 727–732.

KDD-2013-ZhouTWN #approach #predict #probability

A “semi-lazy” approach to probabilistic path prediction (JZ, AKHT, WW, WSN), pp. 748–756.

KDD-2013-ZhuXWL #distance #graph #performance #query #scalability

Efficient single-source shortest path and distance queries on large graphs (ADZ, XX, SW, WL), pp. 998–1006.

SIGIR-2013-GaoXX #query #random #using

Query expansion using path-constrained random walks (JG, GX, JX), pp. 563–572.

SIGIR-2013-HallCFGSAOSFGB

Information seeking in digital cultural heritage with PATHS (MMH, PDC, SF, PG, MS, EA, AO, AS, KF, JG, RB), pp. 1105–1106.

OOPSLA-2013-DEliaD #multi #profiling

Ball-Larus path profiling across multiple loop iterations (DCD, CD), pp. 373–390.

OOPSLA-2013-HerhutHSS #javascript #parallel

River trail: a path to parallelism in JavaScript (SH, RLH, TS, JS), pp. 729–744.

OOPSLA-2013-LiSWL #execution #symbolic computation

Steering symbolic execution to less traveled paths (YL, ZS, LW, XL), pp. 19–32.

PPDP-2013-YamadaKS #order #polynomial #recursion

Unifying the Knuth-Bendix, recursive path and polynomial orders (AY, KK, TS), pp. 181–192.

SAC-2013-KumarR #algorithm #data type #identification #online

Online identification of frequently executed acyclic paths by leveraging data stream algorithms (GK, SR), pp. 1694–1695.

ICSE-2013-MehlitzRV #java #tutorial

A hands-on Java PathFinder tutorial (PCM, NR, WV), pp. 1493–1495.

ICSE-2013-ZhengZ #detection #execution #static analysis #web

Path sensitive static analysis of web applications for remote code execution vulnerability detection (YZ, XZ), pp. 652–661.

SPLC-2013-ClementsRY

Barriers for SPL practice and paths to get over them (PCC, JR, KY), p. 289.

CGO-2013-ChouhanRB #interactive #profiling

Pertinent path profiling: Tracking interactions among relevant statements (RC, SR, SB), p. 12.

HPCA-2013-RhuE #control flow #execution #gpu #performance

The dual-path execution model for efficient GPU control flow (MR, ME), pp. 591–602.

ICST-2013-BagnaraCGG #float #generative #source code #testing

Symbolic Path-Oriented Test Data Generation for Floating-Point Programs (RB, MC, RG, AG), pp. 1–10.

LICS-2013-RosuSCM #logic #reachability

One-Path Reachability Logic (GR, AS, SC, BMM), pp. 358–367.

CASE-2012-KaneshigeNUMT #algorithm #mobile #online

An algorithm for on-line path planning of autonomous mobile overhead traveling crane based on obstacle information (AK, SN, SU, TM, KT), pp. 914–919.

CASE-2012-LiLCS #3d

Extended RRT-based path planning for flying robots in complex 3D environments with narrow passages (DL, QL, NC, JS), pp. 1173–1178.

CASE-2012-LiuSJT #automation #hybrid #mobile

A Floyd-Dijkstra hybrid application for mobile robot path planning in life science automation (HL, NS, SJ, KT), pp. 279–284.

CASE-2012-MitraGRCB #automation

Automated path planning for washing in digital microfluidic biochips (DM, SG, HR, KC, BBB), pp. 115–120.

CASE-2012-WangLC #algorithm #realtime

Real-time path planning for low altitude flight based on A* algorithm and TF/TA algorithm (HW, QL, NC), pp. 837–842.

CASE-2012-WikborgL #multi #petri net #problem #scheduling

Scheduling of Petri nets as a multi-objective shortest path problem (UW, TEL), pp. 212–217.

DAC-2012-GrissomB #scheduling

Path scheduling on digital microfluidic biochips (DG, PB), pp. 26–35.

DAC-2012-KengV #abstraction #debugging #design #refinement #satisfiability

Path directed abstraction and refinement in SAT-based design debugging (BK, AGV), pp. 947–954.

DAC-2012-RoyC #analysis #predict

Predicting timing violations through instruction-level path sensitization analysis (SR, KC), pp. 1074–1081.

DAC-2012-UrdahlSWK #abstraction #composition #concurrent #verification

System verification of concurrent RTL modules by compositional path predicate abstraction (JU, DS, MW, WK), pp. 334–343.

DATE-2012-BeaumontHN #architecture #execution #hardware #replication #security #using

SAFER PATH: Security architecture using fragmented execution and replication for protection against trojaned hardware (MRB, BDH, TN), pp. 1000–1005.

DATE-2012-HuangHLLLG #power management

Off-path leakage power aware routing for SRAM-based FPGAs (KH, YH, XL, BL, HL, JG), pp. 87–92.

DATE-2012-JiangSCBP #algorithm #constraints #generative #memory management #on the

On the optimality of K longest path generation algorithm under memory constraints (JJ, MS, AC, BB, IP), pp. 418–423.

DATE-2012-LiDX #process

Custom on-chip sensors for post-silicon failing path isolation in the presence of process variations (ML, AD, LX), pp. 1591–1596.

HT-2012-WeningerZH #using #web

Building enriched web page representations using link paths (TW, CZ, JH), pp. 53–62.

PODS-2012-LosemannM #complexity

The complexity of evaluating path expressions in SPARQL (KL, WM), pp. 101–112.

SIGMOD-2012-ThomsenYJ #effectiveness

Effective caching of shortest paths for location-based services (JRT, MLY, CSJ), pp. 313–324.

VLDB-2012-MouratidisY #information management

Shortest Path Computation with No Information Leakage (KM, MLY), pp. 692–703.

VLDB-2012-WuXDCZZ #distance #evaluation #network #query

Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation (LW, XX, DD, GC, ADZ, SZ), pp. 406–417.

FoSSaCS-2012-SeidlR

Extending H₁-Clauses with Path Disequalities (HS, AR), pp. 165–179.

ICPC-2012-IshioEI #data flow #interprocedural #lightweight #source code #visualisation

A lightweight visualization of interprocedural data-flow paths for source code reading (TI, SE, KI), pp. 37–46.

SAS-2012-JaffarMNS #slicing

Path-Sensitive Backward Slicing (JJ, VM, JAN, AES), pp. 231–247.

STOC-2012-AnKS #algorithm

Improving christofides’ algorithm for the s-t path TSP (HCA, RK, DBS), pp. 875–886.

LATA-2012-ForisekKS #complexity #online

Advice Complexity of Online Coloring for Paths (MF, LK, MS), pp. 228–239.

CIKM-2012-KongYDW #classification #network

Meta path-based collective classification in heterogeneous information networks (XK, PSY, YD, DJW), pp. 1567–1571.

CIKM-2012-LeePKL #graph #named #novel #ranking #recommendation

PathRank: a novel node ranking measure on a heterogeneous graph for recommender systems (SL, SP, MK, SgL), pp. 1637–1641.

CIKM-2012-YangYGL #graph #multi

Finding the optimal path over multi-cost graphs (YY, JXY, HG, JL), pp. 2124–2128.

CIKM-2012-YuSNMH #network #similarity #using

User guided entity similarity search using meta-path selection in heterogeneous information networks (XY, YS, BN, TM, JH), pp. 2025–2029.

ICML-2012-AlamgirL #distance #graph #nearest neighbour #random

Shortest path distance in random k-nearest neighbor graphs (MA, UvL), p. 163.

ICML-2012-BorboudakisT #constraints #graph #information management #network

Incorporating Causal Prior Knowledge as Path-Constraints in Bayesian Networks and Maximal Ancestral Graphs (GB, IT), p. 59.

ICML-2012-MairalY #analysis #complexity

Complexity Analysis of the Lasso Regularization Path (JM, BY), p. 238.

ICML-2012-StulpS #adaptation #matrix #policy

Path Integral Policy Improvement with Covariance Matrix Adaptation (FS, OS), p. 201.

ICPR-2012-IwashitaPFLOAT #cost analysis

Speeding up optimum-path forest training by path-cost propagation (ASI, JPP, AXF, RdAL, VMdAO, VHCdA, JMRST), pp. 1233–1236.

ICPR-2012-SongZJB #bound #robust #video

Robust video stabilization based on bounded path planning (CS, HZ, WJ, YB), pp. 3684–3687.

KDD-2012-SunNHYYY #clustering #network

Integrating meta-path selection with user-guided object clustering in heterogeneous information networks (YS, BN, JH, XY, PSY, XY), pp. 1348–1356.

KDIR-2012-TakesK #network #traversal

The Difficulty of Path Traversal in Information Networks (FWT, WAK), pp. 138–144.

SEKE-2012-LiuLLGCYL #automation #execution #parallel #testing

Parallel Path Execution for Software Testing Over Automated Test Cloud (WL, XL, FL, YG, LC, GY, ZL), pp. 279–282.

SEKE-2012-YangCXZZ #approach #multi #optimisation

A New Approach to Evaluate Path Feasibility and Coverage Ratio of EFSM Based on Multi-objective Optimization (RY, ZC, BX, ZZ, WZ), pp. 470–475.

SIGIR-2012-KahngL #graph #rdf

Exploiting paths for entity search in RDF graphs (MK, SgL), pp. 1027–1028.

TOOLS-EUROPE-J-2011-HeideggerT12 #javascript #named #testing

JSConTest: Contract-Driven Testing and Path Effect Inference for JavaScript (PH, PT), pp. 1–29.

SAC-2012-GreyRS #automation

Automatic creation of VPN backup paths for improved resilience against BGP-attackers (MG, MR, GS), pp. 613–620.

ASPLOS-2012-MartignoniMPSM #testing

Path-exploration lifting: hi-fi tests for lo-fi emulators (LM, SM, PP, DS, PM), pp. 337–348.

CGO-2012-MatosevicA #analysis #bottom-up #data access #performance #summary

Efficient bottom-up heap analysis for symbolic path-based data access summaries (IM, TSA), pp. 252–263.

ICST-2012-LiLO #algorithm #cost analysis

Better Algorithms to Minimize the Cost of Test Paths (NL, FL, JO), pp. 280–289.

ICST-2012-PasareanuB #analysis #statechart

Statechart Analysis with Symbolic PathFinder (CSP, DB), p. 772.

ISSTA-2012-StrejcekT

Abstracting path conditions (JS, MT), pp. 155–165.

SAT-2012-SlivovskyS #dependence #linear

Computing Resolution-Path Dependencies in Linear Time , (FS, SS), pp. 58–71.

TAP-2012-KosmatovW #automation #testing #tutorial

Tutorial on Automated Structural Testing with PathCrawler — (Extended Abstract) (NK, NW), p. 176.

TAP-2012-KosmatovWBRC #testing

A Lesson on Structural Testing with PathCrawler-online.com (NK, NW, BB, MR, OC), pp. 169–175.

ASE-2011-SagdeoAKV #clustering #invariant #named #using

PRECIS: Inferring invariants using program path guided clustering (PS, VA, SK, SV), pp. 532–535.

CASE-2011-DingRGS #programming

Mixed-integer programming for optimal path planning of robotic manipulators (HD, GR, DG, OS), pp. 133–138.

CASE-2011-MovafaghpourM #approach #linear #probability #programming

A linear programming approach for probabilistic robot path planning with missing information of outcomes (MAM, EM), pp. 126–132.

DAC-2011-ChungXZA #statistics #testing

Testability driven statistical path selection (JC, JX, VZ, JAA), pp. 417–422.

DAC-2011-WhatmoughDBD #power management

Error-resilient low-power DSP via path-delay shaping (PNW, SD, DMB, ID), pp. 1008–1013.

DATE-2011-AndalamRG #analysis #source code

Pruning infeasible paths for tight WCRT analysis of synchronous programs (SA, PSR, AG), pp. 204–209.

DATE-2011-BarceloGBS #estimation #performance #scalability

An efficient and scalable STA tool with direct path estimation and exhaustive sensitization vector exploration for optimal delay computation (SB, XG, SAB, JS), pp. 1602–1607.

DATE-2011-FettweisGK #towards

Entering the path towards terabit/s wireless links (GF, FG, SK), pp. 431–436.

DATE-2011-WuM #analysis #optimisation

Aging-aware timing analysis and optimization considering path sensitization (KCW, DM), pp. 1572–1577.

ICDAR-2011-DuttaLP #graph

Symbol Spotting in Line Drawings through Graph Paths Hashing (AD, JL, UP), pp. 982–986.

SIGMOD-2011-LiuW

Finding shortest path on land surface (LL, RCWW), pp. 433–444.

SIGMOD-2011-TaoSP #on the

On k-skip shortest paths (YT, CS, JP), pp. 421–432.

VLDB-2011-FurcheGGSS #named #scalability #web

OXPath: A Language for Scalable, Memory-efficient Data Extraction from Web Applications (TF, GG, GG, CS, AJS), pp. 1016–1027.

VLDB-2011-SunHYYW #named #network #similarity

PathSim: Meta Path-Based Top-K Similarity Search in Heterogeneous Information Networks (YS, JH, XY, PSY, TW), pp. 992–1003.

VLDB-2012-GaoJZYJW11 #approach #graph #relational #scalability

Relational Approach for Shortest Path Discovery over Large Graphs (JG, RJ, JZ, JXY, XJ, TW), pp. 358–369.

CSEET-2011-WongBDMOV #case study #education #experience #lessons learnt #testing

Teaching software testing: Experiences, lessons learned and the path forward (WEW, AB, VD, APM, JO, MAV), pp. 530–534.

ITiCSE-2011-VanoM #learning #quote

“Computer science and nursery rhymes”: a learning path for the middle school (DDV, CM), pp. 238–242.

ICSM-2011-JiresalCN #cobol #detection #precise #scalability #source code

Precise detection of un-initialized variables in large, real-life COBOL programs in presence of unrealizable paths (RJ, AC, RN), pp. 448–456.

WCRE-2011-KellensRNSJ #evolution #quantifier #reasoning #source code #using

Reasoning over the Evolution of Source Code Using Quantified Regular Path Expressions (AK, CDR, CN, RS, VJ), pp. 389–393.

PEPM-J-2007-CunhaV11 #query #source code #xpath

Transformation of structure-shy programs with application to XPath queries and strategic functions (AC, JV), pp. 516–539.

PLDI-2011-SrivastavaGCF #induction #synthesis

Path-based inductive synthesis for program inversion (SS, SG, SC, JSF), pp. 492–503.

STOC-2011-GiakkoupisS #matter

Optimal path search in small worlds: dimension matters (GG, NS), pp. 393–402.

STOC-2011-KawarabayashiK #algorithm #approximate #problem

Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two (KiK, YK), pp. 81–88.

CIAA-2011-GauwinN #xpath

Streamable Fragments of Forward XPath (OG, JN), pp. 3–15.

DLT-2011-HolzerKL

Nodes Connected by Path Languages (MH, MK, UL), pp. 276–287.

ICALP-v1-2011-AbrahamDFGW #algorithm

VC-Dimension and Shortest Path Algorithms (IA, DD, AF, AVG, RFFW), pp. 690–699.

DHM-2011-DAquaroMMR #game studies #question

Videogames and Elders: A New Path in LCT? (ND, DM, GM, LAR), pp. 245–254.

CIKM-2011-TretyakovAGVD #estimation #graph #performance #scalability

Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs (KT, AAC, LGB, JV, MD), pp. 1785–1794.

ICML-2011-KarasuyamaT #algorithm

Suboptimal Solution Path Algorithm for Support Vector Machine (MK, IT), pp. 473–480.

MLDM-2011-MadaniBZ #clustering #named #xml

Clust-XPaths: Clustering of XML Paths (AM, OB, DEZ), pp. 294–305.

SEKE-2011-WangL #interprocedural #profiling

A Technology of Profiling Inter-procedural Paths (LW, BL), pp. 31–36.

PADL-2011-CaballeroGS #functional #xpath

Integrating XPath with the Functional-Logic Language Toy (RC, YGR, FSP), pp. 145–159.

ESEC-FSE-2011-QiNR

Path exploration based on symbolic output (DQ, HDTN, AR), pp. 278–288.

ESEC-FSE-2011-RamamurthiRS #analysis #data flow #graph #probability #using

Probabilistic dataflow analysis using path profiles on structure graphs (AR, SR, YNS), pp. 512–515.

ICSE-2011-GenevesL #consistency #detection #ide #xml

Inconsistent path detection for XML IDEs (PG, NL), pp. 983–985.

ASPLOS-2011-ChipounovKC #analysis #framework #multi #named

S2E: a platform for in-vivo multi-path analysis of software systems (VC, VK, GC), pp. 265–278.

LCTES-2011-AlthausAN #analysis #parametricity #performance #precise

Precise and efficient parametric path analysis (EA, SA, RN), pp. 141–150.

ISSTA-2011-LeS #analysis #detection #fault #generative

Generating analyses for detecting faults in path segments (WL, MLS), pp. 320–330.

ISSTA-2011-TanejaXTH #generative #named #performance #testing

eXpress: guided path exploration for efficient regression test generation (KT, TX, NT, JdH), pp. 1–11.

ISSTA-2011-TateishiPT #analysis #higher-order #logic #monad #string

Path- and index-sensitive string analysis based on monadic second-order logic (TT, MP, OT), pp. 166–176.

RTA-2011-AvanziniEM #exponential #order #term rewriting

A Path Order for Rewrite Systems that Compute Exponential Time Functions (MA, NE, GM), pp. 123–138.

ASE-2010-PasareanuR #bytecode #execution #java #symbolic computation

Symbolic PathFinder: symbolic execution of Java bytecode (CSP, NR), pp. 179–180.

CASE-2010-DasP

Precision-based robot path planning for microassembly (AND, DOP), pp. 527–532.

CASE-2010-HassanzadehMB #algorithm #mobile #optimisation

Mobile robot path planning based on shuffled frog leaping optimization algorithm (IH, KM, MAB), pp. 680–685.

CASE-2010-LamS #hardware

Accelerating shortest path computations in hardware (SKL, TS), pp. 63–68.

CASE-2010-PaullGLM #adaptation #using

An information gain based adaptive path planning method for an autonomous underwater vehicle using sidescan sonar (LP, SSG, HL, VM), pp. 835–840.

CASE-2010-RososhanskyXL #automation #using

Coverage based tool path planning for automated polishing using contact stress theory (MR, FX, YL), pp. 592–597.

DAC-2010-Coudert #algorithm #performance #verification

An efficient algorithm to verify generalized false paths (OC), pp. 188–193.

DAC-2010-XieD #predict #variability

Representative path selection for post-silicon timing prediction under variability (LX, AD), pp. 386–391.

DATE-2010-GaoM #lazy evaluation

Enhancing double-patterning detailed routing with lazy coloring and within-path conflict avoidance (XG, LM), pp. 1279–1284.

DATE-2010-GuFP #compilation #hardware #scheduling

Path-based scheduling in a hardware compiler (RG, AF, RNP), pp. 1317–1320.

DATE-2010-LiuZYX #power management #pseudo #testing

Layout-aware pseudo-functional testing for critical paths considering power supply noise effects (XL, YZ, FY, QX), pp. 1432–1437.

DATE-2010-MehdipourHKIKMAF #quantum #scalability

Mapping scientific applications on a large-scale data-path accelerator implemented by single-flux quantum (SFQ) circuits (FM, HH, HK, KI, IK, KM, HA, AF), pp. 993–996.

DATE-2010-RaffelsieperMS #library

Checking and deriving module paths in Verilog cell library descriptions (MR, MRM, CWHS), pp. 1506–1511.

DATE-2010-Scholzel #detection #fault #performance

HW/SW co-detection of transient and permanent faults with fast recovery in statically scheduled data paths (MS), pp. 723–728.

DATE-2010-UbarDRJ #parallel #simulation

Parallel X-fault simulation with critical path tracing technique (RU, SD, JR, AJ), pp. 879–884.

HT-2010-PazD #adaptation

Providing resilient XPaths for external adaptation engines (IP, OD), pp. 67–76.

PODS-2010-BarceloHLW #query

Expressive languages for path queries over graph-structured data (PB, CAH, LL, PTW), pp. 3–14.

SIGMOD-2010-ArumugamDJPP #scalability

The DataPath system: a data-centric analytic processing engine for large data warehouses (SA, AD, CMJ, NP, LLP), pp. 519–530.

SIGMOD-2010-Wei #graph #named #performance #query

TEDI: efficient shortest path query answering on graphs (FW0), pp. 99–110.

VLDB-2010-KellarisM

Shortest Path Computation on Air Indexes (GK, KM), pp. 747–757.

VLDB-2010-ManethN #optimisation #query #xpath

XPath Whole Query Optimization (SM, KN), pp. 882–893.

VLDB-2011-OroRS10 #documentation #named #query #towards #web #xpath

SXPath — Extending XPath towards Spatial Querying on Web Documents (EO, MR, SS), pp. 129–140.

VLDB-2011-RiceT10 #graph #network #query #strict

Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions (MNR, VJT), pp. 69–80.

WCRE-2010-RupakhetiH #approach #java #similarity

An Abstraction-Oriented, Path-Based Approach for Analyzing Object Equality in Java (CRR, DH), pp. 205–214.

PLDI-2010-RuwaseCGM #correctness #optimisation #tool support

Decoupled lifeguards: enabling path optimizations for dynamic correctness checking tools (OR, SC, PBG, TCM), pp. 25–35.

DLT-2010-CarpiD #hybrid #on the #problem

On the Hybrid Cerný-Road Coloring Problem and Hamiltonian Paths (AC, FD), pp. 124–135.

ICALP-v1-2010-Georgiadis #graph #testing

Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs (LG), pp. 738–749.

LATA-2010-BalanS #incremental #problem

Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem (MSB, PS), pp. 549–560.

LATA-2010-MiloPZ #constraints #named #regular expression #sequence

SA-REPC — Sequence Alignment with Regular Expression Path Constraint (NM, TP, MZU), pp. 451–462.

CHI-2010-SambasivanCT #community #low cost #named

ViralVCD: tracing information-diffusion paths with low cost media in developing communities (NS, EC, KT), pp. 2607–2610.

CIKM-2010-CaiP #graph #named #query #reachability #scalability

Path-hop: efficiently indexing large graphs for reachability queries (JC, CKP), pp. 119–128.

CIKM-2010-GaoQJWY #graph #performance

Fast top-k simple shortest paths discovery in graphs (JG, HQ, XJ, TW, DY), pp. 509–518.

CIKM-2010-GubichevBSW #estimation #graph #performance #scalability

Fast and accurate estimation of shortest paths in large graphs (AG, SJB, SS, GW), pp. 499–508.

CIKM-2010-QiYXD #automation #generative #taxonomy

Choosing your own adventure: automatic taxonomy generation to permit many paths (XQ, DY, ZX, BDD), pp. 1853–1856.

CIKM-2010-WeningerFHM #database #web

Mapping web pages to database records via link paths (TW, FF, JH, DM), pp. 1637–1640.

ICPR-2010-CaiHTP #multi

Recovering the Topology of Multiple Cameras by Finding Continuous Paths in a Trellis (YC, KH, TT, MP), pp. 3541–3544.

ICPR-2010-DiezFSS #edit distance #normalisation

Normalized Sum-over-Paths Edit Distances (SGD, FF, MS, MS), pp. 1044–1047.

ICPR-2010-HaugeardPG #graph #image #kernel #retrieval #taxonomy

Kernel on Graphs Based on Dictionary of Paths for Image Retrieval (JEH, SPF, PHG), pp. 2965–2968.

ICPR-2010-PapaCF #classification #dataset #optimisation

Optimizing Optimum-Path Forest Classification for Huge Datasets (JPP, FAMC, AXF), pp. 4162–4165.

KDD-2010-LaoC #execution #modelling #performance #query #random #retrieval

Fast query execution for retrieval models based on path-constrained random walks (NL, WWC), pp. 881–888.

POPL-2010-HarrisSIG #program analysis #satisfiability #source code

Program analysis via satisfiability modulo path programs (WRH, SS, FI, AG), pp. 71–82.

SAC-2010-HoL #algorithm #constraints

Simulated annealing based algorithm for smooth robot path planning with different kinematic constraints (YJH, JSL), pp. 1277–1281.

SAC-2010-ShinLKLI #database #nearest neighbour #network #performance

Efficient shortest path finding of k-nearest neighbor objects in road network databases (SHS, SCL, SWK, JL, EGI), pp. 1661–1665.

FSE-2010-LeS #correlation #fault

Path-based fault correlations (WL, MLS), pp. 307–316.

SPLC-2010-McGregor #quality

The Many Paths to Quality Core Assets (JDM), p. 502.

CC-2010-RoyS #optimisation

The Hot Path SSA Form: Extending the Static Single Assignment Form for Speculative Optimizations (SR, YNS), pp. 304–323.

HPCA-2010-XekalakisC #branch #execution #multi

Handling branches in TLS systems with Multi-Path Execution (PX, MC), pp. 1–12.

ICST-2010-DelahayeBG

Explanation-Based Generalization of Infeasible Path (MD, BB, AG), pp. 215–224.

ISSTA-2010-SantelicesH #dependence #execution #multi #scalability #symbolic computation

Exploiting program dependencies for scalable multiple-path symbolic execution (RAS, MJH), pp. 195–206.

LICS-2010-BojanczykL #automaton #xpath

An Extension of Data Automata that Captures XPath (MB, SL), pp. 243–252.

LICS-2010-GuglielmiGS #logic

Breaking Paths in Atomic Flows for Classical Logic (AG, TG, LS), pp. 284–293.

LICS-2010-PlaceS #xpath

Deciding Definability in FO2(<) (or XPath) on Trees (TP, LS), pp. 253–262.

VMCAI-2010-BuZL #automaton #hybrid #programming #reachability #using #verification

Path-Oriented Reachability Verification of a Class of Nonlinear Hybrid Automata Using Convex Programming (LB, JZ, XL), pp. 78–94.

CASE-2009-LeCS #approach #assembly

A path planning approach to (dis)assembly sequencing (DTL, JC, TS), pp. 286–291.

DAC-2009-LiuYKC #algorithm

An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction (CHL, SYY, SYK, YHC), pp. 314–319.

DAC-2009-TsaiH

A false-path aware formal static timing analyzer considering simultaneous input transitions (ST, CYH), pp. 25–30.

DAC-2009-WangCSC #graph #power management #synthesis #using

Low power gated bus synthesis using shortest-path Steiner graph for system-on-chip communications (RW, NCC, BS, CKC), pp. 166–171.

DAC-2009-XiongVZ #correlation #ranking #statistics

Statistical ordering of correlated timing quantities and its application for path ranking (JX, CV, VZ), pp. 122–125.

DATE-2009-ChoudhuryM #fault #logic

Masking timing errors on speed-paths in logic circuits (MRC, KM), pp. 87–92.

DATE-2009-CostaM #approach #embedded

A MILP-based approach to path sensitization of embedded software (JCC, JCM), pp. 1568–1571.

DATE-2009-DSilvaK #detection #fixpoint #multi

Fixed points for multi-cycle path detection (VD, DK), pp. 1710–1715.

DATE-2009-HeH #algorithm #encoding #performance #verification

An efficient path-oriented bitvector encoding width computation algorithm for bit-precise verification (NH, MSH), pp. 1602–1607.

ICDAR-2009-ZhuZLN #evaluation #online #recognition

Effect of Improved Path Evaluation for On-line Handwritten Japanese Text Recognition (BZ, XDZ, CLL, MN), pp. 516–520.

PODS-2009-Figueira #satisfiability #similarity #testing #xpath

Satisfiability of downward XPath with data equality tests (DF), pp. 197–206.

PODS-2009-Parys #complexity #evaluation #linear #polynomial #xpath

XPath evaluation in linear time with polynomial combined complexity (PP), pp. 55–64.

SIGMOD-2009-ChenSZY #monitoring #nearest neighbour #network

Monitoring path nearest neighbor in road networks (ZC, HTS, XZ, JXY), pp. 591–602.

VLDB-2009-CautisDOV #performance #query #set #specification #using #xpath

Efficient Rewriting of XPath Queries Using Query Set Specifications (BC, AD, NO, VV), pp. 301–312.

VLDB-2009-SankaranarayananSA #network

Path Oracles for Spatial Networks (JS, HS, HA), pp. 1210–1221.

FASE-2009-SumnerZ #algorithm #automation

Algorithms for Automatically Computing the Causal Paths of Failures (WNS, XZ), pp. 355–369.

TACAS-2009-BjornerTV #analysis #source code #string

Path Feasibility Analysis for String-Manipulating Programs (NB, NT, AV), pp. 307–321.

ICPC-2009-Larson

A plethora of paths (EL), pp. 40–49.

SCAM-2009-QianZX #analysis #lazy evaluation

Improving Side-Effect Analysis with Lazy Access Path Resolving (JQ, YZ, BX), pp. 35–44.

CIAA-J-2008-Yen09 #composition #petri net

Path Decomposition and Semilinearity of Petri Nets (HCY), pp. 581–596.

ICALP-v2-2009-KuhtzF #ltl

LTL Path Checking Is Efficiently Parallelizable (LK, BF), pp. 235–246.

IFM-2009-YangASHSG #model checking #reduction

Dynamic Path Reduction for Software Model Checking (ZY, BAR, KAS, XH, SAS, RG), pp. 322–336.

CHI-2009-LudwigPT #interactive #novel

Path selection: a novel interaction technique for mapping applications (ML, RP, LGT), pp. 2309–2318.

HIMI-DIE-2009-SakataON

Applications of Visible Light Path Laser Projector (NS, SO, SN), pp. 611–618.

CIKM-2009-CaoQCS #feedback #query

Exploring path query results through relevance feedback (HC, YQ, KSC, MLS), pp. 1959–1962.

CIKM-2009-LeeLLZ #privacy

Navigational path privacy protection: navigational path privacy protection (KCKL, WCL, HVL, BZ), pp. 691–700.

CIKM-2009-PotamiasBCG #distance #estimation #network #performance #scalability

Fast shortest path distance estimation in large networks (MP, FB, CC, AG), pp. 867–876.

CIKM-2009-WuLACB #algebra #benchmark #generative #named #query #xpath

XQGen: an algebra-based XPath query generator for micro-benchmarking (YW, NL, RA, SC, SB), pp. 2109–2110.

ECIR-2009-LiZ #named #navigation #retrieval #web

PathRank: Web Page Retrieval with Navigation Path (JL, YZ), pp. 350–361.

KDD-2009-ShiJ #linear #statistics

Anomalous window discovery through scan statistics for linear intersecting paths (SSLIP) (LS, VPJ), pp. 767–776.

SIGIR-2009-JinW #named #ranking

CDPRanking: discovering and ranking cross-document paths between entities (WJ, XW), p. 844.

OOPSLA-2009-MytkowiczCD #profiling

Inferred call path profiling (TM, DC, AD), pp. 175–190.

PPDP-2009-PhanJ #analysis #source code

Path-sensitive region analysis for mercury programs (QP, GJ), pp. 161–170.

SAC-2009-JeonPC #energy #grid #performance

Sink-oriented dynamic location service for shortest path relay with energy efficient global grid (HJ, KP, HC), pp. 2174–2179.

SAC-2009-PhilipA #ad hoc #maintenance #network

Mobility aware path maintenance in ad hoc networks (SJP, VA), pp. 201–206.

ESEC-FSE-2009-AbadiEF #control flow #slicing

Improving slice accuracy by compression of data and control flow paths (AA, RE, YAF), pp. 223–232.

ICSE-2009-BuseW #execution

The road not taken: Estimating path execution frequency statically (RPLB, WW), pp. 144–154.

ICSE-2009-ChilimbiLMNV #debugging #effectiveness #named #performance #profiling #statistics

HOLMES: Effective statistical debugging via efficient path profiling (TMC, BL, KKM, AVN, KV), pp. 34–44.

CGO-2009-RoyS #algorithm #profiling

Profiling k-Iteration Paths: A Generalization of the Ball-Larus Profiling Algorithm (SR, YNS), pp. 70–80.

ICST-2009-BardinH #generative #testing

Pruning the Search Space in Path-Based Test Generation (SB, PH), pp. 240–249.

ICST-2009-GligoricGLMK #generative #graph #java #optimisation

Optimizing Generation of Object Graphs in Java PathFinder (MG, TG, SL, DM, SK), pp. 51–60.

ICST-2009-KalajiHS #finite #generative #state machine #testing

Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM) (ASK, RMH, SS), pp. 230–239.

RTA-2009-AvanziniM #dependence #order #polynomial

Dependency Pairs and Polynomial Path Orders (MA, GM), pp. 48–62.

TestCom-FATES-2009-GrieskampQWKC #constraints #interactive #smt #theorem proving

Interaction Coverage Meets Path Coverage by SMT Constraint Solving (WG, XQ, XW, NK, MBC), pp. 97–112.

TLCA-2009-SarnatS #induction

Lexicographic Path Induction (JS, CS), pp. 279–293.

ASE-2008-DwyerDE #cost analysis #monitoring

Reducing the Cost of Path Property Monitoring Through Sampling (MBD, MD, SGE), pp. 228–237.

CASE-2008-ChenFL #automation #bibliography #industrial #perspective #process

Automated industrial robot path planning for spray painting process: A review (HC, TAF, XL), pp. 522–527.

CASE-2008-LiYB #multi #network

Neural network based path planning for a multi-robot system with moving obstacles (HL, SXY, YB), pp. 163–168.

CASE-2008-WangZZ #generative

A force control assisted robot path generation system (JW, HZ, GZ), pp. 528–533.

DAC-2008-MoffittPLA #optimisation

Path smoothing via discrete optimization (MDM, DAP, ZL, CJA), pp. 724–727.

DAC-2008-WangLZTYTCN #scheduling

Timing yield driven clock skew scheduling considering non-Gaussian distributions of critical path delays (YW, WSL, XZ, JT, CY, JT, WC, JN), pp. 223–226.

DATE-2008-EberleG #architecture #automation #communication #design #network #power management #scalability

A scalable low-power digital communication network architecture and an automated design path for controlling the analog/RF part of SDR transceivers (WE, MG), pp. 710–715.

DATE-2008-ShahidiG #multi #testing

Multi-Vector Tests: A Path to Perfect Error-Rate Testing (SS, SG), pp. 1178–1183.

PODS-2008-BojanczykP #evaluation #linear #xpath

XPath evaluation in linear time (MB, PP), pp. 241–250.

PODS-2008-CateS #automaton #logic #transitive #xpath

XPath, transitive closure logic, and nested tree walking automata (BtC, LS), pp. 251–260.

SIGMOD-2008-BalminOST #optimisation #xpath

Grouping and optimization of XPath expressions in DB2 pureXML (AB, FÖ, AS, ET), pp. 1065–1074.

SIGMOD-2008-LillisP #xpath

Cooperative XPath caching (KL, EP), pp. 327–338.

SIGMOD-2008-LupuOT #data transformation

Paths to stardom: calibrating the potential of a peer-based data management system (ML, BCO, YCT), pp. 265–278.

TACAS-2008-BoonstoppelCE #constraints #explosion #generative #named #testing

RWset: Attacking Path Explosion in Constraint-Based Test Generation (PB, CC, DRE), pp. 351–366.

PASTE-2008-KhooFHS #static analysis #tool support

Path projection for user-centered static analysis tools (YPK, JSF, MH, VS), pp. 57–63.

PLDI-2008-DilligDA #analysis #scalability

Sound, complete and scalable path-sensitive analysis (ID, TD, AA), pp. 270–280.

SAS-2008-BalakrishnanSIWG #analysis #detection #named #refinement

SLR: Path-Sensitive Analysis through Infeasible-Path Detection and Syntactic Language Refinement (GB, SS, FI, OW, AG), pp. 238–254.

SAS-2008-RamanathanSGJ #protocol #using

Protocol Inference Using Static Path Profiles (MKR, KS, AG, SJ), pp. 78–92.

AFL-2008-KuskeL #automation #graph #recursion

Euler paths and ends in automatic and recursive graphs (DK, ML), pp. 245–256.

ICALP-A-2008-Koutis #algebra #algorithm #performance #problem

Faster Algebraic Algorithms for Path and Packing Problems (IK), pp. 575–586.

ICALP-A-2008-RodittyS #fault #sublinear

All-Pairs Shortest Paths with a Sublinear Additive Error (LR, AS), pp. 622–633.

ICFP-2008-MorihataMT #framework #query #recursion

Write it recursively: a generic framework for optimal path queries (AM, KM, MT), pp. 169–178.

ICEIS-AIDSS-2008-SofokleousA #data flow #generative #search-based #testing

Dynamic Search-Based Test Data Generation Focused on Data Flow Paths (AAS, ASA), pp. 27–35.

ICEIS-J-2008-DroopFGGLPSSSSZ08a #rdf #semantics #web #xml #xpath

Bringing the XML and Semantic Web Worlds Closer: Transforming XML into RDF and Embedding XPath into SPARQL (MD, MF, JG, SG, VL, JP, FS, MS, FS, HS, SZ), pp. 31–45.

ICML-2008-Rosset #kernel

Bi-level path following for cross validated solution of kernel quantile regression (SR), pp. 840–847.

ICPR-2008-DonateWLC #performance

Efficient and accurate subpixel path based stereo matching (AD, YW, XL, EGCJ), pp. 1–4.

KDD-2008-HastieFT #coordination

Regularization paths and coordinate descent (TH, JF, RT), p. 3.

KDD-2008-YenSMS #difference #metric #product line

A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances (LY, MS, AM, MS), pp. 785–793.

KR-2008-CalvaneseGLLR #constraints #identification #logic

Path-Based Identification Constraints in Description Logics (DC, GDG, DL, ML, RR), pp. 231–241.

SEKE-2008-BadriBS #approach #co-evolution #object-oriented #predict

Predicting Change Propagation in Object-oriented Systems: a Control-call Path Based Approach and Associated Tool (LB, MB, DSY), pp. 103–110.

SIGIR-2008-DamianiMP #flexibility #query #xml #xpath

A flexible extension of XPath to improve XML querying (ED, SM, GP), pp. 849–850.

QAPL-2008-TzanisH #logic #probability

Probabilistic Logic over Paths (ET, RH), pp. 79–96.

PADL-2008-HirzelNBV #named #pattern matching

Matchete: Paths through the Pattern Matching Jungle (MH, NN, BB, JV), pp. 150–166.

SAC-2008-Al-MansariHU #on the #semantics

On to formal semantics for path expression pointcuts (MAM, SH, RU), pp. 271–275.

SAC-2008-ShiYLZ #composition #semantics #verification #web #web service

Path-based verification for composition of semantic web services (YS, JY, ZJL, JZ), pp. 2392–2396.

SAC-2008-VellosoR #algorithm #analysis

Percolation analyses in a swarm based algorithm for shortest-path finding (BPV, MR), pp. 1861–1865.

FSE-2008-LeS #detection #named

Marple: a demand-driven path-sensitive buffer overflow detector (WL, MLS), pp. 272–282.

CC-2008-CunninghamGE

Keep Off the Grass: Locking the Right Path for Atomicity (DC, KG, SE), pp. 276–290.

CGO-2008-SalverdakZ #predict #random

Accurate critical path prediction via random trace construction (PS, CT, CBZ), pp. 64–73.

CGO-2008-ThakurG #analysis #data flow

Comprehensive path-sensitive data-flow analysis (AVT, RG), pp. 55–63.

HPCA-2008-LeeKMP #predict #using

Performance-aware speculation control using wrong path usefulness prediction (CJL, HK, OM, YNP), pp. 39–49.

HPCA-2008-MalikADF #named #predict

PaCo: Probability-based path confidence prediction (KM, MA, VD, MIF), pp. 50–61.

HPDC-2008-KhannaCKSSKF #data transfer #multi #network #optimisation #using

Multi-hop path splitting and multi-pathing optimizations for data transfers over shared wide-area networks using gridFTP (GK, ÜVÇ, TMK, PS, JHS, RK, ITF), pp. 225–226.

ISMM-2008-PizloPS #execution

Path specialization: reducing phased execution overheads (FP, EP, BS), pp. 81–90.

OSDI-2008-LiCMKRAD #named

FlightPath: Obedience vs. Choice in Cooperative Services (HCL, AC, MM, MK, LR, LA, MD), pp. 355–368.

CAV-2008-WienandWSKG #algebra #approach #correctness #proving

An Algebraic Approach for Proving Data Correctness in Arithmetic Data Paths (OW, MW, DS, WK, GMG), pp. 473–486.

CSL-2008-BlanquiJR #order

The Computability Path Ordering: The End of a Quest (FB, JPJ, AR), pp. 1–14.

ICST-2008-MouyMWG #generative #testing

Generation of All-Paths Unit Test with Function Calls (PM, BM, NW, PLG), pp. 32–41.

LICS-2008-BaierBBBG #automaton #infinity #model checking

Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata (CB, NB, PB, TB, MG), pp. 217–226.

RTA-2008-BallandM #graph grammar

Term-Graph Rewriting Via Explicit Paths (EB, PEM), pp. 32–47.

RTA-2008-Toyama #lisp #proving #recursion #term rewriting #termination

Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations (YT), pp. 381–391.

ASE-2007-JiangS #control flow #debugging #predict #statistics

Context-aware statistical debugging: from bug predictors to faulty control flow paths (LJ, ZS), pp. 184–193.

CASE-2007-XiaoWL #flexibility #simulation

Dynamic Coupling Simulation of a Power Transmission Line Inspection Robot with its Flexible Moving Path when Overcoming Obstacles (XX, GW, SL), pp. 326–331.

DAC-2007-VenkataramaniBCG #analysis

Global Critical Path: A Tool for System-Level Timing Analysis (GV, MB, TC, SCG), pp. 783–786.

DAC-2007-WenMSKOS #effectiveness #reduction #testing

Critical-Path-Aware X-Filling for Effective IR-Drop Reduction in At-Speed Scan Testing (XW, KM, TS, SK, YO, KKS), pp. 527–532.

ICDAR-2007-HanCZCZ #design #multi #online #recognition

Systematic Multi-Path HMM Topology Design for Online Handwriting Recognition of East Asian Characters (SH, MC, YZ, XC, DZ), pp. 604–608.

PODS-2007-CateL #complexity #query #xpath

The complexity of query containment in expressive fragments of XPath 2.0 (BtC, CL), pp. 73–82.

PODS-2007-FiliotNTT #polynomial #xpath

Polynomial time fragments of XPath with variables (EF, JN, JMT, ST), pp. 205–214.

SIGMOD-2007-GrustRT #off the shelf #why #xpath

Why off-the-shelf RDBMSs are better at XPath than you might expect (TG, JR, JT), pp. 949–958.

VLDB-2007-GonzalezHLMS #adaptation #approach #mining #network #performance

Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach (HG, JH, XL, MM, JPS), pp. 794–805.

TACAS-2007-AlurCC #model checking

Model Checking on Trees with Path Equivalences (RA, PC, SC), pp. 664–678.

TACAS-2007-AnandPV #execution #java #named #symbolic computation

JPF-SE: A Symbolic Execution Extension to Java PathFinder (SA, CSP, WV), pp. 134–138.

PASTE-2007-LeS #analysis #detection

Refining buffer overflow detection via demand-driven path-sensitive analysis (WL, MLS), pp. 63–68.

SCAM-2007-GutzmannLL #analysis #points-to #towards

Towards Path-Sensitive Points-to Analysis (TG, JL, WL), pp. 59–68.

SCAM-2007-LochbihlerS #dependence #graph #on the

On Temporal Path Conditions in Dependence Graphs (AL, GS), pp. 49–58.

PEPM-2007-CunhaV #query #source code #xpath

Transformation of structure-shy programs: applied to XPath queries and strategic functions (AC, JV), pp. 11–20.

PLDI-2007-BeyerHMR #invariant

Path invariants (DB, TAH, RM, AR), pp. 300–309.

PLDI-2007-GenevesLS #performance #static analysis #xml

Efficient static analysis of XML paths and types (PG, NL, AS), pp. 342–351.

STOC-2007-Chan #algorithm #graph

More algorithms for all-pairs shortest paths in weighted graphs (TMC), pp. 590–598.

STOC-2007-Pap

Some new results on node-capacitated packing of A-paths (GP), pp. 599–604.

STOC-2007-VassilevskaWY #graph

All-pairs bottleneck paths for general graphs in truly sub-cubic time (VV, RW, RY), pp. 585–589.

CIAA-J-2006-GiraudVL07 #automaton

Path-Equivalent Developments in Acyclic Weighted Automata (MG, PV, DL), pp. 799–811.

ICEIS-DISI-2007-Brunetto #information management #integration

Information systems integration during mergers — integration modes typology and integration paths (GB), pp. 71–77.

CIKM-2007-SouldatosWTDS #evaluation #query #xml

Evaluation of partial path queries on xml data (SS, XW, DT, TD, TKS), pp. 21–30.

CIKM-2007-TamashiroTV #integration #query #towards

Towards practically feasible answering of regular path queries in lav data integration (MT, AT, SV), pp. 381–390.

ICML-2007-dAspremontBG #analysis #component

Full regularization path for sparse principal component analysis (Ad, FRB, LEG), pp. 177–184.

ICML-2007-Tsuda #graph

Entire regularization paths for graph data (KT), pp. 919–926.

ICML-2007-WangYL #algorithm #kernel

A kernel path algorithm for support vector machines (GW, DYY, FHL), pp. 951–958.

SEKE-2007-FeijoFMGH #concept #modelling #named #query #xml

CXPath: a Query Language for Conceptual Models of Integrated XML Data (DdVF, CNF, ÁFM, RdMG, CAH), p. 592–?.

OOPSLA-2007-IgarashiV #scalability

Variant path types for scalable extensibility (AI, MV), pp. 113–132.

POPL-2007-Lammel #combinator #scrap your boilerplate

Scrap your boilerplate with XPath-like combinators (RL), pp. 137–142.

POPL-2007-VaswaniNC #profiling

Preferential path profiling: compactly numbering interesting paths (KV, AVN, TMC), pp. 351–362.

ESEC-FSE-2007-ChilimbiNV #effectiveness #performance #profiling #testing

Quantifying the effectiveness of testing via efficient residual path profiling (TMC, AVN, KV), pp. 545–548.

ESEC-FSE-2007-NgoT #detection #scalability

Detecting large number of infeasible paths through recognizing their patterns (MNN, HBKT), pp. 215–224.

ICSE-2007-RamanathanGJ #precedence #protocol

Path-Sensitive Inference of Function Precedence Protocols (MKR, AG, SJ), pp. 240–250.

ISMM-2007-AzimiSSWB #memory management #named

Path: page access tracking to improve memory management (RA, LS, MS, TW, ADB), pp. 31–42.

CASE-2006-NarayanasamyCT #assembly #framework

The Creation of an Information Based Manufacturing Framework for micro devices assembly: A discussion of the path planning and virtual assembly modules (GN, JC, AT), pp. 490–495.

DAC-2006-MuraliABM #fault tolerance #multi #network

A multi-path routing strategy with guaranteed in-order packet delivery and fault-tolerance for networks on chip (SM, DA, LB, GDM), pp. 845–848.

DAC-2006-SuhendraMRC #analysis #detection #performance

Efficient detection and exploitation of infeasible paths for software timing analysis (VS, TM, AR, TC), pp. 358–363.

DATE-2006-OgrasMLC #architecture #communication #optimisation

Communication architecture optimization: making the shortest path shorter in regular networks-on-chip (ÜYO, RM, HGL, NC), pp. 712–717.

DATE-2006-ZhangHC #analysis #correlation #statistics

Statistical timing analysis with path reconvergence and spatial correlations (LZ, YH, CCPC), pp. 528–532.

DocEng-2006-GenevesL #xml

Comparing XML path expressions (PG, NL), pp. 65–74.

DocEng-2006-QeliF #aspect-oriented #documentation #programming #using #xml #xpath

Filtering XML documents using XPath expressions and aspect-oriented programming (EQ, BF), pp. 85–87.

DocEng-2006-QeliGF #detection #documentation #using #xml #xpath

Customizable detection of changes for XML documents using XPath expressions (EQ, JG, BF), pp. 88–90.

PODS-2006-Cate #transitive #xpath

The expressivity of XPath with transitive closure (BtC), pp. 328–337.

PODS-2006-GyssensPGF #documentation #navigation #semantics #xpath

Structural characterizations of the semantics of XPath as navigation tool on a document (MG, JP, DVG, GHLF), pp. 318–327.

SIGMOD-2006-ChoKS #metadata #xpath

Meta-data indexing for XPath location steps (SC, NK, DS), pp. 455–466.

VLDB-2006-BalminBON #on the #performance #query #xml

On the Path to Efficient XML Queries (AB, KSB, FÖ, MN), pp. 1117–1128.

VLDB-2006-SawiresTPAAC #maintenance #xpath

Maintaining XPath Views In Loosely Coupled Systems (AS, JT, OP, DA, AEA, KSC), pp. 583–594.

ESOP-2006-LalLPL #debugging #optimisation #source code

Path Optimization in Programs and Its Application to Debugging (AL, JL, MP, BL), pp. 246–263.

PEPM-2006-HammerGK #dependence #graph

Dynamic path conditions in dependence graphs (CH, MG, JK), pp. 58–67.

SAS-2006-DhurjatiDY #analysis #data flow #refinement

Path-Sensitive Dataflow Analysis with Iterative Refinement (DD, MD, YY), pp. 425–442.

STOC-2006-ChekuriKS #constant #graph

Edge-disjoint paths in Planar graphs with constant congestion (CC, SK, FBS), pp. 757–766.

DLT-J-2005-BrlekLL06 #set

Properties of the Contour Path of Discrete Sets (SB, GL, AL), pp. 543–556.

CIAA-2006-GiraudVL #automaton #finite

Path-Equivalent Removals of epsilon-transitions in a Genomic Weighted Finite Automaton (MG, PV, DL), pp. 23–33.

ICALP-v1-2006-RaoZ #graph

Edge Disjoint Paths in Moderately Connected Graphs (SR, SZ), pp. 202–213.

ICML-2006-WangYL #2d

Two-dimensional solution path for support vector regression (GW, DYY, FHL), pp. 993–1000.

ICPR-v1-2006-BauerBSP #sequence #video

Finding Highly Frequented Paths in Video Sequences (DB, NB, SS, RPP), pp. 387–391.

ICPR-v2-2006-GorceP #algorithm #multi #performance

Fast Dichotomic Multiple Search Algorithm for Shortest Cirular Path (MdLG, NP), pp. 403–406.

ICPR-v2-2006-ThakoorJWG #classification

Occlusion Resistant Shape Classifier based onWarped Optimal Path Matching (NT, SJ, QW, JG), pp. 60–63.

ECMDA-FA-2006-FombelleBRG #consistency

Finding a Path to Model Consistency (GdF, XB, LR, MPG), pp. 101–112.

PADL-2006-QuesadaRDC #problem #using

Using Dominators for Solving Constrained Path Problems (LQ, PVR, YD, RC), pp. 73–87.

SAC-2006-ChenSC #algorithm #evaluation #query

Tree inclusion algorithm, signatures and evaluation of path-oriented queries (YC, YS, YC), pp. 1020–1025.

SAC-2006-HazelTVW #approach #named #scalability

TerraCost: a versatile and scalable approach to computing least-cost-path surfaces for massive grid-based terrains (TH, LT, JV, RW), pp. 52–57.

SAC-2006-LucraftEA #internet

Enforcing path uniqueness in internet routing (DL, AE, FA), pp. 399–403.

SAC-2006-PettovelloF #graph #named #xml #xpath

MTree: an XML XPath graph index (PMP, FF), pp. 474–481.

FSE-2006-DwyerPE #detection #fault

Controlling factors in evaluating path-sensitive error detection techniques (MBD, SP, SGE), pp. 92–104.

ASPLOS-2006-CoonsCBMK #algorithm #architecture #scheduling

A spatial path scheduling algorithm for EDGE architectures (KEC, XC, DB, KSM, SKK), pp. 129–140.

CC-2006-FangCOW #analysis #distance #reuse

Path-Based Reuse Distance Analysis (CF, SC, SÖ, ZW), pp. 32–46.

HPDC-2006-CaiKS #data type #named #network #performance #predict

IQ-Paths: Predictably High Performance Data Streams across Dynamic Network Overlays (ZC, VK, KS), pp. 18–29.

HPDC-2006-GaoSC #approximate

Path Grammar Guided Trace Compression and Trace Approximation (XG, AS, LC), pp. 57–68.

CAV-2006-SenA #model checking #testing #tool support

CUTE and jCUTE: Concolic Unit Testing and Explicit Path Model-Checking Tools (KS, GA), pp. 419–423.

IJCAR-2006-KoprowskiZ #automation #infinity #order #recursion #term rewriting

Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems (AK, HZ), pp. 332–346.

ISSTA-2006-McMinnHBT #approach #generative #testing

The species per path approach to SearchBased test data generation (PM, MH, DB, PT), pp. 13–24.

RTA-2006-Koprowski #higher-order #recursion

Certified Higher-Order Recursive Path Ordering (AK), pp. 227–241.

SAT-2006-Zhang #random

A Complete Random Jump Strategy with Guiding Paths (HZ), pp. 96–101.

ASE-2005-WangR #automation #fault #generative #locality

Automated path generation for software fault localization (TW, AR), pp. 347–351.

CASE-2005-PeddiZCC #automation #effectiveness #performance

Efficient and effective path for automated dispensing of bio-precipitant solutions (AP, YFZ, VC, MC), pp. 61–66.

CASE-2005-SchmidW #using

Path planning for a humanoid using NURBS curves (AJS, HW), pp. 351–356.

DAC-2005-KajiharaFWMHS #process

Path delay test compaction with process variation tolerance (SK, MF, XW, TM, SH, YS), pp. 845–850.

DAC-2005-SzeAHS

Path based buffer insertion (CCNS, CJA, JH, WS), pp. 509–514.

DATE-2005-BolchiniSSP #reliability #self #specification

Reliable System Specification for Self-Checking Data-Paths (CB, FS, DS, LP), pp. 1278–1283.

DATE-2005-ChandrasekarH #fault #generative #incremental #integration #learning #performance #satisfiability #testing

Integration of Learning Techniques into Incremental Satisfiability for Efficient Path-Delay Fault Test Generation (KC, MSH), pp. 1002–1007.

DATE-2005-GuoBNV #c #generative

Optimized Generation of Data-Path from C Codes for FPGAs (ZG, BB, WAN, KAV), pp. 112–117.

DATE-2005-KimWK #architecture #design #robust

owards Designing Robust QCA Architectures in the Presence of Sneak Noise Paths (KK, KW, RK), pp. 1214–1219.

DATE-2005-KumarTCJ #fault

Implicit and Exact Path Delay Fault Grading in Sequential Circuits (MMVK, ST, SC, RJ), pp. 990–995.

DATE-2005-TangWD #complexity #power management #synthesis

MINLP Based Topology Synthesis for Delta Sigma Modulators Optimized for Signal Path Complexity, Sensitivity and Power Consumption (HT, YW, AD), pp. 264–269.

DocEng-2005-GenevesR #compilation #policy #streaming #xpath

Compiling XPath for streaming access policy (PG, KHR), pp. 52–54.

ICDAR-2005-NelPH #markov #modelling #multi #using

Estimating the Pen Trajectories of Multi-Path Static Scripts Using Hidden Markov Models (EMN, JAdP, BMH), pp. 41–47.

PODS-2005-BenediktFG #satisfiability #xpath

XPath satisfiability in the presence of DTDs (MB, WF, FG), pp. 25–36.

SIGMOD-2005-TatemuraSPAC #incremental #maintenance

Incremental Maintenance of Path Expression Views (AS, JT, OP, DA, KSC), pp. 443–454.

VLDB-2005-BartaCM #data access #multi #query #summary #xml

Benefits of Path Summaries in an XML Query Optimizer Supporting Multiple Access Methods (AB, MPC, AOM), pp. 133–144.

VLDB-2005-FanYLLR #query #recursion #sql #xpath

Query Translation from XPath to SQL in the Presence of Recursive DTDs (WF, JXY, HL, JL, RR), pp. 337–348.

VLDB-2005-WangWLJLL #performance #query #using #xml

Efficient Processing of XML Path Queries Using the Disk-based F&B Index (WW, HW, HL, HJ, XL, JL), pp. 145–156.

VLDB-2005-XuO #query #using #xpath

Rewriting XPath Queries Using Materialized Views (WX, ZMÖ), pp. 121–132.

PASTE-2005-HampapuramYD #analysis #data flow #simulation

Symbolic path simulation in path-sensitive dataflow analysis (HH, YY, MD), pp. 52–58.

PLDI-2005-JhalaM #slicing

Path slicing (RJ, RM), pp. 38–47.

STOC-2005-AndrewsZ #problem

Hardness of the undirected edge-disjoint paths problem (MA, LZ), pp. 276–283.

STOC-2005-Thorup #worst-case

Worst-case update times for fully-dynamic all-pairs shortest paths (MT), pp. 112–119.

CIAA-2005-LohreyM #automaton #xpath

Tree Automata and XPath on Compressed Trees (ML, SM), pp. 225–237.

ICALP-2005-JampalaZ

Cache-Oblivious Planar Shortest Paths (HJ, NZ), pp. 563–575.

ICALP-2005-Kovacs #multi #polynomial

Polynomial Time Preemptive Sum-Multicoloring on Paths (AK), pp. 840–852.

ICALP-2005-RodittyZ #graph

Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs (LR, UZ), pp. 249–260.

IFM-2005-BensalemPQT #generative

Generating Path Conditions for Timed Systems (SB, DP, HQ, ST), pp. 5–19.

CIKM-2005-EdaOY #query #summary #xml #xpath

Processing XPath queries with XML summaries (TE, MO, MY), pp. 223–224.

CIKM-2005-MatsumuraT #evaluation #incremental #xpath

Incremental evaluation of a monotone XPath fragment (HM, KT), pp. 245–246.

CIKM-2005-ZhaoBG #mining #query #xml

Mining conserved XML query paths for dynamic-conscious caching (QZ, SSB, LG), pp. 219–220.

SAC-2005-Ahmedi #xpath

Making XPath reach for the web-wide links (LA), pp. 1714–1721.

SAC-2005-AjiliRE #approach #optimisation

A branch-price-and-propagate approach for optimizing IGP weight setting subject to unique shortest paths (FA, RR, AE), pp. 366–370.

SAC-2005-BarrettEKMS #ad hoc #multi #network #probability #protocol

Probabilistic multi-path vs. deterministic single-path protocols for dynamic ad-hoc network scenarios (CLB, SE, LK, MVM, JPS), pp. 1166–1173.

SAC-2005-StefanescuTT #distributed #evaluation #query

Distributed evaluation of generalized path queries (DCS, AT, LT), pp. 610–616.

SAC-2005-ValigianiBJLBC

Experimenting with a real-size man-hill to optimize pedagogical paths (GV, RB, YJ, EL, CBR, PC), pp. 4–8.

ESEC-FSE-2005-RenierisRR

Arithmetic program paths (MR, SR, SPR), pp. 90–98.

ESEC-FSE-2005-XieA #detection #memory management

Context- and path-sensitive memory leak detection (YX, AA), pp. 115–125.

CC-2005-Padovani #c++ #compilation #using

Compilation of Generic Regular Path Expressions Using C++ Class Templates (LP), pp. 27–42.

CGO-2005-BondM #profiling

Practical Path Profiling for Dynamic Optimizers (MDB, KSM), pp. 205–216.

CGO-2005-VaswaniTS #hardware #profiling #programmable

A Programmable Hardware Path Profiler (KV, MJT, YNS), pp. 217–228.

ASE-2004-WilliamsMM #c #generative #on the fly #testing

On-the-Fly Generation of K-Path Tests for C Functions (NW, BM, PM), pp. 290–293.

DAC-2004-WangMCA #learning #on the

On path-based learning and its applications in delay test and diagnosis (LCW, TMM, KTC, MSA), pp. 492–497.

DATE-v1-2004-NegreirosCS #low cost #testing

Low Cost Analog Testing of RF Signal Paths (MN, LC, AAS), pp. 292–297.

DATE-v1-2004-PadmanabanT #fault #identification #performance #using

Using BDDs and ZBDDs for Efficient Identification of Testable Path Delay Faults (SP, ST), pp. 50–55.

DATE-v1-2004-Wang #learning #simulation #validation

Regression Simulation: Applying Path-Based Learning In Delay Test and Post-Silicon Validation (LCW), pp. 692–695.

DocEng-2004-GenevesV #optimisation #xpath

Logic-based XPath optimization (PG, JYVD), pp. 211–219.

HT-2004-StottsF #classification #hypermedia

Language-theoretic classification of hypermedia paths (PDS, RF), pp. 40–41.

PODS-2004-Bar-YossefFJ #evaluation #memory management #on the #requirements #xml #xpath

On the Memory Requirements of XPath Evaluation over XML Streams (ZBY, MF, VJ), pp. 177–188.

PODS-2004-Marx #first-order #xpath

Conditional XPath, the First Order Complete XPath Dialect (MM), pp. 13–22.

SIGMOD-2004-ChenDZ #named #performance #xpath

BLAS: An Efficient XPath Processing System (YC, SBD, YZ), pp. 47–58.

VLDB-2004-BalminOBCP #framework #query #using #xml #xpath

A Framework for Using Materialized XPath Views in XML Query Processing (AB, FÖ, KSB, RC, HP), pp. 60–71.

VLDB-2004-ChanFZ #query #xpath

Taming XPath Queries by Minimizing Wildcard Steps (CYC, WF, YZ), pp. 156–167.

VLDB-2004-TajimaF #network #query #xpath

Answering XPath Queries over Networks by Sending Minimal Views (KT, YF), pp. 48–59.

VLDB-2004-WangJLY #estimation #xml

Bloom Histogram: Path Selectivity Estimation for XML Data with Updates (WW, HJ, HL, JXY), pp. 240–251.

FASE-2004-HeG #automation #debugging #using

Automated Debugging Using Path-Based Weakest Preconditions (HH, NG), pp. 267–280.

TACAS-2004-LindseyP #verification

Simulation-Based Verification of Autonomous Controllers via Livingstone PathFinder (AEL, CP), pp. 357–371.

ICSM-2004-Anderson

CodeSurfer/Path Inspector (PA), p. 508.

PLDI-2004-CollbergCDHKLS

Dynamic path-based software watermarking (CSC, EC, SKD, AH, JDK, CL, MS), pp. 107–118.

PLDI-2004-LiuRYSH #parametricity #query

Parametric regular path queries (YAL, TR, FY, SDS, NH), pp. 219–230.

SAS-2004-GulwaniN04a #analysis #linear

Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions (SG, GCN), pp. 328–343.

STOC-2004-Gabow

Finding paths and cycles of superpolylogarithmic length (HNG), pp. 407–416.

ICALP-2004-ArgeMT #algorithm #graph #memory management

External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs (LA, UM, LT), pp. 146–157.

ICALP-2004-BjorklundHK #approximate

Approximating Longest Directed Paths and Cycles (AB, TH, SK), pp. 222–233.

SEFM-2004-WenD #design #requirements

From Requirements Change to Design Change: A Formal Path (LW, RGD), pp. 104–113.

SEFM-2004-ZhangXW #constraints #execution #generative #symbolic computation #testing #theorem proving #using

Path-Oriented Test Data Generation Using Symbolic Execution and Constraint Solving Techniques (JZ, CX, XW), pp. 242–250.

ICFP-2004-ColazzoGMS #correctness #query #xml

Types for path correctness of XML queries (DC, GG, PM, CS), pp. 126–137.

ICGT-2004-Urvoy #composition

Composition of Path Transductions (TU), pp. 368–382.

CHI-2004-TanGSP #3d #integration #navigation #scalability

Physically large displays improve path integration in 3D virtual navigation tasks (DST, DG, PS, RP), pp. 439–446.

CIKM-2004-SigurbjornssonKR #query #xpath

Processing content-oriented XPath queries (BS, JK, MdR), pp. 371–380.

ICPR-v2-2004-JunejoJS #modelling #multi #video

Multi Feature Path Modeling for Video Surveillance (INJ, OJ, MS), pp. 716–719.

ICPR-v4-2004-Gong #estimation #programming #using

Motion Estimation using Dynamic Programming with Selective Path Search (MG), pp. 203–206.

CGO-2004-JoshiBZ #optimisation #profiling #staged

Targeted Path Profiling: Lower Overhead Path Profiling for Staged Dynamic Optimization Systems (RJ, MDB, CBZ), pp. 239–250.

CGO-2004-TallamZG #bound #profiling

Extending Path Profiling across Loop Backedges and Procedure Boundaries (ST, XZ, RG), pp. 251–264.

HPCA-2004-FernandezE #memory management

Link-Time Path-Sensitive Memory Redundancy Elimination (MF, RE), pp. 300–310.

OSDI-2004-GummadiMGLW #internet #reliability

Improving the Reliability of Internet Paths with One-hop Source Routing (PKG, HVM, SDG, HML, DW), pp. 183–198.

OSDI-2004-ZhangZPPW #internet #monitoring #named

PlanetSeer: Internet Path Failure Monitoring and Characterization in Wide-Area Services (MZ, CZ, VSP, LLP, RYW), pp. 167–182.

RTA-2004-Toyama #higher-order #lisp #term rewriting #termination

Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms (YT), pp. 40–54.

DATE-2003-OhtakeOF #algorithm #fault #generative #testing #using

A Method of Test Generation fo Path Delay Faults Using Stuck-at Fault Test Generation Algorithms (SO, KO, HF), pp. 10310–10315.

DATE-2003-PadmanabanT #fault

Non-Enumerative Path Delay Fault Diagnosis (SP, ST), pp. 10322–10327.

DocEng-2003-Vion-Dury #towards #xml #xpath

XPath on left and right sides of rules: toward compact XML tree rewriting through node patterns (JYVD), pp. 19–25.

HT-2003-BarraMS #adaptation #web

“Common” web paths in a group adaptive system (MB, DM, VS), pp. 218–219.

HT-2003-DaveKFFSDD

Browsing intricately interconnected paths (PD, UK, RF, LFR, FMSI, SD, ZD), pp. 95–103.

PODS-2003-GottlobKP #complexity #evaluation #query #xpath

The complexity of XPath query evaluation (GG, CK, RP), pp. 179–190.

PODS-2003-GrahneT #constraints #query #using

Query containment and rewriting using views for regular path queries under constraints (GG, AT), pp. 111–122.

SIGMOD-2003-GuptaS #query #xpath

Stream Processing of XPath Queries with Predicates (AKG, DS), pp. 419–430.

SIGMOD-2003-PengC #query #streaming #xpath

XPath Queries on Streaming Data (FP, SSC), pp. 431–442.

VLDB-2003-KochBG #query #xml

Path Queries on Compressed XML (PB, MG, CK), pp. 141–152.

STOC-2003-DemetrescuI #approach

A new approach to dynamic all pairs shortest paths (CD, GFI), pp. 159–166.

STOC-2003-KowalikK #constant #graph #query

Short path queries in planar graphs in constant time (LK, MK), pp. 143–148.

STOC-2003-Thorup #constant #integer #problem

Integer priority queues with decrease key in constant time and the single source shortest paths problem (MT), pp. 149–158.

CAiSE-2003-WangL #optimisation #query

Query Processing and Optimization for Regular Path Expressions (GW, ML), pp. 30–45.

KDD-2003-AliK #clustering #divide and conquer #using #web

Golden Path Analyzer: using divide-and-conquer to cluster Web clickstreams (KA, SPK), pp. 349–358.

KDD-2003-JoshiAKN #documentation #similarity #web

A bag of paths model for measuring structural similarity in Web documents (SJ, NA, RK, SN), pp. 577–582.

SEKE-2003-SuzukiT #information management #set #web

Path Set Operations for Clipping of Parts of Web Pages and Information Extraction from Web pages (TS, TT), pp. 547–554.

ESEC-FSE-2003-LivshitsL #c #context-sensitive grammar #debugging #detection #pointer #source code

Tracking pointers with path and context sensitivity for bug detection in C programs (VBL, MSL), pp. 317–326.

ESEC-FSE-2003-XieCE #analysis #detection #fault #memory management #named #using

ARCHER: using symbolic, path-sensitive analysis to detect memory access errors (YX, AC, DRE), pp. 327–336.

ICSE-2003-LawR #impact analysis

Whole Program Path-Based Dynamic Impact Analysis (JL, GR), pp. 308–318.

SOSP-2003-MahajanSWA #internet

User-level internet path diagnosis (RM, NTS, DW, TEA), pp. 106–119.

CADE-2003-RiazanovV #performance #relational #retrieval #standard

Efficient Instance Retrieval with Standard and Relational Path Indexing (AR, AV), pp. 380–396.

CAV-2003-EisnerFHLMC #logic #reasoning

Reasoning with Temporal Logic on Truncated Paths (CE, DF, JH, YL, AM, DVC), pp. 27–39.

RTA-2003-BorrallerasR #order #semantics

Monotonic AC-Compatible Semantic Path Orderings (CB, AR), pp. 279–295.

ASE-2002-Hall #concurrent #java #multi #named #profiling #thread

CPPROFJ: Aspect-Capable Call Path Profiling of Multi-Threaded Java Applications (RJH), pp. 107–116.

DAC-2002-Higuchi #detection #multi #scalability

An implication-based method to detect multi-cycle paths in large sequential circuits (HH), pp. 164–169.

DAC-2002-LiouKWC #analysis #performance #statistics #testing #validation

False-path-aware statistical timing analysis and efficient path selection for delay testing and timing validation (JJL, AK, LCW, KTC), pp. 566–569.

DAC-2002-ZengAA #identification #using

False timing path identification using ATPG techniques and delay-based information (JZ, MSA, JAA), pp. 562–565.

DATE-2002-ArrigoniDPLW #scheduling

False Path Elimination in Quasi-Static Scheduling (GA, LD, CP, LL, YW), pp. 964–970.

DATE-2002-FavalliM #fault #problem #self

Problems Due to Open Faults in the Interconnections of Self-Checking Data-Paths (MF, CM), pp. 612–617.

DATE-2002-PadmanabanT #fault #multi

Exact Grading of Multiple Path Delay Faults (SP, ST), pp. 84–88.

DATE-2002-PomeranzR #fault #multi #set #using

Test Enrichment for Path Delay Faults Using Multiple Sets of Target Faults (IP, SMR), pp. 722–729.

PODS-2002-MiklauS #equivalence #xpath

Containment and Equivalence for an XPath Fragment (GM, DS), pp. 65–76.

SIGMOD-2002-ChungMS #adaptation #named #xml

APEX: an adaptive path index for XML data (CWC, JKM, KS), pp. 121–132.

SIGMOD-2002-Grust #xpath

Accelerating XPath location steps (TG), pp. 109–120.

SIGMOD-2002-KaushikBNK #branch #query

Covering indexes for branching path queries (RK, PB, JFN, HFK), pp. 133–144.

VLDB-2002-GottlobKP #algorithm #performance #query #xpath

Efficient Algorithms for Processing XPath Queries (GG, CK, RP), pp. 95–106.

VLDB-2002-LimWPVP #estimation #markov #named #online #self #xml

XPathLearner: An On-line Self-Tuning Markov Histogram for XML Path Selectivity Estimation (LL, MW, SP, JSV, RP), pp. 442–453.

ICSM-2002-LawR #impact analysis

Path Profile-Based Dynamic Impact Analysis (JL, GR), p. 262.

PASTE-2002-ApiwattanapongH #profiling

Selective path profiling (TA, MJH), pp. 35–42.

PEPM-2002-Lu #analysis #logic programming #source code

Path dependent analysis of logic programs (LL), pp. 63–74.

PLDI-2002-DasLS #named #polynomial #verification

ESP: Path-Sensitive Program Verification in Polynomial Time (MD, SL, MS), pp. 57–68.

STOC-2002-BaswanaHS #algorithm #maintenance #transitive

Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths (SB, RH, SS), pp. 117–123.

ICALP-2002-BjorklundH

Finding a Path of Superlogarithmic Length (AB, TH), pp. 985–992.

ICALP-2002-DemetrescuI #bound #trade-off

Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths (CD, GFI), pp. 633–643.

ICALP-2002-JakobyL #problem #symmetry

Paths Problems in Symmetric Logarithmic Space (AJ, ML), pp. 269–280.

ICALP-2002-Pettie #algorithm #graph #performance

A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs (SP), pp. 85–97.

FME-2002-Fidge #analysis #assembly #control flow

Timing Analysis of Assembler Code Control-Flow Paths (CJF), pp. 370–389.

PPDP-2002-DrapeMS #dot-net #logic programming #using

Transforming the .NET intermediate language using path logic programming (SD, OdM, GS), pp. 133–144.

ICSE-2002-RobschinkS #dependence #graph #performance

Efficient path conditions in dependence graphs (TR, GS), pp. 478–488.

CADE-2002-BorrallerasLR #order #recursion

Recursive Path Orderings Can Be Context-Sensitive (CB, SL, AR), pp. 314–331.

CAV-2002-Ben-DavidGSW #design #named

PathFinder: A Tool for Design Exploration (SBD, AG, BS, YW), pp. 510–514.

DAC-2001-XiaoM #analysis #correlation #functional #identification

Functional Correlation Analysis in Crosstalk Induced Critical Paths Identification (TX, MMS), pp. 653–656.

DAC-2001-YuYW #representation #synthesis #using

Signal Representation Guided Synthesis Using Carry-Save Adders For Synchronous Data-path Circuits (ZY, MLY, ANWJ), pp. 456–461.

DATE-2001-LiuWHL #diagrams

Binary decision diagram with minimum expected path length (YYL, KHW, TH, CLL), pp. 708–712.

DATE-2001-NicoliciA #3d #design #testing #trade-off

Testability trade-offs for BIST RTL data paths: the case for three dimensional design space (NN, BMAH), p. 802.

DATE-2001-ZengABA #identification

Full chip false timing path identification: applications to the PowerPCTM microprocessors (JZ, MSA, JB, JAA), pp. 514–519.

ICDAR-2001-BloombergPM #documentation #heuristic #image #using

Document Image Decoding Using Iterated Complete Path Search with Subsampled Heuristic Scoring (DSB, KP, TPM), pp. 344–349.

ICDAR-2001-Yan #algorithm #detection #fuzzy

Detection of Curved Text Path Based on the Fuzzy Curve-Tracing (FCT) Algorithm (HY), pp. 266–270.

PODS-2001-Murata #xml

Extended Path Expressions for XML (MM).

VLDB-2001-AboulnagaAN #internet #xml

Estimating the Selectivity of XML Path Expressions for Internet Scale Applications (AA, ARA, JFN), pp. 591–600.

VLDB-2001-LiM #query #xml

Indexing and Querying XML Data for Regular Path Expressions (QL, BM), pp. 361–370.

ITiCSE-2001-SatratzemiDE #assessment #problem #visualisation

A system for program visualization and problem-solving path assessment of novice programmers (MS, VD, GE), pp. 137–140.

PASTE-2001-BallR #data flow #interprocedural #named

Bebop: a path-sensitive interprocedural dataflow engine (TB, SKR), pp. 97–103.

PLDI-2001-ZhangG #representation

Timestamped Whole Program Path Representation and its Applications (YZ, RG), pp. 180–190.

STOC-2001-Kosaraju #graph #parallel

Euler paths in series parallel graphs (SRK), pp. 237–240.

ICALP-2001-CaragiannisFKPR #network

Fractional Path Coloring with Applications to WDM Networks (IC, AF, CK, SP, HR), pp. 732–743.

ICALP-2001-Tiskin

All-Pairs Shortest Paths Computation in the BSP Model (AT), pp. 178–189.

SVIS-2001-KorhonenST #algorithm #comprehension #testing #visualisation

Understanding Algorithms by Means of Visualized Path Testing (AK, ES, JT), pp. 256–268.

KDD-2001-BerkhinBR #analysis #interactive #web

Interactive path analysis of web site traffic (PB, JDB, DJR), pp. 414–419.

SEKE-2001-BuenoJ #algorithm #automation #generative #search-based #testing #using

Automatic Test Data Generation for Program Paths Using Genetic Algorithms (PMSB, MJ), pp. 2–9.

SAC-2001-GaliassoW #algorithm #hybrid #multi #problem #search-based

A hybrid genetic algorithm for the point to multipoint routing problem with single split paths (PG, RLW), pp. 327–332.

SAC-2001-HuangH #approach #clustering

Finding a hamiltonian paths in tournaments on clusters — a provably communication-efficient approach (CHH, XH), pp. 549–553.

ESEC-FSE-2001-CoadyKFS #composition #operating system #using

Using aspectC to improve the modularity of path-specific customization in operating system code (YC, GK, MJF, GS), pp. 88–98.

CC-2001-Gregg #scheduling

Comparing Tail Duplication with Compensation Code in Single Path Global Instruction Scheduling (DG), pp. 200–212.

HPCA-2001-TuneLTC #predict

Dynamic Prediction of Critical Path Instructions (ET, DL, DMT, BC), pp. 185–195.

ICLP-2001-BeldiceanuC #constraints #product line

Revisiting the Cardinality Operator and Introducing the Cardinality-Path Constraint Family (NB, MC), pp. 59–73.

ASE-2000-BuenoJ #identification #monitoring #testing

Identification of Potentially Infeasible Program Paths by Monitoring the Search for Test Data (PMSB, MJ), pp. 209–218.

DAC-2000-BlaauwPD #graph

Removing user specified false paths from timing graphs (DB, RP, AD), pp. 270–273.

DAC-2000-Hassoun #analysis #bound #using

Critical path analysis using a dynamically bounded delay model (SH), pp. 260–265.

DAC-2000-MeguerdichianP

Watermarking while preserving the critical path (SM, MP), pp. 108–111.

DAC-2000-UmKL #fine-grained #optimisation #power management #synthesis

A fine-grained arithmetic optimization technique for high-performance/low-power data path synthesis (JU, TK, CLL), pp. 98–103.

DATE-2000-OzevBO #synthesis

Test Synthesis for Mixed-Signal SOC Paths (SO, IB, AO), pp. 128–133.

PODS-2000-CalvaneseGLV #query

View-Based Query Processing for Regular Path Queries with Inverse (DC, GDG, ML, MYV), pp. 58–66.

PLDI-2000-ChengH #analysis #composition #design #evaluation #implementation #interprocedural #pointer #using

Modular interprocedural pointer analysis using access paths: design, implementation, and evaluation (BCC, WmWH), pp. 57–69.

STOC-2000-AleksandrovMS #algorithm #approximate #geometry #problem

Approximation algorithms for geometric shortest path problems (LA, AM, JRS), pp. 286–295.

STOC-2000-ChenX #graph #query

Shortest path queries in planar graphs (DZC, JX), pp. 469–478.

STOC-2000-FederMS #graph

Finding long paths and cycles in sparse Hamiltonian graphs (TF, RM, CSS), pp. 524–529.

ICALP-2000-Hagerup #ram #word

Improved Shortest Paths on the Word RAM (TH), pp. 61–72.

ICPR-v3-2000-WinkNV #heuristic #using

Minimum Cost Path Determination Using a Simple Heuristic Function (OW, WJN, MAV), pp. 7010–7013.

KR-2000-CalvaneseGLV #query

Containment of Conjunctive Regular Path Queries with Inverse (DC, GDG, ML, MYV), pp. 176–185.

POPL-2000-CharatonikPT #program analysis

Paths vs. Trees in Set-Based Program Analysis (WC, AP, JMT), pp. 330–337.

ASPLOS-2000-DuesterwaldB #less is more #predict #profiling

Software Profiling for Hot Path Prediction: Less is More (ED, VB), pp. 202–211.

CADE-2000-BorrallerasFR #order #semantics

Complete Monotonic Semantic Path Orderings (CB, MF, AR), pp. 346–364.

RTA-2000-TakaiKS #effectiveness #finite #linear #term rewriting

Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability (TT, YK, HS), pp. 246–260.

DAC-1999-KimHT #on the #self #synthesis

On ILP Formulations for Built-In Self-Testable Data Path Synthesis (HBK, DSH, TT), pp. 742–747.

DAC-1999-RaimiA #detection

Detecting False Timing Paths: Experiments on PowerPC Microprocessors (RR, JAA), pp. 737–741.

DATE-1999-NicoliciA #hardware #performance

Efficient BIST Hardware Insertion with Low Test Application Time for Synthesized Data Paths (NN, BMAH), p. 289–?.

DATE-1999-NikolosVHT #embedded #fault #testing

Path Delay Fault Testing of ICs with Embedded Intellectual Property Blocks (DN, HTV, TH, YT), pp. 112–116.

HT-1999-MizuuchiT #web

Finding Context Paths for Web Pages (YM, KT), pp. 13–22.

PODS-1999-BunemanFW #constraints #interactive

Interaction between Path and Type Constraints (PB, WF, SW), pp. 56–67.

PODS-1999-CalvaneseGLV #query #regular expression

Rewriting of Regular Expressions and Regular Path Queries (DC, GDG, ML, MYV), pp. 194–204.

TACAS-1999-GunterP

Path Exploration Tool (ELG, DP), pp. 405–419.

PLDI-1999-Larus

Whole Program Paths (JRL), pp. 259–269.

STOC-1999-GuruswamiKRSY #algorithm #approximate #problem

Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems (VG, SK, RR, FBS, MY), pp. 19–28.

STOC-1999-Kapoor #performance

Efficient Computation of Geodesic Shortest Paths (SK), pp. 770–779.

STOC-1999-Zwick

All Pairs Lightest Shortest Paths (UZ), pp. 61–69.

DLT-1999-AndreBC #bound #decidability #on the #query

On decidability of boundedness property for regular path queries (YA, FB, ACC), pp. 245–256.

ICALP-1999-LanthierMS

Shortest Anisotropic Paths on Terrains (ML, AM, JRS), pp. 524–533.

HCI-CCAD-1999-Chiu #algorithm #approach #learning #search-based #using

Learning path planning using genetic algorithm approach (CC), pp. 71–75.

HCI-CCAD-1999-Puerta #formal method

Formalization as a path to universal accessibility (ARP), pp. 908–912.

HCI-CCAD-1999-YuCK #approximate #multi #using

Dynamic event filtering technique using multi-level path approximation in a shared virtual environment (SJY, YCC, KK), pp. 583–587.

ICEIS-1999-NicolleCY #using

Using Transformation Paths to Translate and Migrate Data (CN, NC, KY), pp. 125–131.

TOOLS-ASIA-1999-LuDD #approach #evolution #object-oriented #using

A Equivalent Object-Oriented Schema Evolution Approach Using the Path-Independence Language (JL, CD, WD), pp. 212–217.

TOOLS-PACIFIC-1999-Taniar #object-oriented #optimisation #query #traversal

Optimizing Object-Oriented Collection Join Queries through Path Traversals (DT), pp. 295–304.

CC-1999-MelskiR #interprocedural #profiling

Interprocedural Path Profiling (DM, TWR), pp. 47–62.

HPCA-1999-HagerstenK #named #scalability

WildFire: A Scalable Path for SMPs (EH, MK), pp. 172–181.

HPCA-1999-WallaceTC #multi

Instruction Recycling on a Multiple-Path Processor (SW, DMT, BC), pp. 44–53.

LICS-1999-JouannaudR #higher-order #recursion

The Higher-Order Recursive Path Ordering (JPJ, AR), pp. 402–411.

RTA-1999-NieuwenhuisR #constraints #order

Solved Forms for Path Ordering Constraints (RN, JMR), pp. 1–15.

RTA-1999-Stuber #order

Theory Path Orderings (JS), pp. 148–162.

DAC-1998-GhoshJB #analysis #testing

A BIST Scheme for RTL Controller-Data Paths Based on Symbolic Testability Analysis (IG, NKJ, SB), pp. 554–559.

DATE-1998-AntolaPS #approach #detection #fault

A Low-Redundancy Approach to Semi-Concurrent Error Detection in Data Paths (AA, VP, MS), pp. 266–272.

DATE-1998-RingeLB #satisfiability #using #verification

Path Verification Using Boolean Satisfiability (MR, TL, EB), pp. 965–966.

HT-1998-ShipmanFBCH #adaptation #case study #experience #using

Using Paths in the Classroom: Experiences and Adaptations (FMSI, RF, DB, CCC, HwH), pp. 267–270.

PODS-1998-BunemanFW #constraints #database

Path Constraints in Semistructured and Structured Databases (PB, WF, SW), pp. 129–138.

PLDI-1998-AmmonsL #analysis #data flow

Improving Data-flow Analysis with Path Profiles (GA, JRL), pp. 72–84.

STOC-1998-Kleinberg #algorithm #problem

Decision Algorithms for Unsplittable Flow and the Half-Disjoint Paths Problem (JMK), pp. 530–539.

Best-of-PLDI-1998-AmmonsL98a #analysis #data flow

Improving data-flow analysis with path profiles (with retrospective) (GA, JRL), pp. 568–582.

ICPR-1998-HuYY #algorithm #clustering #string

Algorithms for partitioning path construction of handwritten numeral strings (JH, DY, HY), pp. 372–374.

TOOLS-PACIFIC-1998-Taniar #query #traversal

Forward vs. Reverse Traversal in Path Expression Query Processing (DT), pp. 127–140.

TOOLS-USA-1998-Watkins #contract #interface #programming #using

Using Interface Definition Languages to Support Path Expressions and Programming by Contract (DW), p. 308–?.

POPL-1998-BallMS #profiling

Edge Profiling versus Path Profiling: The Showdown (TB, PM, SS), pp. 134–148.

POPL-1998-BodikA #analysis

Path-Sensitive Value-Flow Analysis (RB, SA), pp. 237–251.

SAC-1998-LazanoM #query #using

Querying virtual videos using path and temporal expressions (RL, HM), pp. 248–252.

ASPLOS-1998-StarkEP #branch #predict

Variable Length Path Branch Prediction (JS, ME, YNP), pp. 170–179.

LCTES-1998-LundqvistS #analysis #simulation #using

Integrating Path and Timing Analysis Using Instruction-Level Simulation Techniques (TL, PS), pp. 1–15.

ISSTA-1998-YangSP #parallel #source code

All-du-path Coverage for Parallel Programs (CSDY, ALS, LLP), pp. 153–162.

DAC-1997-KukimotoB #analysis #detection

Exact Required Time Analysis via False Path Detection (YK, RKB), pp. 220–225.

HT-1997-FurutaSMBH #case study #experience #hypermedia #web

Hypertext Paths and the World-Wide Web: Experiences with Walden’s Paths (RF, FMSI, CCM, DB, HwH), pp. 167–176.

PODS-1997-AbiteboulV #constraints #query

Regular Path Queries with Constraints (SA, VV), pp. 122–133.

STOC-1997-BroderFU #approach #graph #random

Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version) (AZB, AMF, EU), pp. 531–539.

ICALP-1997-EilamFZ #layout #network #problem

A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract) (TE, MF, SZ), pp. 527–537.

ICALP-1997-GarganoHP #symmetry

Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing (LG, PH, SP), pp. 505–515.

ICALP-1997-HarelS #logic #process

Computation Paths Logic: An Expressive, yet Elementary, Process Logic (abridged version) (DH, ES), pp. 408–418.

ICALP-1997-Kabanets

Recognizability Equals Definability for Partial k-Paths (VK), pp. 805–815.

OOPSLA-1997-LitmanMP #modelling #using

Modeling Dynamic Collections of Interdependent Objects Using Path-Based Rules (DJL, AM, PFPS), pp. 77–92.

TOOLS-ASIA-1997-WangMG #database #object-oriented

An Object-Oriented Environment Database for AGV Path Planing (TW, QHM, NEG), pp. 86–95.

ESEC-FSE-1997-BodikGS #data flow #using

Refining Data Flow Information Using Infeasible Paths (RB, RG, MLS), pp. 361–377.

ESEC-FSE-1997-ForgacsB #slicing

Feasible Test Path Selection by Principal Slicing (IF, AB), pp. 378–394.

HPCA-1997-YuanMG #algorithm #distributed #multi #network

Distributed Path Reservation Algorithms for Multiplexed All-Optical Interconnection Networks (XY, RGM, RG), pp. 38–47.

RTA-1997-KapurS #order #proving #term rewriting #termination

A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems (DK, GS), pp. 142–156.

DAC-1996-AraujoML #architecture #code generation #using

Using Register-Transfer Paths in Code Generation for Heterogeneous Memory-Register Architectures (GA, SM, MTCL), pp. 591–596.

DAC-1996-ChenG #fault #generative #satisfiability

A Satisfiability-Based Test Generator for Path Delay Faults in Combinational Circuts (CAC, SKG), pp. 209–214.

DAC-1996-DesaiY #cpu #design #simulation #using #verification

A Systematic Technique for Verifying Critical Path Delays in a 300MHz Alpha CPU Design Using Circuit Simulation (MPD, YTY), pp. 125–130.

DAC-1996-LinMCL #logic

Test Point Insertion: Scan Paths through Combinational Logic (CCL, MMS, KTC, MTCL), pp. 268–273.

DAC-1996-MonahanB #analysis #concurrent #optimisation

Concurrent Analysis Techniques for Data Path Timing Optimization (CM, FB), pp. 47–50.

SIGMOD-1996-ChristophidesCM #query

Evaluating Queries with Generalized Path Expressions (VC, SC, GM), pp. 413–422.

VLDB-1996-DiwanRSS #clustering

Clustering Techniques for Minimizing External Path Length (AAD, SR, SS, SS), pp. 342–353.

VLDB-1996-GardarinGT #algorithm #cost analysis #database #object-oriented

Cost-based Selection of Path Expression Processing Algorithms in Object-Oriented Databases (GG, JRG, ZHT), pp. 390–401.

STOC-1996-AggarwalKW #layout #trade-off

Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout (AA, JMK, DPW), pp. 585–594.

CIKM-1996-HuangJR #clustering #database #effectiveness #graph #query

Effective Graph Clustering for Path Queries in Digital Map Databases (YWH, NJ, EAR), pp. 215–222.

CIKM-1996-JingHR #optimisation

Hierarchical Optimization of Optimal Path Finding for Transportation Applications (NJ, YWH, EAR), pp. 261–268.

ICPR-1996-VarstaK #generative #modelling #self #using

Surface modeling and robot path generation using self-organization (MV, PK), pp. 30–34.

ASPLOS-1996-PeirHYO #performance

Improving Cache Performance with Balanced Tag and Data Paths (JKP, WWH, HCY, SO), pp. 268–278.

CADE-1996-Graf

Path Indexing for AC-Theories (PG), pp. 718–732.

ISSTA-1996-MarxF #approach #data flow #pointer #testing

The Path-Wise Approach to Data Flow Testing with Pointer Variables (DISM, PGF), pp. 135–146.

RTA-1996-JouannaudR #higher-order #normalisation #recursion

A Recursive Path Ordering for Higher-Order Terms in η-Long β-Normal Form (JPJ, AR), pp. 108–122.

DAC-1995-KassabMRT #architecture #fault #functional #simulation

Software Accelerated Functional Fault Simulation for Data-Path Architectures (MK, NM, JR, JT), pp. 333–338.

DAC-1995-LeeW #performance

A Performance and Routability Driven Router for FPGAs Considering Path Delays (YSL, ACHW), pp. 557–561.

DAC-1995-LiM #analysis #embedded #performance #using

Performance Analysis of Embedded Software Using Implicit Path Enumeration (YTSL, SM), pp. 456–461.

DAC-1995-MonahanB #evaluation #modelling

Symbolic Modeling and Evaluation of Data Paths (CM, FB), pp. 389–394.

DAC-1995-ParulkarGB #design

Data Path Allocation for Synthesizing RTL Designs with Low BIST Area Overhead (IP, SKG, MAB), pp. 395–401.

DAC-1995-SparmannLCR #fault #identification #performance #robust

Fast Identification of Robust Dependent Path Delay Faults (US, DL, KTC, SMR), pp. 119–125.

PEPM-1995-Reps #analysis #problem

Shape Analysis as a Generalized Path Problem (TWR), pp. 1–11.

STOC-1995-KavrakiLMR #query #random

Randomized query processing in robot path planning (Extended Abstract) (LEK, JCL, RM, PR), pp. 353–362.

STOC-1995-KleinbergT #approximate #network #problem

Approximations for the disjoint paths problem in high-diameter planar networks (JMK, ÉT), pp. 26–35.

ICALP-1995-ChaudhuriZ #graph #query

Shortest Path Queries in Digraphs of Small Treewidth (SC, CDZ), pp. 244–255.

ICALP-1995-Chen #algorithm #set #string

NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings (ZZC), pp. 99–110.

SAC-1995-Li #algorithm #optimisation #performance #set

An efficient algorithm for computing a minimum node cutset from a vertex-disjoint path set for timing optimization (WNL), pp. 56–60.

ICSE-1995-Quilici #legacy #reverse engineering #towards

Reverse Engineering of Legacy Systems: A Path Toward Success (AQ), pp. 333–336.

HPCA-1995-QiaoM #communication #latency #multi

Reducing Communication Latency with Path Multiplexing in Optically Interconnected Multiprocessor Systems (CQ, RGM), pp. 34–43.

LCT-RTS-1995-LiM #analysis #embedded #performance #using

Performance Analysis of Embedded Software Using Implicit Path Enumeration (YTSL, SM), pp. 88–98.

CAV-1995-EirikssonM #analysis #case study #design #using #verification

Using Formal Verification/Analysis Methods on the Critical Path in System Design: A Case Study (ÁTE, KLM), pp. 367–380.

ICLP-1995-IsozakiK #estimation #execution #logic programming #source code #transaction

Transformation of Transaction Logic Programs based on Estimation of Transaction Execution Paths (HI, HK), p. 822.

TLCA-1995-Leclerc #coq #development #multi #order #proving #term rewriting #termination

Termination Proof of Term Rewriting System with the Multiset Path Ordering. A Complete Development in the System Coq (FL), pp. 312–327.

DAC-1994-AloqeelyC #algorithm #synthesis

Sequencer-Based Data Path Synthesis of Regular Iterative Algorithms (MA, CYRC), pp. 155–160.

DAC-1994-CabodiCQ #traversal

Auxiliary Variables for Extending Symbolic Traversal Techniques to Data Paths (GC, PC, SQ), pp. 289–293.

DAC-1994-ChengC #fault #generative #quality #testing

Generation of High Quality Non-Robust Tests for Path Delay Faults (KTC, HCC), pp. 365–369.

DAC-1994-HenftlingWA #fault #simulation

Path Hashing to Accelerate Delay Fault Simulation (MH, HCW, KA), pp. 522–526.

DAC-1994-HeraguBA #fault #performance

An Efficient Path Delay Fault Coverage Estimator (KH, MLB, VDA), pp. 516–521.

DAC-1994-PomeranzR #combinator #fault #scalability #using

Design-for-Testability for Path Delay Faults in Large Combinatorial Circuits Using Test-Points (IP, SMR), pp. 358–364.

DAC-1994-SilvaS

Dynamic Search-Space Pruning Techniques in Path Sensitization (JPMS, KAS), pp. 705–711.

EDAC-1994-BrasenS #clustering

FPGA Partitioning for Critical Paths (DRB, GS), pp. 99–103.

EDAC-1994-FlottesHR #automation #specification #synthesis

Automatic Synthesis of BISTed Data Paths From High Level Specification (MLF, DH, BR), pp. 591–598.

EDAC-1994-JamoussiK #approach #evaluation #named #testing

M-Testability: An Approach for Data-Path Testability Evaluation (MJ, BK), pp. 449–455.

EDAC-1994-KimCL #refinement #synthesis #testing

A Stepwise Refinement Data Path Synthesis Procedure for Easy Testability (TK, KSC, CLL), pp. 586–590.

EDAC-1994-LinCL #fault #named #performance

TRANS: A Fast and Memory-Efficient Path Delay Fault Simulator (MCL, JEC, CLL), pp. 508–512.

EDAC-1994-SchneiderKK #verification

Control Path Oriented Verification of Sequential Generic Circuits with Control and Data Path (KS, TK, RK), pp. 648–652.

EDAC-1994-WittmannH #identification #optimisation #performance #testing

Efficient Path Identification for Delay Testing — Time and Space Optimization (HCW, MH), pp. 513–517.

PODS-1994-RamaswamyS

Path Caching: A Technique for Optimal External Searching (SR, SS), pp. 25–35.

SIGMOD-1994-IoannidisL #ambiguity

Incomplete Path Expressions and their Disambiguation (YEI, YL), pp. 138–149.

VLDB-1994-FrohnLU #data access

Access to Objects by Path Expressions and Rules (JF, GL, HU), pp. 273–284.

STOC-1994-AlonYZ #graph #named #scalability

Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (NA, RY, UZ), pp. 326–335.

STOC-1994-Cohen #approximate

Polylog-time and near-linear work approximation scheme for undirected shortest paths (EC), pp. 16–26.

STOC-1994-KleinRRS #algorithm #graph #performance

Faster shortest-path algorithms for planar graphs (PNK, SR, MRH, SS), pp. 27–37.

ICALP-1994-NikolestseasPSY #graph #multi #network #random #reliability

Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing (SEN, KVP, PGS, MY), pp. 508–519.

TAGT-1994-ArnborgP #bound #graph #subclass

A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths (SA, AP), pp. 469–486.

CHI-1994-VoraHS94a #hypermedia #interface #multi

Evaluating the influence of interface styles and multiple access paths in hypertext (PRV, MH, VLS), pp. 323–329.

CIKM-1994-LeeL #database #object-oriented #query #using

Using Path Information for Query Processing in Object-Oriented Database Systems (DLL, WCL), pp. 64–71.

SAC-1994-Wang #generative #migration #multi #scheduling

Generating a deterministic task migration path for multiprocessor scheduling (MfW), pp. 478–482.

CADE-1994-Graf

Extended Path-Indexing (PG), pp. 514–528.

CAV-1994-LamB #automaton

Criteria for the Simple Path Property in Timed Automata (WKCL, RKB), pp. 27–40.

ISSTA-1994-GoldbergWZ #analysis #testing

Applications of Feasible Path Analysis to Program Testing (AG, TCW, DZ), pp. 80–94.

ISSTA-1994-JasperBWCZ #analysis #generative #testing

Test Data Generation and Feasible Path Analysis (RJ, MB, KEW, BC, DZ), pp. 95–107.

LICS-1994-AspertiDLR #λ-calculus

Paths in the λ-calculus (AA, VD, CL, LR), pp. 426–436.

DAC-1993-ChakrabortyAB #design #fault #testing

Design for Testability for Path Delay faults in Sequential Circuits (TJC, VDA, MLB), pp. 453–457.

DAC-1993-ChakradharDPR #optimisation #using

Sequential Circuit Delay optimization Using Global Path Delays (STC, SD, MP, SGR), pp. 483–489.

DAC-1993-ChangA #named #performance

VIPER: An Efficient Vigorously Sensitizable Path Extractor (HC, JAA), pp. 112–117.

DAC-1993-EvekingH #optimisation

Optimization and Resynthesis of Complex Data-Paths (HE, SH), pp. 637–641.

DAC-1993-HuangPS #approach #approximate #heuristic #polynomial #problem

A Polynomial-Time Heuristic Approach to Approximate a Solution to the False Path Problem (STH, TMP, JMS), pp. 118–122.

DAC-1993-IqbalPDP #algebra #using

Critical Path Minimization Using Retiming and Algebraic Speed-Up (ZI, MP, SD, ACP), pp. 573–577.

DAC-1993-JoneF #identification #optimisation

Timing Optimization By Gate Resizing And Critical Path Identification (WBJ, CLF), pp. 135–140.

DAC-1993-KimL #multi #synthesis

Utilization of Multiport Memories in Data Path Synthesis (TK, CLL), pp. 298–302.

DAC-1993-LeeJW #behaviour #synthesis

Behavioral Synthesis of Highly Testable Data Paths under the Non-Scan and Partial Scan Environments (TCL, NKJ, WW), pp. 292–297.

DAC-1993-PapachristouHN #approach #synthesis

An Approach for Redesigning in Data Path Synthesis (CAP, HH, MN), pp. 419–423.

DAC-1993-PomeranzRU #fault #generative #named #testing

NEST: A Non-Enumerative Test Generation Method for Path Delay Faults in Combinational Circuits (IP, SMR, PU), pp. 439–445.

STOC-1993-BergMS #linear

Piecewise linear paths among convex obstacles (MdB, JM, OS), pp. 505–514.

STOC-1993-HershbergerS #matrix #metric

Matrix searching with the shortest path metric (JH, SS), pp. 485–494.

CIKM-1993-MehtaGPN #generative #using

The OODB Path-Method Generator (PMG) Using Precomputed Access Relevance (AM, JG, YP, EJN), pp. 596–605.

ICML-1993-CohenCBA #analysis #automation #modelling

Automating Path Analysis for Building Causal Models from Data (PRC, AC, LB, ASA), pp. 57–64.

SAC-1993-WangJ #network #segmentation

Segmentation of Merged Characters by Neural Networks and Shortest-Path (JW, JSNJ), pp. 762–769.

HPDC-1993-Pramanick #distributed #problem

Distributed Computing Solutions to the All-Pairs Shortest Path Problem (IP), pp. 196–203.

RTA-1993-AspertiL #λ-calculus

Paths, Computations and Labels in the λ-Calculus (AA, CL), pp. 152–167.

RTA-1993-Backofen #logic

Regular Path Expression in Feature Logic (RB), pp. 121–135.

RTA-1993-DelorP #commutative #order

Extension of the Associative Path Ordering to a Chain of Associative Commutative Symbols (CD, LP), pp. 389–404.

DAC-1992-ChenDC

Circuit Enhancement by Eliminating Long False Paths (HCC, DHCD, SWC), pp. 249–252.

DAC-1992-ChengCDL #optimisation #performance

The Role of Long and Short Paths in Circuit Performance Optimization (SWC, HCC, DHCD, AL), pp. 543–548.

DAC-1992-KrishnamoorthyN #using

Data Path Allocation using an Extended Binding Model (GK, JAN), pp. 279–284.

DAC-1992-PrabhuP #synthesis

Superpipelined Control and Data Path Synthesis (UP, BMP), pp. 638–643.

DAC-1992-YuS #approach #design

A Path-Oriented Approach for Reducing Hazards in Asynchronous Designs (MLY, PAS), pp. 239–244.

STOC-1992-BroderFU #graph

Existence and Construction of Edge Disjoint Paths on Expander Graphs (AZB, AMF, EU), pp. 140–149.

STOC-1992-KleinS #approximate #parallel #random

A Parallel Randomized Approximation Scheme for Shortest Paths (PNK, SS), pp. 750–758.

STOC-1992-Seidel #on the #problem

On the All-Pairs-Shortest-Path Problem (RS), pp. 745–749.

ML-1992-Chen #learning

Improving Path Planning with Learning (PCC), pp. 55–61.

TOOLS-PACIFIC-1992-GerteisW

Synchronizing Objects by Conditional Path Expressions (WG, WW), pp. 193–201.

PLILP-1992-GomardS #analysis #data type #lazy evaluation

Path Analysis for Lazy Data Structures (CKG, PS), pp. 54–68.

ICSE-1992-Hall #profiling

Call Path Profiling (RJH), pp. 296–306.

DAC-1991-BergamaschiCP #analysis #synthesis #using

Data-Path Synthesis Using Path Analysis (RAB, RC, MP), pp. 591–596.

DAC-1991-ChenDL #optimisation #performance

Critical Path Selection for Performance Optimization (HCC, DHCD, LRL), pp. 547–550.

DAC-1991-ChiuP #design #synthesis #testing

A Design for Testability Scheme with Applications to Data Path Synthesis (SC, CAP), pp. 271–277.

DAC-1991-JuS #identification #incremental

Incremental Techniques for the Identification of Statically Sensitizable Critical Paths (YCJ, RAS), pp. 541–546.

DAC-1991-LiuDC #algorithm #parallel #performance

An Efficient Parallel Critical Path Algorithm (LRL, DHCD, HCC), pp. 535–540.

DAC-1991-MaoC #design #fault

Correlation-Reduced Scan-path Design To Improve Delay Fault Coverage (WM, MDC), pp. 73–79.

DAC-1991-PapachristouCH #design #self #synthesis

A Data Path Synthesis Method for Self-Testable Designs (CAP, SC, HH), pp. 378–384.

DAC-1991-ParkK #automation #performance #scheduling

Fast and Near Optimal Scheduling in Automatic Data Path Aynthesis (ICP, CMK), pp. 680–685.

DAC-1991-SutanthavibulS #predict

Dynamic Prediction of Critical Paths and Nets for Constructive Timing-Driven Placement (SS, ES), pp. 632–635.

STOC-1991-Harel #graph #infinity

Hamiltonian Paths in Infinite Graphs (DH), pp. 220–229.

ICALP-1991-DjidjevPZ #graph

Computing Shortest Paths and Distances in Planar Graphs (HD, GEP, CDZ), pp. 327–338.

ICALP-1991-LengauerT #algorithm #performance #problem

Efficient Algorithms for Path Problems with Gernal Cost Citeria (TL, DT), pp. 314–326.

DAC-1990-CaiNSM #assembly #layout #performance

A Data Path Layout Assembler for High Performance DSP Circuits (HC, SN, PS, HDM), pp. 306–311.

DAC-1990-CompasanoB #algorithm #scheduling #synthesis #using

Synthesis Using Path-Based scheduling: algorithms and Exercises (RC, RAB), pp. 450–455.

DAC-1990-DonathNABHKLM #using

Timing Driven Placement Using Complete Path Delays (WED, RJN, BKA, SEB, SYH, JMK, PL, RIM), pp. 84–89.

DAC-1990-HuangCLH

Data Path Allocation Based on Bipartite Weighted Matching (CYH, YSC, YLL, YCH), pp. 499–504.

DAC-1990-HwangHL #constraints #heuristic #scheduling

Optimum and Heuristic Data Path Scheduling Under Resource Constraints (CTH, YCH, YLL), pp. 65–70.

DAC-1990-KucukcakarP #trade-off #using

Data Path Tradeoffs Using MABAL (KK, ACP), pp. 511–516.

DAC-1990-LyEG #synthesis

A Generalized Interconnect Model for Data Path Synthesis (TAL, WLE, EFG), pp. 168–173.

DAC-1990-RamakrishnanK #algorithm

Extension of the Critical Path Tracing Algorithm (TR, LK), pp. 720–723.

DAC-1990-Woo #synthesis

A Global, Dynamic Register Allocation and Binding for a Data Path Synthesis System (NSW), pp. 505–510.

ECHT-1990-MylonasH #hypermedia

Hypertext from the Data Point of View: Paths and Links in the Perseus Project (EM, SH), pp. 324–336.

STOC-1990-AroraLM #algorithm #network #online

On-line Algorithms for Path Selection in a Nonblocking Network (Extended Abstract) (SA, FTL, BMM), pp. 149–158.

SEKE-1990-LukZH #approach #database #named #relational

Path: An Approach to Incorporate List Processing in A Relational Database (WSL, WZ, JH), pp. 189–194.

ALP-1990-Hofbauer #multi #order #proving #recursion #termination

Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths (DH), pp. 347–358.

CADE-1990-Steinbach #order

Improving Assoviative Path Orderings (JS), pp. 411–425.

CAV-1990-NakamuraKFT #logic #using #verification

A Data Path Verifier for Register Transfer Level Using Temporal Logic Language Tokio (HN, YK, MF, HT), pp. 76–85.

DAC-1989-DuYG #analysis #on the #problem

On the General False Path Problem in Timing Analysis (DHCD, SHY, SG), pp. 555–560.

DAC-1989-LukD #layout #multi #optimisation

Multi-Stack Optimization for Data-Path Chip (Microprocessor) Layout (WKL, AAD), pp. 110–115.

DAC-1989-McGeerB89a #algorithm #network #performance

Efficient Algorithms for Computing the Longest Viable Path in a Combinational Network (PCM, RKB), pp. 561–567.

DAC-1989-PerremansCM #analysis

Static Timing Analysis of Dynamically Sensitizable Paths (SP, LJMC, HDM), pp. 568–573.

DAC-1989-PrasitjutrakulK #approach #programming

Path-Delay Constrained Floorplanning: A Mathematical Programming Approach for Initial Placement (SP, WJK), pp. 364–369.

DAC-1989-SchulzFF #fault #parallel #simulation

Parallel Pattern Fault Simulation of Path Delay Faults (MHS, FF, KF), pp. 357–363.

DAC-1989-YenDG #algorithm #analysis #performance

Efficient Algorithms for Extracting the K most Critical Paths in Timing Analysis (SHY, DHCD, SG), pp. 649–654.

HT-1989-Zellweger #documentation #hypermedia

Scripted Documents: A Hypermedia Path Mechanism (PZ), pp. 1–14.

VLDB-1989-MendelzonW #database #graph

Finding Regular Simple Paths in Graph Databases (AOM, PTW), pp. 185–193.

STOC-1989-Awerbuch #algorithm #distributed

Distributed Shortest Paths Algorithms (Extended Abstract) (BA), pp. 490–500.

ICALP-1989-PapadimitriouY

Shortest Paths Without a Map (CHP, MY), pp. 610–620.

NACLP-1989-Winsborough #analysis #multi #reachability

Path-Dependent Reachability Analysis for Multiple Specialization (WHW), pp. 133–153.

RTA-1989-Puel #order #recursion

Embedding with Patterns and Associated Recursive Path Ordering (LP), pp. 371–387.

TAV-1989-BiemanS #testing

Estimating the Number of Test Cases Required to Satisfy the All-du-paths Testing Criterion (JMB, JLS), pp. 179–186.

TAV-1989-YatesM #branch #testing

Reducing the Effects of Infeasible Paths in Branch Testing (DFY, NM), pp. 48–54.

DAC-1988-LiRS #logic #on the

On Path Selection in Combinational Logic Circuits (WNL, SMR, SS), pp. 142–147.

DAC-1988-YenGD #algorithm #analysis

A Path Selection Algorithm for Timing Analysis (HCY, SG, DHCD), pp. 720–723.

DAC-1987-HsuPK

A Path Selection Global Router (YCH, YP, WJK), pp. 641–644.

DAC-1987-KrasniewskiP #low cost #self

Circular Self-Test Path: A Low-Cost BIST Technique (AK, SP), pp. 407–415.

DAC-1987-LadjadjM #benchmark #metric

Benchmark Runs of the Subscripted D-Algorithm with Observation Path Mergers on the Brglez-Fujiwara Circuits (ML, JFM), pp. 509–515.

DAC-1987-PaulinK #automation #scheduling #synthesis

Force-Directed Scheduling in Automatic Data Path Synthesis (PGP, JPK), pp. 195–202.

STOC-1987-Clarkson #algorithm #approximate

Approximation Algorithms for Shortest Path Motion Planning (Extended Abstract) (KLC), pp. 56–65.

STOC-1987-Frederickson #approach #graph

A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract) (GNF), pp. 19–28.

STOC-1987-PelegU #graph

Constructing Disjoint Paths on Expander Graphs (Extended Abstract) (DP, EU), pp. 264–273.

ICALP-1987-GambosiNT

Posets, Boolean Representations and Quick Path Searching (GG, JN, MT), pp. 404–424.

ICALP-1987-HaferT #logic #monad #quantifier

Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree (TH, WT), pp. 269–279.

CSL-1987-RehrmannP #equivalence #problem

Deciding the Path- and Word-Fair Equivalence Problem (RR, LP), pp. 211–222.

LICS-1987-Thomas #first-order #infinity #logic #on the

On Chain Logic, Path Logic, and First-Order Logic over Infinite Trees (WT), pp. 245–256.

DAC-1986-MarshburnLBCLC #assembly #named

DATAPATH: a CMOS data path silicon assembler (TM, IL, RB, DC, GL, PC), pp. 722–729.

DAC-1986-PaulinKG #approach #automation #multi #named #synthesis

HAL: a multi-paradigm approach to automatic data path synthesis (PGP, JPK, EFG), pp. 263–270.

ICALP-1986-Felice #finite #graph #set

Finite Biprefix Sets of Path in a Graph (CdF), pp. 89–94.

CADE-1986-ButlerLMO #automation #proving #theorem proving

Paths to High-Performance Automated Theorem Proving (RB, ELL, WM, RAO), pp. 588–597.

DAC-1985-RamayyaKP #automation #canonical

An automated data path synthesizer for a canonic structure, implementable in VLSI (KR, AK, SP), pp. 381–387.

STOC-1985-Anderson #algorithm #parallel #problem

A Parallel Algorithm for the Maximal Path Problem (RA), pp. 33–37.

STOC-1985-Feldman #fault tolerance #network

Fault Tolerance of Minimal Path Routings in a Network (PF), pp. 327–334.

STOC-1985-SuzukiNS #graph #multi

Multicommodity Flows in Planar Undirected Graphs and Shortest Paths (HS, TN, NS), pp. 195–204.

ICALP-1985-LubyR #algorithm #behaviour #bidirectional

A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version) (ML, PR), pp. 394–403.

POPL-1985-AnantharamanCFM #compilation

Compiling Path Expressions into VLSI Circuits (TSA, EMC, MJF, BM), pp. 191–204.

ICSE-1985-ClarkePRZ #comparison #data flow

A Comparison of Data Flow Path Selection Criteria (LAC, AP, DJR, SJZ), pp. 244–251.

ICSE-1985-HedleyH #source code

The Causes and Effects of Infeasible Paths in Computer Programs (DH, MAH), pp. 259–267.

ICSE-1985-WhiteS #testing

Experiments Determining Best Paths for Testing Computer Program Predicates (LJW, PNS), pp. 238–243.

RTA-1985-BachmairP #order

Associative Path Orderings (LB, DAP), pp. 241–254.

RTA-1985-Rusinowitch #composition #recursion #revisited

Path of Subterms Ordering and Recursive Decomposition Ordering Revisited (MR), pp. 225–240.

DAC-1984-DunlopADJKW #layout #optimisation #using

Chip layout optimization using critical path weighting (AED, VDA, DND, MFJ, PK, MW), pp. 133–136.

DAC-1984-SabetySM #automation #generative #parallel

The semi-automatic generation of processing element control paths for highly parallel machines (TS, DES, BM), pp. 441–446.

STOC-1984-SharirS #on the

On Shortest Paths in Polyhedral Spaces (MS, AS), pp. 144–153.

DAC-1983-AbramoviciMM #fault #simulation

Critical path tracing — an alternative to fault simulation (MA, PRM, DTM), pp. 214–220.

DAC-1983-HitchcockT #automation #synthesis

A method of automatic data path synthesis (CYHI, DET), pp. 484–489.

DAC-1983-TamuraON #analysis #layout

Path delay analysis for hierarchical building block layout system (ET, KO, TN), pp. 403–410.

PODS-1983-Graham #database

Path Expressions in Databases (MHG), pp. 366–378.

DAC-1982-Agrawal #analysis

Synchronous path analysis in MOS circuit simulator (VDA), pp. 629–635.

DAC-1982-BeningLAS #analysis #logic #network

Developments in logic network path delay analysis (LB, TAL, CRA, JES), pp. 605–615.

SIGMOD-1982-DintelmanM #implementation #query

An Implementation of a Query Language Supporting Path Expressions (SMD, ATM), pp. 87–93.

SIGMOD-1982-Klug #query #statistics

Access Paths in the “ABE” Statistical Query Facility (ACK), pp. 161–173.

DAC-1981-Ji-GuangK #algorithm

An algorithm for searching shortest path by propagating wave fronts in four quadrants (XJG, TK), pp. 29–36.

DAC-1981-KamikawaiYCFT

A critical path delay check system (RK, MY, TC, KF, YT), pp. 118–123.

VLDB-1981-Karlsson

Reduced Cover-Trees and their Application in the Sabre Access Path Model (KK), pp. 345–353.

ICALP-1981-Pettorossi #order #proving #recursion #term rewriting #termination

Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems (AP), pp. 432–447.

POPL-1981-CartwrightHM #named #pointer

Paths: An Abstract Alternative to Pointers (RC, RH, PM), pp. 14–27.

ICSE-1981-ZeilW #analysis #testing

Sufficient Tset Sets for Path Analysis Testing Strategies (SJZ, LJW), pp. 184–194.

SIGMOD-1980-KatzW #database #design #physics

An Access Path Model for Physical Database Design (RHK, EW), pp. 22–29.

VLDB-1980-ShneidermanT #automation #database #query

Path Expressions for Complex Queries and Automatic Database Program Conversion (BS, GT), pp. 33–44.

STOC-1980-Bloniarz #algorithm

A Shortest-Path Algorithm with Expected Time O(n^2 log n log ^* n) (PAB), pp. 378–384.

STOC-1980-Cypher #approach #problem

An Approach to The k Paths Problem (AC), pp. 211–217.

STOC-1980-Lloyd #constraints #scheduling

Critical Path Scheduling of Task Systems with Resource and Processor Constraints (Extended Abstract) (ELL), pp. 436–446.

DAC-1979-ParkerTSBHLK #automation #design

The CMU design automation system: An example of automated data path design (ACP, DET, DPS, MB, LJH, GWL, JK), pp. 73–80.

SIGMOD-1979-SelingerACLP #database #relational

Access Path Selection in a Relational Database Management System (PGS, MMA, DDC, RAL, TGP), pp. 23–34.

VLDB-1979-Buneman #database #multi #problem

The Problem of Multiple Paths in a Database Schema (PB), pp. 368–372.

STOC-1979-GalilN #network

Network Flow and Generalized Path Compression (ZG, AN), pp. 13–26.

POPL-1979-Andler

Predicate Path Expressions (SA), pp. 226–236.

ICSE-1979-CampbellK #pascal

Path Expressions in Pascal (RHC, RBK), pp. 212–219.

SIGMOD-1978-Griffeth #database #query

Nonprocedural Query Processing for Databases with Access Paths (NDG), pp. 160–168.

SIGMOD-1978-YaoD #database #evaluation

Evaluation of Database Access Paths (SBY, DD), pp. 66–77.

ICALP-1978-Biskup #metric #turing machine

Path Measures of Turing Machine Computations (Preliminary Report) (JB), pp. 90–104.

GG-1978-CatalanoGM #algebra #framework #problem

Shortest Path Problems and Tree Grammars: An Algebraic Framework (AC, SG, UM), pp. 167–179.

SIGMOD-1977-Swartwout #database #network #specification

An Access Path Specification Language for Restructuring Network Databases (DES), pp. 88–101.

STOC-1977-YaoAR #bound #problem

An Ω(n² log n) Lower Bound to the Shortest Paths Problem (ACCY, DA, RLR), pp. 11–17.

SIGMOD-1976-CarlsonK #database #relational

A Generalized Access Path Model and its Application to a Relational Data Base System (CRC, RSK), pp. 143–154.

POPL-1975-LauerC #petri net

A Description of Path Expressions by Petri Nets (PEL, RHC), pp. 95–105.

DAC-1974-WeberS #algorithm #integer

An integer arithmetic path expansion algorithm (TAW, DGS), pp. 62–69.

SIGFIDET-1974-AstrahanG #algorithm #independence

A Search Path Selection Algorithm for the Data Independent Accessing Model (DIAM) (MMA, SPG), pp. 367–388.

DAC-1972-IraniM #design

Optimal design of central processor data paths (KBI, GAM), pp. 341–349.

DAC-1971-VishnubhotlaC #analysis #approach

A path analysis approach to the diagnosis of combinational circuits (SRV, YHC), pp. 222–230.

STOC-1970-Cook #recognition

Path Systems and Language Recognition (SAC), pp. 70–72.

DAC-1968-Heiss #algorithm #multi

A path connection algorithm for multi-layer boards (SH).