Stem counter$ (all stems)

121 papers:

CIAA-2015-NakanishiY #automaton #problem #quantum

Classical and Quantum Counter Automata on Promise Problems (MN, AY), pp. 224–237.

DLT-2015-EremondiIM #on the

On the Density of Context-Free and Counter Languages (JE, OHI, IM), pp. 228–239.

ICALP-v2-2015-FijalkowHKS #bound #game studies #memory management

Trading Bounds for Memory in Games with Counters (NF, FH, DK, MS), pp. 197–208.

LATA-2015-EremondiIM #bound

Insertion Operations on Deterministic Reversal-Bounded Counter Machines (JE, OHI, IM), pp. 200–211.

CAV-2015-KonnovVW #abstraction #algorithm #distributed #model checking #smt

SMT and POR Beat Counter Abstraction: Parameterized Model Checking of Threshold-Based Distributed Algorithms (IK, HV, JW), pp. 85–102.

CSL-2015-KupfermanV #finite #on the #probability

On Relative and Probabilistic Finite Counterability (OK, GV), pp. 175–192.

HT-2014-Graells-GarridoL #microblog

Balancing diversity to counter-measure geographical centralization in microblogging platforms (EGG, ML), pp. 231–236.

PLDI-2014-LuuSSD #bound #constraints #string

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

CIAA-2014-BiasiY #automaton

Unary Languages Recognized by Two-Way One-Counter Automata (MDB, AY), pp. 148–161.

LATA-2014-GantyR #order #verification

Ordered Counter-Abstraction — Refinable Subword Relations for Parameterized Verification (PG, AR), pp. 396–408.

FM-2014-LakshmiAK #analysis #liveness #reachability #using

Checking Liveness Properties of Presburger Counter Systems Using Reachability Analysis (KVL, AA, RK), pp. 335–350.

POPL-2014-ChenE #debugging #fault #type system

Counter-factual typing for debugging type errors (SC, ME), pp. 583–594.

OSDI-2014-WiresIDHW

Characterizing Storage Workloads with Counter Stacks (JW, SI, ZD, NJAH, AW), pp. 335–349.

LICS-CSL-2014-BrazdilKKNK #automaton #multi #probability

Zero-reachability in probabilistic multi-counter automata (TB, SK, AK, PN, JPK), p. 10.

DAC-2013-WangK #control flow #detection #hardware #kernel #named #performance #using

NumChecker: detecting kernel control-flow modifying rootkits by using hardware performance counters (XW, RK), p. 7.

VLDB-2013-FenderM #top-down

Counter Strike: Generic Top-Down Join Enumeration for Hypergraphs (PF, GM), pp. 1822–1833.

TACAS-2013-BansalKWZ #abstraction

Structural Counter Abstraction (KB, EK, TW, DZ), pp. 62–77.

ICSM-2013-SyerJNHNF #execution #performance

Leveraging Performance Counters and Execution Logs to Diagnose Memory-Related Performance Issues (MDS, ZMJ, MN, AEH, MNN, PF), pp. 110–119.

STOC-2013-BohmGJ #automaton #equivalence

Equivalence of deterministic one-counter automata is NL-complete (SB, SG, PJ), pp. 131–140.

CIAA-2013-Crespi-ReghizziP #parallel

Deterministic Counter Machines and Parallel Matching Computations (SCR, PSP), pp. 280–291.

ICALP-v2-2013-DemriDS #complexity #on the #verification

On the Complexity of Verifying Regular Properties on Flat Counter Systems, (SD, AKD, AS), pp. 162–173.

LATA-2013-BalaJ #automaton #nondeterminism

Limited Non-determinism Hierarchy of Counter Automata (SB, DJ), pp. 92–103.

LATA-2013-Quaas #automaton #logic #metric #model checking

Model Checking Metric Temporal Logic over Automata with One Counter (KQ), pp. 468–479.

MoDELS-2013-FaunesCBSC #automation #metamodelling

Automatically Searching for Metamodel Well-Formedness Rules in Examples and Counter-Examples (MF, JJC, BB, HAS, BC), pp. 187–202.

MoDELS-2013-FaunesCBSC #automation #metamodelling

Automatically Searching for Metamodel Well-Formedness Rules in Examples and Counter-Examples (MF, JJC, BB, HAS, BC), pp. 187–202.

ICSE-2013-MaozS #specification

Counter play-out: executing unrealizable scenario-based specifications (SM, YS), pp. 242–251.

ASPLOS-2013-ArulrajCJL #hardware #performance

Production-run software failure diagnosis via hardware performance counters (JA, PCC, GJ, SL), pp. 101–112.

PPoPP-2013-DiceLM #scalability #statistics

Scalable statistics counters (DD, YL, MM), pp. 307–308.

CAV-2013-StewartEY #automaton #bound #model checking #polynomial #probability

Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata (AS, KE, MY), pp. 495–510.

LICS-2013-DemriFP #reasoning

Reasoning about Data Repetitions with Counter Systems (SD, DF, MP), pp. 33–42.

LICS-2013-HofmanMT #decidability #simulation

Decidability of Weak Simulation on One-Counter Nets (PH, RM, PT), pp. 203–212.

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

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

TACAS-2012-AbdullaACLR

Counter-Example Guided Fence Insertion under TSO (PAA, MFA, YFC, CL, AR), pp. 204–219.

DLT-J-2011-SayY12 #automaton #quantum

Quantum Counter Automata (ACCS, AY), pp. 1099–1116.

CIAA-2012-ReidenbachS #automaton #bound #nondeterminism

Automata with Modulo Counters and Nondeterministic Counter Bounds (DR, MLS), pp. 361–368.

ICALP-v2-2012-BrazdilKNW #markov #process #termination

Minimizing Expected Termination Time in One-Counter Markov Decision Processes (TB, AK, PN, DW), pp. 141–152.

LATA-2012-Bozzelli #abstraction #constraints #termination

Strong Termination for Gap-Order Constraint Abstractions of Counter Systems (LB), pp. 155–168.

IFM-2012-RochaBCN #bound #comprehension #debugging #model checking #programming #using

Understanding Programming Bugs in ANSI-C Software Using Bounded Model Checking Counter-Examples (HR, RSB, LCC, ADN), pp. 128–142.

CSCW-2012-Al-AniMCJ

The Egyptian blogosphere: a counter-narrative of the revolution (BAA, GM, JC, JJ), pp. 17–26.

ISMM-2012-InoueN #hardware #identification #java #source code

Identifying the sources of cache misses in Java programs without relying on hardware counters (HI, TN), pp. 133–142.

CAV-2012-HagueL #analysis #bound #parallel #source code #thread

Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters (MH, AWL), pp. 260–276.

IJCAR-2012-DemriDS #ltl

Taming Past LTL and Flat Counter Systems (SD, AKD, AS), pp. 179–193.

VMCAI-2012-BozzelliP #abstraction #constraints #verification

Verification of Gap-Order Constraint Abstractions of Counter Systems (LB, SP), pp. 88–103.

DLT-J-2009-Petersen11 #bound #simulation

Simulations by Time-Bounded Counter Machines (HP), pp. 395–409.

ICALP-v2-2011-BrazdilBEK #approximate #game studies #probability #termination

Approximating the Termination Value of One-Counter MDPs and Stochastic Games (TB, VB, KE, AK), pp. 332–343.

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

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

FoSSaCS-2010-DemriS #decidability #ltl #model checking

When Model-Checking Freeze LTL over Counter Machines Becomes Decidable (SD, AS), pp. 176–190.

ICALP-v2-2010-GollerHOW #automaton #model checking #parametricity

Model Checking Succinct and Parametric One-Counter Automata (SG, CH, JO, JW), pp. 575–586.

HPDC-2010-LimPF #named #performance #using

SoftPower: fine-grain power estimations using performance counters (MYL, AP, RJF), pp. 308–311.

ICST-2010-AngelisPA #approach #testing

A Counter-Example Testing Approach for Orchestrated Services (FDA, AP, GDA), pp. 373–382.

ICDAR-2009-NagyCBSLS

Camera-Based Ballot Counter (GN, BC, AB, GS, DPL, EHBS), pp. 151–155.

DLT-2009-Petersen #bound #simulation

Simulations by Time-Bounded Counter Machines (HP), pp. 410–418.

LATA-2009-FredrikssonG #string

Nested Counters in Bit-Parallel String Matching (KF, SG), pp. 338–349.

FM-2009-SunLRLD #abstraction #model checking #process

Fair Model Checking with Process Counter Abstraction (JS, YL, AR, SL, JSD), pp. 123–139.

CAV-2009-BaslerMWK #abstraction #concurrent

Symbolic Counter Abstraction for Concurrent Software (GB, MM, TW, DK), pp. 64–78.

CSL-2009-To #model checking #process

Model Checking FO(R) over One-Counter Processes and beyond (AWT), pp. 485–499.

LICS-2009-GollerMT #complexity #on the #process #verification

On the Computational Complexity of Verifying One-Counter Processes (SG, RM, AWT), pp. 235–244.

MBT-2009-KimHHK #concurrent #debugging #kernel #modelling #testing

Model-based Kernel Testing for Concurrency Bugs through Counter Example Replay (MK, SH, CH, TK), pp. 21–36.

FoSSaCS-2008-DemriLS #automaton #ltl #model checking

Model Checking Freeze LTL over One-Counter Automata (SD, RL, AS), pp. 490–504.

ASPLOS-2008-ShenZDLSZ #hardware #on the fly

Hardware counter driven on-the-fly request signatures (KS, MZ, SD, CL, CS, XZ), pp. 189–200.

TAP-2008-ClaessenS #induction #proving

Finding Counter Examples in Induction Proofs (KC, HS), pp. 48–65.

DATE-2007-VermaI #automation #scalability #synthesis

Automatic synthesis of compressor trees: reevaluating large counters (AKV, PI), pp. 443–448.

TACAS-2007-JainKSC #abstraction #named #refinement

VCEGAR: Verilog CounterExample Guided Abstraction Refinement (HJ, DK, NS, EMC), pp. 583–586.

SEKE-2007-VasileB #cost analysis #multi

Cost-based Analysis of Multiple Counter-Examples (FV, SB), pp. 33–38.

CGO-2007-CavazosFABOT #compilation #optimisation #performance #using

Rapidly Selecting Good Compiler Optimizations using Performance Counters (JC, GF, FVA, EVB, MFPO, OT), pp. 185–197.

FoSSaCS-2006-Serre #game studies #graph #process

Parity Games Played on Transition Graphs of One-Counter Processes (OS), pp. 337–351.

ICALP-v2-2006-BozgaIL #automaton #parametricity

Flat Parametric Counter Automata (MB, RI, YL), pp. 577–588.

ICEIS-AIDSS-2006-RosaGPSMLP #traceability

Frequency Calibrations with Conventional Time Interval Counters via GPS Traceability (JJGdlR, ILG, CGP, JMGS, AMM, MLR, VP), pp. 189–201.

FSE-2006-HalfondOM #evaluation #injection #sql #using

Using positive tainting and syntax-aware evaluation to counter SQL injection attacks (WGJH, AO, PM), pp. 175–185.

ASPLOS-2006-EyermanEKS #architecture #component #performance

A performance counter architecture for computing accurate CPI components (SE, LE, TK, JES), pp. 175–184.

HPCA-2006-IsciM

Phase characterization for power: evaluating control-flow-based and event-counter-based techniques (CI, MM), pp. 121–132.

HPCA-2006-RileyZ #predict #probability

Probabilistic counter updates for predictor hysteresis and stratification (NR, CBZ), pp. 110–120.

CAV-2006-BouajjaniBHIMV #automaton #source code

Programs with Lists Are Counter Automata (AB, MB, PH, RI, PM, TV), pp. 517–531.

DLT-2005-Karianto #automaton #graph

Adding Monotonic Counters to Automata and Transition Graphs (KW), pp. 308–319.

DATE-v1-2004-BjesseK #abstraction #debugging #refinement #using

Using Counter Example Guided Abstraction Refinement to Find Complex Bugs (PB, JHK), pp. 156–161.

TACAS-2004-BardinFL #automaton #performance

FASTer Acceleration of Counter Automata in Practice (SB, AF, JL), pp. 576–590.

HPCA-2004-GniadyHL #power management

Program Counter Based Techniques for Dynamic Power Management (CG, YCH, YHL), pp. 24–35.

OSDI-2004-GniadyBH #classification

Program-Counter-Based Pattern Classification in Buffer Caching (CG, ARB, YCH), pp. 395–408.

IJCAR-2004-Larchey-Wendling #logic

Counter-Model Search in Gödel-Dummett Logics (DLW), pp. 274–288.

TACAS-2003-AlurDI #abstraction #hybrid

Counter-Example Guided Predicate Abstraction of Hybrid Systems (RA, TD, FI), pp. 208–223.

TACAS-2003-GurfinkelC #proving

Proof-Like Counter-Examples (AG, MC), pp. 160–175.

SAS-2003-KremenekE #approximate #named #static analysis #statistics #using

Z-Ranking: Using Statistical Analysis to Counter the Impact of Static Analysis Approximations (TK, DRE), pp. 295–315.

ICALP-2003-Mayr #bisimulation #equivalence #process

Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes (RM), pp. 570–583.

CAV-2003-XieDIP #problem #verification

Dense Counter Machines and Verification Problems (GX, ZD, OHI, PSP), pp. 93–105.

FoSSaCS-2002-JancarKMS #automaton #bound #proving

Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds (PJ, AK, FM, ZS), pp. 172–186.

SAS-2002-Yavuz-KahveciB #automation #concurrent #verification

Automated Verification of Concurrent Linked Lists with Counters (TYK, TB), pp. 69–84.

DLT-2002-Hoogeboom #automaton

Carriers and Counters: P Systems with Carriers vs. (Blind) Counter Automata (HJH), pp. 140–151.

DLT-2002-IbarraDS #automaton #finite #safety #verification

Safety Verification for Two-Way Finite Automata with Monotonic Counters (OHI, ZD, ZWS), pp. 326–338.

CADE-2002-Larchey-Wendling #logic

Combining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic (DLW), pp. 94–110.

CAV-2002-BryantLS #logic #modelling #using #verification

Modeling and Verifying Systems Using a Logic of Counter Arithmetic with λ Expressions and Uninterpreted Functions (REB, SKL, SAS), pp. 78–92.

CAV-2002-PnueliXZ #abstraction #liveness

Liveness with (0, 1, infty)-Counter Abstraction (AP, JX, LDZ), pp. 107–122.

TACAS-2001-PasareanuDV #java #model checking #source code

Finding Feasible Counter-examples when Model Checking Abstracted Java Programs (CSP, MBD, WV), pp. 284–298.

PASTE-2001-KadayifCKVIS #energy #named

vEC: virtual energy counters (IK, TC, MTK, NV, MJI, AS), pp. 28–31.

CSL-2001-Finkel #automaton #effectiveness

An Effective Extension of the Wagner Hierarchy to Blind Counter Automata (OF), pp. 369–383.

DATE-2000-LogothetisS #abstraction #realtime

Abstraction from Counters: An Application on Real-Time Systems (GL, KS), pp. 486–493.

ICALP-2000-Kucera #algorithm #performance #process #verification

Efficient Verification Algorithms for One-Counter Processes (AK), pp. 317–328.

ICPR-v4-2000-AlbiolNM #people #realtime #tool support #using

Real-Time High Density People Counter Using Morphological Tools (AA, VN, IM), pp. 4652–4655.

TOOLS-ASIA-2000-LiH

Counter Inference of Intelligent Agents (XL, WH), pp. 148–157.

CAV-2000-AnnichiniAB #parametricity #reasoning

Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems (AA, EA, AB), pp. 419–434.

CHI-1999-YarinI #design #interactive #named #physics

TouchCounters: Designing Interactive Electronic Labels for Physical Containers (PY, HI), pp. 362–369.

ASPLOS-1998-Weissman #approach #concurrent #locality #performance #thread

Performance Counters and State Sharing Annotations: a Unified Approach to Thread Locality (BW), pp. 127–138.

HPCA-1998-MillerJL #architecture

Non-Stalling CounterFlow Architecture (MFM, KJJ, SLL), pp. 334–341.

CAV-1998-ComonJ #analysis #automaton #multi #safety

Multiple Counters Automata, Safety Analysis and Presburger Arithmetic (HC, YJ), pp. 268–279.

EDTC-1997-CabodiCLQ #synthesis #verification

Verification and synthesis of counters based on symbolic techniques (GC, PC, LL, SQ), pp. 176–181.

EDTC-1997-MirandaKCM #architecture #generative #hardware #optimisation

Architectural exploration and optimization for counter based hardware address generation (MM, MK, FC, HDM), pp. 293–298.

PLDI-1997-AmmonsBL #hardware #performance #profiling

Exploiting Hardware Performance Counters with Flow and Context Sensitive Profiling (GA, TB, JRL), pp. 85–96.

ICALP-1997-Jancar #bisimulation #decidability #equivalence #process

Bisimulation Equivalence is Decidable for One-Counter Processes (PJ), pp. 549–559.

CADE-1997-DefourneauxP #proving

Partial Matching for Analogy Discovery in Proofs and Counter-Examples (GD, NP), pp. 431–445.

ISSTA-1996-BultanFG #composition #model checking #verification

Compositional Verification by Model Checking for Counter-Examples (TB, JF, RG), pp. 224–238.

DLT-1995-SchieringT #automaton #first-order #logic

Counter-Free Automata, First-Order Logic and Star-Free Expressions (IS, WT), pp. 166–175.

SAC-1994-ConradJ #people #realtime

A real-time people counter (GC, RJ), pp. 20–24.

DAC-1993-Tokarnia

Minimal Shift Counters and Frequency Division (AMT), pp. 19–24.

ICALP-1993-IbarraJTW #decidability

New Decidability Results Concerning Two-way Counter Machines and Applications (OHI, TJ, NQT, HW), pp. 313–324.

ASPLOS-1989-Mellor-CrummeyL

A Software Instruction Counter (JMMC, TJL), pp. 78–86.

ICALP-1982-DurisG #automaton #bound #on the

On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store (PD, ZG), pp. 166–175.

STOC-1981-Chan #complexity

Reversal Complexity of Counter Machines (ThC), pp. 146–157.

STOC-1981-DurisG #automaton

Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two Way Machines (Preliminary Version) (PD, ZG), pp. 177–188.

ICSE-1981-Forman #on the #traversal

On the Time Overhead of Counters and Traversal Markers (IRF), pp. 164–169.

STOC-1979-GurariI #complexity #equivalence #linear #problem #set #source code

The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs (EMG, OHI), pp. 142–152.

STOC-1972-Plaisted

Flowchart Schemata with Counters (DAP), pp. 44–51.

STOC-1971-Boasson #theorem

An Iteration Theorem for One-Counter Languages (LB), pp. 116–120.