Stem unbound$ (all stems)

58 papers:

VLDB-2015-AkidauBCCFLMMPS #approach #bound #correctness #data flow #latency

The Dataflow Model: A Practical Approach to Balancing Correctness, Latency, and Cost in Massive-Scale, Unbounded, Out-of-Order Data Processing (TA, RB, CC, SC, RFM, RL, SM, DM, FP, ES, SW), pp. 1792–1803.

TACAS-2015-Nguyen0TP #bound #c #contest #lazy evaluation #source code

Unbounded Lazy-CSeq: A Lazy Sequentialization Tool for C Programs with Unbounded Context Switches — (Competition Contribution) (TLN, BF, SLT, GP), pp. 461–463.

SAS-2015-CattaruzzaASK #analysis #bound

Unbounded-Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration (DC, AA, PS, DK), pp. 312–331.

STOC-2015-KoppulaLW #bound #memory management #obfuscation #turing machine

Indistinguishability Obfuscation for Turing Machines with Unbounded Memory (VK, ABL, BW), pp. 419–428.

POPL-2015-FarzanKP #bound #parallel #proving

Proof Spaces for Unbounded Parallelism (AF, ZK, AP), pp. 407–420.

ICST-2015-XuLCK #approach #bound #detection #lightweight #thread

A Lightweight, Static Approach to Detecting Unbounded Thread-Instantiation Loops (JX, YL, RHC, DCK), pp. 1–10.

ASE-2014-BasuB #automation #bound #interactive #verification

Automatic verification of interactions in asynchronous systems with unbounded buffers (SB, TB), pp. 743–754.

VLDB-2015-BegumK14 #bound

Rare Time Series Motif Discovery from Unbounded Streams (NB, EJK), pp. 149–160.

PLDI-2014-LuuSSD #bound #constraints #string

A model counter for constraints over unbounded strings (LL, SS, PS, BD), p. 57.

ICALP-v1-2014-MancinskaV #bound #probability

Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability (LM, TV), pp. 835–846.

ICML-c2-2014-Kontorovich #algorithm #bound #metric

Concentration in unbounded metric spaces and algorithmic stability (AK), pp. 28–36.

KR-2014-LomuscioM14a #bound #model checking

Model Checking Unbounded Artifact-Centric Systems (AL, JM).

CAV-2014-LeeS #abstraction #approximate #bound #reachability #scalability #verification

Unbounded Scalable Verification Based on Approximate Property-Directed Reachability and Datapath Abstraction (SL, KAS), pp. 849–865.

TAP-2014-HentschelHB #bound #execution #symbolic computation #visualisation

Visualizing Unbounded Symbolic Execution (MH, RH, RB), pp. 82–98.

DATE-2013-CabodiLV #bound #model checking #optimisation

Optimization techniques for craig interpolant compaction in unbounded model checking (GC, CL, DV), pp. 1417–1422.

TACAS-2013-GangeNSSS #bound #constraints #model checking #regular expression

Unbounded Model-Checking with Interpolation for Regular Language Constraints (GG, JAN, PJS, HS, PS), pp. 277–291.

TACAS-2013-MorseCNF #bound #contest

Handling Unbounded Loops with ESBMC 1.20 — (Competition Contribution) (JM, LCC, DN, BF), pp. 619–622.

CAV-2013-FarzanK #bound #named #parallel #static analysis

Duet: Static Analysis for Unbounded Parallelism (AF, ZK), pp. 191–196.

CAV-2013-KomuravelliGCC #abstraction #automation #bound #model checking #smt

Automatic Abstraction in SMT-Based Unbounded Software Model Checking (AK, AG, SC, EMC), pp. 846–862.

ICST-2013-HillTB #bound #c++ #named

GrowthTracker: Diagnosing Unbounded Heap Growth in C++ Software (EH, DJT, SB), pp. 134–143.

ASE-2012-NijjarB #bound #smt #using #verification

Unbounded data model verification using SMT solvers (JN, TB), pp. 210–219.

CAV-2012-Moskal #bound #c #infinity #verification

From C to Infinity and Back: Unbounded Auto-active Verification with VCC (MM), p. 6.

IJCAR-2012-SpielmannK #bound #synthesis

Synthesis for Unbounded Bit-Vector Arithmetic (AS, VK), pp. 499–513.

ICALP-v2-2011-BrazdilKKV #analysis #bound #probability #recursion #runtime #source code

Runtime Analysis of Probabilistic Programs with Unbounded Recursion (TB, SK, AK, IHV), pp. 319–331.

ICFP-2011-WeirichYS #bound

Binders unbound (SW, BAY, TS), pp. 333–345.

CAV-2011-BrazdilKK #analysis #bound #performance #probability #source code

Efficient Analysis of Probabilistic Programs with an Unbounded Counter (TB, SK, AK), pp. 208–224.

ASE-2010-HeJBGW #approach #bound #model checking #statistics

A bounded statistical approach for model checking of unbounded until properties (RH, PJ, SB, APG, HW), pp. 225–234.

CAV-2010-BouajjaniDERS #bound #invariant #source code #synthesis

Invariant Synthesis for Programs Manipulating Lists with Unbounded Data (AB, CD, CE, AR, MS), pp. 72–88.

FM-2009-HarrisKCJR #bound #data flow #process #verification

Verifying Information Flow Control over Unbounded Processes (WRH, NK, SC, SJ, TWR), pp. 773–789.

IFM-2009-Cook #bound #hardware #synthesis

Taming the Unbounded for Hardware Synthesis (BC), p. 39.

TAP-2009-Rapin #bound #execution #model checking #symbolic computation

Symbolic Execution Based Model Checking of Open Systems with Unbounded Variables (NR), pp. 137–152.

LATA-2008-ArrighiNW #automaton #bound #finite #quantum

One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations (PA, VN, RFW), pp. 64–75.

LATA-2008-Perekrestenko #bound #np-hard

Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard (AP), pp. 421–432.

ICALP-2007-IwamaNRY #bound #communication #complexity #quantum

Unbounded-Error One-Way Classical and Quantum Communication Complexity (KI, HN, RR, SY), pp. 110–121.

CSL-2007-Burel #bound #deduction

Unbounded Proof-Length Speed-Up in Deduction Modulo (GB), pp. 496–511.

TACAS-2006-LiS #abstraction #bound #model checking #performance #refinement

Efficient Abstraction Refinement in Interpolation-Based Unbounded Model Checking (BL, FS), pp. 227–241.

CIAA-2006-GalvezSF #bound #linear #lookahead #parsing

Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time (JFG, SS, JF), pp. 253–264.

SAC-2006-MeerWA #bound #composition #interactive #performance

Efficient interactive configuration of unbounded modular systems (ERvdM, AW, HRA), pp. 409–414.

ASPLOS-2006-ChuangNVSBPCC #bound #memory management #transaction

Unbounded page-based transactional memory (WC, SN, GV, JS, MVB, GP, BC, OC), pp. 347–358.

DATE-2005-CabodiCNQ #bound #model checking #quantifier #set

Circuit Based Quantification: Back to State Set Manipulation within Unbounded Model Checking (GC, MC, SN, SQ), pp. 688–689.

HPCA-2005-AnanianAKLL #bound #memory management #transaction

Unbounded Transactional Memory (CSA, KA, BCK, CEL, SL), pp. 316–327.

STOC-2004-Feige #bound #graph #independence #on the #random

On sums of independent random variables with unbounded variance, and estimating the average degree in a graph (UF), pp. 594–603.

CAV-2004-BinghamCHQZ #automation #bound #consistency #verification

Automatic Verification of Sequential Consistency for Unbounded Addresses and Data Values (JDB, AC, AJH, SQ, ZZ), pp. 427–439.

CAV-2004-LahiriB #bound #verification

Indexed Predicate Discovery for Unbounded System Verification (SKL, REB), pp. 135–147.

DAC-2003-KangP #bound #model checking #satisfiability

SAT-based unbounded symbolic model checking (HJK, ICP), pp. 840–843.

TACAS-2003-CiardoMS #bound

Saturation Unbound (GC, RMM, RS), pp. 379–393.

CAV-2003-SeshiaB #automaton #bound #model checking #using

Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods (SAS, REB), pp. 154–166.

CSL-2003-ChevalierKRTV #bound

Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions (YC, RK, MR, MT, LV), pp. 128–141.

CAV-2002-ChevalierV #automation #bound #protocol #security #verification

Automated Unbounded Verification of Security Protocols (YC, LV), pp. 324–337.

CAV-2002-McMillan #bound #model checking #satisfiability

Applying SAT Methods in Unbounded Symbolic Model Checking (KLM), pp. 250–264.

CSL-2002-Nipkow #bound #hoare #logic #nondeterminism #recursion

Hoare Logics for Recursive Procedures and Unbounded Nondeterminism (TN), pp. 103–119.

CAV-2000-AbdullaIN #bound #petri net

Unfoldings of Unbounded Petri Nets (PAA, SPI, AN), pp. 495–507.

IWTCS-1999-BaumgartenH #bound #testing

Testability with Unbounded Testing Strategies (BB, OH), pp. 43–60.

CAV-1998-AbdullaBJ #analysis #bound #on the fly

On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels (PAA, AB, BJ), pp. 305–318.

STOC-1983-ChandraFL83a #bound

Unbounded Fan-in Circuits and Associative Functions (AKC, SF, RJL), pp. 52–60.

POPL-1982-ReifS #bound #communication #distributed #variability

Unbounded Speed Variability in Distributed Communication Systems (JHR, PGS), pp. 46–56.

ICALP-1980-Back #bound #nondeterminism #semantics

Semantics of Unbounded Nondeterminism (RJB), pp. 51–63.

ICALP-1980-RaoultV #bound #semiparsing

Optimal Unbounded Search Strategies (JCR, JV), pp. 512–530.