Stem narrow$ (all stems)

137 papers:

FM-2015-AmatoMMS #abstract domain

Narrowing Operators on Template Abstract Domains (GA, SDNDM, MCM, FS), pp. 57–72.

HIMI-IKD-2015-KaoW #concept #interface #web

Narrower Conceptual Scope in the App Than the Web Store Interface — The Size Does It and the Ad Has It (CLK, MYW), pp. 204–214.

DATE-2014-DuanW

Exploiting narrow-width values for improving non-volatile cache lifetime (GD, SW), pp. 1–4.

WRLA-2014-AguirreMPP #logic #maude

Conditional Narrowing Modulo in Rewriting Logic and Maude (LA, NMO, MP, IP), pp. 80–96.

WRLA-2014-BaeM #infinity #model checking #using

Infinite-State Model Checking of LTLR Formulas Using Narrowing (KB, JM), pp. 113–129.

CIKM-2014-AthukoralaOGVJ

Narrow or Broad?: Estimating Subjective Specificity in Exploratory Search (KA, AO, DG, JV, GJ), pp. 819–828.

ICML-c1-2014-DenilMF #random

Narrowing the Gap: Random Forests In Theory and In Practice (MD, DM, NdF), pp. 665–673.

RecSys-2014-DeryKRS #elicitation #recommendation

Preference elicitation for narrowing the recommended list for groups (LND, MK, LR, BS), pp. 333–336.

PLDI-2013-ApinisSV #equation #how

How to combine widening and narrowing for non-monotonic systems of equations (KA, HS, VV), pp. 377–386.

SAS-2013-AmatoS

Localizing Widening and Narrowing (GA, FS), pp. 25–42.

LOPSTR-2013-NishidaV #finite #representation

A Finite Representation of the Narrowing Space (NN, GV), pp. 54–71.

RTA-2013-BaeEM #infinity #logic #model checking #using

Abstract Logical Model Checking of Infinite-State Systems Using Narrowing (KB, SE, JM), pp. 81–96.

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.

DAC-2012-KongC #3d #process

Exploiting narrow-width values for process variation-tolerant 3-D microprocessors (JK, SWC), pp. 1197–1206.

HT-2012-HelicKGST #folksonomy #performance

Navigational efficiency of broad vs. narrow folksonomies (DH, CK, MG, MS, CT), pp. 63–72.

WRLA-J-2010-EscobarSM12 #termination

Folding variant narrowing and optimal variant termination (SE, RS, JM), pp. 898–928.

WRLA-2012-Riesco #maude #specification #using

Using Narrowing to Test Maude Specifications (AR), pp. 201–220.

PEPM-2012-Lopez-FraguasMR #functional #logic programming

Well-typed narrowing with extra variables in functional-logic programming (FJLF, EMM, JRH), pp. 83–92.

CHI-2012-BrynjarsdottirHPBDS #how #persuasion

Sustainably unpersuaded: how persuasion narrows our vision of sustainability (HB, MH, JP, EB, CFD, PS), pp. 947–956.

ASE-2011-NguyenNANN #approach #debugging #topic

A topic-based approach for narrowing the search space of buggy files from a bug report (ATN, TTN, JMAK, HVN, TNN), pp. 263–272.

DAC-2011-ZhouJBHS #library #standard

A 40 nm inverse-narrow-width-effect-aware sub-threshold standard cell library (JZ, SJ, BB, LH, JS), pp. 441–446.

PLDI-2011-XuBQR #memory management #named

LeakChaser: helping programmers narrow down causes of memory leaks (G(X, MDB, FQ, AR), pp. 270–282.

LCTES-2011-BhagatGSG #effectiveness #optimisation

Global productiveness propagation: a code optimization technique to speculatively prune useless narrow computations (IB, EG, FJS, AG), pp. 161–170.

RTA-2011-DuranEEMT #maude #reachability #unification

Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6 (FD, SE, SE, JM, CLT), pp. 31–40.

ASE-2010-NgocO #fault #using

Checking roundoff errors using counterexample-guided narrowing (DTBN, MO), pp. 301–304.

HT-2010-GasslerZTS #named #recommendation #using

SnoopyDB: narrowing the gap between structured and unstructured information using recommendations (WG, EZ, MT, GS), pp. 271–272.

WRLA-2010-EscobarSM #termination

Folding Variant Narrowing and Optimal Variant Termination (SE, RS, JM), pp. 52–68.

SAC-2010-Mohy-ud-DinM #detection #probability

Detecting narrow passages in configuration spaces via spectra of probabilistic roadmaps (HMuD, AM), pp. 1294–1298.

TAP-2010-Rusu #proving #specification #theorem proving

Combining Theorem Proving and Narrowing for Rewriting-Logic Specifications (VR), pp. 135–150.

DATE-2009-WangHZC #design

Exploiting narrow-width values for thermal-aware register file designs (SW, JSH, SGZ, SWC), pp. 1422–1427.

WRLA-2008-EscobarMS09 #equation #unification

Variant Narrowing and Equational Unification (SE, JM, RS), pp. 103–119.

LOPSTR-2009-IborraNV #dependence #proving #termination

Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing (JI, NN, GV), pp. 52–66.

RTA-2009-ClavelDEELMMT #maude #unification

Unification and Narrowing in Maude 2.4 (MC, FD, SE, SE, PL, NMO, JM, CLT), pp. 380–390.

FLOPS-2008-Vidal #linear #termination

Termination of Narrowing in Left-Linear Constructor Systems (GV), pp. 113–129.

ICLP-2008-AlpuenteEI #dependence #termination #using

Termination of Narrowing Using Dependency Pairs (MA, SE, JI), pp. 317–331.

RTA-2008-AlpuenteEI #composition #termination

Modular Termination of Basic Narrowing (MA, SE, JI), pp. 1–16.

ITiCSE-2007-Dickinson07a #diagrams

“Touching the void”…: narrowing the crevasse between the tactile diagrams that tutors request and those that work in reality (AD), p. 339.

WRLA-J-2004-MeseguerT07 #analysis #encryption #protocol #reachability #using #verification

Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (JM, PT), pp. 123–160.

CGO-2007-HormatiCM

Exploiting Narrow Accelerators with Data-Centric Subgraph Mapping (AH, NC, SAM), pp. 341–353.

RTA-2007-EscobarM #infinity #model checking #using

Symbolic Model Checking of Infinite-State Systems Using Narrowing (SE, JM), pp. 153–168.

DAC-2006-NieuwoudtRM #named #optimisation #synthesis

SOC-NLNA: synthesis and optimization for fully integrated narrow-band CMOS low noise amplifiers (AN, TR, YM), pp. 879–884.

STOC-2006-Nordstrom #proving

Narrow proofs may be spacious: separating space and width in resolution (JN), pp. 507–516.

ICGT-2006-EchahedP #pointer

Narrowing Data-Structures with Pointers (RE, NP), pp. 92–106.

LOPSTR-2006-ArroyoRSV #graph #partial evaluation #using

Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs (GA, JGR, JS, GV), pp. 60–76.

WRLA-2004-MeseguerT05 #analysis #encryption #protocol #reachability #using #verification

Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols (JM, PT), pp. 153–182.

ICFP-2005-RamosSV #partial evaluation #performance #source code

Fast narrowing-driven partial evaluation for inductively sequential programs (JGR, JS, GV), pp. 228–239.

PADL-2005-BraunerEFGP #case study #generative

Specializing Narrowing for Timetable Generation: A Case Study (NB, RE, GF, HG, FP), pp. 22–36.

RTA-2005-EscobarMT #term rewriting

Natural Narrowing for General Term Rewriting Systems (SE, JM, PT), pp. 279–293.

TACAS-2004-SuW #analysis #constraints

A Class of Polynomially Solvable Range Constraints for Interval Analysis without Widenings and Narrowings (ZS, DW), pp. 280–295.

FLOPS-2004-Escobar #implementation

Implementing Natural Rewriting and Narrowing Efficiently (SE), pp. 147–162.

PPDP-2004-Lopez-FraguasRV #calculus #constraints #declarative #lazy evaluation #programming

A lazy narrowing calculus for declarative constraint programming (FJLF, MRA, RdVV), pp. 43–54.

PPDP-2004-MarinM #lazy evaluation

New completeness results for lazy conditional narrowing (MM, AM), pp. 120–131.

PPDP-2003-AntoyBH

Conditional narrowing without conditions (SA, BB, MH), pp. 20–31.

PPDP-2003-Escobar

Refining weakly outermost-needed rewriting and narrowing (SE), pp. 113–123.

PPDP-2003-Virseda #calculus

A demand-driven narrowing calculus with overlapping definitional trees (RdVV), pp. 253–263.

PEPM-2002-Vidal

Cost-augmented narrowing-driven specialization (GV), pp. 52–62.

FLOPS-2002-Lopez-FraguasS #functional #logic programming

Narrowing Failure in Functional Logic Programming (FJLF, JSH), pp. 212–227.

ICPR-v4-2002-YuiHZH #3d #adaptation #modelling #performance

A Fast Narrow Band Method and Its Application in Topology-Adaptive 3-D Modeling (SY, KH, HZ, TH), pp. 122–125.

ICDAR-2001-PennHLM #analysis #documentation #flexibility #web

Flexible Web Document Analysis for Delivery to Narrow-Bandwidth Devices (GP, JH, HL, RTM), pp. 1074–1078.

FLOPS-2001-Hortala-GonzalezU #automaton #calculus #lazy evaluation

An Abstract Machine Based System for a Lazy Narrowing Calculus (MTHG, EU), pp. 216–232.

FLOPS-2001-SuzukiM #lazy evaluation

A Complete Selection Function for Lazy Conditional Narrowing (TS, AM), pp. 201–215.

PPDP-2001-Antoy

Constructor-Based Conditional Narrowing (SA), pp. 199–206.

PPDP-2001-AntoyHMS #implementation

An Implementation of Narrowing Strategies (SA, MH, BM, FS), pp. 207–217.

IJCAR-2001-Stuber #modelling #proving

A Model-Based Completeness Proof of Extended Narrowing and Resolution (JS), pp. 195–210.

ICALP-2000-AdlerFGP #bound

Tight Size Bounds for Packet Headers in Narrow Meshes (MA, FEF, LAG, MP), pp. 756–767.

ICSE-2000-Morrogh #education

Is software education narrow-minded? A position paper (PM), pp. 545–546.

STOC-1999-Ben-SassonW #proving

Short Proofs are Narrow — Resolution Made Simple (EBS, AW), pp. 517–526.

FLOPS-1999-AntoyT #higher-order

Typed Higher-Order Narrowing without Higher-Order Strategies (SA, APT), pp. 335–353.

FLOPS-1999-HanusL #functional #logic #program analysis #semantics

A Semantics for Program Analysis in Narrowing-Based Functional Logic Languages (MH, SL), pp. 353–368.

FLOPS-1999-MarinIS #higher-order #lazy evaluation #on the

On Reducing the Search Space of Higher-Order Lazy Narrowing (MM, TI, TS), pp. 319–334.

HPCA-1999-BrooksM #performance

Dynamically Exploiting Narrow Width Operands to Improve Processor Power and Performance (DMB, MM), pp. 13–22.

JICSLP-1998-EchahedJ #graph grammar

Admissible Graph Rewriting and Narrowing (RE, JCJ), pp. 325–342.

ALP-1997-Almendros-JimenezG #lazy evaluation #order #parametricity

Lazy Narrowing with Parametric Order Sorted Types (JMAJ, AGL), pp. 159–173.

ALP-1997-AlpuenteFMV

Safe Folding/Unfolding with Conditional Narrowing (MA, MF, GM, GV), pp. 1–15.

ALP-1997-SuzukiNI #calculus #functional #higher-order #lazy evaluation #logic

Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-Order Functional Logic Language (TS, KN, TI), pp. 99–113.

PLILP-1997-AntoyA

Narrowing the Narrowing Space (SA, ZMA), pp. 1–15.

ILPS-1997-Arenas-SanchezR #algebra #calculus #functional #lazy evaluation #logic programming #polymorphism

A Lazy Narrowing Calculus for Functional Logic Programming with Algebraic Polymorphic Types (PAS, MRA), pp. 53–67.

ESOP-1996-AlpuenteFV #functional #logic programming #partial evaluation #source code

Narrowing-Driven Partial Evaluation of Functional Logic Programs (MA, MF, GV), pp. 45–61.

PLILP-1996-Antoy #prolog

Needed Narrowing in Prolog (Extended Abstract) (SA), pp. 473–474.

JICSLP-1996-LhommeGRT #algorithm

Boosting the Interval Narrowing Algorithm (OL, AG, MR, PT), pp. 378–392.

JICSLP-1996-Rao #implementation

Completeness Results for Basic Narrowing in Non-Copying Implementations (MRKKR), pp. 393–407.

RTA-1996-HanusP #higher-order

Higher-Order Narrowing with Definitional Trees (MH, CP), pp. 138–152.

PLILP-1995-Arenas-SanchezG #debugging #lazy evaluation

A Debugging Model for Lazy Narrowing (PAS, AGL), pp. 453–454.

PLILP-1995-Fasbender #implementation

A Verified Implementation of Narrowing (HF), pp. 63–80.

PLILP-1995-NakaharaMI #calculus #functional #higher-order #logic programming

A Complete Narrowing Calculus for Higher-Order Functional Logic Programming (KN, AM, TI), pp. 97–114.

RTA-1995-Nieuwenhuis #constraints #on the #proving

On Narrowing, Refutation Proofs and Constraints (RN), pp. 56–70.

ALP-1994-WernerBK #how

How to Realize LSE Narrowing (AW, AB, SK), pp. 59–76.

PLILP-1994-Arenas-SanchezGL #constraints #lazy evaluation

Combining Lazy Narrowing with Disequality Constraints (PAS, AGL, FJLF), pp. 385–399.

PLILP-1994-Hanus #lazy evaluation

Combining Lazy Narrowing and Simplification (MH), pp. 370–384.

PLILP-1994-MaraistS #functional #graph #reduction

A Graph Reduction Technique with Sharing across Narrowings for Functional-Logic Languages (JM, FSKS), pp. 355–369.

POPL-1994-AntoyEH

A Needed Narrowing Strategy (SA, RE, MH), pp. 268–279.

CADE-1994-Lysne #consistency #on the #proving

On the Connection between Narrowing and Proof by Consistency (OL), pp. 133–147.

ICLP-1994-KirchnerR #algebra #constraints #theorem proving

Constraint Solving by Narrowing in Combined Algebraic Domains (HK, CR), pp. 617–631.

ICLP-1994-Moreno-Navarro

Default Rules: An Extension of Constructive Negation for Narrowing-based Languages (JJMN), pp. 535–549.

LICS-1994-Prehofer #higher-order

Higher-Order Narrowing (CP), pp. 507–516.

PLILP-1993-AlpuenteFRV #approximate #equation #logic programming #optimisation #source code

Narrowing Approximations as an Optimization for Equational Logic Programs (MA, MF, MJR, GV), pp. 391–409.

PLILP-1993-LoogenFR #lazy evaluation

A Demand Driven Computation Strategy for Lazy Narrowing (RL, FJLF, MRA), pp. 184–200.

PLILP-1993-Moreno-NavarroKMWH #analysis #lazy evaluation #performance #using

Efficient Lazy Narrowing using Demandedness Analysis (JJMN, HK, JMC, SW, WH), pp. 167–183.

ILPS-1993-Hanus #lazy evaluation #normalisation

Combining Lazy Narrowing and Normalization (MH), p. 673.

ALP-1992-Echahed

Uniform Narrowing Strategies (RE), pp. 259–275.

ALP-1992-Hanus #incremental

Incremental Rewriting in Narrowing Derivations (MH), pp. 228–243.

ALP-1992-MiddeldorpH

Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract) (AM, EH), pp. 244–258.

LOPSTR-1992-Jimenez-MartinMM #compilation #lazy evaluation #performance #prolog

Efficient Compilation of Lazy Narrowing into Prolog (JAJM, JMC, JJMN), pp. 253–270.

LOPSTR-1992-Loria-Saenz #source code #synthesis

Synthesis of Narrowing Programs (CLS), pp. 30–45.

PLILP-1992-CousotC #abstract interpretation

Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation (PC, RC), pp. 269–295.

PLILP-1992-KuchenMH #implementation #independence

Independent AND-Parallel Implementation of Narrowing (HK, JJMN, MVH), pp. 24–38.

PLILP-1992-Reus #algebra #higher-order #implementation #specification

Implementing Higher-Order Functions in an Algebraic Specification Language with Narrowing (BR), pp. 483–484.

CADE-1992-Christian #termination

Some Termination Criteria for Narrowing and E-Narrowing (JC), pp. 582–588.

CSL-1992-Gonzalez-MorenoHR #functional #logic programming #on the #semantics

On the Completeness of Narrowing as the Operational Semantics of Functional Logic Programming (JCGM, MTHG, MRA), pp. 216–230.

WSA-1991-CousotC91a #abstract interpretation #comparison

Comparison of the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation (PC, RC), pp. 107–110.

PLILP-1991-AlpuenteF #algorithm #constraints #incremental

Narrowing as an Incremental Constraint Satisfaction Algorithm (MA, MF), pp. 111–122.

PLILP-1991-ChakravartyL #implementation #lazy evaluation

The Implementation of Lazy Narrowing (MMTC, HCRL), pp. 123–134.

PLILP-1991-FrausH #proving #theorem proving

A Narrowing-Based Theorem Prover (UF, HH), pp. 421–422.

RTA-1991-ChabinR #graph

Narrowing Directed by a Graph of Terms (JC, PR), pp. 112–123.

RTA-1991-Fraus #proving #theorem proving

A Narrowing-Based Theorem Prover (UF), pp. 435–436.

RTA-1991-KrischerB #detection

Detecting Redundant Narrowing Derivations by the LSE-SL Reducability Test (SK, AB), pp. 74–85.

ALP-1990-Moreno-NavarroKLR #graph #lazy evaluation

Lazy Narrowing in a Graph Machine (JJMN, HK, RL, MRA), pp. 298–317.

PLILP-1990-Muck #compilation

Compilation of Narrowing (AM), pp. 16–29.

NACLP-1989-Chau #comparison #logic

Narrowing Grammar: A Comparison with Other Logic Grammars (HLC), pp. 735–754.

RTA-1989-DarlingtonG #abstraction #evaluation #functional #programming #set #unification

Narrowing and Unification in Functional Programming — An Evaluation Mechanism for Absolute Set Abstraction (JD, YG), pp. 92–108.

RTA-1989-Lindenstrauss #implementation #parallel

A Parallel Implementation of Rewriting and Narrowing (NL), pp. 569–573.

ICALP-1988-You #equation

Outer Narrowing for Equational Theories Based on Constructors (JHY), pp. 727–741.

ALP-1988-Bockmayr

Narrowing with Built-In Theories (AB), pp. 83–92.

ALP-1988-Giovannetti #programming language

Narrowing and Resolution in Logic-Functional programming Languages (Abstract) (EG), p. 30.

ALP-1988-Moreno-NavarroR #functional #logic programming #named #programming language

BABEL: A Functional and Logic Programming Language based on Constructor Discipline and Narrowing (JJMN, MRA), pp. 223–232.

ALP-1988-Wolter #equation

Narrowing in Partial Conditional Equational Theories (Abstract) (UW), p. 244.

JICSCP-1988-Holldobler88

From Paramodulation to Narrowing (SH), pp. 327–342.

ICLP-1987-Yamamoto87

A Theoretical Combination of SLD-Resolution and Narrowing (AY), pp. 470–487.

RTA-1987-Padawitz #reduction

Strategy-Controlled Reduction and Narrowing (PP), pp. 242–255.

RTA-1987-Rety

Improving Basic Narrowing Techniques (PR), pp. 228–241.

OOPSLA-1986-Kaehler #memory management #object-oriented

Virtual Memory on a Narrow Machine for an Object-Oriented Language (TK), pp. 87–106.

CADE-1986-DickC #automation #empirical #equation #reasoning #using

Using Narrowing to do Isolation in Symbolic Equation Solving — An Experiment in Automated Reasoning (AJJD, JC), pp. 272–280.

CADE-1986-Hussmann #algebra #prototype #specification #using

The Passau RAP System: Prototyping Algebraic Specifications Using Conditional Narrowing (HH), pp. 689–690.

SLP-1986-JosephsonD86 #implementation

An Implementation of Narrowing: The RITE Way (NAJ, ND), pp. 187–197.

RTA-1985-RetyKKL #algorithm #logic programming #named #unification

NARROWER: A New Algorithm for Unification and Its Application to Logic Programming (PR, CK, HK, PL), pp. 141–157.

SLP-1985-Reddy85 #functional #semantics

Narrowing as the Operational Semantics of Functional Languages (USR), pp. 138–151.

CADE-1984-Fribourg

A Narrowing Procedure for Theories with Constructors (LF), pp. 259–281.