Stem branch$ (all stems)

233 papers:

CASE-2015-TanakaM #algorithm #bound #problem #strict

Dominance properties for the unrestricted block relocation problem and their application to a branch-and-bound algorithm (ST, FM), pp. 509–514.

DAC-2015-ChenTSHK #analysis #modelling #multi #reliability

Interconnect reliability modeling and analysis for multi-branch interconnect trees (HBC, SXDT, VS, XH, TK), p. 6.

DATE-2015-FaravelonFP #branch #performance #predict #simulation

Fast and accurate branch predictor simulation (AF, NF, FP), pp. 317–320.

TACAS-2015-Wijs #branch #gpu #similarity

GPU Accelerated Strong and Branching Bisimilarity Checking (AW), pp. 368–383.

ICALP-v1-2015-GoldreichGR #branch #context-free grammar #proving #proximity #source code

Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs — (Extended Abstract) (OG, TG, RDR), pp. 666–677.

ICALP-v2-2015-EtessamiSY #branch #equation #fixpoint #markov #polynomial #probability #process #reachability

Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes (KE, AS, MY), pp. 184–196.

QAPL-2015-LeeV #bisimulation #branch #congruence #probability

Rooted branching bisimulation as a congruence for probabilistic transition systems (MDL, EPdV), pp. 79–94.

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-Puffitsch #analysis #bound #branch #predict

Persistence-based branch misprediction bounds for WCET analysis (WP), pp. 1898–1905.

ESEC-FSE-2015-HuangR #branch

Finding schedule-sensitive branches (JH, LR), pp. 439–449.

SPLC-2015-MontalvilloD #branch #development #git #modelling #repository

Tuning GitHub for SPL development: branching models & repository operations for product engineers (LM, OD), pp. 111–120.

ASPLOS-2015-Sidiroglou-Douskos #automation #branch #integer #using

Targeted Automatic Integer Overflow Discovery Using Goal-Directed Conditional Branch Enforcement (SSD, EL, NR, PP, FL, DK, MCR), pp. 473–486.

CGO-2015-RohouSS #branch #performance #predict #trust

Branch prediction and the performance of interpreters: don’t trust folklore (ER, BNS, AS), pp. 103–114.

ICST-2015-ErmanTBRA #approach #automation #clustering #development #information management #multi #navigation #testing

Navigating Information Overload Caused by Automated Testing — a Clustering Approach in Multi-Branch Development (NE, VT, MB, PR, AA), pp. 1–9.

ICST-2015-PanichellaKT #branch #optimisation #problem

Reformulating Branch Coverage as a Many-Objective Optimization Problem (AP, FMK, PT), pp. 1–10.

LICS-2015-CzerwinskiJ #branch #process #similarity

Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME (WC, PJ), pp. 168–179.

LICS-2015-HeH #branch #similarity

Branching Bisimilarity on Normed BPA Is EXPTIME-Complete (CH, MH), pp. 180–191.

CASE-2014-TanakaT #algorithm #bound #performance #problem

A faster branch-and-bound algorithm for the block relocation problem (ST, KT), pp. 7–12.

DAC-2014-HamzehSV

Branch-Aware Loop Mapping on CGRAs (MH, AS, SBKV), p. 6.

VLDB-2015-InoueOT14 #branch #performance #predict #set

Faster Set Intersection with SIMD instructions by Reducing Branch Mispredictions (HI, MO, KT), pp. 293–304.

TACAS-2014-BoenderC #algorithm #branch #correctness #on the

On the Correctness of a Branch Displacement Algorithm (JB, CSC), pp. 605–619.

CSMR-WCRE-2014-DingZT #branch #detection

Detecting infeasible branches based on code patterns (SD, HZ, HBKT), pp. 74–83.

STOC-2014-ForbesSS #algebra #branch #multi #order #set #source code

Hitting sets for multilinear read-once algebraic branching programs, in any order (MAF, RS, AS), pp. 867–875.

ICALP-v2-2014-BlondinFM #branch #infinity

Handling Infinitely Branching WSTS (MB, AF, PM), pp. 13–25.

ICALP-v2-2014-YinFHHT #branch #similarity

Branching Bisimilarity Checking for PRS (QY, YF, CH, MH, XT), pp. 363–374.

CHI-2014-AndrewsB #branch #interactive #visualisation

Visualizing interactive narratives: employing a branching comic to tell a story and show its readings (DA, CB), pp. 1895–1904.

HCI-AS-2014-MoserF #branch #experience #feedback #game studies

Narrative Control and Player Experience in Role Playing Games: Decision Points and Branching Narrative Feedback (CM, XF), pp. 622–633.

ICEIS-v1-2014-SilvaSMMS #branch #design #heuristic #network #problem

A Heuristic Procedure with Local Branching for the Fixed Charge Network Design Problem with User-optimal Flow (PHGS, LGS, CAdJM, PYPM, ES), pp. 384–394.

KR-2014-Gutierrez-BasultoJ0 #branch #lightweight #logic

Lightweight Description Logics and Branching Time: A Troublesome Marriage (VGB, JCJ, TS).

LICS-CSL-2014-LazicS #branch

Non-elementary complexities for branching VASS, MELL, and extensions (RL, SS), p. 10.

SAT-2014-SonobeKI #branch #community #parallel #satisfiability

Community Branching for Parallel Portfolio SAT Solvers (TS, SK, MI), pp. 188–196.

ASE-2013-FahlandLM #mining

Mining branching-time scenarios (DF, DL, SM), pp. 443–453.

SIGMOD-2013-VlachouDNK #algorithm #bound #query

Branch-and-bound algorithm for reverse top-k queries (AV, CD, KN, YK), pp. 481–492.

FASE-2013-LeoniDG #branch #execution #process

Discovering Branching Conditions from Business Process Execution Logs (MdL, MD, LGB), pp. 114–129.

SCAM-2013-MattsenCS #bound

Driving a sound static software analyzer with branch-and-bound (SM, PC, SS), pp. 63–68.

LATA-2013-BolligCHKS #automaton #branch #communication

Dynamic Communicating Automata and Branching High-Level MSCs (BB, AC, LH, AK, TS), pp. 177–189.

VISSOFT-2013-Elsen #branch #git #named #visualisation

VisGi: Visualizing Git branches (SE), pp. 1–4.

KDD-2013-WangLSG #mining #multi

Mining evolutionary multi-branch trees from text streams (XW, SL, YS, BG), pp. 722–730.

MLDM-2013-PrieditisL #bound #classification #performance #problem #using

When Classification becomes a Problem: Using Branch-and-Bound to Improve Classification Efficiency (AP, ML), pp. 466–480.

LOPSTR-2013-Seki #logic programming #model checking #source code

Extending Co-logic Programs for Branching-Time Model Checking (HS), pp. 127–144.

PPDP-2013-AsadaHKHN #branch #calculus #finite #graph #graph transformation #monad

A parameterized graph transformation calculus for finite graphs with monadic branches (KA, SH, HK, ZH, KN), pp. 73–84.

HPCA-2013-BonannoCLMPS #branch #predict

Two level bulk preload branch prediction (JB, AC, DL, UM, BP, AS), pp. 71–82.

HPCA-2013-FarooqKJ #branch #compilation #predict

Store-Load-Branch (SLB) predictor: A compiler assisted branch prediction for data dependent branches (MUF, K, LKJ), pp. 59–70.

CASE-2012-NishimuraKM

Pathway selection mechanism of a screw drive in-pipe robot in T-branches (TN, AK, SM), pp. 612–617.

DATE-2012-Sadooghi-AlvandiAM #branch #predict #towards

Toward virtualizing branch direction prediction (MSA, KA, AM), pp. 455–460.

DATE-2012-TanLXTC #branch #energy #predict #stack

Energy-efficient branch prediction with Compiler-guided History Stack (MT, XL, ZX, DT, XC), pp. 449–454.

FASE-2012-BarrBRHGD #branch #development

Cohesive and Isolated Development with Branches (ETB, CB, PCR, AH, DMG, PTD), pp. 316–331.

FoSSaCS-2012-GollerHOW #automaton #model checking #parametricity

Branching-Time Model Checking of Parametric One-Counter Automata (SG, CH, JO, JW), pp. 406–420.

STOC-2012-DvirMPY #branch #multi #source code

Separating multilinear branching programs and formulas (ZD, GM, SP, AY), pp. 615–624.

STOC-2012-EtessamiSY #algorithm #branch #context-free grammar #multi #polynomial #probability #process

Polynomial time algorithms for multi-type branching processes and stochastic context-free grammars (KE, AS, MY), pp. 579–588.

ICALP-v1-2012-EtessamiSY #algorithm #branch #equation #markov #polynomial #probability #process

Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (KE, AS, MY), pp. 314–326.

CHI-2012-AndrewsBEK #branch #interactive #using

Creating and using interactive narratives: reading and writing branching comics (DA, CB, SE, MK), pp. 1703–1712.

FSE-2012-BirdZ #analysis #branch

Assessing the value of branches with what-if analysis (CB, TZ), p. 45.

CC-2012-FarooqCJ #branch #compilation #predict

Compiler Support for Value-Based Indirect Branch Prediction (MUF, LC, LKJ), pp. 185–199.

ICST-2012-JuzgadoVSAR #abstraction #branch #clustering #effectiveness #equivalence #testing

Comparing the Effectiveness of Equivalence Partitioning, Branch Testing and Code Reading by Stepwise Abstraction Applied by Subjects (NJJ, SV, MS, SA, IR), pp. 330–339.

IJCAR-2012-LatteL #branch #exclamation

Branching Time? Pruning Time! (ML, ML), pp. 393–407.

LICS-2012-RabinovichR #branch

Interpretations in Trees with Countably Many Branches (AR, SR), pp. 551–560.

DAC-2011-GhaniN #branch #grid #power management #using #verification

Power grid verification using node and branch dominance (NHAG, FNN), pp. 682–687.

ICSM-2011-TarvoZC #algorithm #branch #integration #mining #multi #version control

An integration resolution algorithm for mining multiple branches in version control systems (AT, TZ, JC), pp. 402–411.

ICALP-v1-2011-AllenderW #algebra #branch #on the #power of #source code

On the Power of Algebraic Branching Programs of Width Two (EA, FW), pp. 736–747.

SEFM-2011-CastroKAA #branch #fault tolerance #logic #named #verification

dCTL: A Branching Time Temporal Logic for Fault-Tolerant System Verification (PFC, CK, AA, NA), pp. 106–121.

SAC-2011-ParisiniM #branch #continuation #slicing

Improving CP-based local branching via sliced neighborhood search (FP, MM), pp. 887–892.

HPCA-2011-Seznec #branch #estimation #predict

Storage free confidence estimation for the TAGE branch predictor (AS), pp. 443–454.

CSL-2011-Vardi #branch #linear #perspective #semantics

Branching vs. Linear Time: Semantical Perspective (MYV), p. 3.

HPCA-2010-XekalakisC #branch #execution #multi

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

ICLP-2010-Parisini10 #branch #constraints #framework #programming

Local Branching in a Constraint Programming Framework (FP), pp. 286–288.

ICST-2010-Arcuri #branch #distance #how #matter #testing

It Does Matter How You Normalise the Branch Distance in Search Based Software Testing (AA), pp. 205–214.

ASE-2009-ArthoLHTY #branch #linear #model checking

Cache-Based Model Checking of Networked Applications: From Linear to Branching Time (CA, WL, MH, YT, MY), pp. 447–458.

DLT-2009-MogaveroM #logic #quantifier

Branching-Time Temporal Logics with Minimal Model Quantifiers (FM, AM), pp. 396–409.

ICALP-v1-2009-ChakaravarthyPRS #approximate #branch #multi

Approximating Decision Trees with Multiway Branches (VTC, VP, SR, YS), pp. 210–221.

SIGAda-2009-Lathrop #ada #branch #dynamic analysis #predict

Dynamic analysis of branch mispredictions in Ada (SML), pp. 79–84.

LOPSTR-2009-PettorossiPS #branch #logic #program transformation

Deciding Full Branching Time Logic by Program Transformation (AP, MP, VS), pp. 5–21.

ASPLOS-2009-BurceaM #branch #design #named

Phantom-BTB: a virtualized branch target buffer design (IB, AM), pp. 313–324.

CSL-2009-Weber #complexity #logic #on the

On the Complexity of Branching-Time Logics (VW), pp. 530–545.

SAT-2009-LarrosaNOR #bound #branch #generative #optimisation

Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates (JL, RN, AO, ERC), pp. 453–466.

ITiCSE-2008-MetrolhoC #branch #student

Branches of professional organizations a way to enrich student’s scientific and personal skills (JCM, MITC), p. 360.

MSR-2008-WilliamsS #branch #repository

Branching and merging in the repository (CCW, JS), pp. 19–22.

PEPM-2008-PuchingerS #automation #bound #source code

Automating branch-and-bound for dynamic programs (JP, PJS), pp. 81–89.

ICALP-B-2008-BrazdilFK #branch #markov #process #synthesis #verification

Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives (TB, VF, AK), pp. 148–159.

SEFM-2008-FranzleH #approximate #calculus #model checking #performance

Efficient Model Checking for Duration Calculus Based on Branching-Time Approximations (MF, MRH), pp. 63–72.

SEFM-2008-Gladisch #branch #generative #testing

Verification-Based Test Case Generation for Full Feasible Branch Coverage (CG), pp. 159–168.

ICEIS-ISAS2-2008-AlencarSAFF #approach #bound #branch

Maximizing the Business Value of Software Projects — A Branch & Bound Approach (AJA, EAS, EPdA, MCF, ALF), pp. 162–169.

QAPL-2008-TrckaG #bisimulation #branch #congruence #probability

Branching Bisimulation Congruence for Probabilistic Systems (NT, SG), pp. 129–143.

ASPLOS-2008-ChoiPT #branch #predict #thread

Accurate branch prediction for short threads (BC, LP, DMT), pp. 125–134.

CGO-2008-LeeZ

Branch-on-random (EL, CBZ), pp. 84–93.

HPCA-2008-GaoMDZ #branch #correlation #locality #novel #predict

Address-branch correlation: A novel locality for long-latency hard-to-predict branches (HG, YM, MD, HZ), pp. 74–85.

HPCA-2008-MalikASWF #independence #parallel #predict

Branch-mispredict level parallelism (BLP) for control independence (KM, MA, SSS, KMW, MIF), pp. 62–73.

LATA-2007-AblayevG #branch #complexity #quantum #simulation #source code

Classical Simulation Complexity of Quantum Branching Programs (FMA, AG), pp. 49–56.

CGO-2007-HiserWHDMC #branch

Evaluating Indirect Branch Handling Mechanisms in Software Dynamic Translation Systems (JH, DWW, WH, JWD, JM, BRC), pp. 61–73.

HPCA-2007-QuinonesPG #branch #execution #predict

Improving Branch Prediction and Predicated Execution in Out-of-Order Processors (EQ, JMP, AG), pp. 75–84.

CIAA-2006-ChengWC #analysis #bisimulation #branch #composition #on the fly

On-the-Fly Branching Bisimulation Minimization for Compositional Analysis (YPC, HYW, YRC), pp. 219–229.

QAPL-2005-BaierDG06 #branch #partial order #probability #reduction

Partial Order Reduction for Probabilistic Branching Time (CB, PRD, MG), pp. 97–116.

QAPL-2005-BartheRW06 #branch #transaction

Preventing Timing Leaks Through Transactional Branching Instructions (GB, TR, MW), pp. 33–55.

SAC-2006-Goldsztejn #algorithm #approximate #branch #set

A branch and prune algorithm for the approximation of non-linear AE-solution sets (AG), pp. 1650–1654.

CGO-2006-KimSMP #2d #branch #detection #named #set

2D-Profiling: Detecting Input-Dependent Branches with a Single Input Data Set (HK, MAS, OM, YNP), pp. 159–172.

HPDC-2006-DjerrahCCR #bound #framework #optimisation #problem

Bob++: Framework for Solving Optimization Problems with Branch-and-Bound methods (AD, BLC, VDC, CR), pp. 369–370.

LICS-2006-BrazdilBFK #game studies #probability

Stochastic Games with Branching-Time Winning Objectives (TB, VB, VF, AK), pp. 349–358.

LICS-2006-KupfermanV #logic

Memoryful Branching-Time Logic (OK, MYV), pp. 265–274.

VMCAI-2006-Bozzelli #automaton #complexity #model checking

Complexity Results on Branching-Time Pushdown Model Checking (LB), pp. 65–79.

ASE-2005-VardhanV #branch #learning #verification

Learning to verify branching time properties (AV, MV), pp. 325–328.

DATE-2005-BurguiereR #branch #modelling #predict

A Contribution to Branch Prediction Modeling in WCET Analysi (CB, CR), pp. 612–617.

FoSSaCS-2005-AbbesB #branch #probability

Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications (SA, AB), pp. 95–109.

PLDI-2005-Jimenez #branch #predict

Code placement for improving dynamic branch prediction accuracy (DAJ), pp. 107–116.

ICALP-2005-GuT #graph

Optimal Branch-Decomposition of Planar Graphs in O(n3) Time (QPG, HT), pp. 373–384.

IFM-2005-ChakiCGOSTV #specification #verification

State/Event Software Verification for Branching-Time Specifications (SC, EMC, OG, JO, NS, TT, HV), pp. 53–69.

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.

SAT-2005-Coste-MarquisBL #branch #heuristic #quantifier

A Branching Heuristics for Quantified Renamable Horn Formulas (SCM, DLB, FL), pp. 393–399.

SAT-2005-MneimnehLASS #algorithm #bound #satisfiability

A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas (MNM, IL, ZSA, JPMS, KAS), pp. 467–474.

ASE-2004-KhorG #algorithm #automation #branch #concept analysis #search-based #testing #using

Using a Genetic Algorithm and Formal Concept Analysis to Generate Branch Coverage Test Data Automatically (SK, PG), pp. 346–349.

ICALP-2004-AlfaroFS #branch #linear #metric

Linear and Branching Metrics for Quantitative Transition Systems (LdA, MF, MS), pp. 97–109.

HPCA-2004-AkkarySKPR #branch #estimation

Perceptron-Based Branch Confidence Estimation (HA, STS, RK, YP, WR), pp. 265–275.

HPCA-2004-GandhiAS #branch #predict

Reducing Branch Misprediction Penalty via Selective Branch Recovery (AG, HA, STS), pp. 254–264.

LICS-2004-DamsN #abstraction #branch #finite #model checking

The Existence of Finite Abstractions for Branching Time Model Checking (DD, KSN), pp. 335–344.

DATE-2003-GuptaDGN #branch #design #synthesis

Dynamic Conditional Branch Balancing during the High-Level Synthesis of Control-Intensive Designs (SG, NDD, RKG, AN), pp. 10270–10275.

FASE-2003-Muccini #branch #detection

Detecting Implied Scenarios Analyzing Non-local Branching Choices (HM), pp. 372–386.

TACAS-2003-BerthomieuV #analysis #branch #petri net

State Class Constructions for Branching Analysis of Time Petri Nets (BB, FV), pp. 442–457.

TACAS-2003-KhomenkoK #branch #petri net #process

Branching Processes of High-Level Petri Nets (VK, MK), pp. 458–472.

PLDI-2003-ErtlG #branch #optimisation #predict #virtual machine

Optimizing indirect branch prediction accuracy in virtual machine interpreters (MAE, DG), pp. 278–288.

CIAA-2003-KuskeM #automaton #branch #parallel

Branching Automata with Costs — A Way of Reflecting Parallelism in Costs (DK, IM), pp. 150–162.

DLT-2003-DrewesE #branch

Branching Grammars: A Generalization of ET0L Systems (FD, JE), pp. 266–278.

ICALP-2003-Schnoebelen #model checking

Oracle Circuits for Branching-Time Model Checking (PS), pp. 790–801.

HPCA-2003-ChenDA #branch #data flow #dependence #predict

Dynamic Data Dependence Tracking and its Application to Branch Prediction (LC, SD, DHA), pp. 65–76.

HPCA-2003-Jimenez #branch #predict

Reconsidering Complex Branch Predictors (DAJ), pp. 43–52.

HPCA-2003-SimonCF #branch #predict

Incorporating Predicate Information into Branch Predictors (BS, BC, JF), pp. 53–64.

CAV-2003-Namjoshi #abstraction #branch

Abstraction for Branching Time Properties (KSN), pp. 288–300.

SAT-2003-DrakeF #branch #heuristic #interactive

The Interaction Between Inference and Branching Heuristics (LD, AMF), pp. 370–382.

SAT-2003-HerbstrittB #branch

Conflict-Based Selection of Branching Rules (MH, BB), pp. 441–451.

SIGMOD-2002-KaushikBNK #branch #query

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

ESOP-2002-WellsH #branch

Branching Types (JBW, CH), pp. 115–132.

ICALP-2002-AblayevMP #bound #branch #probability #quantum #source code

Quantum and Stochastic Branching Programs of Bounded Width (FMA, CM, CP), pp. 343–354.

ICALP-2002-GarganoHSV #bound #branch

Spanning Trees with Bounded Number of Branch Vertices (LG, PH, LS, UV), pp. 355–365.

ICPR-v2-2002-FrantiVK #bound #clustering

Branch-and-Bound Technique for Solving Optimal Clustering (PF, OV, TK), pp. 232–235.

HPCA-2002-KampeSD #analysis #branch #fourier #predict #using

The FAB Predictor: Using Fourier Analysis to Predict the Outcome of Conditional Branches (MK, PS, MD), pp. 223–232.

HPCA-2002-ParikhSZBS #branch #predict

Power Issues Related to Branch Prediction (DP, KS, YZ, MB, MRS), pp. 233–244.

LICS-2002-HodkinsonWZ #branch #decidability #first-order #logic

Decidable and Undecidable Fragments of First-Order Branching Temporal Logics (IMH, FW, MZ), pp. 393–402.

SAT-2002-Kullmann #adaptation #branch #database #encryption #normalisation #random #satisfiability #standard #towards #using

Towards an adaptive density based branching rule for SAT solvers, using a database for mixed random conjunctive normal forms built upon the Advanced Encryption Standard (AES) (OK), p. 8.

ICDAR-2001-WangBKR #modelling #multi #recognition

Multi-Branch and Two-Pass HMM Modeling Approaches for Off-Line Cursive Handwriting Recognition (WW, AB, AK, GR), pp. 231–235.

TACAS-2001-Vardi #branch #linear

Branching vs. Linear Time: Final Showdown (MYV), pp. 1–22.

STOC-2001-BolligW #bound #branch #integer #multi #using

A read-once branching program lower bound of Ω(2n/4) for integer multiplication using universal (BB, PW), pp. 419–424.

ICALP-2001-Madhusudan #behaviour #branch #graph #reasoning #sequence

Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs (PM), pp. 809–820.

HPCA-2001-JimenezL #branch #predict

Dynamic Branch Prediction with Perceptrons (DAJ, CL), pp. 197–206.

HPCA-2001-SrinivasanDTCP #branch

Branch History Guided Instruction Prefetching (VS, ESD, GST, MJC, TRP), pp. 291–300.

LICS-2001-ManoliosT #branch #liveness #safety

Safety and Liveness in Branching Time (PM, RJT), pp. 366–374.

SAT-2001-LagoudakisL #branch #learning #satisfiability

Learning to Select Branching Rules in the DPLL Procedure for Satisfiability (MGL, MLL), pp. 344–359.

ASE-2000-GuptaMS #branch #generative #testing

Generating Test Data for Branch Coverage (NG, APM, MLS), pp. 219–228.

DAC-2000-VelevB #branch #exception #functional #multi #predict #verification

Formal verification of superscale microprocessors with multicycle functional units, exception, and branch prediction (MNV, REB), pp. 112–117.

VLDB-2000-JiangSLB

The BT-tree: A Branched and Temporal Access Method (LJ, BS, DBL, MBG), pp. 451–460.

SAC-2000-SchreckC #implementation #using

R-Tree Implementation Using Branch-Grafting Method (TS, ZC), pp. 328–332.

HPCA-2000-HaungsSF #analysis #branch #classification #metric

Branch Transition Rate: A New Metric for Improved Branch Classification Analysis (MH, PS, MKF), pp. 241–250.

HPCA-2000-PatilE #alias #branch #predict

Combining Static and Dynamic Branch Prediction to Reduce Destructive Aliasing (HP, JSE), pp. 251–262.

CADE-2000-HasegawaFK #branch #generative #performance #using

Efficient Minimal Model Generation Using Branching Lemmas (RH, HF, MK), pp. 184–199.

ISSTA-2000-FranklD #branch #case study #comparison #data flow #reliability #testing

Comparison of delivered reliability of branch, data flow and operational testing: A case study (PGF, YD), pp. 124–134.

PLDI-1999-SchlanskerMJ #architecture #branch #optimisation #reduction

Control CPR: A Branch Height Reduction Optimization for EPIC Architectures (MSS, SAM, RJ), pp. 155–168.

ICALP-1999-AndreevBCR #bound #branch #pseudo #set #source code

Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs (AEA, JLB, AEFC, JDPR), pp. 179–189.

HCI-CCAD-1999-Komischke #branch #identification #process #sequence

Identifying core sequences in process control across branches (TK), pp. 1301–1305.

HCI-CCAD-1999-Miki #branch #design #multi

Designing awareness for multipurpose remote branch terminals (HM), pp. 553–557.

PLDI-1998-YangUW #branch #order #performance

Improving Performance by Branch Reordering (MY, GRU, DBW), pp. 130–141.

STOC-1998-Thathachar #branch #on the

On Separating the Read-k-Times Branching Program Hierarchy (JST), pp. 653–662.

ICALP-1998-JuknaZ #bound #branch #nondeterminism #on the #source code

On Branching Programs With Bounded Uncertainty (Extended Abstract) (SJ, SZ), pp. 259–270.

ASPLOS-1998-StarkEP #branch #predict

Variable Length Path Branch Prediction (JS, ME, YNP), pp. 170–179.

HPCA-1998-Chen #adaptation #branch #execution

Supporting Highly-Speculative Execution via Adaptive Branch Trees (TFC), pp. 185–194.

HPCA-1998-VengroffG #branch #estimation #performance #predict #re-engineering

Partial Sampling with Reverse State Reconstruction: A New Technique for Branch Predictor Performance Estimation (DEV, GRG), pp. 342–351.

LICS-1998-KupfermanV #linear

Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time (OK, MYV), pp. 81–92.

LICS-1998-Vardi #branch #linear #perspective

Linear vs. Branching Time: A Complexity-Theoretic Perspective (MYV), pp. 394–405.

PLDI-1997-BodikGS #branch #interprocedural

Interprocedural Conditional Branch Elimination (RB, RG, MLS), pp. 146–158.

PLDI-1997-YoungJKS #branch

Near-optimal Intraprocedural Branch Alignment (CY, DSJ, DRK, MDS), pp. 183–193.

SAS-1997-UhW #branch #performance

Coalescing Conditional Branches into Efficient Indirect Jumps (GRU, DBW), pp. 315–329.

STOC-1997-RazborovWY #branch #calculus #proving #source code

Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus (AAR, AW, ACCY), pp. 739–748.

ICALP-1997-Ablayev #branch #nondeterminism #order #source code

Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs (FMA), pp. 195–202.

SAC-1997-ShulerB #branch

Look-ahead allocation in the presence of branches (JDS, HRB), pp. 504–508.

HPCA-1997-AugustCGH #architecture #branch #predict

Architectural Support for Compiler-Synthesized Dynamic Branch Prediction Strategies: Rationale and Initial Results (DIA, DAC, JCG, WmWH), pp. 84–93.

HPCA-1997-WallaceB #branch #multi #predict

Multiple Branch and Block Prediction (SW, NB), pp. 94–103.

ICALP-1996-AblayevK #branch #on the #power of #random #source code

On the Power of Randomized Branching Programs (FMA, MK), pp. 348–356.

ICPR-1996-Sirakov #3d #automation #branch #re-engineering

Automatic reconstruction of 3D branching objects (NMS), pp. 620–624.

ICPR-1996-SzeL #algorithm #bound #branch #classification

Branch and bound algorithm for the Bayes classifier (LS, CHL), pp. 705–709.

ASPLOS-1996-ChenCM #analysis #branch #predict

Analysis of Branch Prediction Via Data Compression (ICKC, JTC, TNM), pp. 128–137.

ASPLOS-1996-SeznecJSM #branch #multi #predict

Multiple-Block Ahead Branch Predictors (AS, SJ, PS, PM), pp. 116–127.

LICS-1996-WillemsW #branch #linear #model checking #partial order

Partial-Order Methods for Model Checking: From Linear Time to Branching Time (BW, PW), pp. 294–303.

PLDI-1995-CalderGLMMZ #branch #predict

Corpus-Based Static Branch Prediction (BC, DG, DCL, JHM, MM, BGZ), pp. 79–92.

PLDI-1995-MuellerW #branch #replication

Avoiding Conditional Branches by Code Replication (FM, DBW), pp. 56–66.

PLDI-1995-Patterson #branch #predict

Accurate Static Branch Prediction by Value Range Propagation (JRCP), pp. 67–78.

STOC-1995-Ponzio #bound #branch #integer #multi #source code

A lower bound for integer multiplication with read-once branching programs (SP), pp. 130–139.

CAV-1995-EsparzaK #branch #logic #model checking #on the #parallel #problem #process

On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes (JE, AK), pp. 353–366.

CAV-1995-Kupferman #branch #logic #quantifier

Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions (OK), pp. 325–338.

PLDI-1994-Krall #branch #predict #replication

Improving Semi-static Branch Prediction by Code Replication (AK), pp. 97–106.

SEKE-1994-Sakalauskaite #branch #calculus #first-order #logic

A complete sequent calculus for a first order branching temporal logic (JS), pp. 274–280.

ASPLOS-1994-CalderG #branch

Reducing Branch Costs via Branch Alignment (BC, DG), pp. 242–251.

ASPLOS-1994-YoungS #branch #correlation #predict #using

Improving the Accuracy of Static Branch Prediction Using Branch Correlation (CY, MDS), pp. 232–241.

CAV-1994-BernholtzVW #approach #model checking

An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract) (OB, MYV, PW), pp. 142–155.

ISSTA-1994-BertolinoM #bound #branch #testing

A Meaningful Bound for Branch Testing (Abstract) (AB, MM), p. 202.

PLDI-1993-BallL #branch #for free #predict

Branch Prediction For Free (TB, JRL), pp. 300–313.

CIKM-1993-CosarLS #bound #multi #optimisation #query

Multiple Query Optimization with Depth-First Branch-and-Bound and Dynamic Query Ordering (AC, EPL, JS), pp. 433–438.

SEKE-1993-ChangCCL #branch #empirical #generative #testing

An Empirical Study of Intelligent Test Case Generation Methods for Software Branch Coverage (KHC, JHCI, WHC, SSL), pp. 437–444.

SAC-1993-VeezhinathanKT #bound #branch #hybrid

A Hybrid of Neural Net and Branch and Bound Techniques for Seismic Horizon Tracking (JV, FK, JT), pp. 173–178.

ILPS-1993-Sindaha #scheduling

Branch-Level Scheduling in Aurora: The Dharma Scheduler (RYS), pp. 403–419.

DAC-1992-RimJ #branch #representation #synthesis

Representing Conditional Branches for High-Level Synthesis Applications (MR, RJ), pp. 106–111.

PLDI-1992-GranlundK #branch #c #compilation #using

Eliminating Branches using a Superoptimizer and the GNU C Compiler (TG, RK), pp. 341–352.

ASPLOS-1992-FisherF #branch #predict

Predicting Conditional Branch Directions From Previous Runs of a Program (JAF, SMF), pp. 85–95.

ASPLOS-1992-PanSR #branch #correlation #predict #using

Improving the Accuracy of Dynamic Branch Prediction Using Branch Correlation (STP, KS, JTR), pp. 76–84.

CAV-1992-HamaguchiHY #branch #design #logic #using #verification

Design Verification of a Microprocessor Using Branching Time Regular Temporal Logic (KH, HH, SY), pp. 206–219.

DAC-1991-OnoderaTT #bound #layout

Branch-and-Bound Placement for Building Block Layout (HO, YT, KT), pp. 433–439.

DAC-1991-SastryM #analysis #branch #process

A Branching Process Model for Observability Analysis of Combinational Circuits (SS, AM), pp. 452–457.

ICALP-1991-BouajjaniFGRS #branch #safety #semantics

Safety for Branching Time Semantics (AB, JCF, SG, CR, JS), pp. 76–92.

ASPLOS-1991-KatevenisT #branch #memory management

Reducing the Branch Penalty by Rearranging Instructions in Double-Width Memory (MK, NT), pp. 15–27.

CAV-1991-HamaguchiHY #branch #logic #model checking #using #verification

Formal Verification of Speed-Dependent Asynchronous Cicuits Using Symbolic Model Checking of branching Time Regular Temporal Logic (KH, HH, SY), pp. 410–420.

CAV-1991-Huttel #branch #decidability #process #similarity

Silence is Golden: Branching Bisimilarity is Decidable for Context-Free Processes (HH), pp. 2–12.

CAV-1991-Korver #bisimulation #branch

Computing Distinguishing Formulas for Branching Bisimulation (HK), pp. 13–23.

ESOP-1990-SchnoebelenP #logic #on the

On the Weak Adequacy of Branching-Time Remporal Logic (PS, SP), pp. 377–388.

ICALP-1990-GrooteV #algorithm #bisimulation #branch #equivalence #performance

An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence (JFG, FWV), pp. 626–638.

CAV-1990-HamaguchiHY #branch #complexity #linear #logic #model checking

Branching Time Regular Temporal Logic for Model Checking with Linear Time Complexity (KH, HH, SY), pp. 253–262.

DAC-1989-PatilB #algorithm #bound #branch #generative #parallel #testing

A Parallel Branch and Bound Algorithm for Test Generation (SP, PB), pp. 339–343.

SEKE-1989-ChangCCB #branch #generative #testing

An Intelligent Test Data Generator for Software Branch Coverage (KHC, JHCI, WHC, DBB), pp. 13–18.

CSL-1989-Meinel #bound #source code

Ω-Branching Programs of Bounded Width (CM), pp. 242–253.

CSL-1989-Penczek #branch #concurrent #logic

A Concurrent Branching Time Temporal Logic (WP), pp. 337–354.

TAV-1989-YatesM #branch #testing

Reducing the Effects of Infeasible Paths in Branch Testing (DFY, NM), pp. 48–54.

STOC-1988-KarpZ #bound #parallel #random

A Randomized Parallel Branch-and-Bound Procedure (RMK, YZ), pp. 290–300.

STOC-1986-AjtaiBHKPRST #bound #branch #source code

Two lower bounds for branching programs (MA, LB, PH, JK, PP, VR, ES, GT), pp. 30–38.

STOC-1986-Barrington #bound #branch #source code

Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹ (DAMB), pp. 1–5.

ICALP-1985-Pnueli #branch #linear #logic #semantics

Linear and Branching Structures in the Semantics and Logics of Reactive Systems (AP), pp. 15–32.

POPL-1985-EmersonL #branch #model checking

Modalities for Model Checking: Branching Time Strikes Back (EAE, CLL), pp. 84–96.

POPL-1985-WegmanZ #branch #constant

Constant Propagation with Conditional Branches (MNW, FKZ), pp. 291–299.

DAC-1984-LewandowskiL #algorithm #bound #branch

A branch and bound algorithm for optimal pla folding (JLL, CLL), pp. 426–433.

STOC-1984-EmersonS #branch #logic

Deciding Branching Time Logic (EAE, APS), pp. 14–24.

STOC-1983-BorodinDFP #bound #branch #source code

Bounds for Width Two Branching Programs (AB, DD, FEF, WJP), pp. 87–93.

ICALP-1983-BakkerBKM #branch #linear #recursion #semantics

Linear Time and Branching Time Semantics for Recursion with Merge (JWdB, JAB, JWK, JJCM), pp. 39–51.

POPL-1983-EmersonH #branch #linear

“Sometimes” and “Not Never” Revisited: On Branching Versus Linear Time (EAE, JYH), pp. 127–140.

DAC-1982-Grass #algorithm #bound

A depth-first branch-and-bound algorithm for optimal PLA folding (WG), pp. 133–140.

STOC-1982-EmersonH #branch #logic

Decision Procedures and Expressiveness in the Temporal Logic of Branching Time (EAE, JYH), pp. 169–180.

ICALP-1982-FlajoletS #branch #polynomial #process

A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization (PF, JMS), pp. 239–251.

ICALP-1981-Pearl #algorithm #branch

The Solution for the Branching Factor of the α-β Pruning Algorithm (JP), pp. 521–529.

POPL-1981-Ben-AriMP #branch #logic

The Temporal Logic of Branching Time (MBA, ZM, AP), pp. 164–176.

DAC-1979-DysartK #automation #bound #branch

An application of branch and bound method to automatic printed circuit board routing (LD, MK), pp. 494–499.

STOC-1974-Lipton #branch

Limitations of Synchronization Primitives with Conditional Branching and Global Variables (RJL), pp. 230–241.