Stem backward$ (all stems)

63 papers:

ESOP-2015-TorontoMH #probability #source code

Running Probabilistic Programs Backwards (NT, JM, DVH), pp. 53–79.

PEPM-2015-LisperMK #slicing

Static Backward Demand-Driven Slicing (BL, ANM, HK), pp. 115–126.

LATA-2015-TravnicekJMC #pattern matching

Backward Linearised Tree Pattern Matching (JT, JJ, BM, LGC), pp. 599–610.

SEFM-2015-ShenB #formal method

A Formal Study of Backward Compatible Dynamic Software Updates (JS, RAB), pp. 231–248.

ICFP-2015-GenevesG #problem #static typing #type system #xquery

XQuery and static typing: tackling the problem of backward axes (PG, NG), pp. 88–100.

AdaEurope-2015-KhanfarLM #safety #slicing

Static Backward Program Slicing for Safety-Critical Systems (HK, BL, ANM), pp. 50–65.

OOPSLA-2015-FuBS #analysis #automation #fault

Automated backward error analysis for numerical code (ZF, ZB, ZS), pp. 639–654.

ASE-2014-DingesA #execution #generative #using

Targeted test input generation using symbolic-concrete backward execution (PD, GAA), pp. 31–36.

SAS-2014-BakhirkinBP #abstraction #analysis #approximate

Backward Analysis via over-Approximate Abstraction and under-Approximate Subtraction (AB, JB, NP), pp. 34–50.

GRAPHITE-2014-SenniS #knowledge base #reduction

Backwards State-space Reduction for Planning in Dynamic Knowledge Bases (VS, MS), pp. 84–99.

ICML-c1-2014-LiuYF #algorithm #constraints

Forward-Backward Greedy Algorithms for General Convex Smooth Functions over A Cardinality Constraint (JL, JY, RF), pp. 503–511.

PPDP-2014-Haemmerle #constraints #logic programming #on the

On Combining Backward and Forward Chaining in Constraint Logic Programming (RH), pp. 213–224.

TACAS-2013-VizelGS #analysis #reachability #using

Intertwined Forward-Backward Reachability Analysis Using Interpolants (YV, OG, SS), pp. 308–323.

SAC-2013-HoangLCMC #network #protocol

A backward-compatible protocol for inter-routing over heterogeneous overlay networks (GNH, LL, VC, PM, HNC), pp. 649–651.

SAS-2012-JaffarMNS #slicing

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

ICST-2012-UjhelyiHV #model transformation #slicing

Dynamic Backward Slicing of Model Transformations (ZU, ÁH, DV), pp. 1–10.

LICS-2012-Aumann #game studies #induction

Backward induction in games of perfect information (RJA), p. 1.

ASE-2011-UjhelyiHV #model transformation #slicing #towards

Towards dynamic backward slicing of model transformations (ZU, ÁH, DV), pp. 404–407.

KDIR-2011-BonninBB #mining #predict #web

Handling Tabbing and Backward References for Predictive Web Usage Mining (GB, AB, AB), pp. 503–509.

ESEC-FSE-2011-MirghasemiBP #execution #named

Querypoint: moving backwards on wrong values in the buggy execution (SM, JJB, CP), pp. 436–439.

CADE-2011-AlpuenteBER #logic #slicing

Backward Trace Slicing for Rewriting Logic Theories (MA, DB, JE, DR), pp. 34–48.

CIAA-2010-AntosM #approach #automaton #finite #pattern matching

Finite Automata for Generalized Approach to Backward Pattern Matching (JA, BM), pp. 49–58.

ICML-2010-LangT #probability #reasoning #relational

Probabilistic Backward and Forward Reasoning in Stochastic Relational Worlds (TL, MT), pp. 583–590.

ICPR-2010-KalalMM #automation #detection #fault

Forward-Backward Error: Automatic Detection of Tracking Failures (ZK, KM, JM), pp. 2756–2759.

KDIR-2010-SiebersS #feature model

Interleaving Forward Backward Feature Selection (MS, US), pp. 454–457.

ASE-2009-YuAB #analysis #generative #source code #string #using

Generating Vulnerability Signatures for String Manipulating Programs Using Automata-Based Forward and Backward Symbolic Analyses (FY, MA, TB), pp. 605–609.

DATE-2009-ZiermannWT #network #protocol

CAN+: A new backward-compatible Controller Area Network (CAN) protocol with up to 16× higher data rates (TZ, SW, JT), pp. 1088–1093.

DRR-2009-MeilenderB #algorithm #documentation #segmentation

Segmentation of continuous document flow by a modified backward-forward algorithm (TM, AB), pp. 1–10.

CAiSE-2009-LiuLYWH #analysis #constraints #using #verification #workflow

ETL Workflow Analysis and Verification Using Backwards Constraint Propagation (JL, SL, DY, JW, TH), pp. 455–469.

ESEC-FSE-2009-VarmaSS #memory management

Backward-compatible constant-time exception-protected memory (PV, RKS, HJS), pp. 71–80.

SPLC-2009-JepsenB #product line

Running a software product line: standing still is going backwards (HPJ, DB), pp. 101–110.

DAC-2008-LinSH #multi #realtime

A multi-resolution AHB bus tracer for real-time compression of forward/backward traces in a circular buffer (YTL, WCS, IJH), pp. 862–865.

SIGAda-2008-Maurer #ada #problem #source code

Removing backward go-to statements from Ada programs: possibilities and problems (WDM), pp. 105–108.

VMCAI-2008-RanzatoRT #abstraction #algorithm #refinement

A Forward-Backward Abstraction Refinement Algorithm (FR, ORD, FT), pp. 248–262.

FoSSaCS-2007-HagueO #analysis #automaton #higher-order

Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems (MH, CHLO), pp. 213–227.

CIAA-2007-HogbergMM #automaton #bisimulation

Backward and Forward Bisimulation Minimisation of Tree Automata (JH, AM, JM), pp. 109–121.

CASE-2006-ChenYY #algorithm #simulation

Backward-traversing Waveform Relaxation Algorithm for Circuit Simulation and Simulation on Demand (CJC, JLY, TNY), pp. 134–139.

DATE-2006-FrehseKR #abstraction #refinement #using #verification

Verifying analog oscillator circuits using forward/backward abstraction refinement (GF, BHK, RAR), pp. 257–262.

ICSE-2006-DhurjatiA #array #bound #c

Backwards-compatible array bounds checking for C with very low overhead (DD, VSA), pp. 162–171.

IJCAR-2006-ChaudhuriPP #logic

A Logical Characterization of Forward and Backward Chaining in the Inverse Method (KC, FP, GP), pp. 97–111.

SCAM-2005-BinkleyH #slicing

Forward slices are smaller than backward slices (DB, MH), pp. 15–24.

CAV-2005-AronsEFMMSSTVZ #verification

Formal Verification of Backward Compatibility of Microcode (TA, EE, LF, SMH, MM, JS, ES, AT, MYV, LDZ), pp. 185–198.

DAC-2004-LeeZB #analysis #using

Static timing analysis using backward signal propagation (DL, VZ, DB), pp. 664–669.

FLOPS-2004-LuK #analysis

Backward Pair Sharing Analysis (LL, AK), pp. 132–146.

PDCL-2004-HoweKL #logic programming #reasoning #source code

Analysing Logic Programs by Reasoning Backwards (JMH, AK, LL), pp. 152–188.

FSE-2004-XuDS #c #memory management #performance #safety #source code

An efficient and backwards-compatible transformation to ensure memory safety of C programs (WX, DCD, RS), pp. 117–126.

ICSM-2003-BinkleyH #context-sensitive grammar #empirical #scalability #slicing

A Large-Scale Empirical Study of Forward and Backward Static Slice Size and Context Sensitivity (DB, MH), pp. 44–53.

LOPSTR-2003-Gallagher #analysis #logic programming #program transformation #source code

A Program Transformation for Backwards Analysis of Logic Programs (JPG), pp. 92–105.

ICLP-2003-KingL #logic programming #source code #verification

Forward versus Backward Verification of Logic Programs (AK, LL), pp. 315–330.

SAS-2002-LuK #type checking #type inference

Backward Type Inference Generalises Type Checking (LL, AK), pp. 85–101.

CAV-2002-CabodiNQ #traversal #verification

Mixing Forward and Backward Traversals in Guided-Prioritized BDD-Based Verification (GC, SN, SQ), pp. 471–484.

ESOP-2001-Monniaux #abstract interpretation #probability #source code

Backwards Abstract Interpretation of Probabilistic Programs (DM), pp. 367–382.

IWPC-2001-FoxDHH #comprehension

Backward Conditioning: A New Program Specialisation Technique and Its Application to Program Comprehension (CF, SD, MH, RMH), pp. 89–97.

ICPR-v2-2000-SuzukiHS #component #performance

Fast Connected-Component Labeling Based on Sequential Local Operations in the Course of Forward Raster Scan Followed by Backward Raster Scan (KS, IH, NS), pp. 2434–2437.

SIGMOD-1998-KiepuszewskiMO #named #workflow

FlowBack: Providing Backward Recovery for Workflow Systems (BK, RM, MEO), pp. 555–557.

DAC-1997-PomeranzR #approach #fault #multi #simulation #using

Fault Simulation under the Multiple Observation Time Approach using Backward Implications (IP, SMR), pp. 608–613.

SAS-1996-SchoenigD #algorithm #prolog #slicing

A Backward Slicing Algorithm for Prolog (SS, MD), pp. 317–331.

LFP-1992-NeubergerM #analysis #deduction #power of #precise #strict

A Precise Relationship Between the Deductive Power of Forward and Backward Strictness Analysis (MN, PM), pp. 127–138.

JICSLP-1992-AbreuPC #execution #product line

Improving Backward Execution in the Andorra Family of Languages (SA, LMP, PC), pp. 384–398.

PODS-1990-Royer #evaluation

Backward Chaining Evaluation in Stratified Disjunctive Theories (VR), pp. 183–195.

ESOP-1990-JensenM #analysis #garbage collection

A Backwards Analysis for Compile-time Garbage Collection (TPJ, TÆM), pp. 227–239.

SIGMOD-1988-Fischer #question

Nested Relations: A Step Forward — or Backward? (PCF), p. 2.

ICLP-1987-Conery87 #execution #implementation #nondeterminism

Implementing Backward Execution in Non-Deterministic AND-Parallel Systems (JSC), pp. 633–653.