22 papers:
- DAC-2015-AsadJ #programming #using #verification
- Verifying inevitability of phase-locking in a charge pump phase lock loop using sum of squares programming (HuA, KDJ), p. 6.
- DHM-EH-2015-SinghWLMW #formal method #modelling #reasoning #requirements
- Stepwise Formal Modelling and Reasoning of Insulin Infusion Pump Requirements (NKS, HW, ML, TSEM, AW), pp. 387–398.
- DLT-2014-Sorokin #context-free grammar
- Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars (AS), pp. 154–165.
- LATA-2014-Kalocinski #on the
- On Computability and Learnability of the Pumping Lemma Function (DK), pp. 433–440.
- DUXU-ELAS-2014-KarlinPC #experience #learning #online #user interface
- Pumping Up the Citizen Muscle Bootcamp: Improving User Experience in Online Learning (BK, BP, AC), pp. 562–573.
- DATE-2013-CanisAB #multi #reduction #synthesis
- Multi-pumping for resource reduction in FPGA high-level synthesis (AC, JHA, SDB), pp. 194–197.
- LATA-2013-Shamir
- Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars (ES), pp. 516–522.
- KDD-2013-FeiKSNMH #detection #learning
- Heat pump detection from coarse grained smart meter data with positive and unlabeled learning (HF, YK, SS, MRN, SKM, JH), pp. 1330–1338.
- LICS-2013-Kobayashi #type system
- Pumping by Typing (NK0), pp. 398–407.
- CASE-2012-YangHTLSL #automation #process
- A vacuum-pumped microfluidic device for automated in-line mixing and focusing processes (ASY, HHH, LYT, PHL, TLS, CLL), pp. 109–114.
- FM-2012-ZhaoZKL #approach #case study #hybrid #industrial
- A “Hybrid” Approach for Synthesizing Optimal Controllers of Hybrid Systems: A Case Study of the Oil Pump Industrial Example (HZ, NZ, DK, KGL), pp. 471–485.
- CASE-2011-LeonardoKKDS #monitoring #simulation
- Simulation of a hydraulic pump application for monitoring and diagnosis methods (DL, SK, AKH, AD, RS), pp. 341–345.
- CSL-2011-Kartzow #automaton #graph
- A Pumping Lemma for Collapsible Pushdown Graphs of Level 2 (AK), pp. 322–336.
- ICALP-v2-2010-ChambartS #problem
- Pumping and Counting on the Regular Post Embedding Problem (PC, PS), pp. 64–75.
- DLT-2009-Kanazawa #context-free grammar #multi
- The Pumping Lemma for Well-Nested Multiple Context-Free Languages (MK), pp. 312–325.
- ITiCSE-2005-Gal-EzerT #automaton #challenge #education
- Challenges in teaching the pumping lemma in automata theory course (JGE, MBT), p. 369.
- DATE-2003-BurbidgeTR #automation #embedded #monitoring
- Techniques for Automatic On Chip Closed Loop Transfer Function Monitoring For Embedded Charge Pump Phase Locked Loops (MJB, JT, AR), pp. 10496–10503.
- FoSSaCS-1998-Beauquier #automaton
- Pumping Lemmas for Timed Automata (DB), pp. 81–94.
- ICALP-1994-CaronCCDJ #constraints
- Pumping, Cleaning and Symbolic Constraints Solving (ACC, HC, JLC, MD, FJ), pp. 436–449.
- ICALP-1984-RestivoR #formal method #permutation
- Cancellation, Pumping and Permutation in Formal Languages (AR, CR), pp. 414–422.
- GG-1978-Kreowski #graph
- A Pumping Lemma for Context-Free Graph Languages (HJK), pp. 270–283.
- DAC-1970-Meles #design
- Computer aided centrifugal pump design (MM), pp. 138–144.