## Stem provabl$ (all stems)

### 69 papers:

- PLDI-2015-LopesMNR #optimisation
- Provably correct peephole optimizations with alive (NPL, DM, SN, JR), pp. 22–32.
- ICML-2015-BoutsidisKG #clustering
- Spectral Clustering via the Power Method — Provably (CB, PK, AG), pp. 40–48.
- ICML-2015-GhoshdastidarD #clustering
- A Provable Generalized Tensor Spectral Method for Uniform Hypergraph Partitioning (DG, AD), pp. 400–409.
- DATE-2014-ConosMDP #coordination #energy #power management #using
- Provably minimal energy using coordinated DVS and power gating (NAC, SM, FD, MP), pp. 1–6.
- ICML-c1-2014-AroraBGM #bound #learning
- Provable Bounds for Learning Some Deep Representations (SA, AB, RG, TM), pp. 584–592.
- ICML-c2-2014-AsterisPD
- Nonnegative Sparse PCA with Provable Guarantees (MA, DSP, AGD), pp. 1728–1736.
- KDD-2014-PapailiopoulosKB
- Provable deterministic leverage score sampling (DSP, ATK, CB), pp. 997–1006.
- PPoPP-2014-AgrawalFSSU #data type #parallel #scheduling #source code
- Provably good scheduling for parallel programs that use data structures through implicit batching (KA, JTF, BS, JS, RU), pp. 389–390.
- AdaEurope-2013-FaginC #case study #reliability
- Provably Secure DNS: A Case Study in Reliable Software (BSF, MCC), pp. 81–93.
- ICML-c2-2013-AroraGHMMSWZ #algorithm #modelling #topic
- A Practical Algorithm for Topic Modeling with Provable Guarantees (SA, RG, YH, DMM, AM, DS, YW, MZ), pp. 280–288.
- ICML-c3-2013-GopiN0N
- One-Bit Compressed Sensing: Provable Support and Vector Recovery (SG, PN, PJ, AVN), pp. 154–162.
- STOC-2012-AroraGKM #matrix
- Computing a nonnegative matrix factorization — provably (SA, RG, RK, AM), pp. 145–162.
- ICML-2012-BelletHS #classification #learning #linear #similarity
- Similarity Learning for Provably Accurate Sparse Linear Classification (AB, AH, MS), p. 193.
- STOC-2011-Pass #security #standard
- Limits of provable security from standard assumptions (RP), pp. 109–118.
- DAC-2009-FengZYTZ #algorithm #performance
- Provably good and practically efficient algorithms for CMP dummy fill (CF, HZ, CY, JT, XZ), pp. 539–544.
- ICALP-v1-2009-ArbitmanNS #performance #worst-case
- De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results (YA, MN, GS), pp. 107–118.
- FM-2009-JeffordsHAL #composition #fault tolerance #formal method #refinement #using
- A Formal Method for Developing Provably Correct Fault-Tolerant Systems Using Partial Refinement and Composition (RDJ, CLH, MA, EIL), pp. 173–189.
- ECOOP-2009-JacobsP #exception #named
- Failboxes: Provably Safe Exception Handling (BJ, FP), pp. 470–494.
- DLT-2008-GruberH #automaton #finite #regular expression
- Provably Shorter Regular Expressions from Deterministic Finite Automata (HG, MH), pp. 383–395.
- FM-2008-AktugDG #monitoring #runtime
- Provably Correct Runtime Monitoring (IA, MD, DG), pp. 262–277.
- DAC-2007-LiuLC #algorithm #approximate #multi #optimisation #using
- A Provably Good Approximation Algorithm for Power Optimization Using Multiple Supply Voltages (HYL, WPL, YWC), pp. 887–890.
- PLDI-2007-VechevYBR #automation #concurrent #named
- CGCExplorer: a semi-automated search procedure for provably correct concurrent collectors (MTV, EY, DFB, NR), pp. 456–467.
- RecSys-2007-ResnickS #recommendation
- The influence limiter: provably manipulation-resistant recommender systems (PR, RS), pp. 25–32.
- DATE-2006-SutharD #detection #fault #multi #online #performance #testing
- Efficient on-line interconnect testing in FPGAs with provable detectability for multiple faults (VS, SD), pp. 1165–1170.
- STOC-2006-LeviRS #algorithm #modelling #probability
- Provably near-optimal sampling-based algorithms for Stochastic inventory control models (RL, RR, DBS), pp. 739–748.
- ICALP-v2-2006-DuboisGS #performance
- An Efficient Provable Distinguisher for HFE (VD, LG, JS), pp. 156–167.
- SAC-2006-BoldoM #evaluation
- Provably faithful evaluation of polynomials (SB, CM), pp. 1328–1332.
- LICS-2006-Gordon #implementation #protocol #security
- Provable Implementations of Security Protocols (ADG), pp. 345–346.
- SEKE-2005-SenachakSOF #java
- Provably Correct Translation from CafeOBJ into Java (JS, TS, KO, KF), pp. 614–619.
- PADL-2005-WangGL #code generation #continuation #logic #semantics #towards
- Towards Provably Correct Code Generation via Horn Logical Continuation Semantics (QW, GG, ML), pp. 98–112.
- PADL-2005-YangDRS #compilation #mobile #model checking #performance #process
- A Provably Correct Compiler for Efficient Model Checking of Mobile Processes (PY, YD, CRR, SAS), pp. 113–127.
- DAC-2004-VermaDS #online #performance #testing
- Efficient on-line testing of FPGAs with provable diagnosabilities (VV, SD, VS), pp. 498–503.
- FoSSaCS-2004-Leivant #correctness #logic
- Partial Correctness Assertions Provable in Dynamic Logics (DL), pp. 304–317.
- ICALP-2004-AwerbuchS #distributed #protocol
- Group Spreading: A Protocol for Provably Secure Distributed Name Service (BA, CS), pp. 183–195.
- CSL-2004-Cordon-FrancoFM #induction #recursion
- Provably Total Primitive Recursive Functions: Theories with Induction (ACF, AFM, FFLM), pp. 355–369.
- PLDI-2003-ChenWAF #optimisation
- A provably sound TAL for back-end optimization (JC, DW, AWA, HF), pp. 208–219.
- ICML-2003-SchoknechtM #algorithm #performance
- TD(0) Converges Provably Faster than the Residual Gradient Algorithm (RS, AM), pp. 680–687.
- ICALP-2002-AkcogluDK #performance
- Fast Universalization of Investment Strategies with Provably Good Relative Returns (KA, PD, MYK), pp. 888–900.
- SAT-2002-AchlioptasM
- A bit of abstinence (provably) promotes satisfaction (DA, CM), p. 25.
- SAC-2001-HuangH #approach #clustering
- Finding a hamiltonian paths in tournaments on clusters — a provably communication-efficient approach (CHH, XH), pp. 549–553.
- CADE-1999-DemriG #first-order #logic
- Tractable Transformations from Modal Provability Logics into First-Order Logic (SD, RG), pp. 16–30.
- FM-1998-BalserRSS
- KIV 3.0 for Provably Correct Systems (MB, WR, GS, KS), pp. 330–337.
- CAV-1997-CimattiGPPPRTY #certification #embedded #safety #verification
- A Provably Correct Embedded Verifier for the Certification of Safety Critical Software (AC, FG, PP, BP, JP, DR, PT, BY), pp. 202–213.
- ICFP-1996-BlellochG #implementation #performance
- A Provable Time and Space Efficient Implementation of NESL (GEB, JG), pp. 213–225.
- KR-1996-AmatiP #logic #question #reasoning
- Is There a Logic of Provability for Nonmonotonic Reasoning? (GA, FP), pp. 493–503.
- POPL-1996-GreinerB #implementation #parallel
- A Provably Time-Efficient Parallel Implementation of Full Speculation (JG, GEB), pp. 309–321.
- STOC-1995-BellareR
- Provably secure session key distribution: the three party case (MB, PR), pp. 57–66.
- PLILP-1994-HamelG #compilation #towards
- Towards a Provably Correct Compiler for OBJ3 (LHH, JAG), pp. 132–146.
- CC-1994-FranzleM #code generation #programming language #realtime #towards
- Towards Provably Correct Code Generation for a Hard Real-Time Programming Language (MF, MMO), pp. 294–308.
- CC-1994-LammelR #correctness #prototype
- Provable Correctness of Prototype Interpreters in LDL (RL, GR), pp. 218–232.
- CADE-1994-Bruning #detection
- Detecting Non-Provable Goals (SB), pp. 222–236.
- FME-1993-RaoPS #compilation #development #tool support #verification
- Verification Tools in the Development of Provably Correct Compilers (MRKKR, PKP, RKS), pp. 442–461.
- ILPS-1993-Harland #logic #on the
- On Goal-Directed Provability in Classical Logic (JH), p. 677.
- ESOP-1992-Palsberg #compilation #generative
- A Provably Correct Compiler Generator (JP), pp. 418–434.
- ML-1992-SubramanianH #algorithm #design
- Measuring Utility and the Design of Provably Good EBL Algorithms (DS, SH), pp. 426–425.
- CC-1992-ButhBFKLLM #compilation #development #implementation
- Provably Correct Compiler Development and Implementation (BB, KHB, MF, BvK, YL, HL, MMO), pp. 141–155.
- ICALP-1991-Fernando #recursion #source code
- Provably Recursive Programs and Program Extraction (TF), pp. 303–313.
- CSL-1991-ChirimarL
- Provability in TBLL: A Decision Procedure (JC, JL), pp. 53–67.
- STOC-1990-NaorY
- Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks (MN, MY), pp. 427–437.
- ICALP-1990-TuckerWZ #data type
- Provable Computable Functions on Abstract Data Types (JVT, SSW, JIZ), pp. 660–673.
- STOC-1989-ImpagliazzoR #permutation
- Limits on the Provable Consequences of One-Way Permutations (RI, SR), pp. 44–61.
- STOC-1989-Vallee #integer #performance #polynomial
- Provably Fast Integer Factoring with Quasi-Uniform Small Quadratic Residues (BV), pp. 98–106.
- CSL-1989-KrajicekP #modelling
- Propositional Provability and Models of Weak Arithmetic (JK, PP), pp. 193–210.
- ICALP-1988-RajasekaranR
- Nested Annealing: A Provable Improvement to Simulated Annealing (SR, JHR), pp. 455–472.
- STOC-1986-CoffmanL #algorithm #performance
- A Provably Efficient Algorithm for Dynamic Storage Allocation (EGCJ, FTL), pp. 77–90.
- STOC-1985-BruceL #equation #modelling #morphism
- Provable Isomorphisms and Domain Equations in Models of Typed Languages (Preliminary Version) (KBB, GL), pp. 263–272.
- STOC-1985-RaghavanT #array #graph
- Provably Good Routing in Graphs: Regular Arrays (PR, CDT), pp. 79–87.
- STOC-1982-Leighton #layout
- A Layout Strategy for VLSI which Is Provably Good (Extended Abstract) (FTL), pp. 85–98.
- ICSE-1976-BasuM #source code
- Some Classes of Naturally Provable Programs (SKB, JM), pp. 400–406.