BibSLEIGH — partial stem

Used together with:

evalu (185)
order (124)
use (92)
model (82)
base (74)

Stem partial$ (all stems)

869 papers:

DATE-2015-PaganoVRCSS #configuration management: Thermal-aware floorplanning for partially-reconfigurable FPGA-based systems (DP, MV, MR, RC, DS, MDS), pp. 920–923.
SIGMOD-2015-RazniewskiKNS #database #identification #query: Identifying the Extent of Completeness of Query Answers over Partially Complete Databases (SR, FK, WN, DS), pp. 561–576.
VLDB-2015-YuM #network #performance #scalability: Efficient Partial-Pairs SimRank Search for Large Networks (WY, JAM), pp. 569–580.
FASE-2015-SalayC #framework #modelling: A Generalized Formal Framework for Partial Modeling (RS, MC), pp. 133–148.
TACAS-2015-BloemCJK #concurrent #source code #synthesis: Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information (RB, KC, SJ, RK), pp. 517–532.
PLDI-2015-ZhangKW #memory management #modelling #partial order #reduction: Dynamic partial order reduction for relaxed memory models (NZ, MK, CW), pp. 250–259.
CIAA-J-2013-BalkanskiBKW15 #complexity #on the #word: On the state complexity of partial word DFAs (EB, FBS, MK, BJW), pp. 2–12.
LATA-2015-LeonM #partial order #set: Building Bridges Between Sets of Partial Orders (HPdL, AM), pp. 145–160.
LATA-2015-MikulskiPR #commutative #word: Square-Free Words over Partially Commutative Alphabets (LM, MP, WR), pp. 424–435.
LATA-2015-NayakK #on the #word: On the Language of Primitive Partial Words (ACN, KK), pp. 436–445.
LATA-2015-ThiemannS #automaton #regular expression: From ω-Regular Expressions to Büchi Automata via Partial Derivatives (PT, MS), pp. 287–298.
ICFP-2015-LeF #continuation #transaction: Partial aborts for transactions via first-class continuations (ML, MF), pp. 230–242.
GCM-2015-LoweT #algebra #category theory: Single-Pushout Rewriting of Partial Algebras (ML, MT), pp. 82–96.
ICGT-2015-DyckG #induction #invariant: Inductive Invariant Checking with Partial Negative Application Conditions (JD, HG), pp. 237–253.
ICML-2015-Osogami #markov #process #robust: Robust partially observable Markov decision process (TO), pp. 106–115.
ICML-2015-WinnerBS: Inference in a Partially Observed Queuing Model with Applications in Ecology (KW, GB, DS), pp. 2512–2520.
ICML-2015-XuJZ #algorithm #matrix: CUR Algorithm for Partially Observed Matrices (MX, RJ, ZHZ), pp. 1412–1421.
OOPSLA-2015-MarrD #partial evaluation #self: Tracing vs. partial evaluation: comparing meta-compilation approaches for self-optimizing interpreters (SM, SD), pp. 821–839.
OOPSLA-2015-SrinivasanR #partial evaluation: Partial evaluation of machine code (VS, TWR), pp. 860–879.
GPCE-2015-LeissaBHMS #domain-specific language #online #partial evaluation: Shallow embedding of DSLs via online partial evaluation (RL, KB, SH, RM, PS), pp. 11–20.
SAC-2015-BusseSDNH #data access #memory management #virtual machine: Partial coscheduling of virtual machines based on memory access patterns (AB, JHS, MD, POAN, HUH), pp. 2033–2038.
SAC-2015-FernandezAQVFZC #multi #off the shelf: Introduction to partial time composability for COTS multicores (GF, JA, EQ, TV, LF, MZ, FJC), pp. 1955–1956.
SAC-2015-ReadPB #data type #learning: Deep learning in partially-labeled data streams (JR, FPC, AB), pp. 954–959.
SAC-2015-SilvaLP #locality #multi #replication: Boosting locality in multi-version partial data replication (JAS, JL, HP), pp. 1309–1314.
ISMM-2015-MirandaB #object-oriented #performance #programming: A partial read barrier for efficient support of live object-oriented programming (EM, CB), pp. 93–104.
PPoPP-2015-ThomsonD #concurrent #lazy evaluation #partial order #reduction #testing: The lazy happens-before relation: better partial-order reduction for systematic concurrency testing (PT, AFD), pp. 259–260.
ICLP-2015-Nys #deduction #roadmap: Advances in Analyzing Coroutines by Abstract Conjunctive Partial Deduction (VN).
ICLP-J-2015-CristiaRF #constraints #logic programming #set: Adding partial functions to Constraint Logic Programming with sets (MC, GR, CSF), pp. 651–665.
SAT-2015-Zielke0 #approach: A New Approach to Partial MUS Enumeration (CZ, MK), pp. 387–404.
ASE-2014-KusanoW #abstraction #optimisation #partial order #reduction: Assertion guided abstraction: a cooperative optimization for dynamic partial order reduction (MK, CW), pp. 175–186.
CASE-2014-VaskeviciusP0 #locality #low cost #recognition: Fitting superquadrics in noisy, partial views from a low-cost RGBD sensor for recognition and localization of sacks in autonomous unloading of shipping containers (NV, KP, AB), pp. 255–262.
DAC-2014-ChenPCWMYZC #manycore #named #parallel #simulation #thread: DAPs: Dynamic Adjustment and Partial Sampling for Multithreaded/Multicore Simulation (CCC, YCP, CFC, WSW, QM, PCY, WZ, TFC), p. 6.
DAC-2014-YounGK #debugging #locality #probability #statistics: Probabilistic Bug Localization via Statistical Inference based on Partially Observed Data (SY, CG, JK), p. 6.
DATE-2014-LiSH0 #in memory #memory management #named: Partial-SET: Write speedup of PCM main memory (BL, SS, YH, XL), pp. 1–4.
DATE-2014-LiuHL #approximate #configuration management #fault #multi #power management: A low-power, high-performance approximate multiplier with configurable partial error recovery (CL, JH, FL), pp. 1–4.
DATE-2014-SeidlK #quantifier: Partial witnesses from preprocessed quantified Boolean formulas (MS, RK), pp. 1–6.
DATE-2014-SeylerSWSGT #network #self: A self-propagating wakeup mechanism for point-to-point networks with partial network support (JRS, TS, JW, MS, MG, JT), pp. 1–6.
SIGMOD-2014-LangNRN #database: Partial results in database systems (WL, RVN, ER, JFN), pp. 1275–1286.
VLDB-2014-GrecoPW #consistency #database #query: Certain Query Answering in Partially Consistent Databases (SG, FP, JW), pp. 353–364.
FASE-2014-Stevens #bidirectional #consistency #nondeterminism: Bidirectionally Tolerating Inconsistency: Partial Transformations (PS), pp. 32–46.
FoSSaCS-2014-Chatterjee0NV #complexity #game studies #probability: The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies (KC, LD, SN, MYV), pp. 242–257.
PEPM-2014-Scholz #case study #compilation #experience #partial evaluation: Partial evaluation as universal compiler tool: experiences from the SAC Eco system (SBS), pp. 95–96.
CIAA-2014-Blanchet-SadriGS #automaton: Minimal Partial Languages and Automata (FBS, KG, AS), pp. 110–123.
CIAA-2014-MaiaMR #automaton #similarity: Partial Derivative and Position Bisimilarity Automata (EM, NM, RR), pp. 264–277.
ICALP-v1-2014-IshaiW: Partial Garbling Schemes and Their Applications (YI, HW), pp. 650–662.
SEFM-2014-BonifacioM #modelling #testing: Test Suite Completeness and Partial Models (ALB, AVM), pp. 96–110.
SEFM-2014-DobrikovL #model checking #optimisation #partial order #reduction #using: Optimising the ProB Model Checker for B Using Partial Order Reduction (ID, ML), pp. 220–234.
ICGT-2014-HaymanH #category theory #on the: On Pushouts of Partial Maps (JH, TH), pp. 177–191.
CHI-2014-LeeJN #experience: Partially intelligent automobiles and driving experience at the moment of system transition (KJL, YKJ, CN), pp. 3631–3634.
CSCW-2014-XiaLSLDG #approach #mobile #replication: A partial replication approach for anywhere anytime mobile commenting (HX, TL, BS, GL, XD, NG), pp. 530–541.
ICML-c2-2014-LinAKLC #combinator #feedback #game studies #linear #monitoring: Combinatorial Partial Monitoring Game with Linear Feedback and Its Applications (TL, BDA, RDK, JL, WC), pp. 901–909.
ICML-c2-2014-MukutaH #analysis #canonical #correlation #probability: Probabilistic Partial Canonical Correlation Analysis (YM, TH), pp. 1449–1457.
ICML-c2-2014-NgoT #modelling #relational: Model-Based Relational RL When Object Existence is Partially Observable (NAV, MT), pp. 559–567.
ICPR-2014-Kobayashi #named #pattern matching: S3CCA: Smoothly Structured Sparse CCA for Partial Pattern Matching (TK), pp. 1981–1986.
ICPR-2014-McCloskey: Masking Light Fields to Remove Partial Occlusion (SM), pp. 2053–2058.
ICPR-2014-SandhanC #dataset #hybrid #pattern matching #pattern recognition #recognition: Handling Imbalanced Datasets by Partially Guided Hybrid Sampling for Pattern Recognition (TS, JYC), pp. 1449–1453.
ICPR-2014-YangLLZ #consistency #geometry #image #rank: Low Rank Global Geometric Consistency for Partial-Duplicate Image Search (LY, YL, ZL, HZ), pp. 3939–3944.
KR-2014-BartholomewL #modelling #multi: Stable Models of Multi-Valued Formulas: Partial versus Total Functions (MB, JL).
MLDM-2014-JayabalR #clustering #modelling #performance #student: Clustering Students Based on Student’s Performance — A Partial Least Squares Path Modeling (PLS-PM) Study (YJ, CR), pp. 393–407.
SEKE-2014-WanZWS #analysis #graph #performance #points-to: Efficient Points-To Analysis for Partial Call Graph Construction (ZW, BZ, YW, YS), pp. 416–421.
SIGIR-2014-KaneT: Skewed partial bitvectors for list intersection (AK, FWT), pp. 263–272.
LOPSTR-2014-SchreyeNN #compilation #deduction: Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction (DDS, VN, CJN), pp. 21–38.
LOPSTR-2014-SinghK #detection #java #partial evaluation: Partial Evaluation for Java Malware Detection (RS, AK), pp. 133–147.
PPDP-2014-AsaiFTZ #partial evaluation #specification: A Type Theoretic Specification of Partial Evaluation (KA, LF, PT, YZ), pp. 57–68.
PPDP-2014-Neron: Elimination of Square Roots and Divisions by Partial Inlining (PN), pp. 81–92.
PADL-2014-WinantDPS #haskell: Partial Type Signatures for Haskell (TW, DD, FP, TS), pp. 17–32.
POPL-2014-AbdullaAJS #partial order #reduction: Optimal dynamic partial order reduction (PAA, SA, BJ, KFS), pp. 373–384.
CGO-2014-StadlerWM #analysis #java: Partial Escape Analysis and Scalar Replacement for Java (LS, TW, HM), p. 165.
CAV-2014-HansenLLN0 #abstraction #automaton #partial order #reduction #women: Diamonds Are a Girl’s Best Friend: Partial Order Reduction for Timed Automata with Abstractions (HH, SWL, YL, TKN, JS), pp. 391–406.
ISSTA-2014-TrippFP #analysis #hybrid #javascript #partial evaluation #security #web: Hybrid security analysis of web JavaScript code via dynamic partial evaluation (OT, PF, MP), pp. 49–59.
LICS-CSL-2014-BovaGS #logic #model checking #order #set: Model checking existential logic on partially ordered sets (SB, RG, SS), p. 10.
CASE-2013-BentahaBD #composition #probability: A decomposition method for stochastic partial disassembly line balancing with profit maximization (MLB, OB, AD), pp. 404–409.
CASE-2013-LinG #detection #framework #network #optimisation #synthesis: Synthesis and optimization of a Bayesian belief network based observation platform for anomaly detection under partial and unreliable observations (WCL, HEG), pp. 51–58.
CASE-2013-MohajeraniMF #automaton #composition #finite #using #verification: Compositional nonblocking verification for extended finite-state automata using partial unfolding (SM, RM, MF), pp. 930–935.
DAC-2013-WagstaffGFT #architecture #partial evaluation #set: Early partial evaluation in a JIT-compiled, retargetable instruction set simulator generated from a high-level architecture description (HW, MG, BF, NPT), p. 6.
DATE-2013-ShreejithVFL #approach #configuration management #network #using: An approach for redundancy in FlexRay networks using FPGA partial reconfiguration (SS, KV, SAF, ML), pp. 721–724.
DATE-2013-WangLPKC #architecture #configuration management #cost analysis #design #optimisation: Capital cost-aware design and partial shading-aware architecture optimization of a reconfigurable photovoltaic system (YW, XL, MP, JK, NC), pp. 909–912.
ICDAR-2013-StammLD #analysis #approach #documentation #multi #partial order: Continuous Partial-Order Planning for Multichannel Document Analysis: A Process-Driven Approach (KS, ML, AD), pp. 626–630.
VLDB-2013-BronziCMP #integration #web: Extraction and Integration of Partially Overlapping Web Sources (MB, VC, PM, PP), pp. 805–816.
FoSSaCS-2013-Czajka #higher-order #logic #recursion: Partiality and Recursion in Higher-Order Logic (LC0), pp. 177–192.
PEPM-2013-Thiemann: Partially static operations (PT), pp. 75–76.
PLDI-2013-CohenP #bound #towards: Limitations of partial compaction: towards practical bounds (NC, EP), pp. 309–320.
CIAA-2013-BalkanskiBKW #word: Partial Word DFAs (EB, FBS, MK, BJW), pp. 36–47.
ICALP-v2-2013-HenzingerKN #maintenance #network: Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks (MH, SK, DN), pp. 607–619.
LATA-2013-Blanchet-SadriL #problem #word: Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem (FBS, JL), pp. 165–176.
CIKM-2013-BaoCD #classification #topic: A partially supervised cross-collection topic model for cross-domain text classification (YB, NC, AD), pp. 239–248.
ICML-c1-2013-GrinbergP #optimisation: Average Reward Optimization Objective In Partially Observable Domains (YG, DP), pp. 320–328.
ICML-c1-2013-NarasimhanA #approach #optimisation: A Structural SVM Based Approach for Optimizing Partial AUC (HN, SA), pp. 516–524.
KDD-2013-NarasimhanA #bound #named #optimisation: SVMpAUCtight: a new support vector method for optimizing partial AUC based on a tight convex upper bound (HN, SA), pp. 167–175.
MLDM-2013-YasojimaFBOS #analysis #case study #generative #power management: Partial Discharge Analysis and Inspection Alert Generation in High Power Transformers: A Case Study of an Autotransformer Bank at Eletrobrás-ELETRONORTE Vila do Conde Station (CTKY, MSF, FdSB, TFdO, AMdS), pp. 367–378.
SEKE-2013-CorralSS #mobile #quality #using: Using a Partially Instantiated GQM to Measure the Quality of Mobile Applications (S) (LC, AS, GS), pp. 520–524.
SEKE-2013-WangGZZX #array #combinator #generative #interactive #testing: Generating Partial Covering Array for Locating Faulty Interactions in Combinatorial Testing (ZW, TG, WZ, WZ, BX), pp. 578–583.
ICMT-2013-FinotMSA #model transformation #testing: Partial Test Oracle in Model Transformation Testing (OF, JMM, GS, CA), pp. 189–204.
OOPSLA-2013-BalatsourasS #graph: Class hierarchy complementation: soundly completing a partial type graph (GB, YS), pp. 515–532.
OOPSLA-2013-CoonsMM #bound #partial order #reduction: Bounded partial-order reduction (KEC, MM, KSM), pp. 833–848.
RE-2013-KrkaM #behaviour: Distributing refinements of a system-level partial behavior model (IK, NM), pp. 72–81.
ICSE-2013-PaveseBU #automation #estimation #reliability: Automated reliability estimation over partial systematic explorations (EP, VAB, SU), pp. 602–611.
SLE-2013-BakDACW #subclass: Partial Instances via Subclassing (KB, ZD, MA, KC, AW), pp. 344–364.
CAV-2013-AlglaveKT #bound #concurrent #model checking #partial order #performance: Partial Orders for Efficient Bounded Model Checking of Concurrent Software (JA, DK, MT), pp. 141–157.
CSL-2013-ChatterjeeCT #decidability #markov #process #what: What is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives (KC, MC, MT), pp. 165–180.
ICLP-J-2013-Balduccini: ASP with non-herbrand partial functions: a language and system for practical use (MB), pp. 547–561.
LICS-2013-NainV #game studies #probability: Solving Partial-Information Stochastic Parity Games (SN, MYV), pp. 341–348.
SAT-2013-GoultiaevaB: Recovering and Utilizing Partial Duality in QBF (AG, FB), pp. 83–99.
VMCAI-2013-JohnNN #network #predict: Knockout Prediction for Reaction Networks with Partial Kinetic Information (MJ, MN, JN), pp. 355–374.
VMCAI-2013-ZhengS0LD0 #network #partial order #reduction #using: State Space Reduction for Sensor Networks Using Two-Level Partial Order Reduction (MZ, DS, JS, YL, JSD, YG), pp. 515–535.
CASE-2012-GhonaimGS #on the #problem: On the assignment problem of arbitrary processing time operations in partially overlapping manufacturing resources (WG, HG, WS), pp. 341–346.
CASE-2012-TuanKL #3d #feedback: Partial Feedback Linearization Control of the three dimensional overhead crane (LAT, GHK, SGL), pp. 1198–1203.
DAC-2012-DingLM: WCET-centric partial instruction cache locking (HD, YL, TM), pp. 412–420.
DAC-2012-LinWYSCP #configuration management: Near-optimal, dynamic module reconfiguration in a photovoltaic system to combat partial shading effects (XL, YW, SY, DS, NC, MP), pp. 516–521.
DAC-2012-MiddendorfBH #hardware #recursion #synthesis: Hardware synthesis of recursive functions through partial stream rewriting (LM, CB, CH), pp. 1207–1215.
DATE-2012-ChandrasekarMSH #debugging #design #industrial: A scan pattern debugger for partial scan industrial designs (KC, SKM, SS, MSH), pp. 558–561.
DATE-2012-GrudnitskyBH #architecture #configuration management: Partial online-synthesis for mixed-grained reconfigurable architectures (AG, LB, JH), pp. 1555–1560.
DATE-2012-MarinMLB #design #incremental #using #verification: Verification of partial designs using incremental QBF solving (PM, CM, MDTL, BB), pp. 623–628.
VLDB-2012-BailisVFHS #bound: Probabilistically Bounded Staleness for Practical Partial Quorums (PB, SV, MJF, JMH, IS), pp. 776–787.
FASE-2012-SalayFC #independence #modelling #refinement #using: Language Independent Refinement Using Partial Modeling (RS, MF, MC), pp. 224–239.
TACAS-2012-LangM #equation #lts #model checking #network #using: Partial Model Checking Using Networks of Labelled Transition Systems and Boolean Equation Systems (FL, RM), pp. 141–156.
PEPM-2012-GiacobazziJM #obfuscation #partial evaluation: Obfuscation by partial evaluation of distorted interpreters (RG, NDJ, IM), pp. 63–72.
PLDI-2012-PerelmanGBG: Type-directed completion of partial expressions (DP, SG, TB, DG), pp. 275–286.
AFL-J-2011-Blanchet-Sadri12 #algorithm #combinator #word: Algorithmic Combinatorics on Partial Words (FBS), pp. 1189–1206.
DLT-J-2011-BrodaMMR12 #automaton #on the: On the Average Size of Glushkov and Partial derivative Automata (SB, AM, NM, RR), pp. 969–984.
DLT-2012-Blanchet-SadriJM #word: Squares in Binary Partial Words (FBS, YJ, JMM), pp. 404–415.
LATA-2012-Oliveira #generative #partial order: Canonizable Partial Order Generators (MdOO), pp. 445–457.
IFM-2012-JiB #java #named #source code: PE-KeY: A Partial Evaluator for Java Programs (RJ, RB), pp. 283–295.
IFM-2012-MarkovskiBB #component #requirements: Partially-Supervised Plants: Embedding Control Requirements in Plant Components (JM, DAvB, JCMB), pp. 253–267.
ICFP-2012-Danielsson #monad #semantics #using: Operational semantics using the partiality monad (NAD), pp. 127–138.
CHI-2012-FisherPDs #dataset #incremental #performance #scalability #trust #visualisation: Trust me, I’m partially right: incremental visualization lets analysts explore large datasets faster (DF, IOP, SMD, MMCS), pp. 1673–1682.
CHI-2012-VoidaBOOD #distributed: Cross-cutting faultlines of location and shared identity in the intergroup cooperation of partially distributed groups (AV, NB, JSO, GMO, LD), pp. 3101–3110.
CIKM-2012-QuanzH #generative #learning #multi #named: CoNet: feature generation for multi-view semi-supervised learning with partially observed views (BQ, JH), pp. 1273–1282.
ICML-2012-BartokZS #adaptation #algorithm #finite #monitoring #probability: An adaptive algorithm for finite stochastic partial monitoring (GB, NZ, CS), p. 231.
ICML-2012-LouH #learning: Structured Learning from Partial Annotations (XL, FAH), p. 52.
ICML-2012-MakinoT #learning #parametricity: Apprenticeship Learning for Model Parameters of Partially Observable Environments (TM, JT), p. 117.
ICPR-2012-ChandraJ #kernel #sequence #video: Partial Least Squares kernel for computing similarities between video sequences (SC, CVJ), pp. 513–516.
ICPR-2012-GuK #learning #online #visual notation: Grassmann manifold online learning and partial occlusion handling for visual object tracking under Bayesian formulation (IYHG, ZHK), pp. 1463–1466.
ICPR-2012-HouZQ #higher-order: Diffusion-driven high-order matching of partial deformable shapes (TH, MZ, HQ), pp. 137–140.
ICPR-2012-TangW #detection #semantics: Semantic Hough Transform based object detection with Partial Least Squares (JT, HW), pp. 3652–3655.
ICPR-2012-ZhongHH #approach: A hierarchical approach to high-quality partial shape registration (MZ, TH, QH), pp. 113–116.
KR-2012-FelliGL #ltl #multi #protocol #specification: Synthesizing Agent Protocols From LTL Specifications Against Multiple Partially-Observable Environments (PF, GDG, AL).
KR-2012-MaBL #framework: Revising Partial Pre-Orders with Partial Pre-Orders: A Unit-Based Revision Framework (JM, SB, WL).
KR-2012-WilsonM #axiom #diagrams #framework #order: An Axiomatic Framework for Influence Diagram Computation with Partially Ordered Utilities (NW, RM).
MLDM-2012-XuCG #concept #learning #multi #using: Constructing Target Concept in Multiple Instance Learning Using Maximum Partial Entropy (TX, DKYC, IG), pp. 169–182.
SEKE-2012-ZhangCGZSC #named #reduction #requirements #testing: CATESR: Change-aware Test Suite Reduction Based on Partial Coverage of Test Requirements (LZ, XC, QG, HZ, XS, DC), pp. 217–224.
ICMT-2012-SenMTC #model transformation #modelling #using: Using Models of Partial Knowledge to Test Model Transformations (SS, JMM, MT, JC), pp. 24–39.
MoDELS-2012-JohansenHFES #array #generative #modelling #product line: Generating Better Partial Covering Arrays by Modeling Weights on Sub-product Lines (MFJ, ØH, FF, AGE, TS), pp. 269–284.
MoDELS-2012-JohansenHFES #array #generative #modelling #product line: Generating Better Partial Covering Arrays by Modeling Weights on Sub-product Lines (MFJ, ØH, FF, AGE, TS), pp. 269–284.
OOPSLA-2012-MishneSY #code search #semantics #source code: Typestate-based semantic code search over partial programs (AM, SS, EY), pp. 997–1016.
TOOLS-EUROPE-2012-ZhengAMSBVTQM #bytecode #partial evaluation: Turbo DiSL: Partial Evaluation for High-Level Bytecode Instrumentation (YZ, DA, LM, AS, WB, AV, PT, ZQ, MM), pp. 353–368.
PPDP-2012-SulzmannL #regular expression #using: Regular expression sub-matching using partial derivatives (MS, KZML), pp. 79–90.
RE-2012-SalayCH #modelling #nondeterminism #requirements: Managing requirements uncertainty with partial models (RS, MC, JH), pp. 1–10.
SAC-2012-AtifMO #detection #verification: Formal verification of Unreliable Failure Detectors in Partially Synchronous Systems (MA, MRM, AO), pp. 478–485.
SAC-2012-ChhelLGS #biology #multi #using: Minimum multiple characterization of biological data using partially defined boolean formulas (FC, FL, AG, FS), pp. 1399–1405.
ICSE-2012-FamelisSC #modelling #nondeterminism #reasoning #towards: Partial models: Towards modeling and reasoning with uncertainty (MF, RS, MC), pp. 573–583.
ICSE-2012-RazaviK #model transformation #partial evaluation: Partial evaluation of model transformations (AR, KK), pp. 562–572.
ICLP-J-2012-Vidal #independence #logic programming #partial evaluation #source code: Annotation of logic programs for independent AND-parallelism by partial evaluation (GV), pp. 583–600.
ICST-2012-SalayCG #towards #verification: Towards a Methodology for Verifying Partial Model Refinements (RS, MC, JG), pp. 938–945.
IJCAR-2012-SudaW: A PLTL-Prover Based on Labelled Superposition with Partial Model Guidance (MS, CW), pp. 537–543.
LICS-2012-ChatterjeeD #game studies #how #probability: Partial-Observation Stochastic Games: How to Win When Belief Fails (KC, LD), pp. 175–184.
SAT-2012-MarinMB #design #incremental #preprocessor #verification: Incremental QBF Preprocessing for Partial Design Verification — (Poster Presentation) (PM, CM, BB), pp. 473–474.
ASE-2011-BokorKSS #partial order #reduction: Supporting domain-specific state space reductions through local partial-order reduction (PB, JK, MS, NS), pp. 113–122.
DATE-2011-MeyerNHBSGSB #configuration management #performance #using: Fast Start-up for Spartan-6 FPGAs using Dynamic Partial Reconfiguration (JM, JN, MH, LB, OS, RMG, RS, JB), pp. 1542–1547.
PODS-2011-CohenK #using: Get the most out of your sample: optimal unbiased estimators using partial information (EC, HK), pp. 13–24.
VLDB-2012-QumsiyehPN11 #generative: Generating Exact- and Ranked Partially-Matched Answers to Questions in Advertisements (RQ, MSP, YKN), pp. 217–228.
TACAS-2011-CimattiNR #abstraction #lazy evaluation #partial order #reduction: Boosting Lazy Abstraction for SystemC with Partial Order Reduction (AC, IN, MR), pp. 341–356.
PEPM-J-2007-CaretteK11a #partial evaluation: Partial evaluation of Maple (JC, MK), pp. 469–491.
PEPM-2011-BolzCFLPR #jit #partial evaluation: Allocation removal by partial evaluation in a tracing JIT (CFB, AC, MF, ML, SP, AR), pp. 43–52.
PEPM-2011-Mogensen #partial evaluation: Partial evaluation of the reversible language janus (TÆM), pp. 23–32.
PLDI-2011-KupersteinVY #abstraction #memory management #modelling: Partial-coherence abstractions for relaxed memory models (MK, MTV, EY), pp. 187–198.
CIAA-J-2010-KufleitnerL11 #automaton #order: Partially Ordered Two-Way BüChi Automata (MK, AL), pp. 1861–1876.
DLT-J-2010-BrodaMMR11 #approach #automaton #combinator #complexity #on the: On the Average State Complexity of Partial derivative Automata: an analytic Combinatorics Approach (SB, AM, NM, RR), pp. 1593–1606.
AFL-2011-Blanchet-Sadri #problem #word: Open Problems on Avoidable Patterns in Partial Words (FBS), pp. 12–24.
AFL-2011-Blanchet-SadriNT #on the #word: On Operations Preserving Primitivity of Partial Words with One Hole (FBS, SN, AT), pp. 93–107.
DLT-2011-Blanchet-SadriS #word: Avoiding Abelian Powers in Partial Words (FBS, SS), pp. 70–81.
DLT-2011-BrodaMMR #automaton #complexity: The Average Transition Complexity of Glushkov and Partial Derivative Automata (SB, AM, NM, RR), pp. 93–104.
LATA-2011-Blanchet-SadriBZ #word: Unary Pattern Avoidance in Partial Words Dense with Holes (FBS, KB, AZ), pp. 155–166.
LATA-2011-CaronCM #regular expression: Partial Derivatives of an Extended Regular Expression (PC, JMC, LM), pp. 179–191.
IFM-J-2009-BenesBBCSV11 #automaton #component #ltl #partial order #reduction: Partial order reduction for state/event LTL with application to component-interaction automata (NB, LB, BB, IC, JS, PV), pp. 877–890.
FM-2011-QinLCH #automation #specification #verification: Automatically Refining Partial Specifications for Program Verification (SQ, CL, WNC, GH), pp. 369–385.
CIKM-2011-CroceMB #dependence #kernel #semantics: Semantic convolution kernels over dependency trees: smoothed partial tree kernel (DC, AM, RB), pp. 2013–2016.
CIKM-2011-YalnizCM #detection #scalability: Partial duplicate detection for large book collections (IZY, EFC, RM), pp. 469–474.
ICML-2011-JalaliCSX #clustering #graph #optimisation: Clustering Partially Observed Graphs via Convex Optimization (AJ, YC, SS, HX), pp. 1001–1008.
ICML-2011-TamarCM #algorithm: Integrating Partial Model Knowledge in Model Free RL Algorithms (AT, DDC, RM), pp. 305–312.
KDD-2011-QiYZZ #image #mining: Mining partially annotated images (ZQ, MY, Z(Z, ZZ), pp. 1199–1207.
KDD-2011-RamageMD #mining #modelling #topic: Partially labeled topic models for interpretable text mining (DR, CDM, STD), pp. 457–465.
OOPSLA-2011-HoffmanME #memory management #named #programming: Ribbons: a partially shared memory programming model (KJH, HM, PE), pp. 289–306.
OOPSLA-2011-ShaliC #hybrid #partial evaluation: Hybrid partial evaluation (AS, WRC), pp. 375–390.
POPL-2011-BenderskyP #bound #memory management: Space overhead bounds for dynamic memory management with partial compaction (AB, EP), pp. 475–486.
SAC-2011-DumasDBB #partial order #verification: Application of partial-order methods for the verification of closed-loop SDL systems (XD, PD, FB, EB), pp. 1666–1673.
ESEC-FSE-2011-CheungSM: Partial replay of long-running applications (AC, ASL, SM), pp. 135–145.
CADE-2011-FontaineMP #proving: Compression of Propositional Resolution Proofs via Partial Regularization (PF, SM, BWP), pp. 237–251.
ISSTA-2011-GodefroidL #automation #generative #summary #testing: Automatic partial loop summarization in dynamic test generation (PG, DL), pp. 23–33.
TLCA-2011-SvendsenBN #dependent type: Partiality, State and Dependent Types (KS, LB, AN), pp. 198–212.
CASE-2010-XuSY #algorithm #problem: Exact algorithms for non-overlapping 2-frame problem with non-partial coverage for networked robotic cameras (YX, DS, JY), pp. 503–508.
DATE-2010-Jara-BerrocalG #architecture #configuration management #embedded #named: VAPRES: A Virtual Architecture for Partially Reconfigurable Embedded Systems (AJB, AGR), pp. 837–842.
DRR-2010-ChenMT #automation #performance #using #validation #word: Efficient automatic OCR word validation using word partial format derivation and language model (SC, DM, GRT), pp. 1–10.
VLDB-2010-ZhangMKC #evaluation #order #performance: Efficient Skyline Evaluation over Partially Ordered Domains (SZ, NM, BK, DWLC), pp. 1255–1266.
FASE-2010-LauterburgKMA #heuristic #partial order #reduction: Evaluating Ordering Heuristics for Dynamic Partial-Order Reduction Techniques (SL, RKK, DM, GA), pp. 308–322.
FASE-2010-NaeemHOH #composition #contract #incremental #visual notation: Incremental Service Composition Based on Partial Matching of Visual Contracts (MN, RH, FO, FH), pp. 123–138.
TACAS-2010-MalinowskiN #automaton #bound #model checking #partial order #satisfiability #semantics: SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata (JM, PN), pp. 405–419.
PEPM-2010-AlbertGP #bytecode #generative #java #named #partial evaluation #testing: PET: a partial evaluation-based test case generation tool for Java bytecode (EA, MGZ, GP), pp. 25–28.
PEPM-2010-Augustsson #question: O, partial evaluator, where art thou? (LA), pp. 1–2.
STOC-2010-CardinalFJJM #algorithm #sorting: Sorting under partial information (without the ellipsoid algorithm) (JC, SF, GJ, RMJ, JIM), pp. 359–368.
AFL-J-2008-Blanchet-SadriOR10 #theorem #word: Fine and Wilf’s Theorem for Partial Words with Arbitrarily Many Weak Periods (FBS, TO, TDR), pp. 705–722.
CIAA-2010-AlmeidaMPS #automaton #coq: Partial Derivative Automata Formalized in Coq (JBA, NM, DP, SMdS), pp. 59–68.
CIAA-2010-KufleitnerL #automaton #order: Partially Ordered Two-Way Büchi Automata (MK, AL), pp. 181–190.
DLT-2010-BrodaMMR #automaton #on the: On the Average Number of States of Partial Derivative Automata (SB, AM, NM, RR), pp. 112–123.
ICALP-v1-2010-Xia #artificial reality #reduction #theorem: Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems (MX), pp. 666–677.
LATA-2010-Blanchet-SadriKMSS #word: Abelian Square-Free Partial Words (FBS, JIK, RM, WS, SS), pp. 94–105.
LATA-2010-Blanchet-SadriMSW #word: Avoidable Binary Patterns in Partial Words (FBS, RM, SS, EW), pp. 106–117.
LATA-2010-KlunderR #commutative #problem: Post Correspondence Problem with Partially Commutative Alphabets (BK, WR), pp. 356–367.
LATA-2010-ManeaT #problem #word: Hard Counting Problems for Partial Words (FM, CT), pp. 426–438.
SEFM-2010-BarnatBR #parallel #partial order #reduction: Parallel Partial Order Reduction with Topological Sort Proviso (JB, LB, PR), pp. 222–231.
ICFP-2010-BradyH #domain-specific language #implementation #partial evaluation #using: Scrapping your inefficient engine: using partial evaluation to improve domain-specific language implementation (EB, KH), pp. 297–308.
CIKM-2010-AzizR #data flow #multi #predict #robust #semistructured data: Robust prediction from multiple heterogeneous data sources with partial information (MSA, CKR), pp. 1857–1860.
CIKM-2010-SotoudehA #detection #framework #induction #using: Partial drift detection using a rule induction framework (DS, AA), pp. 769–778.
ICML-2010-Cesa-BianchiSS #learning #performance: Efficient Learning with Partially Observed Attributes (NCB, SSS, OS), pp. 183–190.
ICML-2010-DinculescuP #approximate #predict: Approximate Predictive Representations of Partially Observable Systems (MD, DP), pp. 895–902.
ICPR-2010-Demirci #performance #retrieval: Efficient Shape Retrieval Under Partial Matching (MFD), pp. 3057–3060.
ICPR-2010-Fan #recognition: Feature-Based Partially Occluded Object Recognition (NF), pp. 3001–3004.
ICPR-2010-HarmanciH #adaptation #image #query: Content Adaptive Hash Lookups for Near-Duplicate Image Search by Full or Partial Image Queries (OH, IH), pp. 1582–1585.
ICPR-2010-McCloskeyLS: Removing Partial Occlusion from Blurred Thin Occluders (SM, MSL, KS), pp. 4400–4403.
ICPR-2010-RicamatoT #effectiveness #question: AUC-based Combination of Dichotomizers: Is Whole Maximization also Effective for Partial Maximization? (MTR, FT), pp. 73–76.
ICPR-2010-StrucDP #recognition #robust: Confidence Weighted Subspace Projection Techniques for Robust Face Recognition in the Presence of Partial Occlusions (VS, SD, NP), pp. 1334–1338.
ICPR-2010-SzeptyckiACZGS #2d #composition #using: Partial Face Biometry Using Shape Decomposition on 2D Conformal Maps of Faces (PS, MA, LC, WZ, XDG, DS), pp. 1505–1508.
ICPR-2010-WuXJHCL #constraints #geometry #image #invariant #retrieval: Adding Affine Invariant Geometric Constraint for Partial-Duplicate Image Retrieval (ZW, QX, SJ, QH, PC, LL), pp. 842–845.
KR-2010-XiaoLMQ #consistency #metric #multi #nondeterminism #satisfiability #semantics: Computing Inconsistency Measurements under Multi-Valued Semantics by Partial Max-SAT Solvers (GX, ZL, YM, GQ).
SIGIR-2010-ZhangZYH #detection #performance #sequence: Efficient partial-duplicate detection based on sequence matching (QZ, YZ, HY, XH), pp. 675–682.
LOPSTR-2010-Vidal #approach #hybrid #logic programming #partial evaluation #source code: A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs (GV), pp. 200–214.
RE-2010-KaindlSN #requirements #reuse #specification: Case-based Reuse with Partial Requirements Specifications (HK, MS, WN), pp. 399–400.
FSE-2010-Krka #approach #behaviour #incremental #modelling #refinement #requirements #specification: From requirements to partial behavior models: an iterative approach to incremental specification refinement (IK), pp. 341–344.
CGO-2010-HanLT #parallel #reduction: Speculative parallelization of partial reduction variables (LH, WL, JT), pp. 141–150.
IJCAR-2010-Nivelle #logic: Classical Logic with Partial Functions (HdN), pp. 203–217.
IJCAR-2010-ShermanGD #partial order #type system: A Slice-Based Decision Procedure for Type-Based Partial Orders (ES, BJG, MBD), pp. 156–170.
RTA-2010-Bahr10a #partial order #term rewriting: Partial Order Infinitary Term Rewriting and Böhm Trees (PB), pp. 67–84.
WICSA-ECSA-2009-PerezDSG #architecture #component #variability: Plastic Partial Components: A solution to support variability in architectural components (JP, JD, CCS, JG), pp. 221–230.
CASE-2009-HariharanB #markov #process #using: Misplaced item search in a warehouse using an RFID-based Partially Observable Markov Decision Process (POMDP) model (SH, STSB), pp. 443–448.
CASE-2009-XuK #nondeterminism: Discrete event control under nondeterministic partial observation (SX, RK), pp. 127–132.
DATE-2009-Diaz-MadridNHDR #pipes and filters #reduction: Power reduction of a 12-bit 40-MS/s pipeline ADC exploiting partial amplifier sharing (JÁDM, HN, HH, GDA, RRM), pp. 369–373.
DATE-2009-FlynnGG #configuration management: Bitstream relocation with local clock domains for partially reconfigurable FPGAs (AF, AGR, ADG), pp. 300–303.
DATE-2009-KoesterLHP #configuration management #design #optimisation: Design optimizations to improve placeability of partial reconfiguration modules (MK, WL, JH, MP), pp. 976–981.
ICDAR-2009-SunK #detection #embedded: Detecting Printed and Handwritten Partial Copies of Line Drawings Embedded in Complex Backgrounds (WS, KK), pp. 341–345.
SIGMOD-2009-ChenCMPSS #database #optimisation #order: Partial join order optimization in the paraccel analytic database (YC, RLC, WJM, SP, AS, ESJ), pp. 905–908.
ESOP-2009-MostrousYH #commutative #type system: Global Principal Typing in Partially Commutative Asynchronous Sessions (DM, NY, KH), pp. 316–332.
PEPM-2009-EversK #automation #network: Partially evaluated sensor networks: automatic specialization for heterogeneous wireless sensor & actuator networks (LE, JK), pp. 73–80.
SAS-2009-Bodik #algorithm #source code #synthesis: Algorithmic Program Synthesis with Partial Programs and Decision Procedures (RB), p. 1.
STOC-2009-CardinalFJJM #algorithm #partial order #performance: An efficient algorithm for partial order production (JC, SF, GJ, RMJ, JIM), pp. 93–100.
CIAA-2009-SuzukiO: Hedge Pattern Partial Derivative (TS, SO), pp. 125–134.
DLT-2009-BlakeleyBGR #complexity #on the #set #word: On the Complexity of Deciding Avoidability of Sets of Partial Words (BB, FBS, JG, NR), pp. 113–124.
LATA-2009-Blanchet-SadriABM #how #question #word: How Many Holes Can an Unbordered Partial Word Contain? (FBS, EA, CB, RM), pp. 176–187.
LATA-2009-Blanchet-SadriMRW #algorithm #using #word: An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms (FBS, RM, AR, EW), pp. 188–199.
LATA-2009-BoigelotD #automaton #finite #set #visualisation: Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization (BB, JFD), pp. 200–211.
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.
FM-2009-LangM #composition #confluence #detection #partial order #reduction #using: Partial Order Reductions Using Compositional Confluence Detection (FL, RM), pp. 157–172.
IFM-2009-BenesBCSVZ #ltl #partial order #reduction: Partial Order Reduction for State/Event LTL (NB, LB, IC, JS, PV, BZ), pp. 307–321.
ICFP-2009-ZiarekSJ #communication #concurrent: Partial memoization of concurrency and communication (LZ, KCS, SJ), pp. 161–172.
DHM-2009-MobusEGZ #empirical #modelling #probability: Probabilistic and Empirical Grounded Modeling of Agents in (Partial) Cooperative Traffic Scenarios (CM, ME, HG, MZ), pp. 423–432.
CIKM-2009-GargS #classification #learning: Active learning in partially supervised classification (PG, SS), pp. 1783–1786.
CIKM-2009-TangSB #string: Space-economical partial gram indices for exact substring matching (NT, LS, PAB), pp. 285–294.
ICML-2009-DoA #markov #modelling #scalability: Large margin training for hidden Markov models with partially observed states (TMTD, TA), pp. 265–272.
ICML-2009-HelleputteD #feature model #linear #modelling: Partially supervised feature selection with regularized linear models (TH, PD), pp. 409–416.
ICML-2009-McFeeL #kernel #multi #partial order: Partial order embedding with multiple kernels (BM, GRGL), pp. 721–728.
KDD-2009-BeygelzimerL #learning: The offset tree for learning with partial labels (AB, JL), pp. 129–138.
RecSys-2009-QasimOWHO #partial order #recommendation: A partial-order based active cache for recommender systems (UQ, VO, YfBW, MEH, MTÖ), pp. 209–212.
SIGIR-2009-RavanaPM #using: System scoring using partial prior information (SDR, LAFP, AM), pp. 788–789.
TOOLS-EUROPE-2009-BoixCVMD #ad hoc #mobile #network: A Leasing Model to Deal with Partial Failures in Mobile Ad Hoc Networks (EGB, TVC, JV, WDM, TD), pp. 231–251.
LOPSTR-2009-BolzLR #partial evaluation #prolog #towards: Towards Just-In-Time Partial Evaluation of Prolog (CFB, ML, AR), pp. 158–172.
LOPSTR-2009-Vidal #declarative #partial evaluation #scalability #source code #towards: Towards Scalable Partial Evaluation of Declarative Programs (GV), pp. 1–4.
SAC-2009-DemailleLS #abstract syntax tree #effectiveness #named #parsing #using: TWEAST: a simple and effective technique to implement concrete-syntax AST rewriting using partial parsing (AD, RL, BS), pp. 1924–1929.
ESEC-FSE-2009-KrkaBEM #behaviour #component #modelling #specification: Synthesizing partial component-level behavior models from system specifications (IK, YB, GE, NM), pp. 305–314.
CGO-2009-SerranoZ #approximate: Building Approximate Calling Context from Partial Call Traces (MJS, XZ), pp. 221–230.
CAV-2009-KahlonWG #partial order #reduction: Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique (VK, CW, AG), pp. 398–413.
ICST-2009-DavidLLN #testing: Timed Testing under Partial Observability (AD, KGL, SL, BN), pp. 61–70.
SAT-2009-AnsoteguiBL #satisfiability #testing: Solving (Weighted) Partial MaxSAT through Satisfiability Testing (CA, MLB, JL), pp. 427–440.
SAT-2009-ArgelichCLM #encoding #satisfiability: Sequential Encodings from Max-CSP into Partial Max-SAT (JA, AC, IL, FM), pp. 161–166.
TLCA-2009-FaggianP #linear #partial order: Partial Orders, Event Structures and Linear Strategies (CF, MP), pp. 95–111.
CASE-2008-WangSF #automation #detection #difference #equation: Partial differential equation-based GPR signature discrimination for automatic detection of bridge deck delamination (ZWW, GGS, TF), pp. 431–435.
DAC-2008-KunduGG #design #partial order #reduction #scalability #testing: Partial order reduction for scalable testing of systemC TLM designs (SK, MKG, RG), pp. 936–941.
DATE-2008-FeinsteinTM #detection #equivalence #logic #using: Partially Redundant Logic Detection Using Symbolic Equivalence Checking in Reversible and Irreversible Logic Circuits (DYF, MAT, DMM), pp. 1378–1381.
DATE-2008-LaiHK #identification #multi #verification: Improving Constant-Coefficient Multiplier Verification by Partial Product Identification (CYL, CYH, KYK), pp. 813–818.
DATE-2008-LiNBPC #architecture #multi: Generic Multi-Phase Software-Pipelined Partial-FFT on Instruction-Level-Parallel Architectures and SDR Baseband Applications (ML, DN, BB, LVdP, FC), pp. 598–603.
DATE-2008-MarconiLBG #algorithm #configuration management #online: Intelligent Merging Online Task Placement Algorithm for Partial Reconfigurable Systems (TM, YL, KB, GG), pp. 1346–1351.
DATE-2008-MokhovY #configuration management #graph #partial order #synthesis: Conditional Partial Order Graphs and Dynamically Reconfigurable Control Synthesis (AM, AY), pp. 1142–1147.
SIGMOD-2008-WuLOT #query #retrieval: Just-in-time query retrieval over partially indexed data on structured P2P overlays (SW, JL, BCO, KLT), pp. 279–290.
SIGMOD-2008-WuXH #named #query #ranking: ARCube: supporting ranking aggregate queries in partially materialized data cubes (TW, DX, JH), pp. 79–92.
TACAS-2008-WangYKG #partial order #reduction: Peephole Partial Order Reduction (CW, ZY, VK, AG), pp. 382–396.
ICPC-2008-PetrenkoRV #comprehension #evolution #maintenance: Partial Domain Comprehension in Software Evolution and Maintenance (MP, VR, RV), pp. 13–22.
SCAM-2008-Gomez-ZamalloaAP #composition #decompiler #low level #partial evaluation: Modular Decompilation of Low-Level Code by Partial Evaluation (MGZ, EA, GP), pp. 239–248.
PEPM-2008-SaabasU #optimisation #proving: Proof optimization for partial redundancy elimination (AS, TU), pp. 91–101.
DLT-J-2007-Link08 #database #dependence #multi #on the: On the Implication of Multivalued Dependencies in Partial Database Relations (SL), pp. 691–715.
AFL-2008-Blanchet-SadriMS #word: Counting Distinct Squares in Partial Words (FBS, RM, GS), pp. 122–133.
AFL-2008-Blanchet-SadriOR #word: Computing Weak Periods of Partial Words (FBS, TO, TDR), pp. 134–145.
ICALP-B-2008-GomezGP #commutative #question: When Does Partial Commutative Closure Preserve Regularity? (ACG, GG, JÉP), pp. 209–220.
CIKM-2008-HauglidN #database #distributed #named #query: PROQID: partial restarts of queries in distributed databases (JOH, KN), pp. 1251–1260.
CIKM-2008-MahouiTSC #identification #modelling #predict #using: Identification of gene function using prediction by partial matching (PPM) language models (MM, WJT, AKTS, SC), pp. 779–786.
CIKM-2008-WuT #query #xml: Evaluating partial tree-pattern queries on XML streams (XW, DT), pp. 1409–1410.
ICML-2008-HellerWG #modelling #statistics: Statistical models for partial membership (KAH, SW, ZG), pp. 392–399.
ICML-2008-KohliSRKT #multi #on the: On partial optimality in multi-label MRFs (PK, AS, CR, VK, PHST), pp. 480–487.
ICPR-2008-Abd-AlmageedASD #classification #hybrid #using: Document-zone classification using partial least squares and hybrid classifiers (WAA, MA, WS, DSD), pp. 1–4.
ICPR-2008-FuSHLT #image #kernel #learning #multi #set: Multiple kernel learning from sets of partially matching image features (SYF, GS, ZGH, ZzL, MT), pp. 1–4.
ICPR-2008-GuehamBC #automation #classification #correlation #forensics #using: Automatic classification of partial shoeprints using Advanced Correlation Filters for use in forensic science (MG, AB, DC), pp. 1–4.
ICPR-2008-MaruyamaOTKYTT #3d #locality: 3D localization of partially buried object in unstructured environment (KM, KO, RT, YK, TY, HT, FT), pp. 1–4.
ICPR-2008-TaEL #difference #equation #graph: Nonlocal morphological levelings by partial difference equations over weighted graphs (VTT, AE, OL), pp. 1–4.
ICPR-2008-ZhangW #clustering #order #ranking: Partial closure-based constrained clustering with order ranking (SZ, HSW), pp. 1–4.
KDD-2008-NguyenC #classification: Classification with partial labels (NN, RC), pp. 551–559.
KDD-2008-SaigoKT #graph #mining: Partial least squares regression for graph mining (HS, NK, KT), pp. 578–586.
KR-2008-TunD #generative #ontology #reuse: Ontology Generation through the Fusion of Partial Reuse and Relation Extraction (NNT, JSD), pp. 318–328.
KR-2008-YahiBLSP: A Lexicographic Inference for Partially Preordered Belief Bases (SY, SB, SL, MS, OP), pp. 507–517.
SIGIR-2008-AminiTG #algorithm #learning #ranking: A boosting algorithm for learning bipartite ranking functions with partially labeled data (MRA, TVT, CG), pp. 99–106.
SIGIR-2008-DuhK #learning #rank: Learning to rank with partially-labeled data (KD, KK), pp. 251–258.
OOPSLA-2008-DagenaisH #java #source code #static analysis: Enabling static analysis for partial java programs (BD, LJH), pp. 313–328.
LOPSTR-2008-AlbertGP #bytecode #generative #partial evaluation #testing: Test Data Generation of Bytecode by CLP Partial Evaluation (EA, MGZ, GP), pp. 4–23.
LOPSTR-2008-LeuschelV #logic programming #partial evaluation #performance #scalability #source code: Fast Offline Partial Evaluation of Large Logic Programs (ML, GV), pp. 119–134.
PPDP-2008-BertotK #coq #fixpoint #recursion #semantics: Fixed point semantics and partial recursion in Coq (YB, VK), pp. 89–96.
QAPL-2008-OchoaP #partial evaluation: Oracle-Based Partial Evaluation (CO, GP), pp. 145–161.
SAC-2008-Armendariz-InigoMMM #database #named #protocol #replication: SIPRe: a partial database replication protocol with SI replicas (JEAI, AMG, JRGdM, FDME), pp. 2181–2185.
SAC-2008-BallabrigaCS #analysis #approach: An improved approach for set-associative instruction cache partial analysis (CB, HC, PS), pp. 360–367.
SAC-2008-CastelucioSZ #deployment: Evaluating the partial deployment of an AS-level IP traceback system (AOC, RMS, AZ), pp. 2069–2073.
FSE-2008-FischbeinU #behaviour #modelling #on the: On correct and complete strong merging of partial behaviour models (DF, SU), pp. 297–307.
ICLP-2008-Cabalar #programming #set #similarity: Partial Functions and Equality in Answer Set Programming (PC), pp. 392–406.
ICLP-2008-CodishLS #constraints #partial order #problem: Telecommunications Feature Subscription as a Partial Order Constraint Problem (MC, VL, PJS), pp. 749–753.
ICLP-2008-Vidal #analysis #effectiveness #partial evaluation #predict: Trace Analysis for Predicting the Effectiveness of Partial Evaluation (GV), pp. 790–794.
SAT-2008-ArgelichCLM #modelling #satisfiability: Modelling Max-CSP as Partial Max-SAT (JA, AC, IL, FM), pp. 1–14.
TestCom-FATES-2008-BochmannHJJ #automaton #partial order #testing: Testing Systems Specified as Partial Order Input/Output Automata (GvB, SH, CJ, GVJ), pp. 169–183.
TestCom-FATES-2008-SimaoP #finite #generative #sequence #state machine: Generating Checking Sequences for Partial Reduced Finite State Machines (AdSS, AP), pp. 153–168.
DATE-2007-ChattopadhyayAKKLAM #configuration management #design #embedded: Design space exploration of partially re-configurable embedded processors (AC, WA, KK, DK, RL, GA, HM), pp. 319–324.
DATE-2007-ClausZMS #configuration management #hardware #using #video: Using partial-run-time reconfigurable hardware to accelerate video processing in driver assistance system (CC, JZ, FHM, WS), pp. 498–503.
DATE-2007-CuiDHG #2d #algorithm #configuration management #online #performance: An efficient algorithm for online management of 2D area of partially reconfigurable FPGAs (JC, QD, XH, ZG), pp. 129–134.
DATE-2007-QiuTW #modelling #optimisation #power management #probability #robust: Stochastic modeling and optimization for robust power management in a partially observable system (QQ, YT, QW), pp. 779–784.
DATE-2007-RousseauMGMLDG #certification #configuration management #using: Enabling certification for dynamic partial reconfiguration using a minimal flow (BR, PM, DG, DM, JDL, FD, YG), pp. 983–988.
DATE-2007-ZhuSD #functional #interactive #pipes and filters #validation: Interactive presentation: Functional and timing validation of partially bypassed processor pipelines (QZ, AS, ND), pp. 1164–1169.
WRLA-2006-FarzanM07 #partial order #programming language #reduction #semantics: Partial Order Reduction for Rewriting Semantics of Programming Languages (AF, JM), pp. 61–78.
PEPM-2007-CaretteK #partial evaluation: Partial evaluation of Maple (JC, MK), pp. 41–50.
PEPM-2007-OchoaP #partial evaluation: Poly-controlled partial evaluation in practice (CO, GP), pp. 164–173.
PEPM-2007-Vidal #logic programming #partial evaluation #source code #termination: Quasi-terminating logic programs for ensuring the termination of partial evaluation (GV), pp. 51–60.
CIAA-2007-Volkov #automaton #partial order: Synchronizing Automata Preserving a Chain of Partial Orders (MVV), pp. 27–37.
DLT-2007-Blanchet-SadriBP #set #word: Two Element Unavoidable Sets of Partial Words (FBS, NCB, JP), pp. 96–107.
LATA-2007-Blanchet-SadriCN #word: Fine and Wilf’s Periodicity Result on Partial Words and Consequences (FBS, KC, JN), pp. 115–126.
IFM-2007-DunneG #correctness: Lifting General Correctness into Partial Correctness is ok (SD, AG), pp. 215–232.
IFL-2007-HerhutSBGT #contract #dependent type #partial evaluation #proving #towards: From Contracts Towards Dependent Types: Proofs by Partial Evaluation (SH, SBS, RB, CG, KT), pp. 254–273.
IFL-2007-Wallace #parsing: Partial Parsing: Combining Choice with Commitment (MW), pp. 93–110.
ICEIS-AIDSS-2007-Janicki #partial order: Pairwise Comparisons, Incomparability and Partial Orders (RJ), pp. 297–302.
ICEIS-SAIC-2007-Maximilien #approach #challenge #problem #ruby #semantics #using #web #web service: A Partial Solution to the Semantic Web Services Challenge Problem Using Swashup — The Ruby on Rails Services Mashup Approach (EMM), pp. 438–446.
CIKM-2007-SouldatosWTDS #evaluation #query #xml: Evaluation of partial path queries on xml data (SS, XW, DT, TD, TKS), pp. 21–30.
KDD-2007-ShengL #learning: Partial example acquisition in cost-sensitive learning (VSS, CXL), pp. 638–646.
LOPSTR-2007-AlbertGGP #online #partial evaluation #type system: Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation (EA, JPG, MGZ, GP), pp. 23–42.
LOPSTR-2007-FischerSTV #functional #lazy evaluation #partial evaluation #source code: Preserving Sharing in the Partial Evaluation of Lazy Functional Programs (SF, JS, ST, GV), pp. 74–89.
PADL-2007-KloseOL #partial evaluation: Partial Evaluation of Pointcuts (KK, KO, ML), pp. 320–334.
SAC-2007-YangWK #analysis #modelling #partial order: General dominant relationship analysis based on partial order models (ZY, BW, MK), pp. 470–474.
SAC-2007-ZengWN #analysis #classification: Text classification based on partial least square analysis (XQZ, MWW, JYN), pp. 834–838.
ESEC-FSE-2007-AcharyaXPX #api #mining #partial order #source code #specification: Mining API patterns as partial orders from source code: from usage scenarios to specifications (MA, TX, JP, JX), pp. 25–34.
HPDC-2007-WeigleC #network #performance: Partial content distribution on high performance networks (EW, AAC), pp. 137–146.
SAT-2007-ArgelichM #learning #satisfiability: Partial Max-SAT Solvers with Clause Learning (JA, FM), pp. 28–40.
TestCom-FATES-2007-FalconeFMR #composition #framework #specification #testing: A Compositional Testing Framework Driven by Partial Specifications (YF, JCF, LM, JLR), pp. 107–122.
TestCom-FATES-2007-HaarJJ #automaton #partial order #testing: Testing Input/Output Partial Order Automata (SH, CJ, GVJ), pp. 171–185.
VLDB-2006-BunemanCFK #distributed #partial evaluation #query #using: Using Partial Evaluation in Distributed Query Evaluation (PB, GC, WF, AK), pp. 211–222.
TACAS-2006-NiebertP #ltl #model checking #partial order #performance: Efficient Model Checking for LTL with Partial Order Snapshots (PN, DP), pp. 272–286.
PEPM-2006-CooperMG #on the #optimisation #partial evaluation #simulation: On the application of partial evaluation to the optimisation of cardiac electrophysiological simulations (JC, SM, AG), pp. 12–20.
PEPM-2006-LeuschelEVCF #interface #web: The Ecce and Logen partial evaluators and their web interfaces (ML, DE, MV, SJC, MF), pp. 88–94.
PEPM-2006-ThompsonM #partial evaluation: Bit-level partial evaluation of synchronous circuits (ST, AM), pp. 29–37.
FM-2006-ZhengWWX #approach #case study #development #formal method #object-oriented #using: Partially Introducing Formal Methods into Object-Oriented Development: Case Studies Using a Metrics-Driven Approach (YZ, JW, KW, JX), pp. 190–204.
IFL-2006-Almendros-JimenezV #automation: Automatic Partial Inversion of Inductively Sequential Functions (JMAJ, GV), pp. 253–270.
CHI-2006-BosONSHJ #distributed #question: Collocation bindness in partially distributed groups: is there a downside to being collocated? (NB, JSO, NN, NSS, SH, EWJ), pp. 1313–1321.
ICEIS-DISI-2006-ChakrabortySN #database #scalability: Scalable Update Propagation in Partially Replicated, Disconnected Client Server Databases (LC, AS, KN), pp. 11–21.
CIKM-2006-TheodoratosSDPS #graph #heuristic #query: Heuristic containment check of partial tree-pattern queries in the presence of index graphs (DT, SS, TD, PP, TKS), pp. 445–454.
ICML-2006-HolmesJ: Looping suffix tree-based inference of partially observable hidden state (MPH, CLIJ), pp. 409–416.
ICML-2006-LiLC #markov #process: Region-based value iteration for partially observable Markov decision processes (HL, XL, LC), pp. 561–568.
ICPR-v1-2006-AnwarF #fault #robust #towards: Towards Robust Voxel-Coloring: Handling Camera Calibration Errors and Partial Emptiness of Surface Voxels (ZA, FPF), pp. 98–102.
ICPR-v2-2006-ChenSYCG #detection: Modification of the AdaBoost-based Detector for Partially Occluded Faces (JC, SS, SY, XC, WG), pp. 516–519.
ICPR-v2-2006-HeLL #bias #robust #segmentation: Robust Partial Volume Segmentation with Bias Field Correction in Brain MRI (HH, BL, KL), pp. 175–178.
ICPR-v2-2006-LuXL #hybrid #recognition: A Hybrid Recognition Scheme Based on Partially Labeled SOM and MLP (SL, CX, YL), pp. 800–803.
ICPR-v4-2006-PeursumVW #linear: Observation-Switching Linear Dynamic Systems for Tracking Humans Through Unexpected Partial Occlusions by Scene Objects (PP, SV, GAWW), pp. 929–934.
KDD-2006-LiuZWMP #clustering #difference #order #set: Clustering pair-wise dissimilarity data into partially ordered sets (JL, QZ, WW, LM, JP), pp. 637–642.
QAPL-2005-BaierDG06 #branch #partial order #probability #reduction: Partial Order Reduction for Probabilistic Branching Time (CB, PRD, MG), pp. 97–116.
LOPSTR-2006-ArroyoRSV #graph #partial evaluation #using: Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs (GA, JGR, JS, GV), pp. 60–76.
LOPSTR-2006-LeuschelCE #logic programming #online #partial evaluation #source code #using: Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques (ML, SJC, DE), pp. 43–59.
PPDP-2006-PueblaO #partial evaluation: Poly-controlled partial evaluation (GP, CO), pp. 261–271.
SAC-2006-BergerMD #categorisation #email #set: Exploiting partial decision trees for feature subset selection in e-mail categorization (HB, DM, MD), pp. 1105–1109.
SAC-2006-LallouetL #consistency #constraints #satisfiability: From satisfiability to consistency through certificates: application to partially defined constraints (AL, AL), pp. 415–416.
ASPLOS-2006-ReddyRP #comprehension #fault tolerance #predict #thread: Understanding prediction-based partial redundant threading for low-overhead, high- coverage fault tolerance (VKR, ER, SP), pp. 83–94.
ISMM-2006-HuangBGM #order #performance: Fast and efficient partial code reordering: taking advantage of dynamic recompilatior (XH, SMB, DG, KSM), pp. 184–192.
CAV-2006-KahlonGS #concurrent #model checking #on the fly #partial order #source code #transaction #using: Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions (VK, AG, NS), pp. 286–299.
ICLP-2006-CabalarOPV #equilibrium #logic #semantics #using: Analysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic (PC, SPO, DP, AV), pp. 346–360.
IJCAR-2006-Krauss #higher-order #logic #recursion: Partial Recursive Functions in Higher-Order Logic (AK), pp. 589–603.
RTA-2006-CodishLS #constraints #partial order #termination: Solving Partial Order Constraints for LPO Termination (MC, VL, PJS), pp. 4–18.
SAT-2006-FuM #on the #problem #satisfiability: On Solving the Partial MAX-SAT Problem (ZF, SM), pp. 252–265.
ASE-2005-AgarwalSWS #concurrent #detection #runtime #using: Optimized run-time race detection and atomicity checking using partial discovered types (RA, AS, LW, SDS), pp. 233–242.
DAC-2005-BanerjeeBD #architecture #clustering #configuration management: Physically-aware HW-SW partitioning for reconfigurable architectures with partial dynamic reconfiguration (SB, EB, NDD), pp. 335–340.
DATE-2005-ShrivastavaDNE #embedded #framework #named: PBExplore: A Framework for Compiler-in-the-Loop Exploration of Partial Bypassing in Embedded Processors (AS, NDD, AN, EE), pp. 1264–1269.
ICDAR-2005-AbedELE #composition #documentation #retrieval: Frequencies Decomposition and Partial Similarities Retrieval for Ancient Handwriting Documents Compression (AEA, VE, FL, HE), pp. 996–1000.
ICDAR-2005-NakaiKI #documentation #image #invariant #retrieval: Camera-Based Document Image Retrieval as Voting for Partial Signatures of Projective Invariants (TN, KK, MI), pp. 379–383.
SIGMOD-2005-ChanET: Stratified Computation of Skylines with Partially-Ordered Domains (CYC, PKE, KLT), pp. 203–214.
VLDB-2005-PandeyROCC #random #ranking: Shuffling a Stacked Deck: The Case for Partially Randomized Ranking of Search Engine Results (SP, SR, CO, JC, SC), pp. 781–792.
ESOP-2005-LeuschelV #deduction #slicing: Forward Slicing by Conjunctive Partial Deduction and Argument Filtering (ML, GV), pp. 61–76.
STOC-2005-DodisS #fault: Correcting errors without leaking partial information (YD, AS), pp. 654–663.
DLT-2005-Ananichev #automaton: The Mortality Threshold for Partially Monotonic Automata (DSA), pp. 112–121.
IFM-2005-Lang #composition #flexibility #on the fly #partial order #verification: Exp.Open 2.0: A Flexible Tool Integrating Partial Order, Compositional, and On-The-Fly Verification Methods (FL), pp. 70–88.
ICFP-2005-RamosSV #partial evaluation #performance #source code: Fast narrowing-driven partial evaluation for inductively sequential programs (JGR, JS, GV), pp. 228–239.
ICFP-2005-Remy #system f: Simple, partial type-inference for System F based on type-containment (DR), pp. 130–143.
CHI-2005-LambertyK: Camera talk: making the camera a partial participant (KKL, JLK), pp. 839–848.
CIKM-2005-TheodoratosDKG #data flow #query #semantics #using: Semantic querying of tree-structured data sources using partially specified tree patterns (DT, TD, AK, NHG), pp. 712–719.
KDD-2005-Momma #kernel #performance #scalability: Efficient computations via scalable sparse kernel partial least squares and boosted latent features (MM), pp. 654–659.
KDD-2005-UkkonenFM #partial order: Finding partial orders from unordered 0-1 data (AU, MF, HM), pp. 285–293.
LOPSTR-2005-AlbertPG #logic programming #partial evaluation #source code: Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates (EA, GP, JPG), pp. 115–132.
PPDP-2005-TombF #automation #partial evaluation #type inference: Automatic type inference via partial evaluation (AT, CF), pp. 106–116.
POPL-2005-FlanaganG #model checking #partial order #reduction: Dynamic partial-order reduction for model checking software (CF, PG), pp. 110–121.
SAC-2005-ChoC #database #image #recognition #symmetry #using: Contour-based partial object recognition using symmetry in image databases (JSC, JC), pp. 1190–1194.
CSL-2005-KhoussainovR #algebra #decidability: Decidability of Term Algebras Extending Partial Algebras (BK, SR), pp. 292–308.
FATES-2005-PeledQ #partial order: Time Unbalanced Partial Order (DP, HQ), pp. 152–169.
FATES-2005-PetrenkoY #automaton #consistency #nondeterminism #testing: Conformance Tests as Checking Experiments for Partial Nondeterministic FSM (AP, NY), pp. 118–133.
RTA-2005-HendrixCM #reasoning #specification: A Sufficient Completeness Reasoning Tool for Partial Specifications (JH, MC, JM), pp. 165–174.
RTA-2005-NishidaSS #term rewriting: Partial Inversion of Constructor Term Rewriting Systems (NN, MS, TS), pp. 264–278.
TestCom-2005-CampbellVHP #multi #order: Multiplexing of Partially Ordered Events (CC, MV, JH, AP), pp. 97–110.
CBSE-2004-MinCK #component #off the shelf #problem #using: Using Smart Connectors to Resolve Partial Matching Problems in COTS Component Acquisition (HGM, SWC, SDK), pp. 40–47.
DATE-v1-2004-SchaumontV #interactive #partial evaluation: Interactive Cosimulation with Partial Evaluation (PS, IV), pp. 642–647.
FoSSaCS-2004-GenestMMP #partial order #specification #using #verification: Specifying and Verifying Partial Order Properties Using Template MSCs (BG, MM, AM, DP), pp. 195–210.
FoSSaCS-2004-Leivant #correctness #logic: Partial Correctness Assertions Provable in Dynamic Logics (DL), pp. 304–317.
TACAS-2004-LugiezNZ #approach #automaton #explosion #partial order #problem #semantics: A Partial Order Semantics Approach to the Clock Explosion Problem of Timed Automata (DL, PN, SZ), pp. 296–311.
PEPM-2004-Asai #partial evaluation: Offline partial evaluation for shift and reset (KA), pp. 3–14.
PEPM-2004-Debois #imperative #optimisation #partial evaluation: Imperative program optimization by partial evaluation (SD), pp. 113–122.
SAS-2004-ManevichSRF #abstraction: Partially Disjunctive Heap Abstraction (RM, SS, GR, JF), pp. 265–279.
FLOPS-2004-CraigL #effectiveness #named #prolog #self: LIX: an Effective Self-applicable Partial Evaluator for Prolog (SJC, ML), pp. 85–99.
ICFP-2004-HermanM #embedded #partial evaluation #static analysis: Improving the static analysis of embedded languages via partial evaluation (DH, PM), pp. 16–27.
ICGT-2004-Casas-GarrigaB #partial order: Coproduct Transformations on Lattices of Closed Partial Orders (GCG, JLB), pp. 336–351.
ICPR-v2-2004-BollePCR: Iris Individuality: A Partial Iris Model (RMB, SP, JHC, NKR), pp. 927–930.
ICPR-v2-2004-HaasdonkHB #invariant: Adjustable Invariant Features by Partial Haar-Integration (BH, AH, HB), pp. 769–774.
ICPR-v2-2004-KimuraKK #image #multi #retrieval #similarity #using: Acceleration of Similarity-Based Partial Image Retrieval using Multistage Vector Quantization (AK, TK, KK), pp. 993–996.
ICPR-v4-2004-DebiollesOA #network: Combined Use of Partial Least Squares Regression and Neural Network for Diagnosis Tasks (AD, LO, PA), pp. 573–576.
KR-2004-ZhouC #semantics: Partial Implication Semantics for Desirable Propositions (YZ, XC), pp. 606–612.
PDCL-2004-LeuschelCBV #deduction #using: Specialising Interpreters Using Offline Partial Deduction (ML, SJC, MB, WV), pp. 340–375.
POPL-2004-BalatCF #normalisation #partial evaluation #λ-calculus: Extensional normalisation and type-directed partial evaluation for typed λ calculus with sums (VB, RDC, MPF), pp. 64–76.
SAC-2004-DaescuJRS #deployment #multi #reliability: Optimal placement of NAK-suppressing agents for reliable multicast: a partial deployment case (OD, RJ, BR, KS), pp. 334–338.
FSE-2004-LetierL #design #reasoning #requirements: Reasoning about partial goal satisfaction for requirements and design engineering (EL, AvL), pp. 53–62.
FSE-2004-UchitelC #behaviour #modelling: Merging partial behavioural models (SU, MC), pp. 43–52.
CC-2004-CaiGX: Region-Based Partial Dead Code Elimination on Predicated Code (QC, LG, JX), pp. 150–166.
CC-2004-VanDrunenH: Value-Based Partial Redundancy Elimination (TV, ALH), pp. 167–184.
LCTES-2004-ScholzHK #optimisation: Optimizing for space and time usage with speculative partial redundancy elimination (BS, RNH, JK), pp. 221–230.
CAV-2004-GoelB #abstraction #functional #model checking #order #simulation: Symbolic Simulation, Model Checking and Abstraction with Partially Ordered Boolean Functional Vectors (AG, REB), pp. 255–267.
CSL-2004-Schroder #logic #similarity #λ-calculus: The Logic of the Partial λ-Calculus with Equality (LS), pp. 385–399.
IJCAR-2004-GanzingerSW #composition #proving #similarity: Modular Proof Systems for Partial Functions with Weak Equality (HG, VSS, UW), pp. 168–182.
TestCom-2004-HuoP #on the #testing: On Testing Partially Specified IOTS through Lossless Queues (JH, AP), pp. 76–94.
ASE-2003-HallZ #bibliography #validation: Overview of OpenModel-based Validation with Partial Information (RJH, AZ), pp. 347–351.
DAC-2003-LiYRP #generative #markov #using: A scan BIST generation method using a markov source and partial bit-fixing (WL, CY, SMR, IP), pp. 554–559.
DAC-2003-SzymanekK #constraints #graph: Partial task assignment of task graphs under heterogeneous resource constraints (RS, KK), pp. 244–249.
DATE-2003-MoraesMPMC #configuration management #development: Development of a Tool-Set for Remote and Partial Reconfiguration of FPGAs (FGM, DM, JCSP, LM, NLVC), pp. 11122–11123.
VLDB-2003-HelmerNM #clustering: Estimating the Output Cardinality of Partial Preaggregation with a Measure of Clusteredness (SH, TN, GM), pp. 656–667.
ICSM-2003-JohnsonD #experience #information management #legacy #reverse engineering #using: Experience in developing interoperations among legacy information systems using partial reverse engineering (MJ, CNGD), pp. 369–372.
PEPM-2003-AgerDR #partial evaluation #pattern matching #performance #string: Fast partial evaluation of pattern matching in strings (MSA, OD, HKR), pp. 3–9.
PEPM-2003-GluckKH #partial evaluation: Transforming interpreters into inverse interpreters by partial evaluation (RG, YK, TH), pp. 10–19.
PEPM-2003-HatcliffDDJRR #component #corba #design #partial evaluation #slicing: Slicing and partial evaluation of CORBA component model designs for avionics system (JH, WD, MBD, GJ, VPR, R), pp. 1–2.
SAS-2003-Thiemann #continuation #partial evaluation: Continuation-Based Partial Evaluation without Continuations (PT), pp. 366–382.
STOC-2003-JayramKKR #bound #problem: Cell-probe lower bounds for the partial match problem (TSJ, SK, RK, YR), pp. 667–672.
SEFM-2003-WatsonF #assembly #modelling #semantics #source code: A Partial-Correctness Semantics for Modelling Assembler Programs (GW, CJF), pp. 82–90.
ICEIS-v2-2003-CamposGM #abduction #network #probability #using: Partial Abductive Inference in Bayesian Networks By Using Probability Trees (LMdC, JAG, SM), pp. 83–91.
ICEIS-v2-2003-IsikK #network #problem: Partially Connected Neural Networks for Mapping Problems (CI, SK), pp. 469–473.
ICML-2003-Graepel #difference #equation #linear #process: Solving Noisy Linear Operator Equations by Gaussian Processes: Application to Ordinary and Partial Differential Equations (TG), pp. 234–241.
ICML-2003-ZhangH #learning #taxonomy: Learning from Attribute Value Taxonomies and Partially Specified Instances (JZ, VH), pp. 880–887.
SEKE-2003-ChenXCYZ #scalability #slicing #source code: Partial Slicing for Large Programs (ZC, BX, WCC, HY, JZ), pp. 204–207.
SEKE-2003-LaiSF #mining #realtime: Real-Time Mining of Partial Periodic Patterns (CL, LS, MF), pp. 259–266.
OOPSLA-2003-TanterNCC #behaviour: Partial behavioral reflection: spatial and temporal selection of reification (ÉT, JN, DC, PC), pp. 27–46.
GPCE-2003-ElphickLC #matlab #partial evaluation: Partial Evaluation of MATLAB (DE, ML, SJC), pp. 344–363.
RE-2003-Catrava #quality #requirements #testing #towards #verification: Testing with Partial Traced Requirements: A Necessary Step Towards Higher Quality System Level Verification (SC), p. 303.
ESEC-FSE-2003-UchitelKM #behaviour #lts #using: Behaviour model elaboration using partial labelled transition systems (SU, JK, JM), pp. 19–27.
CGO-2003-CaiX #performance: Optimal and Efficient Speculation-Based Partial Redundancy Elimination (QC, JX), pp. 91–104.
CADE-2003-Stump #set: Subset Types and Partial Functions (AS), pp. 151–165.
CAV-2003-BouyerDMP: Timed Control with Partial Observability (PB, DD, PM, AP), pp. 180–192.
CSL-2003-Schroder #calculus #modelling: Henkin Models of the Partial σ-Calculus (LS), pp. 498–512.
LICS-2003-KhoussainovRS #automation #on the #partial order: On Automatic Partial Orders (BK, SR, FS), pp. 168–177.
RTA-2003-KhasidashviliG #partial order #semantics #term rewriting: Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication) (ZK, JRWG), pp. 467–482.
DAC-2002-HortaLTP #configuration management #hardware #plugin #runtime: Dynamic hardware plugins in an FPGA with partial run-time reconfiguration (ELH, JWL, DET, DBP), pp. 343–348.
DAC-2002-PilarskiH #satisfiability: SAT with partial clauses and back-leaps (SP, GH), pp. 743–746.
DATE-2002-Al-ArsG #fault #in memory #memory management #modelling #testing: Modeling Techniques and Tests for Partial Faults in Memory Devices (ZAA, AJvdG), pp. 89–93.
DATE-2002-BystrovKY #design #modelling #partial order #visualisation: Visualization of Partial Order Models in VLSI Design Flow (AVB, MK, AY), p. 1089.
DATE-2002-GericotaASF #concurrent #configuration management #novel: A Novel Methodology for the Concurrent Test of Partial and Dynamically Reconfigurable SRAM-Based FPGAs (MGG, GRA, MLS, JMF), p. 1126.
SIGMOD-2002-RamanH #online #query: Partial results for online query processing (VR, JMH), pp. 275–286.
ASIA-PEPM-2002-AgerDR #on the #partial evaluation #string: On obtaining Knuth, Morris, and Pratt’s string matcher by partial evaluation (MSA, OD, HKR), pp. 32–46.
ASIA-PEPM-2002-FutamuraKG #algorithm #automation #generative #performance #string: Automatic generation of efficient string matching algorithms by generalized partial computation (YF, ZK, RG), pp. 1–8.
PEPM-2002-Asai #online #partial evaluation: Online partial evaluation for shift and reset (KA), pp. 19–30.
PEPM-2002-MeurLC #partial evaluation #programming language #towards: Towards bridging the gap between programming languages and partial evaluation (AFLM, JLL, CC), pp. 9–18.
ICALP-2002-CharikarIP #algorithm #orthogonal #problem #query #set: New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems (MC, PI, RP), pp. 451–462.
ICALP-2002-HermenegildoPBL #approximate #debugging #semantics #specification #using #validation: Program Debugging and Validation Using Semantic Approximations and Partial Specifications (MVH, GP, FB, PLG), pp. 69–72.
ICALP-2002-MeseguerR #algebra #approach #specification: A Total Approach to Partial Algebraic Specification (JM, GR), pp. 572–584.
CIKM-2002-KimWLC #database #object-oriented: Partial rollback in object-oriented/object-relational database management systems (WYK, KYW, BSL, YKL, JWC), pp. 316–323.
ECIR-2002-DuffingS #database #image: Organising and Searching Partially Indexed Image Databases (GD, MS), pp. 22–40.
ICML-2002-Bonet #algorithm #markov #process: An epsilon-Optimal Grid-Based Algorithm for Partially Observable Markov Decision Processes (BB), pp. 51–58.
ICML-2002-LiuLYL #classification #documentation: Partially Supervised Classification of Text Documents (BL, WSL, PSY, XL), pp. 387–394.
ICML-2002-PerkinsP #fixpoint #on the: On the Existence of Fixed Points for Q-Learning and Sarsa in Partially Observable Domains (TJP, MDP), pp. 490–497.
KDD-2002-JinLS #similarity: Similarity measure based on partial information of time series (XJ, YL, CS), pp. 544–549.
KR-2002-HazarikaC: Abducing Qualitative Spatio-Temporal Histories from Partial Observations (SMH, AGC), pp. 14–25.
GPCE-2002-BalatD #partial evaluation: Memoization in Type-Directed Partial Evaluation (VB, OD), pp. 78–92.
LOPSTR-2002-Gruner #deduction: Abstract Partial Deduction Challenged (SG), pp. 258–259.
LOPSTR-2002-Vidal #declarative #multi #partial evaluation #slicing #source code: Forward Slicing of Multi-paradigm Declarative Programs Based on Partial Evaluation (GV), pp. 219–237.
CSL-2002-Kreutzer #fixpoint #infinity #logic: Partial Fixed-Point Logic on Infinite Structures (SK), pp. 337–351.
ASE-2001-BastenB #clustering #partial order #process #reduction: Enhancing Partial-Order Reduction via Process Clustering (TB, DB), pp. 245–253.
DAC-2001-KjeldsbergCA #data-driven #detection #estimation: Detection of Partially Simultaneously Alive Signals in Storage Requirement Estimation for Data Intensive Applications (PGK, FC, EJA), pp. 365–370.
DAC-2001-SchollB #equivalence #implementation: Checking Equivalence for Partial Implementations (CS, BB), pp. 238–243.
PODS-2001-MendelzonM #data flow #query: Querying Partially Sound and Complete Data Sources (AOM, GAM).
TACAS-2001-RuysLKLM #algebra #analysis #partial order #probability #process #using: First Passage Time Analysis of Stochastic Process Algebra Using Partial Orders (TCR, RL, JPK, DL, MM), pp. 220–235.
WCRE-2001-BaxterM #partial evaluation #preprocessor: Preprocessor Conditional Removal by Simple Partial Evaluation (IDB, MM), pp. 281–290.
FLOPS-2001-AlbertHV #declarative #multi: A Practical Partial Evaluator for a Multi-Paradigm Declarative Language (EA, MH, GV), pp. 326–342.
DLT-2001-SchwentickTV #automaton: Partially-Ordered Two-Way Automata: A New Characterization of DA (TS, DT, HV), pp. 239–250.
ICALP-2001-DiekertM #commutative #decidability #equation: Solvability of Equations in Free Partially Commutative Groups Is Decidable (VD, AM), pp. 543–554.
ICALP-2001-GandhiKS #algorithm #approximate #problem: Approximation Algorithms for Partial Covering Problems (RG, SK, AS), pp. 225–236.
ICALP-2001-Nielsen #modelling #partial order #question #why: Modelling with Partial Orders — Why and Why Not? (MN), pp. 61–63.
ICML-2001-LloraG #algorithm: Inducing Partially-Defined Instances with Evolutionary Algorithms (XL, JMGiG), pp. 337–344.
OOPSLA-2001-Whaley #compilation #using: Partial Method Compilation using Dynamic Profile Information (JW), pp. 166–179.
LOPSTR-2001-LeuschelG #deduction #model checking #using: Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking (ML, SG), pp. 91–110.
SAIG-2001-Asai: Integrating Partial Evaluators into Interpreters (KA), pp. 126–145.
CSL-2001-Akama #algebra #combinator #logic #towards #λ-calculus: Limiting Partial Combinatory Algebras towards Infinitary λ-Calculi and Classical Logic (YA), pp. 399–413.
LICS-2001-KozenT #correctness #linear #logic: Intuitionistic Linear Logic and Partial Correctness (DK, JT), pp. 259–268.
TLCA-2001-Haghverdi #category theory #linear #logic #modelling: Partially Additive Categories and Fully Complete Models of Linear Logic (EH), pp. 197–216.
DAC-2000-ShepardK #analysis: Static noise analysis for digital integrated circuits in partially-depleted silicon-on-insulator technology (KLS, DJK), pp. 239–242.
DATE-2000-GanesanV00a #clustering #configuration management #design #latency: An Integrated Temporal Partitioning and Partial Reconfiguration Technique for Design Latency Improvement (SG, RV), pp. 320–325.
TACAS-2000-ClarkeJM #partial order #protocol #reduction #security #verification: Partial Order Reductions for Security Protocol Verification (EMC, SJ, WRM), pp. 503–518.
TACAS-2000-KrimmM #communication #composition #generative #partial order #reduction: Compositional State Space Generation with Partial Order Reductions for Asynchronous Communicating Systems (JPK, LM), pp. 266–282.
PEPM-2000-BrauxN #java #towards: Towards Partially Evaluating Reflection in Java (MB, JN), pp. 2–11.
PEPM-2000-GallagherP #approximate #using: Using Regular Approximations for Generalisation During Partial Evalution (JPG, JCP), pp. 44–51.
PEPM-2000-GrobauerY #partial evaluation: The Second Futamura Projection for Type-Directed Partial Evaluation (BG, ZY), pp. 22–32.
PEPM-2000-MurphyL #program analysis: Program Analysis with Partial Transfer Functions (BRM, MSL), pp. 94–103.
PEPM-2000-SumiiK #approach #partial evaluation: Online-and-Offline Partial Evaluation: A Mixed Approach (Extended Abstract) (ES, NK), pp. 12–21.
SAS-2000-KnoopCJ: Partial Redundancy Elimination on Predicated Code (JK, JFC, RDCJ), pp. 260–279.
STOC-2000-FitziM #consistency: From partial consistency to global broadcast (MF, UMM), pp. 494–503.
ICALP-2000-BorosGKM #generative #multi: Generating Partial and Multiple Transversals of a Hypergraph (EB, VG, LK, KM), pp. 588–599.
ICML-2000-TodorovskiDSWG #behaviour #difference #equation: Discovering the Structure of Partial Differential Equations from Example Behaviour (LT, SD, AS, JPW, DG), pp. 991–998.
ICML-2000-Torgo #linear: Partial Linear Trees (LT), pp. 1007–1014.
ICPR-v3-2000-SalamancaCA #modelling #named #representation: HWM: A New Spherical Representation Structure for Modeling Partial Views of an Object (SS, CC, AA), pp. 3778–3781.
KDD-2000-MannilaM #partial order: Global partial orders from sequential data (HM, CM), pp. 161–168.
KR-2000-JanhunenNSY #semantics: Unfolding Partiality and Disjunctions in Stable Model Semantics (TJ, IN, PS, JHY), pp. 411–422.
SIGIR-2000-LuM #information retrieval #replication: Partial collection replication versus caching for information retrieval systems (ZL, KSM), pp. 248–255.
LOPSTR-2000-AlbertAV #effectiveness #partial evaluation: Measuring the Effectiveness of Partial Evaluation (EA, SA, GV).
LOPSTR-J-2000-AlbertAV #effectiveness #functional #logic #partial evaluation: Measuring the Effectiveness of Partial Evaluation in Functional Logic Languages (EA, SA, GV), pp. 103–124.
PPDP-2000-LeuschelL #deduction #petri net #problem: Solving coverability problems of petri nets by partial deduction (ML, HL), pp. 268–279.
PADL-2000-BistarelliCGR #consistency #constraints #programming: Labeling and Partial Local Consistency for Soft Constraint Programming (SB, PC, YG, FR), pp. 230–248.
CC-2000-Thiemann #adaptation #compilation #partial evaluation #source code: Compiling Adaptive Programs by Partial Evaluation (PT), pp. 264–278.
CAV-2000-StollerUL #detection #distributed #partial order #performance #using: Efficient Detection of Global Properties in Distributed Systems Using Partial-Order Methods (SDS, LU, YAL), pp. 264–279.
CL-2000-AlferesHP #logic programming #modelling #source code: Partial Models of Extended Generalized Logic Programs (JJA, HH, LMP), pp. 149–163.
CL-2000-BaralTTK #complexity: Computational Complexity of Planning Based on Partial Information about the System’s Present and Past States (CB, LCT, RT, VK), pp. 882–896.
CL-2000-LeuschelL #deduction #petri net: Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction (ML, HL), pp. 101–115.
DAC-1999-KondratyevCKLY #automation #optimisation #synthesis: Automatic Synthesis and Optimization of Partially Specified Asynchronous Systems (AK, JC, MK, LL, AY), pp. 110–115.
DAC-1999-VelevB #pipes and filters #similarity #verification: Exploiting Positive Equality and Partial Non-Consistency in the Formal Verification of Pipelined Microprocessors (MNV, REB), pp. 397–401.
DATE-1999-LechnerFRH #automation #performance #self: A Digital Partial Built-In Self-Test for a High Performance Automatic Gain Control Circuit (AL, JF, AR, BH), pp. 232–238.
DATE-1999-LinPR #fault: Full Scan Fault Coverage With Partial Scan (XL, IP, SMR), pp. 468–472.
PASTE-1999-NaumovichCC #analysis #data flow #partial order #performance #using #verification: Using Partial Order Techniques to Improve Performance of Data Flow Analysis Based Verification (GN, LAC, JMC), pp. 57–65.
PASTE-1999-SouterPH #analysis: Inter-Class Def-Use Analysis with Partial Class Representations (ALS, LLP, DH), pp. 47–56.
WCRE-1999-BalazinskaMDLK #analysis #java: Partial Redesign of Java Software Systems Based on Clone Analysis (MB, EM, MD, BL, KK), pp. 326–336.
PEPM-1999-Jay #experience #partial evaluation #source code: Partial Evaluation of Shaped Programs: Experience with FISh (CBJ), pp. 147–158.
PEPM-1999-PueblaHG #abstract interpretation #framework #integration #partial evaluation: An Integration of Partial Evaluation in a Generic Abstract Interpretation Framework (GP, MVH, JPG), pp. 75–84.
PEPM-1999-Rhiger #static typing: Deriving a Statically Typed Type-Directed Partial Evaluator (MR), pp. 25–29.
PEPM-1999-Veldhuizen #c++ #partial evaluation: C++ Templates as Partial Evaluation (TLV), pp. 13–18.
SAS-1999-TakimotoH #graph #using: Partial Dead Code Elimination Using Extended Value Graph (MT, KH), pp. 179–193.
FLOPS-1999-BartheS #calculus #partial evaluation: Partial Evaluation and Non-inference for Object Calculi (GB, BPS), pp. 53–67.
ICALP-1999-FlescaG #graph #order #query #regular expression: Partially Ordered Regular Languages for Graph Queries (SF, SG), pp. 321–330.
ICALP-1999-GuptaKS #on the: On the Complements of Partial k-Trees (AG, DK, TCS), pp. 382–391.
HCI-CCAD-1999-JackoRSPD #performance #visual notation: Linking visual capabilities of partially sighted computer users to psychomotor task performance (JAJ, RHRJ, IUS, CJP, MAD), pp. 975–979.
HCI-CCAD-1999-Sik-LanyiKV #development #multi: Multimedia program for the development of the vision of partially sighted children (CSL, PK, ZV), pp. 1014–1017.
ICML-1999-CardieMP #classification #parsing: Combining Error-Driven Pruning and Classification for Partial Parsing (CC, SM, DRP), pp. 87–96.
ICML-1999-ThrunLF #learning #markov #modelling #monte carlo #parametricity #probability #process: Monte Carlo Hidden Markov Models: Learning Non-Parametric Models of Partially Observable Stochastic Processes (ST, JL, DF), pp. 415–424.
SIGIR-1999-LuM #information retrieval: Partial Replica Selection Based on Relevance for Information Retrieval (ZL, KSM), pp. 97–104.
PPDP-1999-Filinski #partial evaluation #semantics: A Semantic Account of Type-Directed Partial Evaluation (AF), pp. 378–395.
POPL-1999-RielyH #mobile #trust #type system: Trust and Partial Typing in Open Systems of Mobile Agents (JR, MH), pp. 93–104.
CC-1999-KnoopRS #semantics: Expansion-Based Removal of Semantic Partial Redundancies (JK, OR, BS), pp. 91–106.
HPCA-1999-ZhangRT #hardware #parallel: Hardware for Speculative Parallelization of Partially-Parallel Loops in DSM Multiprocessors (YZ, LR, JT), pp. 135–139.
CAV-1999-BrunsG #logic #model checking: Model Checking Partial State Spaces with 3-Valued Temporal Logics (GB, PG), pp. 274–287.
DATE-1998-CornoPRV: Exploiting Symbolic Techniques for Partial Scan Flip Flop Selection (FC, PP, MSR, MV), pp. 670–677.
DATE-1998-FlottesPRV #effectiveness #performance: Scanning Datapaths: A Fast and Effective Partial Scan Selection Technique (MLF, RP, BR, LV), pp. 921–922.
DATE-1998-VercauterenVJL #analysis #partial order #performance #using #verification: Efficient Verification using Generalized Partial Order Analysis (SV, DV, GGdJ, BL), pp. 782–789.
ESOP-1998-BruynoogheLS #analysis #deduction: A Polyvariant Binding-Time Analysis for Off-line Partial Deduction (MB, ML, KFS), pp. 27–41.
FoSSaCS-1998-BukatinS #metric: Partial Metrics and Co-continuous Valuations (MAB, SYS), pp. 125–139.
TACAS-1998-KurshanLMPY #partial order #reduction: Static Partial Order Reduction (RPK, VL, MM, DP, HY), pp. 345–357.
IWPC-1998-ErdosS #comprehension #maintenance #source code: Partial Comprehension of Complex Programs (enough to perform maintenance) (KE, HMS), pp. 98–105.
PLDI-1998-ChowKLLT: Register Promotion by Partial Redundancy Elimination of Loads and Stores (FCC, RK, SML, RL, PT), pp. 26–37.
PLDI-1998-FahndrichFSA #constraints #graph #online: Partial Online Cycle Elimination in Inclusion Constraint Graphs (MF, JSF, ZS, AA), pp. 85–96.
FLOPS-1998-Danvy #online #partial evaluation: Online Type-Directed Partial Evaluation (OD), pp. 271–295.
ICALP-1998-AlurMP #partial order: Deciding Global Partial-Order Properties (RA, KLM, DP), pp. 41–52.
ICALP-1998-Lasota #similarity: Partial-Congruence Factorization of Bisimilarity Induced by Open Maps (SL), pp. 91–102.
TAGT-1998-LlabresR #algebra #category theory: Pushout Complements for Arbitrary Partial Algebras (ML, FR), pp. 131–144.
CIKM-1998-JacksonAKG #generative #information management #parsing #query #retrieval: Information Extraction from Case Low and Retrieval of Prior Cases by Partial Parsing and Query Generation (PJ, KAK, CK, BG), pp. 60–67.
ICML-1998-LittmanJK #corpus #independence #learning #representation: Learning a Language-Independent Representation for Terms from a Partially Aligned Corpus (MLL, FJ, GAK), pp. 314–322.
ICML-1998-LochS #markov #policy #process #using: Using Eligibility Traces to Find the Best Memoryless Policy in Partially Observable Markov Decision Processes (JL, SPS), pp. 323–331.
KR-1998-BaiolettiMM #constraints #encoding #partial order: Encoding Planning Constraints into Partial Order Planners (MB, SM, AM), pp. 608–616.
ECOOP-1998-MasuharaY #concurrent #design #partial evaluation: Design and Partial Evaluation of Meta-Objects for a Concurrent Reflective Language (HM, AY), pp. 418–439.
FSE-1998-DwyerP #model checking: Filter-Based Model Checking of Partial Systems (MBD, CSP), pp. 189–202.
HPCA-1998-VengroffG #branch #estimation #performance #predict #re-engineering: Partial Sampling with Reverse State Reconstruction: A New Technique for Branch Predictor Performance Estimation (DEV, GRG), pp. 342–351.
CADE-1998-Crary #fixpoint #induction: Admissibility of Fixpoint Induction over Partial Types (KC), pp. 270–285.
CAV-1998-AbdullaJKP #approach #partial order #reduction #verification: A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract) (PAA, BJ, MK, DP), pp. 379–390.
CAV-1998-Peled #partial order #reduction: Ten Years of Partial Order Reduction (DP), pp. 17–28.
IWTCS-1998-PetrenkoUC #concurrent #detection #fault #using: Using Partial-Orders for Detecting Faults in Concurrent Systems (AP, AU, VC), pp. 175–190.
JICSLP-1998-CollavizzaDR #consistency: Relationships between Partial Consistencies over Continuous Domains (HC, FD, MR), pp. 345–346.
RTA-1998-Akama #algebra #combinator: SN Combinators and Partial Combinatory Algebras (YA), pp. 302–316.
RTA-1998-DanvyR #higher-order #partial evaluation: Higher-Order Rewriting and Partial Evaluation (OD, KHR), pp. 286–301.
ASE-1997-MarletTC #architecture #implementation #partial evaluation #performance: Mapping Software Architectures to Efficient Implementations via Partial Evaluation (RM, ST, CC), pp. 183–192.
DAC-1997-CabodiCLQ #approach #clustering #effectiveness #scalability #traversal: Disjunctive Partitioning and Partial Iterative Squaring: An Effective Approach for Symbolic Traversal of Large Circuits (GC, PC, LL, SQ), pp. 728–733.
DAC-1997-HeCP #named: SPIE: Sparse Partial Inductance Extraction (ZH, MC, LTP), pp. 137–140.
EDTC-1997-HigamiK #design #parallel: Design of partially parallel scan chain (YH, KK), p. 626.
EDTC-1997-WalrathVB #analysis #partial evaluation #performance #using #verification: Performance verification using partial evaluation and interval analysis (JW, RV, WB), p. 622.
PODS-1997-HoBA #query #using: Partial-Sum Queries in Data Cubes Using Covering Codes (CTH, JB, RA), pp. 228–237.
TACAS-1997-AndersenSM #model checking: Partial Model Checking with ROBDDs (HRA, JS, NM), pp. 35–49.
TACAS-1997-EmersonJP #partial order #reduction #symmetry: Combining Partial Order and Symmetry Reductions (EAE, SJ, DP), pp. 19–34.
PEPM-1997-AsaiMY #call-by #partial evaluation #λ-calculus: Partial Evaluation of Call-by-Value λ-Calculus with Side-Effects (KA, HM, AY), pp. 12–21.
PEPM-1997-Augustsson #partial evaluation: Partial Evaluation in Aircraft Crew Planning (LA), pp. 127–136.
PEPM-1997-BeshersF #compilation #generative #partial evaluation #performance #using #visualisation: Generating Efficient Virtual Worlds for Visualization Using Partial Evaluation and Dynamic Compilation (CB, SF), pp. 107–115.
PEPM-1997-Debray #bound #partial evaluation: Resource-Bounded Partial Evaluation (SKD), pp. 179–192.
PEPM-1997-GenglerM #partial evaluation #self #π-calculus: Self-Applicable Partial Evaluation for the π-Calculus (MG, MM), pp. 36–46.
PEPM-1997-HeldalH #compilation #partial evaluation: Partial Evaluation and Separate Compilation (RH, JH), pp. 1–11.
PEPM-1997-MarinescuG #concurrent #source code: Partial-Evaluation Techniques for Concurrent Programs (MM, BG), pp. 47–62.
PEPM-1997-MullerVM #optimisation #partial evaluation #protocol #scalability: Scaling up Partial Evaluation for Optimizing the Sun Commercial RPC Protocol (GM, ENV, RM), pp. 116–126.
PEPM-1997-Sheard #online #polymorphism: A Type-directed, On-line, Partial Evaluator for a Polymorphic Language (TS), pp. 22–35.
PLDI-1997-BodikG #slicing #using: Partial Dead Code Elimination using Slicing Transformations (RB, RG), pp. 159–170.
PLDI-1997-ChowCKLLT #algorithm: A New Algorithm for Partial Redundancy Elimination based on SSA Form (FCC, SC, RK, SML, RL, PT), pp. 273–286.
PLDI-1997-SperberT #compilation #partial evaluation: Two for the Price of One: Composing Partial Evaluation and Compilation (MS, PT), pp. 215–225.
SAS-1997-Braunburger #analysis #automation #order #polynomial #termination #using: Automatic Termination Analysis for Partial Functions Using Polynomial Orderings (JB), pp. 330–344.
SAS-1997-Jones #abstract interpretation #bibliography #partial evaluation: Combining Abstract Interpretation and Partial Evaluation (Brief Overview) (NDJ), pp. 396–405.
ICALP-1997-DrosteG #on the: On Recognizable and Rational Formal Power Series in Partially Commuting Variables (MD, PG), pp. 682–692.
ICALP-1997-Kabanets: Recognizability Equals Definability for Partial k-Paths (VK), pp. 805–815.
IFL-1997-SparudR #functional: Complete and Partial Redex Trails of Functional Computations (JS, CR), pp. 160–177.
CIKM-1997-MehrotraHK #multi: Dealing with Partial Failures in Multiple Processor Primary-Backup Systems (SM, KH, SMK), pp. 371–378.
KDD-1997-AliMS #classification #using: Partial Classification Using Association Rules (KA, SM, RS), pp. 115–118.
LOPSTR-1997-LafaveG #constraints #functional #logic programming #partial evaluation #source code: Constraint-Based Partial Evaluation of Rewriting-Based Functional Logic Programs (LL, JPG), pp. 168–188.
RE-1997-EasterbrookC #experience #formal method #specification: Formal Methods for V&V of Partial Specifications: An Experience RSeport (SME, JRC), pp. 160–168.
ICSE-1997-AvruninCD #realtime: Analyzing Partially-Implemented Real-Time Systems (GSA, JCC, LKD), pp. 228–238.
ASF+SDF-1997-BorovanskyK #partial evaluation: Strategies of ELAN: meta-interpretation and partial evaluation (PB, HK), p. 2.
CADE-1997-DefourneauxP #proving: Partial Matching for Analogy Discovery in Proofs and Counter-Examples (GD, NP), pp. 431–445.
CADE-1997-RousselM #calculus #compilation: Exact Kanowledge Compilation in Predicate Calculus: The Partial Achievement Case (OR, PM), pp. 161–175.
CAV-1997-AlurBHQR #partial order #reduction: Partial-Order Reduction in Symbolic State Space Exploration (RA, RKB, TAH, SQ, SKR), pp. 340–351.
CAV-1997-KokkarinenPV #partial order #reduction: Relaxed Visibility Enhances Partial Order Reduction (IK, DP, AV), pp. 328–339.
ICLP-1997-Liu #database #deduction #set #tuple: Supporting Partial and Complete Sets and Tuples in Deductive Databases (ML), p. 415.
ILPS-1997-SeipelMR #database #modelling: A Characterization of the Partial Stable Models For Disjunctive Databases (DS, JM, CR), pp. 245–259.
LICS-1997-EscardoS #algebra #induction #recursion: Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras (MHE, TS), pp. 376–386.
LICS-1997-Kobayashi #calculus #concurrent #process: A Partially Deadlock-Free Typed Process Calculus (NK0), pp. 128–139.
RTA-1997-BechetGR #axiom #partial order: A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders (DB, PdG, CR), pp. 230–240.
RTA-1997-KuhlerW #data type #equation #induction #proving #specification #theorem proving: Conditional Equational Specifications of Data Types with Partial Operations for Inductive Theorem Proving (UK, CPW), pp. 38–52.
DAC-1996-ChenLH #layout: Layout Driven Selecting and Chaining of Partial Scan (CSC, KHL, TH), pp. 262–267.
DAC-1996-VerlindJL #analysis #performance: Efficient Partial Enumeration for Timing Analysis of Asynchronous Systems (EV, GGdJ, BL), pp. 55–58.
DAC-1996-XiangVFP #design: Partial Scan Design Based on Circuit State Information (DX, SV, WKF, JHP), pp. 807–812.
ESOP-1996-AlpuenteFV #functional #logic programming #partial evaluation #source code: Narrowing-Driven Partial Evaluation of Functional Logic Programs (MA, MF, GV), pp. 45–61.
ESOP-1996-Bechet #encoding #partial evaluation #using: Removing Value Encoding Using Alternative Values in Partial Evaluation of Strongly-Typed Languages (DB), pp. 77–91.
TACAS-1996-ChouP #model checking #partial order #reduction #verification: Formal Verification of a Partial-Order Reduction Technique for Model Checking (CTC, DP), pp. 241–257.
WCRE-1996-Cifuentes #automation #reverse engineering: Partial Automation of an Integrated Reverse Engineering Environment of Binary Code (CC), pp. 50–56.
PLDI-1996-SperberT #compilation #partial evaluation: Realistic Compilation by Partial Evaluation (MS, PT), pp. 206–214.
SAS-1996-AndersenH #analysis #functional #higher-order #partial evaluation #termination: Termination Analysis for Offline Partial Evaluation of a Higher Order Functional Language (PHA, CKH), pp. 67–82.
SAS-1996-BrauburgerG #analysis #termination: Termination Analysis for Partial Functions (JB, JG), pp. 113–127.
FME-1996-BoitenDBS #consistency #refinement #specification: Consistency and Refinement for Partial Specification in Z (EAB, JD, HB, MS), pp. 287–306.
ICPR-1996-BasriGJ #image #multi #performance: Efficient determination of shape from multiple images containing partial information (RB, AJG, DWJ), pp. 268–274.
ICPR-1996-Cinque #parallel: A parallel partial-sums computation on a pyramid machine (LC), pp. 616–619.
ICPR-1996-DarrellP #gesture #markov #process #recognition #using: Active gesture recognition using partially observable Markov decision processes (TD, AP), pp. 984–988.
KDD-1996-KramerP #performance: Efficient Search for Strong Partial Determinations (SK, BP), pp. 371–374.
KR-1996-Sharma #inheritance #partial order: Partial Orders of Sorts and Inheritances (or Placing Inheritance in Context) (NS), pp. 280–290.
LOPSTR-1996-JorgensenLM #deduction: Conjunctive Partial Deduction in Practice (JJ, ML, BM), pp. 59–82.
LOPSTR-1996-MatskinKK #deduction #framework #source code #synthesis: Partial Deduction in the Framework of Structural Synthesis of Programs (MM, HJK, JK), pp. 239–255.
LOPSTR-1996-PettorossiPR #deduction: Enhancing Partial Deduction via Unfold/Fold Rules (AP, MP, SR), pp. 146–168.
PLILP-1996-DanvyV #case study #compilation #partial evaluation #semantics: Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation (OD, RV), pp. 182–197.
PLILP-1996-GluckJMS #deduction: Controlling Conjunctive Partial Deduction (RG, JJ, BM, MHS), pp. 152–166.
PLILP-1996-Thiemann #implementation #partial evaluation: Implementing Memoization for Partial Evaluation (PT), pp. 198–212.
POPL-1996-Danvy #partial evaluation: Type-Directed Partial Evaluation (OD), pp. 242–257.
SAC-1996-Gurr #logic programming #specification: Verifiable partial specifications for logic programming (CAG), pp. 374–379.
SAC-1996-SucciBR #component #identification #nondeterminism #specification #taxonomy: A taxonomy for identifying a software component for uncertain and partial specifications (GS, FB, MR), pp. 570–579.
CC-1996-Salomon #maintenance #partial evaluation #reuse #using: Using Partial Evaluation in Support of Portability, Reusability, and Maintainability (DJS), pp. 208–222.
ISSTA-1996-GodefroidPS #concurrent #industrial #partial order #source code #using #validation: Using Partial-Order Methods in the Formal Validation of Industrial Concurrent Programs (PG, DP, MGS), pp. 261–269.
JICSLP-1996-LeuschelSW #concept #deduction #integration #towards: A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration (ML, DDS, DAdW), pp. 319–332.
JICSLP-1996-PettorossiPR #algorithm #deduction #how #specification #string: How to Extend Partial Deduction to Derive the KMP String-Matching Algorithm from a Naive Specification (Poster Abstract) (AP, MP, SR), p. 539.
LICS-1996-BethkeKV #algebra #combinator #normalisation: Completing Partial Combinatory Algebras With Unique Head-Normal Forms (IB, JWK, RCdV), pp. 448–454.
LICS-1996-WillemsW #branch #linear #model checking #partial order: Partial-Order Methods for Model Checking: From Linear Time to Branching Time (BW, PW), pp. 294–303.
DAC-1995-PanL: Partial Scan with Pre-selected Scan Signals (PP, CLL), pp. 189–194.
PEPM-1995-Doh #partial evaluation: Action Transformation by Partial Evaluation (KGD), pp. 230–240.
PEPM-1995-LeuschelS #partial evaluation #towards: Towards Creating Specialised Integrity Checks through Partial Evaluation of Meta-Interpreters (ML, DDS), pp. 253–263.
PEPM-1995-Mogensen #online #partial evaluation #self #λ-calculus: Self-applicable Online Partial Evaluation of Pure λ Calculus (TÆM), pp. 39–44.
PLDI-1995-AgrawalSD #compilation #distributed #interprocedural #memory management: Interprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilation (GA, JHS, RD), pp. 258–269.
STOC-1995-FranklinY #privacy: Secure hypergraphs: privacy from partial broadcast (Extended Abstract) (MKF, MY), pp. 36–44.
ICALP-1995-MetivierRW #set #word: Computing the Closure of Sets of Words Under Partial Commutations (YM, GR, PAW), pp. 75–86.
CIKM-1995-IkejiF #adaptation #query #using: Computation of Partial Query Results Using An Adaptive Stratified Sampling Technique (ACI, FF), pp. 145–149.
ICML-1995-LittmanCK #learning #policy #scalability: Learning Policies for Partially Observable Environments: Scaling Up (MLL, ARC, LPK), pp. 362–370.
KDD-1995-PfahringerK #evaluation: Compression-Based Evaluation of Partial Determinations (BP, SK), pp. 234–239.
SIGIR-1995-Finch #documentation #partial order #representation: Partial Orders for Document Representation: A New Methodology for Combining Document Features (SF), pp. 264–272.
OOPSLA-1995-MasuharaMAY #compilation #concurrent #object-oriented #partial evaluation #using: Compiling Away the Meta-Level in Object-Oriented Concurrent Reflective Languages Using Partial Evaluation (HM, SM, KA, AY), pp. 300–315.
LOPSTR-1995-Leuschel #constraints #deduction: Ecological Partial Deduction: Preserving Characteristic Trees Without Constraints (ML), pp. 1–16.
PLILP-1995-Hatcliff #correctness #verification: Mechanically Verifying the Correctness of an Offline Partial Evaluator (JH), pp. 279–298.
PLILP-1995-HengleinS #partial evaluation #semantics: A Semantic Model of Binding Times for Safe Partial Evaluation (FH, DS), pp. 299–320.
SAC-1995-TarauDB #empirical #power of #prolog: The power of partial tanslation: an experiment with the C-ification of binary Prolog (PT, BD, KDB), pp. 152–156.
ICLP-1995-BrassD #bottom-up #evaluation #semantics: Disjunctive Semantics based upon Partial and Bottom-Up Evaluation (SB, JD), pp. 199–213.
ICLP-1995-CervesatoCM #calculus #framework #logic programming #order: A Modal Calculus of Partially Ordered Events in a Logic Programming Framework (IC, LC, AM), pp. 299–313.
ICLP-1995-MartensG #deduction #flexibility #termination: Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance (BM, JPG), pp. 597–611.
ICLP-1995-SakamaI #abduction #deduction #reasoning: The Effect of Partial Deduction in Abductive Reasoning (CS, KI), pp. 383–397.
ILPS-1995-FerrandL #composition #correctness #logic programming #proving #source code: A Compositional Proof Method of Partial Correctness for Normal Logic Programs (GF, AL), pp. 209–223.
ILPS-1995-LeuschelM #deduction #representation: Partial Deduction of the Ground Representation and its Application to Integrity Checking (ML, BM), pp. 495–509.
LICS-1995-Andersen #model checking: Partial Model Checking (Extended Abstract) (HRA), pp. 398–407.
RTA-1995-Senizergues #algorithm #confluence #polynomial #testing: A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems (GS), pp. 194–209.
DAC-1994-AsharM #low cost #set: Implicit Computation of Minimum-Cost Feedback-Vertex Sets for Partial Scan and Other Applications (PA, SM), pp. 77–80.
DAC-1994-ChakradharBA #algorithm: An Exact Algorithm for Selecting Partial Scan Flip-Flops (STC, AB, VDA), pp. 81–86.
DAC-1994-ChakradharD: Resynthesis and Retiming for Optimum Partial Scan (STC, SD), pp. 87–93.
EDAC-1994-HarrisO #concurrent #fine-grained #scheduling: Fine-Grained Concurrency in Test Scheduling for Partial-Intrusion BIST (IGH, AO), pp. 119–123.
PODS-1994-GuptaSUW #constraints: Constraint Checking with Partial Information (AG, YS, JDU, JW), pp. 45–55.
ESOP-1994-SorensenGJ #deforestation #partial evaluation #supercompilation #towards: Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC (MHS, RG, NDJ), pp. 485–500.
ICSM-1994-GuptaS #analysis #data flow #framework: A Framework for Partial Data Flow Analysis (RG, MLS), pp. 4–13.
PEPM-1994-BaierGZ #fortran #partial evaluation #source code: Partial Evaluation of Numerical Programs in Fortran (RB, RG, RZ), pp. 119–132.
PEPM-1994-BerlinS #experience #partial evaluation #tool support: Partial Evaluation for Scientific Computing: The Supercomputer Toolkit Experience (AAB, RJS), pp. 133–141.
PEPM-1994-BondorfD #partial evaluation: Improving CPS-Based Partial Evaluation: Writing Cogen by Hand (AB, DD), pp. 1–9.
PEPM-1994-DanvyMP #partial evaluation: The Essence of Eta-Expansion in Partial Evaluation (OD, KM, JP), pp. 11–20.
PEPM-1994-Jones #partial evaluation: Dictionary-Free Overloading by Partial Evaluation (MPJ), pp. 107–117.
PLDI-1994-BriggsC #effectiveness: Effective Partial Redundancy Elimination (PB, KDC), pp. 159–170.
PLDI-1994-KnoopRS: Partial Dead Code Elimination (JK, OR, BS), pp. 147–158.
SAS-1994-Goubault: Generalized Boxings, Congruences and Partial Inlining (JG), pp. 147–161.
LFP-1994-LawallD #partial evaluation: Continuation-Based Partial Evaluation (JLL, OD), pp. 227–238.
TAGT-1994-AlberichBRVW #algebra #approach #graph transformation: A Partial Algebras Approach to Graph Transformation (RA, PB, FR, GV, BW), pp. 1–15.
TAGT-1994-ArnborgP #bound #graph #subclass: A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths (SA, AP), pp. 469–486.
ICML-1994-SinghJJ #learning #markov #process: Learning Without State-Estimation in Partially Observable Markovian Decision Processes (SPS, TSJ, MIJ), pp. 284–292.
KR-1994-HoekJT #logic: Honesty in Partial Logic (WvdH, JJ, ET), pp. 583–594.
SEKE-1994-SuzukiT #abstraction #behaviour #retrieval #using: Associative program retrieval using partially-ordered behavioral abstractions of a program (HS, NT), pp. 395–404.
LOPSTR-1994-Leuschel #partial evaluation: Partial Evaluation of the “Real Thing” (ML), pp. 122–137.
LOPSTR-1994-SakamaS #approach #declarative #deduction #logic programming #source code: Partial Deduction of Disjunctive Logic Programs: A Declarative Approach (CS, HS), pp. 170–182.
PLILP-1994-GluckS #deduction: Partial Deduction and Driving are Equivalent (RG, MHS), pp. 165–181.
PLILP-1994-MoreauQ #continuation #difference: Partial Continuations as the Difference of Continuations — A Duumvirate of Control Operators (LM, CQ), pp. 182–197.
HPDC-1994-CataniaPRV #array #clustering #evaluation #performance: Performance Evaluation of a Partial Dynamic Declustering Disk Array System (VC, AP, SR, LV), pp. 244–252.
HPDC-1994-HuiCYHA #difference #equation #network: Solving Partial Differential Equations on a Network of Workstations (CCH, GKKC, MMSY, MH, IA), pp. 194–201.
CADE-1994-Eriksson #calculus #editing #induction #interactive #named: Pi: an Interactive Derivation Editor for the Calculus of Partial Inductive Definitions (LHE), pp. 821–825.
CADE-1994-KerberK #logic: A Mechanization of Strong Kleene Logic for Partial Functions (MK, MK), pp. 371–385.
CAV-1994-Peled #model checking #on the fly #partial order #reduction: Combining Partial Order Reductions with On-the-fly Model-Checking (DP), pp. 377–390.
ILPS-1994-Jones #abstract interpretation #functional #logic programming #partial evaluation: Abstract Interpretation and Partial Evaluation in Functional and Logic Programming (NDJ), pp. 17–22.
DAC-1993-HeebPR #modelling #using: Frequency Domain Microwave Modeling Using Retarded Partial Element Equivalent Circuits (HH, SP, AER), pp. 702–706.
DAC-1993-KagarisT: Partial Scan with Retiming (DK, ST), pp. 249–254.
DAC-1993-LeeJW #behaviour #synthesis: Behavioral Synthesis of Highly Testable Data Paths under the Non-Scan and Partial Scan Environments (TCL, NKJ, WW), pp. 292–297.
DAC-1993-ParikhA #approach #cost analysis: A Cost-Based Approach to Partial Scan (PSP, MA), pp. 255–259.
ICDAR-1993-ChenWB #detection #image #keyword #markov #modelling #using: Detecting and locating partially specified keywords in scanned images using hidden Markov models (FC, LW, DSB), pp. 133–138.
ICDAR-1993-WangHF #recognition: Optical recognition of handwritten Chinese characters by partial matching (ABW, JSH, KCF), pp. 822–823.
SIGMOD-1993-PangCL: Partially Preemptive Hash Joins (HP, MJC, ML), pp. 59–68.
VLDB-1993-ZobelMS #scalability #using: Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files (JZ, AM, RSD), pp. 290–301.
PEPM-1993-Consel93a #higher-order #partial evaluation: A Tour of Schism: A Partial Evaluation System For Higher-Order Applicative Languages (CC), pp. 145–154.
PEPM-1993-ConselPW #composition #incremental #operating system #partial evaluation #performance: Incremental Partial Evaluation: The Key to High Performance, Modularity and Portability in Operating Systems (CC, CP, JW), pp. 44–46.
PEPM-1993-Lawall #induction #partial evaluation #proving #using: Proofs by Structural Induction using Partial Evaluation (JLL), pp. 155–166.
PEPM-1993-Malmkjaer #partial evaluation #performance #towards: Towards Efficient Partial Evaluation (KM), pp. 33–43.
PEPM-1993-Mossin #parsing #partial evaluation: Partial Evaluation of General Parsers (CM), pp. 13–21.
PEPM-1993-Prestwich #deduction #online #scalability #source code: Online Partial Deduction of Large Programs (SDP), pp. 111–118.
PEPM-1993-Vasell #data flow #graph: A Partial Evaluator for Data Flow Graphs (JV), pp. 206–215.
ICALP-1993-Contejean #reduction: A Partial Solution for D-Unification Based on a Reduction to AC1-Unification (EC), pp. 621–632.
ICALP-1993-LodayaT #decidability #logic #partial order: Decidability of a Partial Order Based Temporal Logic (KL, PST), pp. 582–592.
FPCA-1993-BondorfP #compilation #partial evaluation: Compiling Actions by Partial Evaluation (AB, JP), pp. 308–320.
CAiSE-1993-BlazyF #comprehension #fortran #partial evaluation #source code #symbolic computation: Partial Evaluation and Symbolic Computation for the Understanding of Fortran Programs (SB, PF), pp. 184–198.
SEKE-1993-BlazyF #comprehension #fortran #partial evaluation #source code: Partial Evaluation for the Understanding of FORTRAN Programs (SB, PF), pp. 517–525.
SIGIR-1993-KilpelainenM #retrieval: Retrieval from Hierarchical Texts by Partial Patterns (PK, HM), pp. 214–222.
LOPSTR-1993-Waal #partial evaluation #power of: The Power of Partial Evaluation (DAdW), pp. 113–123.
POPL-1993-ConselD #partial evaluation #tutorial: Tutorial Notes on Partial Evaluation (CC, OD), pp. 493–501.
HPDC-1993-AmerCCD #multi #partial order #reliability: Partial Order Transport Service for Multimedia Applications: Reliable Service (PDA, TJC, CC, MD), pp. 272–280.
CAV-1993-GodefroidP #dependence #partial order #verification: Refining Dependencies Improves Partial-Order Verification Methods (Extended Abstract) (PG, DP), pp. 438–449.
TLCA-1993-Bakel #term rewriting: Partial Intersection Type Assignment in Applicative Term Rewriting Systems (SvB), pp. 29–44.
SIGMOD-1992-RabinovichL #fault tolerance #protocol: Improving Fault Tolerance and Supporting Partial Writes in Structured Coterie Protocols for Replicated Objects (MR, EDL), pp. 226–235.
ESOP-1992-OKeefeW #decidability #type inference: Type Inference for Partial Types is Decidable (PO, MW), pp. 408–417.
PEPM-1992-AndersenG #analysis #partial evaluation: Speedup Analysis in Partial Evaluation: Preliminary Results (LOA, CKG), pp. 1–7.
PEPM-1992-ConselP #programming: A Programming Environment for Binding-time Based Partial Evaluators (CC, SP), pp. 62–66.
PEPM-1992-DehboneiJ #analysis #evaluation #interprocedural #semantics #symbolic computation: Semantical Interprocedural Analysis by Partial Symbolic Evaluation (BD, PJ), pp. 14–20.
PEPM-1992-KatzW #partial evaluation #towards: Towards a New Perspective on Partial Evaluation (MK, DW), pp. 29–37.
PEPM-1992-Mogensen #partial evaluation #self #λ-calculus: Self-applicable Partial Evaluation for Pure λ Calculus (TÆM), pp. 116–121.
WSA-1992-Bechet #interactive #partial evaluation: Partial Evaluation of Interaction Nets (DB), pp. 331–338.
WSA-1992-GenglerR #analysis: A Polyvariant Binding Time Analysis Handling Partially Known Values (MG, MR), pp. 322–330.
WSA-1992-QueinnecG #backtracking #partial evaluation #pattern matching: Partial Evaluation applied to Symbolic Pattern Matching with Intelligent Backtrack (CQ, PG), pp. 109–117.
WSA-1992-Saint-James #compilation #industrial #partial evaluation: Partial Evaluation in an Industrial Context: Compiling for Endomorphic Machines (ESJ), pp. 102–108.
KR-1992-MintonDBP #partial order #performance: Total Order vs. Partial Order Planning: Factors Influencing Performance (SM, MD, JLB, ABP), pp. 83–92.
KR-1992-PenberthyW #named #partial order: UCPOP: A Sound, Complete, Partial Order Planner for ADL (JSP, DSW), pp. 103–114.
ML-1992-ClarkH #integration #lazy evaluation #partial evaluation: Lazy Partial Evaluation: An Integration of Explanation-Based Generalization and Partial Evaluation (PC, RCH), pp. 82–91.
SEKE-1992-SotiropoulouP #case study #difference #equation #information management: A Case Study of Knowledge Engineering in the Application Area of Elliptic Partial Differential Equations (PDE’s) (VVS, TSP), pp. 261–268.
ALP-1992-AravindanD #deduction #logic programming #semantics #source code: Partial Deduction of Logic Programs wrt Well-Founded Semantics (CA, PMD), pp. 384–402.
ALP-1992-GabbrielliM #fixpoint #semantics: Fixpoint Semantics for Partial Computed Answer Substitutions and Call Patterns (MG, MCM), pp. 84–99.
LOPSTR-1992-Giacomo #partial evaluation #query: Intensional Query Answering: An Application of Partial Evaluation (GDG), pp. 132–150.
LOPSTR-1992-LammaM #partial evaluation: A Rationalisation of the ATMS in Terms of Partial Evaluation (EL, PM), pp. 118–131.
LOPSTR-1992-MogensenB #named #prolog #self: Logimix: A Self-Applicable Partial Evaluator for Prolog (TÆM, AB), pp. 214–227.
POPL-1992-Jorgensen #compilation #generative #lazy evaluation #partial evaluation: Generating a Compiler for a Lazy Language by Partial Evaluation (JJ), pp. 258–268.
POPL-1992-NirkheP #imperative #partial evaluation #programming language #realtime: Partial Evaluation of High-Level Imperative Programming Languages, with Applications in Hard Real-Time Systems (VN, WP), pp. 269–280.
CC-1992-Andersen #automation #c #compilation #generative #partial evaluation: Partial Evaluation of C and Automatic Compiler Generation (Extended Abstract) (LOA), pp. 251–257.
CSL-1992-Gavilanes-FrancoLR #higher-order #reasoning: Reasoning with Higher Order Partial Functions (AGF, FLC, MRA), pp. 167–181.
JICSLP-1992-FerrandD #correctness #logic programming #proving #source code: Proof Method of Partial Correctness and Weak Completeness for Normal Logic Programs (GF, PD), pp. 161–174.
DAC-1991-ChakrabortyBBL #testing #using: Enhanced Controllability for IDDQ Test Sets Using Partial Scan (TJC, SB, RB, CJL), pp. 278–281.
PODS-1991-Matsliach #analysis #multi #performance: Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves with Partial Expansions (GM), pp. 164–180.
PEPM-1991-HickeyS #partial evaluation #towards: Toward the Partial Evaluation of CLP Languages (TJH, DAS), pp. 43–51.
PEPM-1991-HolstG #lazy evaluation #partial evaluation: Partial Evaluation is Fuller Laziness (CKH, CKG), pp. 223–233.
PEPM-1991-KhooS #compilation #inheritance #partial evaluation #using: Compiling Inheritance using Partial Evaluation (SCK, RSS), pp. 211–222.
PEPM-1991-Lisper #algorithm #detection #partial evaluation: Detecting Static Algorithms by Partial Evaluation (BL), pp. 31–42.
PEPM-1991-Meyer #imperative #partial evaluation: Techniques for Partial Evaluation of Imperative Languages (UM), pp. 94–105.
PEPM-1991-ShermanSD #equation #optimisation #partial evaluation #source code #using: Optimization of Equational Programs Using Partial Evaluation (DS, RS, ID), pp. 72–82.
PEPM-1991-Smith #constraints #logic programming #partial evaluation #pattern matching #programming language: Partial Evaluation of Pattern Matching in Constraint Logic Programming Languages (DAS), pp. 62–71.
PEPM-1991-Sundaresh #incremental #partial evaluation #source code #using: Building Incremental Programs using Partial Evaluation (RSS), pp. 83–93.
PEPM-1991-Takano #functional #lazy evaluation: Generalized Partial Computation for a Lazy Functional Language (AT), pp. 1–11.
PLDI-1991-ConselK #partial evaluation: Parameterized Partial Evaluation (CC, SCK), pp. 92–106.
STOC-1991-Maurer #encryption #independence #security: Perfect Cryptographic Security from Partially Independent Channels (UMM), pp. 561–571.
WSA-1991-ColbyL #implementation #partial evaluation: An Implementation of Parametrized Partial Evaluation (CC, PL), pp. 82–89.
WSA-1991-DurandSS #equation #partial evaluation #source code: Partial Evaluation of an Intermediate Language for Equational Programs (ID, DS, RS), pp. 98–106.
WSA-1991-NielBV #functional #partial evaluation #problem #representation: Partial Evaluation of Polymorphically Typed Functional Languages: the Representation Problem (ADN, EB, KDV), pp. 90–97.
ICALP-1991-DuchampK #commutative #monad: Lazard’s Factorizations of Free Partially Commutative Monoids (GD, DK), pp. 242–253.
VDME-1991-1-ZaveJ #specification: Techniques for Partial Specification and Specification of Switching Systems (PZ, MJ), pp. 511–525.
FPCA-1991-Launchbury #self: A Strongly-Typed Self-Applicable Partial Evaluator (JL), pp. 145–164.
FPCA-1991-WeiseCRS #automation #online #partial evaluation: Automatic Online Partial Evaluation (DW, RC, ER, SS), pp. 165–191.
KR-1991-GeneserethH #source code: Partial Programs (MRG, JYjH), pp. 238–249.
LOPSTR-1991-Mill #partial evaluation: Pruning Operators for Partial Evaluation (PMM), pp. 183–204.
LOPSTR-1991-Ross #partial evaluation #prolog #semantics #source code: Semantics-based Partial Evaluation of Prolog Programs (BJR), pp. 221–237.
POPL-1991-QueinnecS #continuation: A Dynamic Extent Control Operator for Partial Continuations (CQ, BPS), pp. 174–184.
POPL-1991-SundareshH #compilation #incremental #partial evaluation: Incremental Compilation via Partial Evaluation (RSS, PH), pp. 1–13.
CAV-1991-GodefroidW #concurrent #partial order #performance #safety #using #verification: Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties (PG, PW), pp. 332–342.
CAV-1991-ProbstL #model checking #partial order: Partial-Order Model Checking: A Guide for the Perplexed (DKP, HFL), pp. 322–331.
ISLP-1991-BruynoogheSM #deduction #infinity #logic programming #source code: A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs (MB, DDS, BM), pp. 117–131.
LICS-1991-Audebaud #calculus: Partial Objects in the Calculus of Constructions (PA), pp. 86–95.
LICS-1991-GodefroidW #approach #model checking: A Partial Approach to Model Checking (PG, PW), pp. 406–415.
ICALP-1990-ClerboutLR #composition: Decomposition of Partial Commutations (MC, ML, YR), pp. 501–511.
ICALP-1990-Jones #partial evaluation #self: Partial Evaluation, Self-Application and Types (NDJ), pp. 639–659.
ICALP-1990-PeledP #liveness #partial order #proving: Proving Partial Order Liveness Properties (DP, AP), pp. 553–571.
LFP-1990-Berlin #partial evaluation: Partial Evaluation Applied to Numerical Computation (AB), pp. 139–150.
LFP-1990-Gomard #functional #source code #type inference: Partial Type Inference for Untyped Functional Programs (CKG), pp. 282–287.
GG-1990-Kennaway #category theory #graph grammar #morphism: Graph Rewriting in Some Categories of Partial Morphisms (RK), pp. 490–504.
POPL-1990-Gunter #correctness #nondeterminism #source code: Relating Total and Partial Correctness Interpretations of Non-Deterministic Programs (CAG), pp. 306–319.
CAV-1990-Godefroid #automation #partial order #using #verification: Using Partial Orders to Improve Automatic Verification Methods (PG), pp. 176–185.
CAV-1990-ProbstL #explosion #partial order #problem #semantics #using: Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems (DKP, HFL), pp. 146–155.
LICS-1990-CleavelandS #proving #specification #using: When is “Partial” Adequate? A Logic-Based Proof Technique Using Partial Specifications (RC, BS), pp. 440–449.
NACLP-1990-BenkerimiL #logic programming #partial evaluation #source code: A Partial Evaluation Procedure for Logic Programs (KB, JWL), pp. 343–358.
NACLP-1990-BugliesiLM #logic #partial evaluation: Partial Evaluation for Hierarchies of Logic Theories (MB, EL, PM), pp. 359–376.
NACLP-1990-Sahlin #approach #automation #partial evaluation #prolog: The Mixtus Approach to Automatic Partial Evaluation of Full Prolog (DS), pp. 377–398.
NACLP-1990-SmithH #partial evaluation: Partial Evaluation of a CLP Language (DAS, TJH), pp. 119–138.
DAC-1989-OgiharaMYM #effectiveness #generative #named #reliability #testing: MULTES/IS: An Effective and Reliable Test Generation System for Partial Scan and Non-Scan Synchronous Circuits (TO, KM, GY, SM), pp. 519–524.
STOC-1989-Kenyon-MathieuK #partial order #verification: Verifying Partial Orders (CKM, VK), pp. 367–374.
ICALP-1989-Perrin: Partial Commutations (DP), pp. 637–651.
KR-1989-Leishman #concept #graph: Analogy as a Constrained Partial Correspondence Over Conceptual Graphs (DL), pp. 223–234.
POPL-1989-Parker #partial order #programming: Partial Order Programming (DSPJ), pp. 260–266.
LICS-1989-KfouryTU #problem #unification: Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report) (AJK, JT, PU), pp. 98–105.
NACLP-1989-BugliesiR #partial evaluation #prolog: Partial Evaluation in Prolog: Some Improvements about Cut (MB, FR), pp. 645–660.
NACLP-1989-FurukawaFS #partial evaluation #performance: Deriving an Efficient Production System by Partial Evaluation (KF, HF, TS), pp. 661–674.
DAC-1988-Savir #design #verification #why: Why Partial Design Verification Works Better Than It Should (JS), pp. 704–707.
SIGMOD-1988-KimP #retrieval: Optimal File Distribution For Partial Match Retrieval (MHK, SP), pp. 173–182.
VLDB-1988-HafezO #normalisation: The Partial Normalized Storage Model of Nested Relations (AH, GÖ), pp. 100–111.
ESOP-1988-Consel #empirical #partial evaluation: New Insights into Partial Evaluation: the SCHISM Experiment (CC), pp. 236–246.
ICALP-1988-Diekert #commutative #for free #monad #transitive: Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids (VD), pp. 176–187.
ICALP-1988-Thatte #type inference: Type Inference with Partial Types (ST), pp. 615–629.
LFP-1988-Pfenning #higher-order #polymorphism #type inference #unification: Partial Polymorphic Type Inference and Higher-Order Unification (FP), pp. 153–163.
ALP-1988-Wolter #equation: Narrowing in Partial Conditional Equational Theories (Abstract) (UW), p. 244.
POPL-1988-JohnsonD #continuation: Stores and Partial Continuations as First-Class Objects in a Language and its Environment (GFJ, DD), pp. 158–168.
CADE-1988-Basin #automation #reasoning: An Environment For Automated Reasoning About Partial Functions (DAB), pp. 101–110.
CADE-1988-BlasiusS #equation #graph #reasoning #unification: Partial Unification for Graph Based Equational Reasoning (KHB, JHS), pp. 397–414.
JICSCP-1988-FujitaOF88 #constraints #haskell #partial evaluation #source code: Partial Evaluation of GHC Programs Based on the UR-set with Constraints (HF, AO, KF), pp. 924–941.
LICS-1988-HoareG #correctness #logic: Partial Correctness of C-MOS Switching Circuits: An Exercise in Applied Logic (CARH, MJCG), pp. 28–36.
VLDB-1987-Blakey #database #distributed: Basis of a Partially Informed Distributed Database (MB), pp. 381–388.
PLDI-1987-Johnson #continuation #named: GL — a denotational testbed with continuations and partial continuations as first-class objects (GFJ), pp. 165–176.
ICALP-1987-ChoffrutD #monad #problem: A Star-Height Problem in Free Monoids with Partial Communications (CC, CD), pp. 190–201.
ICALP-1987-Kreowski #algebra #specification: Partial Algebras Flow From Algebraic Specifications (HJK), pp. 521–530.
FPCA-1987-Goldberg #detection #functional #source code: Detecting sharing of partial applications in functional programs (BG), pp. 408–425.
POPL-1987-MoshierR #data type #logic: A Logic for Partially Specified Data Structures (MDM, WCR), pp. 156–167.
ICSE-1987-KatzRT #named #reuse: PARIS: A System for Reusing Partially Interpreted Schemas (SK, CR, KST), pp. 377–386.
ICLP-1987-Pereira87 #logic: Grammars and Logics of Partial Information (FCNP), pp. 989–1013.
LICS-1987-ConstableS #type system: Partial Objects In Constructive Type Theory (RLC, SFS), pp. 183–193.
LICS-1987-GaifmanP #concurrent #modelling #partial order: Partial Order Models of Concurrency and the Computation of Functions (HG, VRP), pp. 72–85.
SLP-1987-LeviPBGM87 #logic #semantics: A Complete Semantic Characterization of K-Leaf: A Logic Language with Partial Functions (GL, CP, PGB, EG, CM), pp. 318–327.
ICALP-1986-Metivier #commutative #monad #on the #set: On Recognizable Subsets of Free Partially Commutative Monoids (YM), pp. 254–264.
ICALP-1986-Stirling #composition #concurrent #correctness #logic: A Compositional Reformulation of Owicki-Gries’s Partial Correctness Logic for a Concurrent While Language (CS), pp. 407–415.
GG-1986-Brandenburg #graph grammar #on the #order: On Partially Ordered Graph Grammars (FJB), pp. 99–111.
LICS-1986-Brookes #concurrent #correctness #csp #proving #semantics: A Semantically Based Proof System for Partial Correctness and Deadlock in CSP (SDB), pp. 58–65.
DAC-1985-Joseph #approach: An expert systems approach to completing partially routed printed circuit boards (RLJ), pp. 523–528.
RTA-1985-JonesSS #compilation #empirical #generative #partial evaluation: An Experiment in Partial Evaluation: The Generation of a Compiler Generator (NDJ, PS, HS), pp. 124–140.
ICALP-1984-Reisig #partial order #semantics: Partial Order Semantics versus Interleaving Semantics for CSP-like Languages and its Impact on Fairness (WR), pp. 403–413.
ICALP-1983-SpinradV #2d #morphism #partial order #recognition: Recognition and Isomorphism of Two Dimensional Partial Orders (JPS, JV), pp. 676–686.
VLDB-1982-Larson #linear: A Single-File Version of Linear Hashing with Partial Expansions (PÅL), pp. 300–309.
STOC-1982-GoldwasserM #encryption #game studies #how #probability: Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information (SG, SM), pp. 365–377.
POPL-1982-Komorowski #data type #implementation #partial evaluation #prolog: Partial Evaluation as a Means for Inferencing Data Structures in an Applicative Language: A Theory and Implementation in the Case of Prolog (HJK), pp. 255–267.
ICSE-1982-SakabeIH #data type #specification: Specification of Abstract Data Types with Partially Defined Operations (TS, YI, NH), pp. 218–224.
ILPC-1982-Kahn82 #lisp #prolog #source code: A Partial Evaluator of Lisp Programs Written in Prolog (KMK), pp. 19–25.
SIGMOD-1981-KedemS #concurrent #database #using: Deadlock Removal Using Partial Rollback in Database Systems (DSF, ZMK, AS), pp. 65–73.
PS-1981-ColemanG #correctness #distributed #source code: Partial Correctness of Distributed Programs (DC, RMG), pp. 138–180.
VLDB-1980-Larson #linear: Linear Hashing with Partial Expansions (PÅL), pp. 224–232.
DAC-1979-Lichten #design #parametricity #scalability: A partial solution to fitting large parametric surfaces in computer-aided design systems (LL), pp. 222–228.
ICALP-1979-Schmidt #graph #source code: Investigating Programs in Terms of Partial Graphs (GS), pp. 505–519.
GG-1978-ArbibM #algebra #monad #recursion #semantics: Partially-Additive Monoids, Graph-Growing, and the Algebraic Semantics of Recursive Calls (MAA, EGM), pp. 127–138.
POPL-1978-Haraldsson #compilation #lisp: A Partial Evaluator, Its Use for Compiling Iterative Statements in Lisp (AH), pp. 195–202.
VLDB-J-1975-Burkhard76 #algorithm #retrieval: Hashing and Trie Algorithms for Partial Match Retrieval (WAB), pp. 175–187.
VLDB-1975-Burkhard #design #query: Partial-Match Queries and File Designs (WAB), pp. 523–525.
SOSP-1975-ChandyR #execution #order #probability #scheduling: Scheduling Partially Ordered Tasks with Probabilistic Execution Times (KMC, PFR), pp. 169–177.
STOC-1974-Leeuwen #problem: A Partial Solution to the Reachability-Problem for Vector-Addition Systems (JvL), pp. 303–309.
SIGFIDET-1972-Minsky72a: Rotating Storage Devices As Partially Associative Memories (NHM), pp. 214–241.
STOC-1971-Robertson #complexity #recursion: Complexity Classes of Partial Recursive Functions (Preliminary Version) (ELR), pp. 258–266.
STOC-1969-Ullian #algorithm #ambiguity #context-free grammar #problem: The Inherent Ambiguity Partial Algorithm Problem for Context Free Languages (JSU), pp. 19–20.
SOSP-1969-FuchiTMY: A program simulator by partial interpretation (KF, HT, YM, TY), pp. 97–104.