BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
logic (82)
program (63)
system (61)
model (55)
problem (54)

Stem complet$ (all stems)

802 papers:

CBSECBSE-2015-BenesDHKN #composition #testing
Complete Composition Operators for IOCO — Testing Theory (NB, PD, TAH, JK, DN), pp. 101–110.
PODSPODS-2015-CzerwinskiMPP
The (Almost) Complete Guide to Tree Pattern Containment (WC, WM, PP, MP), pp. 117–130.
SIGMODSIGMOD-2015-RazniewskiKNS #database #identification #query
Identifying the Extent of Completeness of Query Answers over Partially Complete Databases (SR, FK, WN, DS), pp. 561–576.
ESOPESOP-2015-TerauchiU #approach #refinement
Relaxed Stratification: A New Approach to Practical Complete Predicate Refinement (TT, HU), pp. 610–633.
FoSSaCSFoSSaCS-2015-HoO #problem
The Cyclic-Routing UAV Problem is PSPACE-Complete (HMH, JO), pp. 328–342.
FoSSaCSFoSSaCS-2015-Winter #bisimulation #finite #λ-calculus
A Completeness Result for Finite λ-bisimulations (JW), pp. 117–132.
PLDIPLDI-2015-NguyenH #higher-order #source code
Relatively complete counterexamples for higher-order programs (PCN, DVH), pp. 446–456.
PLDIPLDI-2015-ParkSR #javascript #named #semantics
KJS: a complete formal semantics of JavaScript (DP, AS, GR), pp. 346–356.
STOCSTOC-2015-ChawlaMSY #algorithm #clustering #graph
Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs (SC, KM, TS, GY), pp. 219–228.
CIAACIAA-2015-Szykula #automaton
Checking Whether an Automaton Is Monotonic Is NP-complete (MS), pp. 279–291.
DLTDLT-2015-BannaiGIKKPPS
Diverse Palindromic Factorization Is NP-complete (HB, TG, SI, JK, DK, MP, SJP, SS), pp. 85–96.
ICALPICALP-v1-2015-GargMVY #multi #nash #symmetry
ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria (JG, RM, VVV, SY), pp. 554–566.
CSCWCSCW-2015-DaiRPC #crowdsourcing #workflow
And Now for Something Completely Different: Improving Crowdsourcing Workflows with Micro-Diversions (PD, JMR, PP, EHC), pp. 628–638.
CSCWCSCW-2015-KilicHS
Coercing into Completeness in Financial Advisory Service Encounters (MK, PH, GS), pp. 1324–1335.
CAiSECAiSE-2015-Francescomarino #using #workflow
Completing Workflow Traces Using Action Languages (CDF, CG, ST, IVS), pp. 314–330.
ICEISICEIS-v3-2015-SantosTF #process
Investigating Completeness of Coding in Business Process Model and Notation (CHdS, LHT, MF), pp. 328–333.
ECIRECIR-2015-GaillardR #adaptation #collaboration #matrix
Time-Sensitive Collaborative Filtering through Adaptive Matrix Completion (JG, JMR), pp. 327–332.
ICMLICML-2015-HsiehND #learning #matrix
PU Learning for Matrix Completion (CJH, NN, ISD), pp. 2445–2453.
ICMLICML-2015-ParkNZSD #collaboration #ranking #scalability
Preference Completion: Large-scale Collaborative Ranking from Pairwise Comparisons (DP, JN, JZ, SS, ISD), pp. 1907–1916.
ICMLICML-2015-SunQW #optimisation #taxonomy #using
Complete Dictionary Recovery Using Nonconvex Optimization (JS, QQ, JW), pp. 2351–2360.
KDDKDD-2015-RuchanskyCT #matrix #query
Matrix Completion with Queries (NR, MC, ET), pp. 1025–1034.
KDDKDD-2015-WangCGDKCMS #data analysis #health #named
Rubik: Knowledge Guided Tensor Factorization and Completion for Health Data Analytics (YW, RC, JG, JCD, ANK, YC, BAM, JS), pp. 1265–1274.
RecSysRecSys-2015-BarjastehFMER #recommendation
Cold-Start Item and User Recommendation with Decoupled Completion and Transduction (IB, RF, FM, AHE, HR), pp. 91–98.
SIGIRSIGIR-2015-LiDDCZB #behaviour #markov #process #query
Analyzing User’s Sequential Behavior in Query Auto-Completion via Markov Processes (LL, HD, AD, YC, HZ, RABY), pp. 123–132.
SIGIRSIGIR-2015-ZhangGKDDCGH #adaptation #feedback #named #query
adaQAC: Adaptive Query Auto-Completion via Implicit Negative Feedback (AZ, AG, WK, HD, AD, YC, CAG, JH), pp. 143–152.
MODELSMoDELS-J-2011-HermannEOCDXGE15 #correctness #graph grammar
Model synchronization based on triple graph grammars: correctness, completeness and invertibility (FH, HE, FO, KC, ZD, YX, SG, TE), pp. 241–269.
MODELSMoDELS-J-2011-HermannEOCDXGE15 #correctness #graph grammar
Model synchronization based on triple graph grammars: correctness, completeness and invertibility (FH, HE, FO, KC, ZD, YX, SG, TE), pp. 241–269.
AMTAMT-2015-RabbiLYK #approach #diagrams
A Diagrammatic Approach to Model Completion (FR, YL, IY, LK), pp. 56–65.
POPLPOPL-2015-BogdanasR #java #named #semantics
K-Java: A Complete Semantics of Java (DB, GR), pp. 445–456.
POPLPOPL-2015-FioritiH #composition #probability #termination
Probabilistic Termination: Soundness, Completeness, and Compositionality (LMFF, HH), pp. 489–501.
SACSAC-2015-SaezPCCP #manycore #named #symmetry
ACFS: a completely fair scheduler for asymmetric single-isa multicore systems (JCS, AP, FC, DC, MPM), pp. 2027–2032.
ESEC-FSEESEC-FSE-2015-MoranVBP #android #debugging
Auto-completing bug reports for Android applications (KM, MLV, CBC, DP), pp. 673–686.
ICSEICSE-v2-2015-Roos #code completion #performance #precise #statistics
Fast and Precise Statistical Code Completion (PR), pp. 757–759.
PPoPPPPoPP-2015-AcharyaB #locality #modelling #parallel
PLUTO+: near-complete modeling of affine transformations for parallelism and locality (AA, UB), pp. 54–64.
CADECADE-2015-SatoW #dependence #encoding
Encoding Dependency Pair Techniques and Control Strategies for Maximal Completion (HS, SW), pp. 152–162.
CAVCAV-2015-AlurRSTU #automation #distributed #protocol #symmetry
Automatic Completion of Distributed Protocols with Symmetry (RA, MR, CS, ST, AU), pp. 395–412.
ICSTICST-2015-BardinDDKPTM #detection #requirements
Sound and Quasi-Complete Detection of Infeasible Test Requirements (SB, MD, RD, NK, MP, YLT, JYM), pp. 1–10.
LICSLICS-2015-BlondinFGHM #2d #reachability
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete (MB, AF, SG, CH, PM), pp. 32–43.
LICSLICS-2015-DasR #axiom #infinity
A Complete Axiomatization of MSO on Infinite Trees (AD, CR), pp. 390–401.
LICSLICS-2015-HeH #branch #similarity
Branching Bisimilarity on Normed BPA Is EXPTIME-Complete (CH, MH), pp. 180–191.
RTARTA-2015-DasS #linear #logic #term rewriting
No complete linear term rewriting system for propositional logic (AD, LS), pp. 127–142.
TLCATLCA-2015-Bagnol #diagrams #equivalence #proving
MALL Proof Equivalence is Logspace-Complete, via Binary Decision Diagrams (MB), pp. 60–75.
ASEASE-2014-BajajPM #code completion #javascript #named
Dompletion: DOM-aware JavaScript code completion (KB, KP, AM), pp. 43–54.
ASEASE-2014-KuschkeM #modelling #process #uml
Pattern-based auto-completion of UML modeling activities (TK, PM), pp. 551–556.
SIGMODSIGMOD-2014-IleanaCDK #constraints #query
Complete yet practical search for minimal query reformulations under constraints (II, BC, AD, YK), pp. 1015–1026.
VLDBVLDB-2014-YunYHVD #algorithm #distributed #matrix #multi #named #probability
NOMAD: Nonlocking, stOchastic Multi-machine algorithm for Asynchronous and Decentralized matrix completion (HY, HFY, CJH, SVNV, ISD), pp. 975–986.
FoSSaCSFoSSaCS-2014-MossakowskiT #calculus #specification
A Relatively Complete Calculus for Structured Heterogeneous Specifications (TM, AT), pp. 441–456.
TACASTACAS-2014-PiskacWZ #named #specification #verification
GRASShopper — Complete Heap Verification with Mixed Specifications (RP, TW, DZ), pp. 124–139.
WRLAWRLA-2014-Genet #automaton #functional #source code #static analysis #towards #using
Towards Static Analysis of Functional Programs Using Tree Automata Completion (TG), pp. 147–161.
ICSMEICSME-2014-AsaduzzamanRSH #code completion #named #performance
CSCC: Simple, Efficient, Context Sensitive Code Completion (MA, CKR, KAS, DH), pp. 71–80.
ICSMEICSME-2014-AsaduzzamanRSH14a #api #code completion #usability
Context-Sensitive Code Completion Tool for Better API Usability (MA, CKR, KAS, DH), pp. 621–624.
PEPMPEPM-J-2013-Simon14 #type inference #using
Deriving a complete type inference for Hindley-Milner and vector sizes using expansion (AS), pp. 254–271.
PLDIPLDI-2014-RaychevVY #code completion #modelling #statistics
Code completion with statistical language models (VR, MTV, EY), p. 44.
ICALPICALP-v1-2014-ChildsGW
The Bose-Hubbard Model is QMA-complete (AMC, DG, ZW), pp. 308–319.
ICALPICALP-v2-2014-DerevenetcM #robust
Robustness against Power is PSpace-complete (ED, RM), pp. 158–170.
LATALATA-2014-ArroyoCMP #network
Networks of Polarized Evolutionary Processors Are Computationally Complete (FA, SGC, VM, SP), pp. 101–112.
SEFMSEFM-2014-BonifacioM #modelling #testing
Test Suite Completeness and Partial Models (ALB, AVM), pp. 96–110.
SEFMSEFM-2014-TatsutaC #induction #logic #verification
Completeness of Separation Logic with Inductive Definitions for Program Verification (MT, WNC), pp. 20–34.
CHICHI-2014-BiOZ #multi #optimisation
Both complete and correct?: multi-objective optimization of touchscreen keyboard (XB, TO, SZ), pp. 2297–2306.
CIKMCIKM-2014-CaiLR #personalisation #query
Time-sensitive Personalized Query Auto-Completion (FC, SL, MdR), pp. 1599–1608.
CIKMCIKM-2014-HofmannMRS #interactive #query
An Eye-tracking Study of User Interactions with Query Auto Completion (KH, BM, FR, MS), pp. 549–558.
ICMLICML-c1-2014-ChenBSW #matrix
Coherent Matrix Completion (YC, SB, SS, RW), pp. 674–682.
ICMLICML-c2-2014-Bhojanapalli0 #matrix
Universal Matrix Completion (SB, PJ), pp. 1881–1889.
ICMLICML-c2-2014-GunasekarRG #constraints #exponential #matrix #product line
Exponential Family Matrix Completion under Structural Constraints (SG, PR, JG), pp. 1917–1925.
ICMLICML-c2-2014-WangLLFDY #matrix
Rank-One Matrix Pursuit for Matrix Completion (ZW, MJL, ZL, WF, HD, JY), pp. 91–99.
ICPRICPR-2014-GeXYS #image #synthesis #using
Image Completion Using Global Patch Matching and Optimal Seam Synthesis (SG, KX, RY, ZS), pp. 871–876.
RecSysRecSys-2014-PetroniQ #clustering #distributed #graph #matrix #named #probability
GASGD: stochastic gradient descent for distributed asynchronous matrix completion via graph partitioning (FP, LQ), pp. 241–248.
SIGIRSIGIR-2014-JiangKCC #behaviour #learning #query
Learning user reformulation behavior for query auto-completion (JYJ, YYK, PYC, PJC), pp. 445–454.
SIGIRSIGIR-2014-LiDWDCZ #2d #query
A two-dimensional click model for query auto-completion (YL, AD, HW, HD, YC, CZ), pp. 455–464.
SIGIRSIGIR-2014-MitraSRH #interactive #on the #query
On user interactions with query auto-completion (BM, MS, FR, KH), pp. 1055–1058.
ECOOPECOOP-2014-AnconaC #induction #object-oriented #type system
Sound and Complete Subtyping between Coinductive Types for Object-Oriented Languages (DA, AC), pp. 282–307.
LOPSTRLOPSTR-2014-Drabent #logic programming #on the #source code
On Completeness of Logic Programs (WD), pp. 261–278.
POPLPOPL-2014-BrotherstonV #parametricity
Parametric completeness for separation theories (JB, JV), pp. 453–464.
POPLPOPL-2014-ChongDK #abstraction #parallel #reasoning
A sound and complete abstraction for reasoning about parallel prefix sums (NC, AFD, JK), pp. 397–410.
REFSQREFSQ-2014-FerraridSG #natural language #requirements
Measuring and Improving the Completeness of Natural Language Requirements (AF, FD, GOS, SG), pp. 23–38.
SACSAC-2014-BonifacioM #on the #testing
On the completeness of test suites (ALB, AVM), pp. 1287–1292.
SLESLE-2014-Ridge #combinator #context-free grammar #parsing #performance #using
Simple, Efficient, Sound and Complete Combinator Parsing for All Context-Free Grammars, Using an Oracle (TR), pp. 261–281.
IJCARIJCAR-2014-Blanchette0T #induction #logic
Unified Classical Logic Completeness — A Coinductive Pearl (JCB, AP, DT), pp. 46–60.
IJCARIJCAR-2014-SteigmillerGL #algorithm #logic
Coupling Tableau Algorithms for Expressive Description Logics with Completion-Based Saturation Procedures (AS, BG, TL), pp. 449–463.
LICSLICS-CSL-2014-DemriD #logic
Expressive completeness of separation logic with two variables and no separating conjunction (SD, MD), p. 10.
LICSLICS-CSL-2014-HeijltjesH #equivalence #proving
No proof nets for MLL with units: proof equivalence in MLL is PSPACE-complete (WH, RH), p. 10.
RTARTA-TLCA-2014-Schmitz #logic
Implicational Relevance Logic is 2-ExpTime-Complete (SS), pp. 395–409.
ICSTSAT-2014-CreusFG #automation #evaluation #problem #reduction
Automatic Evaluation of Reductions between NP-Complete Problems (CC, PF, GG), pp. 415–421.
VMCAIVMCAI-2014-BozgaIK #integer #problem #safety #source code
Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops (MB, RI, FK), pp. 242–261.
CASECASE-2013-ChenZAX #analysis #finite
Analysis of production completion time in Bernoulli serial lines with finite buffers (GC, LZ, JA, GX), pp. 770–775.
DACDAC-2013-LuoCH #design #nondeterminism
Design of cyberphysical digital microfluidic biochips under completion-time uncertainties in fluidic operations (YL, KC, TYH), p. 7.
SIGMODSIGMOD-2013-MoerkotteFE #on the
On the correct and complete enumeration of the core search space (GM, PF, ME), pp. 493–504.
VLDBVLDB-2013-SavkovicPTN #approximate #query
Complete Approximations of Incomplete Queries (OS, PM, AT, WN), pp. 1378–1381.
ITiCSEITiCSE-2013-CrescenziEK #student #theory and practice
From theory to practice: NP-completeness for every CS student (PC, EE, VK), pp. 16–21.
FoSSaCSFoSSaCS-2013-DahlqvistP #algebra #logic
Some Sahlqvist Completeness Results for Coalgebraic Logics (FD, DP), pp. 193–208.
CSMRCSMR-2013-AbebeT #automation #identifier
Automated Identifier Completion and Replacement (SLA, PT), pp. 263–272.
PEPMPEPM-2013-Simon #type inference #using
Deriving a complete type inference for hindley-milner and vector sizes using expansion (AS), pp. 13–22.
PLDIPLDI-2013-GveroKKP #using
Complete completion using types and weights (TG, VK, IK, RP), pp. 27–38.
STOCSTOC-2013-BohmGJ #automaton #equivalence
Equivalence of deterministic one-counter automata is NL-complete (SB, SG, PJ), pp. 131–140.
STOCSTOC-2013-CaiGW
A complete dichotomy rises from the capture of vanishing signatures: extended abstract (JYC, HG, TW), pp. 635–644.
STOCSTOC-2013-JainNS #matrix #rank #using
Low-rank matrix completion using alternating minimization (PJ, PN, SS), pp. 665–674.
DLTDLT-J-2012-GeffertP13
Unary Coded NP-Complete Languages in Aspace(log log n) (VG, DP), p. 1167–?.
CIAACIAA-2013-GenetGLM #algorithm #automaton
A Completion Algorithm for Lattice Tree Automata (TG, TLG, AL, VM), pp. 134–145.
DLTDLT-2013-LuPC
Deciding Determinism of Unary Languages Is coNP-Complete (PL, FP, HC), pp. 350–361.
ICALPICALP-v1-2013-GlasserNRSW #polynomial #reduction #set
Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions (CG, DTN, CR, ALS, MW), pp. 473–484.
ICALPICALP-v1-2013-Grier #finite #game studies
Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete (DG), pp. 497–503.
ICALPICALP-v2-2013-FearnleyJ #automaton #reachability
Reachability in Two-Clock Timed Automata Is PSPACE-Complete (JF, MJ), pp. 212–223.
IFMIFM-2013-LiuLACSWD #semantics #state machine #uml
A Formal Semantics for Complete UML State Machines with Communications (SL, YL, ÉA, CC, JS, BW, JSD), pp. 331–346.
ICFPICFP-2013-DunfieldK #bidirectional #morphism #polymorphism #rank
Complete and easy bidirectional typechecking for higher-rank polymorphism (JD, NRK), pp. 429–442.
GRAPHITEGRAPHITE-2013-Majster-CederbaumS #architecture #constraints #operating system #reachability
Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete (MEMC, NS), pp. 1–11.
CAiSECAiSE-2013-Espada0A #complexity #framework #modelling
A Framework to Evaluate Complexity and Completeness of KAOS Goal Models (PE, MG, JA), pp. 562–577.
CAiSECAiSE-2013-FahlandG #design #enterprise #integration #middleware #petri net #using
Analyzing and Completing Middleware Designs for Enterprise Integration Using Coloured Petri Nets (DF, CG), pp. 400–416.
ICMLICML-c3-2013-ChenC #matrix
Spectral Compressed Sensing via Structured Matrix Completion (YC, YC), pp. 414–422.
ICMLICML-c3-2013-YiZJQJ #clustering #matrix #similarity
Semi-supervised Clustering by Input Pattern Assisted Pairwise Similarity Matrix Completion (JY, LZ, RJ, QQ, AKJ), pp. 1400–1408.
SIGIRSIGIR-2013-Shokouhi #learning #personalisation #query
Learning to personalize query auto-completion (MS), pp. 103–112.
AMTAMT-2013-Gottmann0NBEEE #concurrent #correctness #graph grammar
Correctness and Completeness of Generalised Concurrent Model Synchronisation Based on Triple Graph Grammars (SG, FH, NN, BB, CE, HE, TE), pp. 62–71.
ICMTICMT-2013-HildebrandtLG #automation #consistency #graph grammar #implementation #specification #testing
Complete Specification Coverage in Automatically Generated Conformance Test Cases for TGG Implementations (SH, LL, HG), pp. 174–188.
MODELSMoDELS-2013-KuschkeMR #modelling #process #recommendation
Recommending Auto-completions for Software Modeling Activities (TK, PM, PR), pp. 170–186.
MODELSMoDELS-2013-KuschkeMR #modelling #process #recommendation
Recommending Auto-completions for Software Modeling Activities (TK, PM, PR), pp. 170–186.
OOPSLAOOPSLA-2013-BalatsourasS #graph
Class hierarchy complementation: soundly completing a partial type graph (GB, YS), pp. 515–532.
POPLPOPL-2013-TotlaW
Complete instantiation-based interpolation (NT, TW), pp. 537–548.
POPLPOPL-2013-UnnoTK #automation #functional #higher-order #source code #verification
Automating relatively complete verification of higher-order functional programs (HU, TT, NK), pp. 75–86.
SACSAC-2013-RabanalR #metaheuristic #polynomial #problem #reduction #using
Using polynomial reductions to test the suitability of metaheuristics for solving NP-complete problems (PR, IR), pp. 194–199.
ICSEICSE-2013-LeeHKM #code completion #navigation
Temporal code completion and navigation (YYL, SH, SK, DM), pp. 1181–1184.
ISMMISMM-2013-RicciGM #garbage collection #precise
Elephant tracks: portable production of complete and precise gc traces (NPR, SZG, JEBM), pp. 109–118.
CADECADE-2013-KersaniP #decidability #first-order
Completeness and Decidability Results for First-Order Clauses with Indices (AK, NP), pp. 58–75.
CSLCSL-2013-Hunter #logic #metric #question
When is Metric Temporal Logic Expressively Complete? (PH), pp. 380–394.
ICLPICLP-J-2013-LifschitzY #modelling
Lloyd-Topor completion and general stable models (VL, FY), pp. 503–515.
LICSLICS-2013-GoncharovS #hoare #logic
A Relatively Complete Generic Hoare Logic for Order-Enriched Effects (SG, LS), pp. 273–282.
LICSLICS-2013-HunterOW #logic #metric
Expressive Completeness for Metric Temporal Logic (PH, JO, JW), pp. 349–357.
LICSLICS-2013-Pattinson #logic
The Logic of Exact Covers: Completeness and Uniform Interpolation (DP), pp. 418–427.
RTARTA-2013-GuiraudMM #monad #topic
A Homotopical Completion Procedure with Applications to Coherence of Monoids (YG, PM, SM), pp. 223–238.
RTARTA-2013-Okada #multi #term rewriting
Husserl and Hilbert on Completeness and Husserl’s Term Rewrite-based Theory of Multiplicity (Invited Talk) (MO), pp. 4–19.
RTARTA-2013-SternagelT #formal method #order
Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion (CS, RT), pp. 287–302.
RTARTA-2013-WinklerM #normalisation #revisited
Normalized Completion Revisited (SW, AM), pp. 319–334.
TLCATLCA-2013-BerardiT #backtracking #game studies #logic #semantics #subclass
Games with Sequential Backtracking and Complete Game Semantics for Subclassical Logics (SB, MT), pp. 61–76.
TLCATLCA-2013-Mazza #metric
Non-linearity as the Metric Completion of Linearity (DM), pp. 3–14.
TLCATLCA-2013-SeveriV #modelling #source code
Completeness of Conversion between Reactive Programs for Ultrametric Models (PS, FJdV), pp. 221–235.
VMCAIVMCAI-2013-Pearce #type system
Sound and Complete Flow Typing with Unions, Intersections and Negations (DJP), pp. 335–354.
VMCAIVMCAI-2013-Ranzato #abstraction
Complete Abstractions Everywhere (FR), pp. 15–26.
DACDAC-2012-CropPC #detection #logic #throughput #using
Regaining throughput using completion detection for error-resilient, near-threshold logic (JC, RP, PC), pp. 974–979.
SIGMODSIGMOD-2012-AbiteboulAMS #learning #xml
Auto-completion learning for XML (SA, YA, TM, PS), pp. 669–672.
ESOPESOP-2012-DimoulasTF #behaviour #contract #monitoring
Complete Monitors for Behavioral Contracts (CD, STH, MF), pp. 214–233.
FoSSaCSFoSSaCS-2012-Kartzow #automaton #exponential #first-order #model checking
First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time (AK), pp. 376–390.
ICSMEICSM-2012-OmoriKM #case study #code completion
A study on repetitiveness of code completion operations (TO, HK, KM), pp. 584–587.
MSRMSR-2012-NguyenK #api #mutation testing #testing
Discovering complete API rules with mutation testing (ACN, SCK), pp. 151–160.
PEPMPEPM-2012-GotoS #approach #functional
An approach to completing variable names for implicitly typed functional languages (TG, IS), pp. 131–140.
PLDIPLDI-2012-PerelmanGBG
Type-directed completion of partial expressions (DP, SG, TB, DG), pp. 275–286.
STOCSTOC-2012-AlonMS #graph #scalability
Nearly complete graphs decomposable into large induced matchings and their applications (NA, AM, BS), pp. 1079–1090.
STOCSTOC-2012-ChakrabartiFW #multi #network #problem
When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks (AC, LF, CW), pp. 19–26.
DLTDLT-2012-FazekasMS #bound
Hairpin Completion with Bounded Stem-Loop (SZF, RM, KST), pp. 428–439.
DLTDLT-2012-GeffertP
Unary Coded NP-Complete Languages in ASPACE (log log n) (VG, DP), pp. 166–177.
DLTDLT-2012-KrebsL
Dense Completeness (AK, KJL), pp. 178–189.
ICALPICALP-v2-2012-Barenboim #locality #on the #problem
On the Locality of Some NP-Complete Problems (LB), pp. 403–415.
ICALPICALP-v2-2012-FernandezR #term rewriting
Nominal Completion for Rewrite Systems with Binders (MF, AR), pp. 201–213.
LATALATA-2012-CiobanuP #petri net
Catalytic Petri Nets Are Turing Complete (GC, GMP), pp. 192–203.
SEFMSEFM-2012-PaulSS #assembly #automation #verification
Completing the Automated Verification of a Small Hypervisor — Assembler Code Verification (WJP, SS, AS), pp. 188–202.
ICGTICGT-2012-DrechslerDGKLSSW #development
Completeness-Driven Development (RD, MD, DG, UK, HML, JS, MS, RW), pp. 38–50.
CSCWCSCW-2012-SohnLZDT #coordination #how
An examination of how households share and coordinate the completion of errands (TS, LL, SZ, DD, KNT), pp. 729–738.
CIKMCIKM-2012-GaoCK #graph #keyword #scalability
Information-complete and redundancy-free keyword search over large data graphs (BJG, ZC, QK), pp. 2639–2642.
CIKMCIKM-2012-NuttR #database #query #sql
Completeness of queries over SQL databases (WN, SR), pp. 902–911.
CIKMCIKM-2012-SavkovicPPN #named
MAGIK: managing completeness of data (OS, PM, SP, WN), pp. 2725–2727.
ICMLICML-2012-KiralyT #algebra #approach #combinator #matrix #rank
A Combinatorial Algebraic Approach for the Identifiability of Low-Rank Matrix Completion (FJK, RT), p. 100.
ICMLICML-2012-VogtR #analysis
A Complete Analysis of the l_1, p Group-Lasso (JEV, VR), p. 143.
ICPRICPR-2012-SunXAL #approach #online #performance #video
A tracking based fast online complete video synopsis approach (LS, JX, HA, SL), pp. 1956–1959.
ICPRICPR-2012-ZarifFR #image #multi #performance #similarity #using
Fast and efficient multichannel image completion using local similarity (SZ, IF, DR), pp. 3116–3119.
KDDKDD-2012-HuZLYH #matrix
Accelerated singular value thresholding for matrix completion (YH, DZ, JL, JY, XH), pp. 298–306.
KRKR-2012-BordeauxJSM #on the #quantifier
On Unit-Refutation Complete Formulae with Existentially Quantified Variables (LB, MJ, JPMS, PM).
KRKR-2012-GiordanoMD #bound #model checking
Achieving Completeness in Bounded Model Checking of Action Theories in ASP (LG, AM, DTD).
SIGIRSIGIR-2012-ShokouhiR #query
Time-sensitive query auto-completion (MS, KR), pp. 601–610.
ICSEICSE-2012-AlrajehKLRU #generative #requirements
Generating obstacle conditions for requirements completeness (DA, JK, AvL, AR, SU), pp. 705–715.
ICSEICSE-2012-FosterGL #ide #named #realtime #refactoring
WitchDoctor: IDE support for real-time auto-completion of refactorings (SRF, WGG, SL), pp. 222–232.
ICSEICSE-2012-NguyenNNN12a #code completion #graph #named
GraPacc: A graph-based pattern-oriented, context-sensitive code completion tool (ATN, HAN, TTN, TNN), pp. 1407–1410.
ICSEICSE-2012-NguyenNNTNAN #code completion #graph #source code
Graph-based pattern-oriented, context-sensitive source code completion (ATN, TTN, HAN, AT, HVN, JMAK, TNN), pp. 69–79.
ICSEICSE-2012-OmarYLM #code completion
Active code completion (CO, YY, TDL, BAM), pp. 859–869.
CAVCAV-2012-ChuJ #reduction #safety #symmetry #verification
A Complete Method for Symmetry Reduction in Safety Verification (DHC, JJ), pp. 616–633.
CSLCSL-2012-Berardid #learning
Knowledge Spaces and the Completeness of Learning Strategies (SB, Ud), pp. 77–91.
IJCARIJCAR-2012-GaoAC #satisfiability
δ-Complete Decision Procedures for Satisfiability over the Reals (SG, JA, EMC), pp. 286–300.
IJCARIJCAR-2012-SternagelZ #named #visualisation
KBCV — Knuth-Bendix Completion Visualizer (TS, HZ), pp. 530–536.
LICSLICS-2012-BundalaOW #bound #model checking #on the
On the Magnitude of Completeness Thresholds in Bounded Model Checking (DB, JO, JW), pp. 155–164.
LICSLICS-2012-CreusGGR #problem
The HOM Problem is EXPTIME-Complete (CC, AG, GG, LR), pp. 255–264.
LICSLICS-2012-Platzer12a #hybrid #proving
The Complete Proof Theory of Hybrid Systems (AP), pp. 541–550.
LICSLICS-2012-SchalkS #linear #logic #modelling #multi
Constructing Fully Complete Models for Multiplicative Linear Logic (AS, HPS), pp. 571–580.
RTARTA-2012-Bahr #graph grammar
Infinitary Term Graph Rewriting is Simple, Sound and Complete (PB), pp. 69–84.
RTARTA-2012-SattlerB #equation #polymorphism
Turing-Completeness of Polymorphic Stream Equation Systems (CS, FB), pp. 256–271.
PODSPODS-2011-ArenasPR
Data exchange beyond complete data (MA, JP, JLR), pp. 83–94.
VLDBVLDB-2011-RazniewskiN #database #query #semistructured data
Completeness of Queries over Incomplete Databases (SR, WN), pp. 749–760.
TACASTACAS-2011-BurnimSS #consistency #memory management #modelling #monitoring
Sound and Complete Monitoring of Sequential Consistency for Relaxed Memory Models (JB, KS, CS), pp. 11–25.
TACASTACAS-2011-ConchonCI #modulo theories
Canonized Rewriting and Ground AC Completion Modulo Shostak Theories (SC, EC, MI), pp. 45–59.
ICSMEICSM-2011-HouP #api #code completion #evaluation #sorting
An evaluation of the strategies of sorting, filtering, and grouping API methods for Code Completion (DH, DMP), pp. 233–242.
CIAACIAA-J-2010-DiekertK11 #regular expression
It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular (VD, SK), pp. 1813–1828.
DLTDLT-2011-GusevP #on the #set
On Non-complete Sets and Restivo’s Conjecture (VVG, EVP), pp. 239–250.
ICALPICALP-v1-2011-ElsasserT #complexity
Settling the Complexity of Local Max-Cut (Almost) Completely (RE, TT), pp. 171–182.
CIKMCIKM-2011-LiSZ #feedback
Learning-based relevance feedback for web-based relation completion (ZL, LS, XZ), pp. 1535–1540.
ICMLICML-2011-ChenXCS #matrix #robust
Robust Matrix Completion and Corrupted Columns (YC, HX, CC, SS), pp. 873–880.
ICMTICMT-2011-EgyedDGLMNR #co-evolution #consistency #model transformation
Fine-Tuning Model Transformation: Change Propagation in Context of Consistency, Completeness, and Human Guidance (AE, AD, AG, RELH, PM, AN, AR), pp. 1–14.
GPCEGPCE-2011-ArnoldusBS #less is more #metalanguage
Less is more: unparser-completeness of metalanguages for template engines (BJA, MvdB, AS), pp. 137–146.
SACSAC-2011-Zhang #analysis #constraints #geometry #graph #problem
Well-constrained completion for under-constrained geometric constraint problem based on connectivity analysis of graph (GFZ), pp. 1094–1099.
CADECADE-2011-Horbach #horn clause #set
Predicate Completion for non-Horn Clause Sets (MH), pp. 315–330.
CADECADE-2011-WinklerM #termination #tool support
AC Completion with Termination Tools (SW, AM), pp. 492–498.
CAVCAV-2011-KroeningOSWW #bound #linear #model checking
Linear Completeness Thresholds for Bounded Model Checking (DK, JO, OS, TW, JW), pp. 557–572.
CAVCAV-2011-MullerP #hardware #interface #verification
Complete Formal Hardware Verification of Interfaces for a FlexRay-Like Bus (CAM, WJP), pp. 633–648.
CSLCSL-2011-CardelliLM #axiom #logic #markov #metric
Continuous Markovian Logic — From Complete Axiomatization to the Metric Space of Formulas (LC, KGL, RM), pp. 144–158.
CSLCSL-2011-ReusS #functional #logic #source code
Relative Completeness for Logics of Functional Programs (BR, TS), pp. 470–480.
LICSLICS-2011-LagoG #dependent type #linear
Linear Dependent Types and Relative Completeness (UDL, MG), pp. 133–142.
RTARTA-2011-AotoT #confluence #proving #term rewriting
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems (TA, YT), pp. 91–106.
RTARTA-2011-KleinH
Maximal Completion (DK, NH), pp. 71–80.
VMCAIVMCAI-2011-JacobsK #axiom #reasoning #specification #towards
Towards Complete Reasoning about Axiomatic Specifications (SJ, VK), pp. 278–293.
QoSAQoSA-2010-HappeWSK #modelling #parametricity #performance #statistics
Statistical Inference of Software Performance Models for Parametric Performance Completions (JH, DW, KS, LK), pp. 20–35.
DACDAC-2010-PashaDS #architecture #generative #power management
A complete design-flow for the generation of ultra low-power WSN node architectures based on micro-tasking (MAP, SD, OS), pp. 693–698.
DATEDATE-2010-BonfiettiBLM #approach #manycore #performance #scheduling
An efficient and complete approach for throughput-maximal SDF allocation and scheduling on multi-core platforms (AB, LB, ML, MM), pp. 897–902.
ITiCSEITiCSE-2010-Crescenzi #using
Using AVs to explain NP-completeness (PC), p. 299.
FASEFASE-2010-DarvasM #consistency #proving #using
Proving Consistency and Completeness of Model Classes Using Theory Interpretation (ÁD, PM), pp. 218–232.
FoSSaCSFoSSaCS-2010-CateF #calculus #finite #proving #μ-calculus
An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees (BtC, GF), pp. 161–175.
FoSSaCSFoSSaCS-2010-Staton #algebra
Completeness for Algebraic Theories of Local State (SS), pp. 48–63.
ICSMEICSM-2010-GergelyBGG #case study #experience #industrial #metric
Effect of test completeness and redundancy measurement on post release failures — An industrial experience report (TG, ÁB, TG, MIG), pp. 1–10.
PLDIPLDI-2010-BurckhardtDMT #automation #named
Line-up: a complete and automatic linearizability checker (SB, CD, MM, RT), pp. 330–340.
PLDIPLDI-2010-KuncakMPS #functional #synthesis
Complete functional synthesis (VK, MM, RP, PS), pp. 316–329.
FLOPSFLOPS-2010-AlvezL #axiom #similarity #strict
A Complete Axiomatization of Strict Equality (, FJLF), pp. 118–133.
AFLAFL-J-2008-ManeaMY10
Some Remarks on the Hairpin Completion (FM, VM, TY), pp. 859–872.
CIAACIAA-2010-DiekertK #complexity #regular expression
Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract) (VD, SK), pp. 105–114.
DLTDLT-2010-Kopecki #on the
On the Iterated Hairpin Completion (SK), pp. 438–439.
ICALPICALP-v1-2010-Ambos-SpiesB #exponential
Weak Completeness Notions for Exponential Time (KAS, TB), pp. 503–514.
ICALPICALP-v1-2010-LibertY #encryption #performance
Efficient Completely Non-malleable Public Key Encryption (BL, MY), pp. 127–139.
CIKMCIKM-2010-GaoYW #mining #multi #named #query
SEQUEL: query completion via pattern mining on multi-column structural data (CG, QY, JW), pp. 1955–1956.
CIKMCIKM-2010-JainM #query #web
Organizing query completions for web search (AJ, GM), pp. 1169–1178.
ICPRICPR-2010-BecattiniMC #injection
Anisotropic Contour Completion for Cell Microinjection Targeting (GB, LSM, DGC), pp. 2262–2265.
KRKR-2010-LarbiKM
A Characterization of Optimality Criteria for Decision Making under Complete Ignorance (RBL, SK, PM).
RERE-2010-MenzelMGD #comparison #functional #requirements #specification
An Experimental Comparison Regarding the Completeness of Functional Requirements Specifications (IM, MM, AG, JD), pp. 15–24.
SACSAC-2010-BelohlavekV10a #database #logic #query #similarity
Query systems in similarity-based databases: logical foundations, expressive power, and completeness (RB, VV), pp. 1648–1655.
CAVCAV-2010-KuncakMPS #functional #named #synthesis
Comfusy: A Tool for Complete Functional Synthesis (VK, MM, RP, PS), pp. 430–433.
ICLPICLP-J-2010-BetzRF #constraints #execution
A complete and terminating execution model for Constraint Handling Rules (HB, FR, TWF), pp. 597–610.
IJCARIJCAR-2010-WinklerM #order #termination #tool support
Termination Tools in Ordered Completion (SW, AM), pp. 518–532.
LICSLICS-2010-BasaldellaT
Infinitary Completeness in Ludics (MB, KT), pp. 294–303.
LICSLICS-2010-Milius #calculus #finite
A Sound and Complete Calculus for Finite Stream Circuits (SM), pp. 421–430.
ASEASE-2009-HanWM #code completion
Code Completion from Abbreviated Input (SH, DRW, RCM), pp. 332–343.
CASECASE-2009-TrckaAS #workflow
Workflow completion patterns (NT, WMPvdA, NS), pp. 7–12.
DATEDATE-2009-VillenaCIS #modelling #on the #parametricity #performance #reduction
On the efficient reduction of complete EM based parametric models (JFV, GC, DI, LMS), pp. 1172–1177.
ICDARICDAR-2009-PanBS #recognition #using
Isolated Handwritten Farsi Numerals Recognition Using Sparse and Over-Complete Representations (WP, TDB, CYS), pp. 586–590.
PODSPODS-2009-FanG
Relative information completeness (WF, FG), pp. 97–106.
CSEETCSEET-2009-ThompsonE09a #how #question #student
How Can We Scale-Up Student Admissions and Graduate Completions? (JBT, HME), pp. 298–299.
FoSSaCSFoSSaCS-2009-Leivant #logic #on the
On the Completeness of Dynamic Logic (DL), pp. 78–91.
ICSMEICSM-2009-PletcherH #api #code completion #named #usability
BCC: Enhancing code completion for better API usability (DMP, DH), pp. 393–394.
PEPMPEPM-2009-MoretBV #execution #named #profiling
CCCP: complete calling context profiling in virtual execution environments (PM, WB, AV), pp. 151–160.
PLDIPLDI-2009-NagarakatteZMZ #bound #c #memory management #named #safety
SoftBound: highly compatible and complete spatial memory safety for c (SN, JZ, MMKM, SZ), pp. 245–258.
ICALPICALP-v2-2009-FinkelG #analysis
Forward Analysis for WSTS, Part II: Complete WSTS (AF, JGL), pp. 188–199.
ICALPICALP-v2-2009-JouannaudO #confluence #diagrams
Diagrammatic Confluence and Completion (JPJ, VvO), pp. 212–222.
LATALATA-2009-ItoLM #bound
Bounded Hairpin Completion (MI, PL, VM), pp. 434–445.
SEFMSEFM-2009-Chalin #verification
Adjusted Verification Rules for Loops Are More Complete and Give Better Diagnostics for Less (PC), pp. 317–324.
SEFMSEFM-2009-TatsutaCA #logic #pointer #verification
Completeness of Pointer Program Verification by Separation Logic (MT, WNC, MFAA), pp. 179–188.
ICFPICFP-2009-SchrijversJSV #data type #decidability #type inference
Complete and decidable type inference for GADTs (TS, SLPJ, MS, DV), pp. 341–352.
GT-VMTGT-VMT-2009-EhrigHS #correctness #graph grammar #model transformation
Completeness and Correctness of Model Transformations based on Triple Graph Grammars with Negative Application Conditions (HE, FH, CS), pp. 67–84.
HCIHCI-AUII-2009-SuzukiNABYF #comparison #empirical #interactive #mobile #modelling #sequence
Empirical Comparison of Task Completion Time between Mobile Phone Models with Matched Interaction Sequences (SS, YN, TA, VB, NY, SF), pp. 114–122.
HCIHCI-NIMT-2009-AmftASST #gesture
Gesture-Controlled User Input to Complete Questionnaires on Wrist-Worn Watches (OA, RA, AS, DPS, GT), pp. 131–140.
HCIHIMI-II-2009-JungLSY #framework #reliability #semantics #web #web service
Auto-complete for Improving Reliability on Semantic Web Service Framework (HJ, ML, WKS, BJY), pp. 36–44.
CIKMCIKM-2009-WestPP #reduction #wiki
Completing wikipedia’s hyperlink structure through dimensionality reduction (RW, DP, JP), pp. 1097–1106.
SIGIRSIGIR-2009-MeijMZ #evaluation #query
An evaluation of entity and frequency based query completion methods (EM, PM, HZ), pp. 678–679.
SIGIRSIGIR-2009-WangLF #automation #fuzzy #predict #using
Automatic URL completion and prediction using fuzzy type-ahead search (JW, GL, JF), pp. 634–635.
SIGIRSIGIR-2009-XuM #using #web
Evaluating web search using task completion time (YX, DM), pp. 676–677.
MODELSMoDELS-2009-EhrigEHP #correctness #graph grammar #model transformation #on the fly
On-the-Fly Construction, Correctness and Completeness of Model Transformations Based on Triple Graph Grammars (HE, CE, FH, UP), pp. 241–255.
MODELSMoDELS-2009-EhrigEHP #correctness #graph grammar #model transformation #on the fly
On-the-Fly Construction, Correctness and Completeness of Model Transformations Based on Triple Graph Grammars (HE, CE, FH, UP), pp. 241–255.
TOOLSTOOLS-EUROPE-2009-NordioCMM #eiffel #logic
A Sound and Complete Program Logic for Eiffel (MN, CC, PM, BM), pp. 195–214.
PADLPADL-2009-GuzmanCH #execution #program transformation #towards
Towards a Complete Scheme for Tabled Execution Based on Program Transformation (PCdG, MC, MVH), pp. 224–238.
RERE-2009-EspanaCGP #empirical #functional #requirements #specification
Evaluating the Completeness and Granularity of Functional Requirements Specifications: A Controlled Experiment (SE, NCF, AG, OP), pp. 161–170.
ESEC-FSEESEC-FSE-2009-BruchMM #code completion #learning
Learning from examples to improve code completion systems (MB, MM, MM), pp. 213–222.
ICSEICSE-2009-PhamNNAN #clone detection #detection #graph #modelling
Complete and accurate clone detection in graph-based models (NHP, HAN, TTN, JMAK, TNN), pp. 276–286.
ASPLOSASPLOS-2009-TiwariWMMCS #data flow
Complete information flow tracking from the gates up (MT, HMGW, BM, SM, FTC, TS), pp. 109–120.
HPCAHPCA-2009-ChenLHCSWP #consistency #memory management #performance #verification
Fast complete memory consistency verification (YC, YL, WH, TC, HS, PW, HP), pp. 381–392.
CAVCAV-2009-DilligDA #integer #linear #proving
Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers (ID, TD, AA), pp. 233–247.
CAVCAV-2009-GeM #modulo theories #quantifier #satisfiability
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories (YG, LMdM), pp. 306–320.
CSLCSL-2009-Sumii #equivalence #polymorphism #λ-calculus
A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References (ES), pp. 455–469.
ICLPICLP-2009-SwiftPP #incremental
Incremental Answer Completion in the SLG-WAM (TS, AMP, LMP), pp. 519–524.
LICSLICS-2009-BasaldellaF #exponential #interactive
Ludics with Repetitions (Exponentials, Interactive Types and Completeness) (MB, CF), pp. 375–384.
LICSLICS-2009-CarraroS #reflexive #λ-calculus
Reflexive Scott Domains are Not Complete for the Extensional λ Calculus (AC, AS), pp. 91–100.
RTARTA-2009-Simonsen #term rewriting
The -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity) (JGS), pp. 335–349.
TLCATLCA-2009-BasaldellaT #logic #on the
On the Meaning of Logical Completeness (MB, KT), pp. 50–64.
TLCATLCA-2009-Tasson #algebra #towards
Algebraic Totality, towards Completeness (CT), pp. 325–340.
VMCAIVMCAI-2009-Oshman #bound #model checking
An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking (RO), pp. 275–289.
ASEASE-2008-RobbesL #code completion #how #repository
How Program History Can Improve Code Completion (RR, ML), pp. 317–326.
DATEDATE-2008-GanaiG #smt #source code
Completeness in SMT-based BMC for Software Programs (MKG, AG), pp. 831–836.
FASEFASE-2008-MossakowskiSG #logic #reasoning
A Generic Complete Dynamic Logic for Reasoning About Purity and Effects (TM, LS, SG), pp. 199–214.
PLDIPLDI-2008-DilligDA #analysis #scalability
Sound, complete and scalable path-sensitive analysis (ID, TD, AA), pp. 270–280.
PLDIPLDI-2008-FlanaganFY #named #parallel #source code #thread
Velodrome: a sound and complete dynamic atomicity checker for multithreaded programs (CF, SNF, JY), pp. 293–303.
STOCSTOC-2008-GordonHKL
Complete fairness in secure two-party computation (SDG, CH, JK, YL), pp. 413–422.
AFLAFL-2008-BreveglieriCNR #equation #problem #satisfiability
NP-completeness of the alphabetical satisfiability problem for trace equations (LB, AC, CDN, ER), pp. 111–121.
AFLAFL-2008-ManeaMY
Some Remarks on the Hairpin Completion (FM, VM, TY), pp. 302–313.
AFLAFL-2008-MasopustM #automaton #multi #on the
On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops (TM, AM), pp. 325–336.
DLTDLT-2008-AtigBH #automaton #multi
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete (MFA, BB, PH), pp. 121–133.
ICALPICALP-A-2008-EldarR #quantum #satisfiability
Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete (LE, OR), pp. 881–892.
ICALPICALP-B-2008-BergerHY #abstraction #logic #mobile #process
Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes (MB, KH, NY), pp. 99–111.
ICALPICALP-B-2008-JezO #equation #on the #set
On the Computational Completeness of Equations over Sets of Natural Numbers (AJ, AO), pp. 63–74.
ICALPICALP-B-2008-Schewe #satisfiability
ATL* Satisfiability Is 2EXPTIME-Complete (SS), pp. 373–385.
LATALATA-2008-BaumeisterR #problem #reduction
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions (DB, JR), pp. 76–87.
SEFMSEFM-2008-Giacobazzi08a #obfuscation
Hiding Information in Completeness Holes: New Perspectives in Code Obfuscation and Watermarking (RG), pp. 7–18.
ICFPICFP-2008-HornM
Deciding kCFA is complete for EXPTIME (DVH, HGM), pp. 275–282.
ICGTICGT-2008-EhrigE #correctness #graph #model transformation #semantics #using
Semantical Correctness and Completeness of Model Transformations Using Graph and Rule Transformation (HE, CE), pp. 194–210.
ICGTICGT-2008-MazanekMM #algorithm
An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars (SM, SM, MM), pp. 39–53.
ICEISICEIS-ISAS2-2008-FukudaY #design #developer #framework #internet
Camel Framework — A Framework for Realizing Complete Separation of Developer’s and Designer’s Work in Rich Internet Application (HF, YY), pp. 137–143.
ICPRICPR-2008-YangYWY #fuzzy #recognition #using
Face recognition using Complete Fuzzy LDA (WY, HY, JW, JY), pp. 1–4.
KRKR-2008-BelardinelliL #first-order #logic
A Complete First-Order Logic of Knowledge and Time (FB, AL), pp. 705–714.
KRKR-2008-Cortes-CalabuigDAB #approximate #database #fixpoint #performance #query
Accuracy and Efficiency of Fixpoint Methods for Approximate Query Answering in Locally Complete Databases (ACC, MD, OA, MB), pp. 81–91.
SACSAC-2008-AdaikkalavanC #exclamation
Events must be complete in event processing! (RA, SC), pp. 1038–1039.
SACSAC-2008-FilhoZ #traceability
Traceability and completeness checking for agent-oriented systems (GACF, AZ), pp. 71–77.
SACSAC-2008-HallerGK #ontology #towards
Towards a complete SCM ontology: the case of ontologising RosettaNet (AH, JG, PK), pp. 1467–1473.
FSEFSE-2008-FischbeinU #behaviour #modelling #on the
On correct and complete strong merging of partial behaviour models (DF, SU), pp. 297–307.
CCCC-2008-LogozzoF #analysis #bytecode #on the #source code
On the Relative Completeness of Bytecode Analysis Versus Source Code Analysis (FL, MF), pp. 197–212.
ICLPICLP-2008-GuzmanCH #execution #program transformation #sketching
A Sketch of a Complete Scheme for Tabled Execution Based on Program Transformation (PCdG, MC, MVH), pp. 795–800.
ICLPICLP-2008-Sneyers #subclass
Turing-Complete Subclasses of CHR (JS), pp. 759–763.
IJCARIJCAR-2008-BoyerGJ #automaton
Certifying a Tree Automata Completion Checker (BB, TG, TPJ), pp. 523–538.
IJCARIJCAR-2008-SatoWKM #multi #termination #tool support
Multi-completion with Termination Tools (System Description) (HS, SW, MK, AM), pp. 306–312.
LICSLICS-2008-NauroisM #correctness #multi #proving
Correctness of Multiplicative Additive Proof Structures is NL-Complete (PJdN, VM), pp. 476–485.
ICSTSAT-2008-Gao #algorithm #complexity #problem #random
Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms (YG), pp. 91–104.
DocEngDocEng-2007-PuginI #semantics
Combination of transformation and schema languages described by a complete formal semantics (CP, RI), pp. 222–224.
ICDARICDAR-2007-CostagliolaDR #diagrams #grammarware #sketching #using
Using Grammar-Based Recognizers for Symbol Completion in Diagrammatic Sketches (GC, VD, MR), pp. 1078–1082.
SIGMODSIGMOD-2007-AntovaKO
From complete to incomplete information and back (LA, CK, DO), pp. 713–724.
VLDBVLDB-2007-StonebrakerMAHHH #architecture
The End of an Architectural Era (It’s Time for a Complete Rewrite) (MS, SM, DJA, SH, NH, PH), pp. 1150–1160.
WRLAWRLA-2006-OlveczkyM07a #abstraction #maude #realtime
Abstraction and Completeness for Real-Time Maude (PCÖ, JM), pp. 5–27.
ESOPESOP-2007-BoerCJ
A Complete Guide to the Future (FSdB, DC, EBJ), pp. 316–330.
FoSSaCSFoSSaCS-2007-GollerLL
PDL with Intersection and Converse Is 2 EXP-Complete (SG, ML, CL), pp. 198–212.
STOCSTOC-2007-HeggernesPTV
Interval completion with few edges (PH, CP, JAT, YV), pp. 374–381.
ICALPICALP-2007-BurgisserC #complexity #problem #quantifier
Exotic Quantifiers, Complexity Classes, and Complete Problems (PB, FC), pp. 207–218.
ICALPICALP-2007-LeePP #alias #source code
Aliased Register Allocation for Straight-Line Programs Is NP-Complete (JKL, JP, FMQP), pp. 680–691.
HCIHIMI-MTT-2007-ChonRL #adaptation
Converting Information Through a Complete and Minimal Unit Transcoder for QoS Adaptation (SC, DR, YL), pp. 594–603.
CAiSECAiSE-2007-ZachosMZJ #requirements #web #web service
Discovering Web Services to Specify More Complete System Requirements (KZ, NAMM, XZ, SJ), pp. 142–157.
CIKMCIKM-2007-BastMW #interactive #performance #query
Efficient interactive query expansion with complete search (HB, DM, IW), pp. 857–860.
POPLPOPL-2007-CalcagnoGZ #logic #parametricity
Context logic as modal logic: completeness and parametric inexpressivity (CC, PG, UZ), pp. 123–134.
POPLPOPL-2007-StovringL #induction
A complete, co-inductive syntactic theory of sequential control and state (KS, SBL), pp. 161–172.
CSLCSL-2007-Abramsky #geometry #interactive #proving
Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract) (SA), pp. 1–2.
CSLCSL-2007-HertelU #game studies
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space (AH, AU), pp. 527–541.
CSLCSL-2007-NauroisM #correctness #exponential #multi #proving
Correctness of Multiplicative (and Exponential) Proof Structures is NL -Complete (PJdN, VM), pp. 435–450.
LICSLICS-2007-BaillotCL #complexity #logic #reduction
Light Logics and Optimal Reduction: Completeness and Complexity (PB, PC, UDL), pp. 421–430.
LICSLICS-2007-BrotherstonS #calculus #induction #infinity
Complete Sequent Calculi for Induction and Infinite Descent (JB, AS), pp. 51–62.
LICSLICS-2007-CohenD #axiom #encryption
A Complete Axiomatization of Knowledge and Cryptography (MC, MD), pp. 77–88.
MBTMBT-2007-OuimetL #automation #consistency #satisfiability #specification #state machine #using #verification
Automated Verification of Completeness and Consistency of Abstract State Machine Specifications using a SAT Solver (MO, KL), pp. 85–97.
RTARTA-2007-HendrixM #on the #order #specification
On the Completeness of Context-Sensitive Order-Sorted Specifications (JH, JM), pp. 229–245.
TLCATLCA-2007-IntrigilaS #calculus
The ω-Rule is Π¹₁-Complete in the λβ-Calculus (BI, RS), pp. 178–193.
TLCATLCA-2007-Santo
Completing Herbelin’s Programme (JES), pp. 118–132.
VMCAIVMCAI-2007-Namjoshi #analysis #symmetry
Symmetry and Completeness in the Analysis of Parameterized Systems (KSN), pp. 299–313.
CASECASE-2006-ChandrasekaranSPV #algorithm #optimisation #permutation #problem #scheduling
An Application of Particle Swarm Optimization Algorithm to Permutation Flowshop Scheduling Problems to Minimize Makespan, Total Flowtime and Completion Time Variance (SC, RKS, SGP, NV), pp. 513–518.
DATEDATE-DF-2006-Daglio #design #embedded #verification
A complete and fully qualified design flow for verification of mixed-signal SoC with embedded flash memories (PD), pp. 94–99.
SIGMODSIGMOD-2006-GouKC #evaluation #performance #query #using
Query evaluation using overlapping views: completeness and efficiency (GG, MK, RC), pp. 37–48.
FoSSaCSFoSSaCS-2006-ChenFN #finite #infinity #on the #simulation
On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation (TC, WF, SN), pp. 1–15.
FoSSaCSFoSSaCS-2006-PereiraP
Register Allocation After Classical SSA Elimination is NP-Complete (FMQP, JP), pp. 79–93.
TACASTACAS-2006-JhalaM #approach #refinement
A Practical and Complete Approach to Predicate Refinement (RJ, KLM), pp. 459–473.
WCREWCRE-2006-KnieselB #analysis #aspect-oriented #correctness #weaving
An Analysis of the Correctness and Completeness of Aspect Weaving (GK, UB), pp. 324–333.
CIAACIAA-2006-OnderB #proving
XSLT Version 2.0 Is Turing-Complete: A Purely Transformation Based Proof (RO, ZB), pp. 275–276.
ICALPICALP-v1-2006-HitchcockP #reduction #set
Comparing Reductions to NP-Complete Sets (JMH, AP), pp. 465–476.
ICALPICALP-v1-2006-NearyW #automaton
P-completeness of Cellular Automaton Rule 110 (TN, DW), pp. 132–143.
ICALPICALP-v2-2006-HondaBY #higher-order #logic
Descriptive and Relative Completeness of Logics for Higher-Order Functions (KH, MB, NY), pp. 360–371.
SEFMSEFM-2006-DSouzaG #graph
Computing Complete Test Graphs for Hierarchical Systems (DD, MG), pp. 70–79.
ICFPICFP-2006-Rosu #problem #similarity
Equality of streams is a Pi0 over 2-complete problem (GR), pp. 184–191.
ICEISICEIS-ISAS-2006-PetersT #flexibility #process #workflow
Flexible Completion of Workflow Activities (GP, RT), pp. 173–180.
ICPRICPR-v1-2006-MillerW #analysis #semantics #word
Word Completion with Latent Semantic Analysis (TM, EW), pp. 1252–1255.
ICPRICPR-v3-2006-AnLV #classification #performance
Efficient Cross-validation of the Complete Two Stages in KFD Classifier Formulation (SA, WL, SV), pp. 240–244.
ICPRICPR-v3-2006-ShenLCF #video
Video Completion for Perspective Camera Under Constrained Motion (YS, FL, XC, HF), pp. 63–66.
ICPRICPR-v3-2006-XuJJG #2d #recognition
Complete Two-Dimensional PCA for Face Recognition (AX, XJ, YJ, PG), pp. 481–484.
ICPRICPR-v3-2006-ZhengYYWY #agile #feature model #recognition
A Complete and Rapid Feature Extraction Method for Face Recognition (YJZ, JYY, JY, XW, DY), pp. 469–472.
ICPRICPR-v4-2006-SmithH #using
Estimating Cast Shadows using SFS and Class-based Surface Completion (WAPS, ERH), pp. 86–90.
KRKR-2006-CateCMV #logic
Definitorially Complete Description Logics (BtC, WC, MM, YV), pp. 79–89.
KRKR-2006-SonT #approximate #on the #reasoning
On the Completeness of Approximation Based Reasoning and Planning in Action Theories with Incomplete Information (TCS, PHT), pp. 481–491.
HPCAHPCA-2006-ManovitH #consistency #memory management #verification
Completely verifying memory consistency of test program executions (CM, SH), pp. 166–175.
CSLCSL-2006-HellaT #higher-order #logic #problem
Complete Problems for Higher Order Logics (LH, JMTT), pp. 380–394.
ICLPICLP-2006-Rocha #logic programming #source code
Handling Incomplete and Complete Tables in Tabled Logic Programs (RR), pp. 427–428.
IJCARIJCAR-2006-DemriL #logic
Presburger Modal Logic Is PSPACE-Complete (SD, DL), pp. 541–556.
IJCARIJCAR-2006-HendrixMO #axiom #linear #order #specification
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms (JH, JM, HO), pp. 151–155.
IJCARIJCAR-2006-LevySV #unification
Stratified Context Unification Is NP-Complete (JL, MSS, MV), pp. 82–96.
IJCARIJCAR-2006-Walukiewicz-ChrzaszczC #calculus #consistency
Consistency and Completeness of Rewriting in the Calculus of Constructions (DWC, JC), pp. 619–631.
RTARTA-2006-LevySV #bound #higher-order #unification
Bounded Second-Order Unification Is NP-Complete (JL, MSS, MV), pp. 400–414.
RTARTA-2006-WehrmanSW #named #termination
Slothrop: Knuth-Bendix Completion with a Modern Termination Checker (IW, AS, EMW), pp. 287–296.
ICSTSAT-2006-BonetLM #calculus #satisfiability
A Complete Calculus for Max-SAT (MLB, JL, FM), pp. 240–251.
ICSTSAT-2006-Goldberg #algorithm
Determinization of Resolution by an Algorithm Operating on Complete Assignments (EG), pp. 90–95.
ICSTSAT-2006-Zhang #random
A Complete Random Jump Strategy with Guiding Paths (HZ), pp. 96–101.
VMCAIVMCAI-2006-GantyRB #abstract interpretation #framework
A Complete Abstract Interpretation Framework for Coverability Properties of WSTS (PG, JFR, LVB), pp. 49–64.
DATEDATE-2005-GenkoAMMHC #framework
A Complete Network-On-Chip Emulation Framework (NG, DA, GDM, JMM, RH, FC), pp. 246–251.
DATEDATE-2005-MishchenkoB #network #optimisation #satisfiability
SAT-Based Complete Don’t-Care Computation for Network Optimization (AM, RKB), pp. 412–417.
SIGMODSIGMOD-2005-PangJRT #query #relational #verification
Verifying Completeness of Relational Query Results in Data Publishing (HP, AJ, KR, KLT), pp. 407–418.
VLDBVLDB-2005-GuoLR #consistency
Caching with “Good Enough” Currency, Consistency, and Completeness (HG, PÅL, RR), pp. 457–468.
ESOPESOP-2005-JanvierLM #encryption
Completing the Picture: Soundness of Formal Encryption in the Presence of Active Adversaries (RJ, YL, LM), pp. 172–185.
DLTDLT-J-2004-MuschollW05 #ltl
An NP-complete fragment of LTL (AM, IW), pp. 743–753.
ICALPICALP-2005-Fischlin
Completely Non-malleable Schemes (MF), pp. 779–790.
CIKMCIKM-2005-LiL05a #encoding #named #novel #xml
QED: a novel quaternary encoding to completely avoid re-labeling in XML updates (CL, TWL), pp. 501–508.
CCCC-2005-XueN #analysis #object-oriented #source code
Completeness Analysis for Incomplete Object-Oriented Programs (JX, PHN), pp. 271–286.
ICSTSAT-J-2004-PorschenS05 #bound #problem
Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems (SP, ES), pp. 251–262.
CAVCAV-2005-HeljankoJL #bound #incremental #model checking
Incremental and Complete Bounded Model Checking for Full PLTL (KH, TAJ, TL), pp. 98–111.
ICLPICLP-2005-DovierFP #comparison #problem
A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems (AD, AF, EP), pp. 67–82.
LICSLICS-2005-HondaYB #higher-order #imperative #logic
An Observationally Complete Program Logic for Imperative Higher-Order Frame Rules (KH, NY, MB), pp. 270–279.
LICSLICS-2005-Mellies #game studies #linear #logic
Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic (PAM), pp. 386–395.
LICSLICS-2005-Santocanale #algebra
Completions of μ-algebras (LS), pp. 219–228.
RTARTA-2005-HendrixCM #reasoning #specification
A Sufficient Completeness Reasoning Tool for Partial Specifications (JH, MC, JM), pp. 165–174.
RTARTA-2005-Yoshinaka #higher-order #linear #λ-calculus
Higher-Order Matching in the Linear λ Calculus in the Absence of Constants Is NP-Complete (RY), pp. 235–249.
ICSTSAT-2005-GentR #learning
Local and Global Complete Solution Learning Methods for QBF (IPG, AGDR), pp. 91–106.
TLCATLCA-2005-Coquand #theorem #λ-calculus
Completeness Theorems and λ-Calculus (TC), pp. 1–9.
ASEASE-2004-HillR #automation
Automatic Method Completion (RH, JR), pp. 228–235.
PODSPODS-2004-Marx #first-order #xpath
Conditional XPath, the First Order Complete XPath Dialect (MM), pp. 13–22.
ESOPESOP-2004-RanzatoT #abstract interpretation
Strong Preservation as Completeness in Abstract Interpretation (FR, FT), pp. 18–32.
FoSSaCSFoSSaCS-2004-BozgaEL #effectiveness #encryption #on the #protocol
On the Existence of an Effective and Complete Inference System for Cryptographic Protocols (LB, CE, YL), pp. 42–57.
FoSSaCSFoSSaCS-2004-BucciarelliL #parallel
Hypergraphs and Degrees of Parallelism: A Completeness Result (AB, BL), pp. 58–71.
SASSAS-2004-Preda #evaluation #refinement
Completeness Refinement in Abstract Symbolic Trajectory Evaluation (MDP), pp. 38–52.
STOCSTOC-2004-HarnikNRR #perspective
Completeness in two-party secure computation: a computational view (DH, MN, OR, AR), pp. 252–261.
FLOPSFLOPS-2004-Ogawa #algebra #axiom #graph
Complete Axiomatization of an Algebraic Construction of Graphs (MO), pp. 163–179.
DLTDLT-2004-MuschollW #ltl
An NP-Complete Fragment of LTL (AM, IW), pp. 334–344.
IFMIFM-2004-CurzonB #case study #design #fault
Formally Justifying User-Centred Design Rules: A Case Study on Post-completion Errors (PC, AB), pp. 461–480.
ICFPICFP-2004-BlumeM #contract
A sound (and complete) model of contracts (MB, DAM), pp. 189–200.
ICPRICPR-v2-2004-BrownCA #classification #performance #set
Efficient Calculation of the Complete Optimal Classification Set (MB, NC, SA), pp. 307–310.
SIGIRSIGIR-2004-GrabskiS
Sentence completion (KG, TS), pp. 433–439.
PPDPPPDP-2004-MarinM #lazy evaluation
New completeness results for lazy conditional narrowing (MM, AM), pp. 120–131.
CSLCSL-2004-Goubault-LarrecqLNZ #encryption #logic #λ-calculus
Complete Lax Logical Relations for Cryptographic λ-Calculi (JGL, SL, DN, YZ), pp. 400–414.
RTARTA-2004-LevySV #higher-order #monad #unification
Monadic Second-Order Unification Is NP-Complete (JL, MSS, MV), pp. 55–69.
VMCAIVMCAI-2004-ClarkeKOS #bound #complexity #model checking
Completeness and Complexity of Bounded Model Checking (EMC, DK, JO, OS), pp. 85–96.
VMCAIVMCAI-2004-PodelskiR #linear #ranking #synthesis
A Complete Method for the Synthesis of Linear Ranking Functions (AP, AR), pp. 239–251.
VLDBVLDB-2003-WangZL #data mining #data type #mining #named #sql
ATLAS: A Small but Complete SQL Extension for Data Mining and Data Streams (HW, CZ, CL), pp. 1113–1116.
ITiCSEITiCSE-2003-GrayGR #design #process
Extending CRC cards into a complete design process (KAG, MG, SR), p. 226.
FoSSaCSFoSSaCS-2003-Maier #composition
Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete (PM), pp. 343–357.
WCREWCRE-2003-LinHM
Completeness of a Fact Extractor (YL, RCH, AJM), pp. 196–205.
DLTDLT-2003-Gecseg #automaton #set
Comments on Complete Sets of Tree Automata (FG), pp. 22–34.
ICALPICALP-2003-JohannsenL #exponential
CTL+ Is Complete for Double Exponential Time (JJ, ML), pp. 767–775.
ICFPICFP-2003-KameyamaH #axiom #continuation
A sound and complete axiomatization of delimited continuations (YK, MH), pp. 177–188.
KDDKDD-2003-PerngTGMH #data-driven #network #validation
Data-driven validation, completion and construction of event relationship networks (CSP, DT, GG, SM, JLH), pp. 729–734.
UMLUML-2003-AlghathbarW #case study #consistency #data access #policy
Consistent and Complete Access Control Policies in Use Cases (KA, DW), pp. 373–387.
REFSQREFSQ-J-2002-ZowghiG03 #consistency #correctness #evolution #on the #requirements
On the interplay between consistency, completeness, and correctness in requirements evolution (DZ, VG), pp. 993–1009.
CSLCSL-2003-Vorobjov #effectiveness #formal method #strict
Effective Model Completeness of the Theory of Restricted Pfaffian Functions (Invited Lecture) (NV), p. 544.
LICSLICS-2003-Jancar #parallel #process #similarity
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete (PJ), p. 218–?.
LICSLICS-2003-Raffalli
System ST β-reduction and completeness (CR), p. 21–?.
TLCATLCA-2003-Fujita #λ-calculus #μ-calculus
A Sound and Complete CPS-Translation for λμ-Calculus (KeF), pp. 120–134.
VMCAIVMCAI-2003-GiacobazziM #abstraction
Domain Compression for Complete Abstractions (RG, IM), pp. 146–160.
DATEDATE-2002-BecerZBPH #analysis #using
Analysis of Noise Avoidance Techniques in DSM Interconnects Using a Complete Crosstalk Noise Model (MRB, VZ, DB, RP, INH), pp. 456–463.
DATEDATE-2002-DuarteVI #power management
A Complete Phase-Locked Loop Power Consumption Model (DD, NV, MJI), p. 1108.
DATEDATE-2002-Sanchez-ElezFMMKHB #architecture #configuration management #multi
A Complete Data Scheduler for Multi-Context Reconfigurable Architectures (MSE, MF, RM, RH, NB, FJK), pp. 547–552.
FoSSaCSFoSSaCS-2002-SchoppS #process #using #verification
Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes (US, AKS), pp. 372–386.
TACASTACAS-2002-BallPR #abstraction #model checking #refinement
Relative Completeness of Abstraction Refinement for Software Model Checking (TB, AP, SKR), pp. 158–172.
WRLAWRLA-2002-AlpuenteEL
Correct and Complete (Positive) Strategy Annotations for OBJ (MA, SE, SL), pp. 70–89.
STOCSTOC-2002-AgolHT
3-manifold knot genus is NP-complet (IA, JH, WPT), pp. 761–766.
STOCSTOC-2002-ScharbrodtSS #analysis #scheduling
A new average case analysis for completion time scheduling (MS, TS, AS), pp. 170–178.
DLTDLT-2002-Lam #finite
Finite Completion of Comma-Free Codes. Part I (NHL), pp. 357–368.
ICALPICALP-2002-AdsulS #linear #logic
Complete and Tractable Local Linear Time Temporal Logics over Traces (BA, MAS), pp. 926–937.
ICALPICALP-2002-GastinM #logic
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces (PG, MM), pp. 938–949.
ICALPICALP-2002-Senizergues #decidability
L(A) = L(B)? Decidability Results from Complete Formal Systems (GS), p. 37.
IFMIFM-2002-GeryHP #development #lifecycle #modelling #named
Rhapsody: A Complete Life-Cycle Model-Based Development System (EG, DH, EP), pp. 1–10.
CSCWCSCW-2002-GrassoM #question
Who can claim complete abstinence from peeking at print jobs? (AG, JLM), pp. 296–305.
ICPRICPR-v3-2002-ZhouK #representation #set #using
Representing and Recognizing Complete Set of Geons Using Extended Superquadrics (LZ, CK), pp. 713–718.
ICSEICSE-2002-WoodsidePS #specification
Performance-related completions for software specifications (CMW, DBP, KHS), pp. 22–32.
HPCAHPCA-2002-GurumurthiSIVKLJ #approach #estimation #simulation #using
Using Complete Machine Simulation for Software Power Estimation: The SoftWatt Approach (SG, AS, MJI, NV, MTK, TL, LKJ), pp. 141–150.
CADECADE-2002-BofillR #order
Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation (MB, AR), pp. 456–470.
CSLCSL-2002-EsikL #algebra #normalisation
Greibach Normal Form in Algebraically Complete Semirings (, HL), pp. 135–150.
ICLPICLP-2002-Maher #constraints
Propagation Completeness of Reactive Constraints (MJM), pp. 148–162.
LICSLICS-2002-HesseI #complexity #problem
Complete Problems for Dynamic Complexity Classes (WH, NI), p. 313–?.
SATSAT-2002-FormanS #named #parallel #random #satisfiability
NAGSAT: A randomized, complete, parallel solver for 3-SAT (SF, AMS), p. 45.
SATSAT-2002-LynceM1 #algorithm #backtracking #satisfiability #strict
Complete unrestricted backtracking algorithms for satisfiability (IL, JMS), p. 29.
DACDAC-2001-ZhouSN #analysis #fixpoint
Timing Analysis with Crosstalk as Fixpoints on Complete Lattice (HZ, NVS, WN), pp. 714–719.
DATEDATE-2001-LaiW #representation #slicing
Slicing tree is a complete floorplan representation (ML, DFW), pp. 228–232.
ICDARICDAR-2001-BansalS
A Complete OCR for Printed Hindi Text in Devanagari Script (VB, RMKS), pp. 800–804.
ICDARICDAR-2001-BloombergPM #documentation #heuristic #image #using
Document Image Decoding Using Iterated Complete Path Search with Subsampled Heuristic Scoring (DSB, KP, TPM), pp. 344–349.
PODSPODS-2001-MendelzonM #data flow #query
Querying Partially Sound and Complete Data Sources (AOM, GAM).
ITiCSEITiCSE-2001-English #named #programming #user interface
JEWL: GUI programming for complete beginners (JE), p. 176.
ESOPESOP-2001-Ranzato #model checking #on the
On the Completeness of Model Checking (FR), pp. 137–154.
FoSSaCSFoSSaCS-2001-HabelP #graph transformation #programming language
Computational Completeness of Programming Languages Based on Graph Transformation (AH, DP), pp. 230–245.
FLOPSFLOPS-J1-1998-LedererD01 #automation #runtime #verification
Automatic Result Verification by Complete Run-Time Checking of Computations (EFAL, RAD), pp. 97–124.
FLOPSFLOPS-2001-SuzukiM #lazy evaluation
A Complete Selection Function for Lazy Conditional Narrowing (TS, AM), pp. 201–215.
ICALPICALP-2001-BofillG #on the
On the Completeness of Arbitrary Selection Strategies for Paramodulation (MB, GG), pp. 951–962.
ICALPICALP-2001-ChekuriK
A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines (CC, SK), pp. 848–861.
ICALPICALP-2001-FishkinJP #multi #on the
On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates (AVF, KJ, LP), pp. 875–886.
ICALPICALP-2001-KorovinV #constraints #theorem proving
Knuth-Bendix Constraint Solving Is NP-Complete (KK, AV), pp. 979–992.
ICALPICALP-2001-Woeginger #constraints #on the #precedence #scheduling
On the Approximability of Average Completion Time Scheduling under Precedence Constraints (GJW), pp. 887–897.
CAiSECAiSE-2001-CombiM #modelling #multi
Data Models with Multiple Temporal Dimensions: Completing the Picture (CC, AM), pp. 187–202.
CSLCSL-2001-AbramskyL #modelling #λ-calculus
Fully Complete Minimal PER Models for the Simply Typed λ-Calculus (SA, ML), pp. 443–457.
CSLCSL-2001-Rosu #category theory #deduction #equation
Complete Categorical Equational Deduction (GR), pp. 528–538.
ICLPICLP-2001-DrabentM #approach #correctness #declarative #proving #source code
Proving Correctness and Completeness of Normal Programs — A Declarative Approach (WD, MM), pp. 284–299.
IJCARIJCAR-2001-Lutz #logic
NEXPTIME-Complete Description Logics with Concrete Domains (CL), pp. 45–60.
IJCARIJCAR-2001-Stuber #modelling #proving
A Model-Based Completeness Proof of Extended Narrowing and Resolution (JS), pp. 195–210.
IJCARIJCAR-2001-Szeider
NP-Completeness of Refutability by Literal-Once Resolution (SS), pp. 168–181.
LICSLICS-2001-LangeS #game studies #logic #satisfiability
Focus Games for Satisfiability and Completeness of Temporal Logic (ML, CS), pp. 357–365.
TLCATLCA-2001-Haghverdi #category theory #linear #logic #modelling
Partially Additive Categories and Fully Complete Models of Linear Logic (EH), pp. 197–216.
ASEASE-2000-Bouhoula #confluence
Simultaneous Checking of Completeness and Ground Confluence (AB), p. 143–?.
STOCSTOC-2000-Istrail #3d #statistics
Statistical mechanics, three-dimensionality and NP-completeness: I. Universality of intracatability for the partition function of the Ising model across non-planar surfaces (extended abstract) (SI), pp. 87–96.
STOCSTOC-2000-KatzY #encryption #probability #security
Complete characterization of security notions for probabilistic private-key encryption (JK, MY), pp. 245–254.
STOCSTOC-2000-Kilian #theorem
More general completeness theorems for secure two-party computation (JK), pp. 316–324.
ICALPICALP-2000-BravettiG #axiom #behaviour #congruence #finite
A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors (MB, RG), pp. 744–755.
ICALPICALP-2000-DiekertG #ltl
LTL Is Expressively Complete for Mazurkiewicz Traces (VD, PG), pp. 211–222.
ICALPICALP-2000-FokkinkL #equation #specification
An ω-Complete Equational Specification of Interleaving (WF, SPL), pp. 729–743.
ICALPICALP-2000-Moszkowski #logic #proving
An Automata-Theoretic Completeness Proof for Interval Temporal Logic (BCM), pp. 223–234.
ICEISICEIS-2000-HeL #protocol #towards
Towards a Secure and Complete Protocol for Electronic Commerce (RH, KL), pp. 435–441.
ICMLICML-2000-MullinS #classification #nearest neighbour
Complete Cross-Validation for Nearest Neighbor Classifiers (MDM, RS), pp. 639–646.
ICPRICPR-v4-2000-GuestFPD #aspect-oriented
Analyzing Constructional Aspects of Figure Completion for the Diagnosis of Visuospatial Neglect (RMG, MCF, JMP, ND), pp. 4316–4319.
ICPRICPR-v4-2000-StocktonS #interactive #named
JKanji: Wavelet-Based Interactive Kanji Completion (RGS, RS), pp. 4442–4446.
TOOLSTOOLS-EUROPE-2000-Daniels00a #component #design
Component Based Design: A Complete Worked Example (JD), p. 470.
POPLPOPL-2000-KnoblockR #bytecode #java #type system
Type Elaboration and Subtype Completion for Java Bytecode (TBK, JR), pp. 228–242.
CADECADE-2000-BorrallerasFR #order #semantics
Complete Monotonic Semantic Path Orderings (CB, MF, AR), pp. 346–364.
CSLCSL-2000-AbramskyL #ml #polymorphism
A Fully Complete PER Model for ML Polymorphic Types (SA, ML), pp. 140–155.
CSLCSL-2000-CoquandZ
Sequents, Frames, and Completeness (TC, GQZ), pp. 277–291.
CSLCSL-2000-Laird #finite #modelling
Finite Models and Full Completeness (JL), pp. 384–398.
CSLCSL-2000-Naijun #calculus #higher-order
Completeness of Higher-Order Duration Calculus (ZN), pp. 442–456.
LICSLICS-2000-Moszkowski #axiom #infinity #logic
A Complete Axiomatization of Interval Temporal Logic with Infinite Time (BCM), pp. 241–252.
LICSLICS-2000-SimpsonP #axiom #category theory #fixpoint
Complete Axioms for Categorical Fixed-Point Operators (AKS, GDP), pp. 30–41.
RTARTA-2000-Groote #higher-order #linear
Linear Higher-Order Matching Is NP-Complete (PdG), pp. 127–140.
FoSSaCSFoSSaCS-1999-Lenisa #bisimulation #equivalence #induction #logic
A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects (ML), pp. 243–257.
CSMRCSMR-1999-PoloPRC #maintenance #named #standard
MANTEMA: A Complete Rigorous Methodology for Supporting Maintenance Based On The ISO/IEC 12207 Standard (MP, MP, FR, CC), pp. 178–181.
STOCSTOC-1999-SchulmanV #approximate #problem
Majorizing Estimators and the Approximation of #P-Complete Problems (LJS, VVV), pp. 288–294.
STOCSTOC-1999-SkutellaW #parallel
A PTAS for Minimizing the Weighted Sum of Job Completion Times on Parallel Machines (MS, GJW), pp. 400–407.
FMFM-v2-1999-Merz
A More Complete TLA (SM), pp. 1226–1244.
HCIHCI-EI-1999-WandkeH #guidelines #interactive
Completing Human Factor Guidelines by Interactive Examples (HW, JH), pp. 983–987.
SACSAC-1999-Rivera-Gallego #algorithm #distance #matrix #problem #search-based
A Genetic Algorithm for Solving the Euclidean Distance Matrices Completion Problem (WRG), pp. 286–290.
CAVCAV-1999-LangerakB #algebra #finite #process
A Complete Finite Prefix for Process Algebra (RL, EB), pp. 184–195.
CSLCSL-1999-DiekertG #logic
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces (VD, PG), pp. 188–203.
CSLCSL-1999-Roversi #logic #proving
A P-Time Completeness Proof for Light Logics (LR), pp. 469–483.
CSLCSL-1999-Tobies #logic #strict
A NExpTime-Complete Description Logic Strictly Contained in C2 (ST), pp. 292–306.
LICSLICS-1999-AbramskyM #concurrent #game studies
Concurrent Games and Full Completeness (SA, PAM), pp. 431–442.
LICSLICS-1999-DevarajanHPP #linear #logic #multi
Full Completeness of the Multiplicative Linear Logic of Chu Spaces (HD, DJDH, GDP, VRP), pp. 234–243.
LICSLICS-1999-NiehrenMT #constraints #set
Entailment of Atomic Set Constraints is PSPACE-Complete (JN, MM, JMT), pp. 285–294.
ESOPESOP-1998-Ruggieri #debugging #declarative
A Complete Declarative Debugger of Missing Answers (SR), pp. 236–251.
PLDIPLDI-1998-BodikGS
Complete Removal of Redundant Computations (RB, RG, MLS), pp. 1–14.
PLDIPLDI-1998-FessantPS #distributed #garbage collection #implementation
An Implementation for Complete, Asynchronous, Distributed Garbage Collection (FLF, IP, MS), pp. 152–161.
SASSAS-1998-GiacobazziRS #abstract interpretation #linear
Building Complete Abstract Interpretations in a Linear Logic-based Setting (RG, FR, FS), pp. 215–229.
PLDIBest-of-PLDI-1998-BodikGS98a
Complete removal of redundant expressions (with retrospective) (RB, RG, MLS), pp. 596–611.
ICALPICALP-1998-Lin #proving #π-calculus
Complete Proof Systems for Observation Congruences in Finite-Control π-Calculus (HL), pp. 443–454.
ICALPICALP-1998-Peleg #distributed
Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning Trees (DP), pp. 164–175.
ICALPICALP-1998-SantisCPY #image
Image Density is Complete for Non-Interactive-SZK (Extended Abstract) (ADS, GDC, GP, MY), pp. 784–795.
KRKR-1998-Levesque #first-order #knowledge base #reasoning
A Completeness Result for Reasoning with Incomplete First-Order Knowledge Bases (HJL), pp. 14–23.
TOOLSTOOLS-ASIA-1998-YuanHXLZ #object-oriented
Complete Object-Oriented Z and Its Supporting Environment COOZ-Tools (XY, DH, HX, YL, GZ), pp. 206–213.
PPDPALP-PLILP-1998-AjiliL #constraints #linear
Integrating Constraint Propagation in Complete Solving of Linear Diophantine Systems (FA, HCRL), pp. 463–480.
LICSLICS-1998-FriasM #calculus #relational
Completeness of a Relational Calculus for Program Schemes (MFF, RDM), pp. 127–134.
LICSLICS-1998-Yokouchi #quantifier
Completeness of Type Assignment Systems with Intersection, Union, and Type Quantifiers (HY), pp. 368–379.
ICDARICDAR-1997-BaumannADJMWW #documentation
Message Extraction from Printed Documents — A Complete Solution (SB, MBHA, AD, TJ, MM, AW, CW), pp. 1055–1059.
PODSPODS-1997-GyssensBG #geometry #query
Complete Geometrical Query Languages (MG, JVdB, DVG), pp. 62–67.
STOCSTOC-1997-KhannaSW #classification #constraints #problem
A Complete Classification of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction (SK, MS, DPW), pp. 11–20.
DLTDLT-1997-GecsegI #automaton #on the #set
On complete sets of tree automata (FG, BI), pp. 37–47.
ICALPICALP-1997-Bruyere #algorithm #bound
A Completion Algorithm for Codes with Bounded Synchronization Delay (VB), pp. 87–97.
ICALPICALP-1997-EilamFZ #layout #network #problem
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract) (TE, MF, SZ), pp. 527–537.
ICALPICALP-1997-HemaspaandraHR #analysis #parallel
Exact Analysis of Dodgson Elections: Lewis Carroll’s 1876 Voting System is Complete for Parallel Access to NP (EH, LAH, JR), pp. 214–224.
ICALPICALP-1997-ManziniM #automaton #classification #linear
A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Zm (GM, LM), pp. 794–804.
ICALPICALP-1997-Papadimitriou #named
NP-Completeness: A Retrospective (CHP), pp. 2–6.
IFLIFL-1997-SparudR #functional
Complete and Partial Redex Trails of Functional Computations (JS, CR), pp. 160–177.
SACSAC-1997-BinkleyK #named #problem
Crozzle: an NP-complete problem (DB, BMK), pp. 30–34.
ICLPICLP-1997-Liu #database #deduction #set #tuple
Supporting Partial and Complete Sets and Tuples in Deductive Databases (ML), p. 415.
ICLPILPS-1997-SeidlF
Disjuntive Completion Is Not “Optimal” (HS, CF), p. 408.
LICSLICS-1997-ComonJ
Ground Reducibility is EXPTIME-Complete (HC, FJ), pp. 26–34.
LICSLICS-1997-FiorePP #axiom #set
Complete Cuboidal Sets in Axiomatic Domain Theory (MPF, GDP, AJP), pp. 268–278.
LICSLICS-1997-Janin #automaton #calculus #fixpoint #reduction #theorem
Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices (DJ), pp. 172–182.
LICSLICS-1997-ThiagarajanW #linear #logic
An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces (PST, IW), pp. 183–194.
RTARTA-1997-BechetGR #axiom #partial order
A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders (DB, PdG, CR), pp. 230–240.
RTARTA-1997-Kapur #congruence
Shostak’s Congruence Closure as Completion (DK), pp. 23–37.
RTARTA-1997-Lynch #graph #using
Goal-Directed Completion Using SOUR Graphs (CL), pp. 8–22.
DACDAC-1996-ChengTDRK #named #reliability
iCET: A Complete Chip-Level Thermal Reliability Diagnosis Tool for CMOS VLSI Chips (YKC, CCT, AD, ER, SMK), pp. 548–551.
DACDAC-1996-Park
A New Complete Diagnosis Patterns for Wiring Interconnects (SP), pp. 203–208.
VLDBVLDB-1996-Levy #database #semistructured data
Obtaining Complete Answers from Incomplete Databases (AYL), pp. 402–412.
ESOPESOP-1996-BergstraDFH #compilation #tool support
A Complete Transformational Toolkit for Compilers (JAB, TBD, JF, JH), pp. 92–107.
ESOPESOP-1996-Stolen #data flow #network
Assumption/Commitment Rules for Dataflow Networks — With an Emphasis on Completeness (KS), pp. 356–372.
ICALPICALP-1996-ChengK #axiom #constraints #set
A Complete Gentzen-Style Axiomatization for Set Constraints (AC, DK), pp. 134–145.
FMFME-1996-ZwiersHLRS #composition #development #reuse #top-down
Modular Completeness: Integrating the Reuse of Specified Software in Top-down Program Development (JZ, UH, YL, WPdR, FAS), pp. 595–608.
ICPRICPR-1996-ArumugaveluR #algorithm #clustering
SIMD algorithms for single link and complete link pattern clustering (SA, NR), pp. 625–629.
ICPRICPR-1996-MokademDG #distance #invariant
A shape distance by complete and stable invariant descriptors for contour tracking (AM, MD, FG), pp. 105–109.
KRKR-1996-JonssonDB #algebra #classification #subclass
Tractable Subclasses of the Point-Interval Algebra: A Complete Classification (PJ, TD, CB), pp. 352–363.
CADECADE-1996-Fernmuller #semantics
Semantic Trees Revisited: Some New Completeness Results (CGF), pp. 568–582.
CSLCSL-1996-Dziembowski #bound #fixpoint #query
Bounded-Variable Fixpoint Queries are PSPACE-complete (SD), pp. 89–105.
CSLCSL-1996-KozenS #algebra #decidability #testing
Kleene Algebra with Tests: Completeness and Decidability (DK, FS), pp. 244–259.
ICLPJICSLP-1996-Rao #implementation
Completeness Results for Basic Narrowing in Non-Copying Implementations (MRKKR), pp. 393–407.
LICSLICS-1996-BethkeKV #algebra #combinator #normalisation
Completing Partial Combinatory Algebras With Unique Head-Normal Forms (IB, JWK, RCdV), pp. 448–454.
RTARTA-1996-BoudetCM #proving #theorem proving #unification
AC-Complete Unification and its Application to Theorem Proving (AB, EC, CM), pp. 18–32.
RTARTA-1996-ContejeanM #named
CiME: Completion Modulo E (EC, CM), pp. 416–419.
RTARTA-1996-HillenbrandBF #on the #performance #proving #theorem proving
On Gaining Efficiency in Completion-Based Theorem Proving (TH, AB, RF), pp. 432–435.
RTARTA-1996-KirchnerLS #concurrent #fine-grained
Fine-Grained Concurrent Completion (CK, CL, CS), pp. 3–17.
STOCSTOC-1995-Wang #problem #word
Average-case completeness of a word problem for groups (JW), pp. 325–334.
LOPSTRLOPSTR-1995-Renault #logic programming #proving #source code #towards
Towards a Complete Proof Procedure to Prove Properties of Normal Logic Programs under the Completion (SR), pp. 204–218.
PPDPPLILP-1995-NakaharaMI #calculus #functional #higher-order #logic programming
A Complete Narrowing Calculus for Higher-Order Functional Logic Programming (KN, AM, TI), pp. 97–114.
ICSEICSE-1995-HeimdahlL #analysis #consistency #requirements
Completeness and Consistency Analysis of State-Based Requirements (MPEH, NGL), pp. 3–14.
ICLPICLP-1995-Fung #abduction
Abduction with Clark Completion (THF), p. 817.
ICLPILPS-1995-GiacobazziR #abstract interpretation #dependence #functional #semantics
Functional Dependencies and Moore-Set Completions of Abstract Interpretations and Semantics (RG, FR), pp. 321–335.
LICSLICS-1995-Dutertre #first-order #logic #proving
Complete Proof Systems for First Order Interval Temporal Logic (BD), pp. 36–43.
LICSLICS-1995-KestenP #proving
A Complete Proof Systems for QPTL (YK, AP), pp. 2–12.
LICSLICS-1995-Walukiewicz #axiom #calculus #μ-calculus
Completeness of Kozen’s Axiomatisation of the Propositional μ-Calculus (IW), pp. 14–24.
RTARTA-1995-KirchnerM #constraints #prototype #using
Prototyping Completion with Constraints Using Computational Systems (HK, PEM), pp. 438–443.
RTARTA-1995-KuriharaKO #multi #order #reduction
Completion for Multiple Reduction Orderings (MK, HK, AO), pp. 71–85.
RTARTA-1995-Marchiori #composition #revisited
Modularity of Completeness Revisited (MM), pp. 2–10.
RTARTA-1995-ZantemaG #termination
A Complete Characterization of Termination of Op 1q -> 1r Os (HZ, AG), pp. 41–55.
TLCATLCA-1995-Leclerc #coq #development #multi #order #proving #term rewriting #termination
Termination Proof of Term Rewriting System with the Multiset Path Ordering. A Complete Development in the System Coq (FL), pp. 312–327.
TLCATLCA-1995-Simpson #category theory #λ-calculus
Categorical completeness results for the simply-typed λ-calculus (AKS), pp. 414–427.
DACDAC-1994-KovalFSD #named
MONSTR: A Complete Thermal Simulator of Electronic Systems (VK, IWF, AJS, SWD), pp. 570–575.
SASSAS-1994-Garza-SalazarB #analysis #array
Uniqueness and Completeness Analysis of Array Comprehensions (DAGS, APWB), pp. 193–207.
STOCSTOC-1994-AroraRV #polynomial #simulation
Simulating quadratic dynamical systems is PSPACE-complete (preliminary version) (SA, YR, UVV), pp. 459–467.
STOCSTOC-1994-BodlaenderFH #bound #problem
Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (HLB, MRF, MTH), pp. 449–458.
STOCSTOC-1994-MaratheHSR #approximate #problem #specification
Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version) (MVM, HBHI, RES, VR), pp. 468–477.
ICALPICALP-1994-BirgetMMW #algorithm #problem
PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups (JCB, SWM, JCM, PW), pp. 274–285.
LISPLFP-1994-Cosmadakis #algebra #proving
Complete Proof Systems for Algebraic Simply-Typed Terms (SSC), pp. 220–226.
ICMLICML-1994-GervasioD #approach #incremental #learning
An Incremental Learning Approach for Completable Planning (MTG, GD), pp. 78–86.
KRKR-1994-Val #compilation #database #how
Tractable Databases: How to Make Propositional Unit Resolution Complete Through Compilation (AdV), pp. 551–561.
SEKESEKE-1994-Sakalauskaite #branch #calculus #first-order #logic
A complete sequent calculus for a first order branching temporal logic (JS), pp. 274–280.
PPDPALP-1994-Bouhoula #induction #proving
Sufficient Completeness and Parameterized Proofs by Induction (AB), pp. 23–40.
PPDPALP-1994-Teusink #abduction #logic programming #source code
Three-Valued Completion for Abductive Logic Programs (FT), pp. 150–167.
SACSAC-1994-WassermanS #locality #logic programming
The locality principle and completeness in logic programming (HCW, ZS), pp. 286–291.
CADECADE-1994-Beckert
A Completion-Based Method for Mixed Universal and Rigid E-Unification (BB), pp. 678–692.
CADECADE-1994-Bouhoula #induction #named #proving
SPIKE: a System for Sufficient Completeness and Parameterized Inductive Proofs (AB), pp. 836–840.
CAVCAV-1994-ZhuS #hardware
The Completeness of a Hardware Inference System (ZZ, CJHS), pp. 286–298.
ICLPICLP-1994-Christiansen #performance
Efficient and Complete Demo Predicates for Definite Clause Languages (HC), pp. 735–736.
ICLPICLP-1994-ProiettiP #logic
Completeness of Some Transformation Strategies for Avoiding Unnecessary Logical Variables (MP, AP), pp. 714–729.
ISSTAISSTA-1994-Kapur #automation #equation #specification
An Automated Tool for Analyzing Completeness of Equational Specifications (DK), pp. 28–43.
LICSLICS-1994-Goubault
Rigid E-Unifiability is DEXPTIME-Complete (JG), pp. 498–506.
LICSLICS-1994-Loader #linear #logic
Linear Logic, Totality and Full Completeness (RL), pp. 292–298.
LICSLICS-1994-Marche #normalisation
Normalised Rewriting and Normalised Completion (CM), pp. 394–403.
LICSLICS-1994-MedinaI
A Syntactic Characterization of NP-Completeness (JAM, NI), pp. 241–250.
LICSLICS-1994-Pentus #calculus
Language Completeness of the Lambek Calculus (MP), pp. 487–496.
LICSLICS-1994-Stefansson #constraints #set
Systems of Set Constraints with Negative Constraints are NEXPTIME-Complete (KS), pp. 137–141.
PODSPODS-1993-HirstH #database #recursion
Completeness Results for Recursive Data Bases (TH, DH), pp. 244–252.
PEPMPEPM-1993-Mycroft #abstract interpretation
Completeness and predicate-based abstract interpretation (AM), pp. 179–185.
DLTDLT-1993-Honkala #on the
On Lindenmayerian Series in Complete Semirings (JH), pp. 179–192.
ICALPICALP-1993-MaratheHR #approximate #complexity #problem #specification
The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract) (MVM, HBHI, SSR), pp. 76–87.
CHIINTERCHI-1993-MyersMK #named #user interface
Marquise: creating complete user interfaces by demonstration (BAM, RGM, DSK), pp. 293–300.
ICMLICML-1993-Schlimmer #algorithm
Efficiently Inducing Determinations: A Complete and Systematic Search Algorithm that Uses Optimal Pruning (JCS), pp. 284–290.
TOOLSTOOLS-USA-1993-Patels #development #named #process
OOSEM — A Complete Development Process for O-O Software (RP), p. 572.
POPLPOPL-1993-ReickeS #algebra #reasoning
Algebraic Reasoning and Completeness in Typed Languages (JGR, RS), pp. 185–195.
SACSAC-1993-RankinWHS #algorithm #evaluation #hybrid #problem #search-based
A Hybrid Genetic Algorithm for an NP-Complete Problem with an Expensive Evaluation Function (RR, RWW, GH, JS), pp. 251–256.
ICLPILPS-1993-Ben-Eliyahu #revisited
Back to the Future: Program Completion, Revisited (RBE), p. 642.
ICLPILPS-1993-Drabent #query
Completeness of SLDNF-Resolution for Non-Floundering Queries (WD), p. 643.
ICLPILPS-1993-Orgun #logic programming
The Soundness and Completeness of a Temporal Extension of Logic Programming (MAO), p. 669.
RTARTA-1993-LynchS
Redundancy Criteria for Constrained Completion (CL, WS), pp. 2–16.
RTARTA-1993-Zhang #case study
A Case Study of Completion Modulo Distributivity and Abelian Groups (HZ), pp. 32–46.
HTHT-ECHT-1992-Pavanello
The Complete Works of St. Thomas Aquinas on CD-ROM (Demonstration) (AP), p. 294.
ESOPESOP-1992-NieuwenhuisR
Basic Superposition is Complete (RN, AR), pp. 371–389.
STOCSTOC-1992-DorT #composition #graph #proving
Graph Decomposition Is NPC-A Complete Proof of Holyer’s Conjecture (DD, MT), pp. 252–263.
ICALPICALP-1992-Comon #constraints #term rewriting
Completion of Rewrite Systems with Membership Constraints (HC), pp. 392–403.
AdaTRI-Ada-C-1992-Strong #development #identification #lifecycle #object-oriented #scalability
Identifying a Complete Object Oriented Life Cycle for Large Systems Development (NSS), pp. 166–175.
KRKR-1992-PenberthyW #named #partial order
UCPOP: A Sound, Complete, Partial Order Planner for ADL (JSP, DSW), pp. 103–114.
PPDPALP-1992-MiddeldorpH
Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract) (AM, EH), pp. 244–258.
PPDPALP-1992-Socher-Ambrosius
A Goal Oriented Strategy Based on Completion (RSA), pp. 435–445.
PPDPPLILP-1992-Hans #automaton
A Complete Indexing Scheme for WAM-based Abstract Machines (WH), pp. 232–244.
CCCC-1992-Emmelmann #specification #testing
Testing Completeness of Code Selector Specifications (HE), pp. 163–175.
CADECADE-1992-YelickG #parallel #term rewriting
A Parallel Completion Procedure for Term Rewriting Systems (KAY, SJG), pp. 109–123.
CSLCSL-1992-Creignou #linear #problem #proving #satisfiability
The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness (NC), pp. 115–133.
CSLCSL-1992-Gonzalez-MorenoHR #functional #logic programming #on the #semantics
On the Completeness of Narrowing as the Operational Semantics of Functional Logic Programming (JCGM, MTHG, MRA), pp. 216–230.
CSLCSL-1992-Grandjean #algorithm #linear #problem
Linear Time Algorithms and NP-Complete Problems (EG), pp. 248–273.
CSLCSL-1992-Stark #logic programming #source code
Negation-Complete Logic Programs (RFS), pp. 403–409.
ICLPJICSLP-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.
ICLPJICSLP-1992-Hanus #on the
On the Completeness of Residuation (MH), pp. 192–206.
LICSLICS-1992-Kanovich #linear #logic #programming
Horn Programming in Linear Logic Is NP-Complete (MIK), pp. 200–210.
LICSLICS-1992-KapurN #complexity #set
Double-exponential Complexity of Computing a Complete Set of AC-Unifiers (DK, PN), pp. 11–21.
DACDAC-1991-PaterasR #correlation #generative #multi #random #testing
Generation of Correlated Random Patterns for the Complete Testing of Synthesized Multi-level Circuits (SP, JR), pp. 347–352.
DACDAC-1991-PomeranzR #fault #on the #using
On Achieving a Complete Fault Coverage for Sequential Machines Using the Transition Fault Model (IP, SMR), pp. 341–346.
STOCSTOC-1991-BrightwellW #linear
Counting Linear Extensions is #P-Complete (GB, PW), pp. 175–181.
STOCSTOC-1991-Kilian #game studies #theorem
A General Completeness Theorem for Two-Party Games (JK), pp. 553–560.
STOCSTOC-1991-Ko #equation #polynomial
Integral Equations, Systems of Quadratic Equations, and Exponential-Time Completeness (Extended Abstract) (KIK), pp. 10–20.
SASWSA-1991-EchahedJPS #case study #comparative #equation #program transformation
Equational Reasonning and the Completion Procedure. A Comparative Study in Program Transformation (RE, PJ, MLP, SS), pp. 53–61.
ICALPICALP-1991-Comon #algebra #axiom
Complete Axiomatizations of Some Quotient Term Algebras (HC), pp. 469–480.
ICALPICALP-1991-CuckerT #formal method #problem
Two P-Complete Problems in the Theory of the Reals (FC, AT), pp. 556–565.
ICALPICALP-1991-MadlenerNO #monad #string #term rewriting
A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups (KM, PN, FO), pp. 279–290.
ICALPICALP-1991-RaviAK #approximate #graph #problem #scheduling
Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion (RR, AA, PNK), pp. 751–762.
KRKR-1991-Baalen #automation #design #satisfiability
The Completeness of DRAT, A Technique for Automatic Design of Satisfiability Procedures (JVB), pp. 514–525.
KRKR-1991-Freuder #constraints #problem
Completable Representations of Constraint Satisfaction Problems (ECF), pp. 186–195.
ICMLML-1991-Rouveirol #induction
Completeness for Inductive Procedures (CR), pp. 452–456.
SIGIRSIGIR-1991-TagueSM #information retrieval
A Complete Model for Information Retrieval Systems (JT, AS, CM), pp. 14–20.
CSLCSL-1991-Stewart #on the
On Completeness for NP via Projection Translations (IAS), pp. 353–366.
CSLCSL-1991-Voronkov #on the #synthesis
On Completeness of Program Synthesis Systems (AV), pp. 411–418.
ICLPICLP-1991-Harland #logic programming #source code
A Clausal Form for the Completion of Logic Programs (JH), pp. 711–725.
ICLPICLP-1991-Przymusinski #logic programming #source code
Well-Founded Completions of Logic Programs (TCP), pp. 726–741.
ICLPISLP-1991-SatoM #first-order #interpreter #source code #top-down
A Complete Top-Down Interpreter for First Order Programs (TS, FM), pp. 35–53.
LICSLICS-1991-Kozen #algebra #theorem
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events (DK), pp. 214–225.
RTARTA-1991-Avenhaus #equation #induction #proving #theorem
Proving Equational and Inductive Theorems by Completion and Embedding Techniques (JA), pp. 361–373.
RTARTA-1991-BonacinaH #on the #proving #theorem proving
On Fairness of Completion-Based Theorem Proving Strategies (MPB, JH), pp. 348–360.
RTARTA-1991-Bundgen #algorithm #simulation
Simulation Buchberger’s Algorithm by Knuth-Bendix Completion (RB), pp. 386–397.
RTARTA-1991-Hermann #on the #proving
On Proving Properties of Completion Strategies (MH), pp. 398–410.
RTARTA-1991-Marche #on the
On Ground AC-Completion (CM), pp. 411–422.
RTARTA-1991-MiddeldorpT
Completeness of Combinations of Constructor Systems (AM, YT), pp. 188–199.
RTARTA-1991-Sattler-Klein
Divergence Phenomena during Completion (ASK), pp. 374–385.
DACDAC-1990-DonathNABHKLM #using
Timing Driven Placement Using Complete Path Delays (WED, RJN, BKA, SEB, SYH, JMK, PL, RIM), pp. 84–89.
VLDBVLDB-1990-TuzhilinC #algebra #relational
A Temporal Relational Algebra as Basis for Temporal Relational Completeness (AT, JC), pp. 13–23.
STOCSTOC-1990-DietzfelbingerH #how #network #taxonomy
How to Distribute a Dictionary in a Complete Network (MD, FMadH), pp. 117–127.
ICALPICALP-1990-Krob
A Complete System of B-Rational Identities (DK), pp. 60–73.
ICALPICALP-1990-Riecke #call-by #decidability #proving
A Complete and Decidable Proof System for Call-by-Value Equalities (Preliminary Report) (JGR), pp. 20–31.
SIGIRSIGIR-1990-Huther #on the #taxonomy
On the Interrelationship of Dictionary Size and Completeness (HH), pp. 313–325.
PPDPALP-1990-Dung #logic programming #on the #source code
On the strong completion of logic programs (PMD), pp. 158–172.
PPDPALP-1990-Lescanne #implementation
Implementations of Completion by Transition Rules + Control: ORME (PL), pp. 262–269.
POPLPOPL-1990-Mairson #exponential #ml
Deciding ML Typability is Complete for Deterministic Exponential Time (HGM), pp. 382–401.
CADECADE-1990-Basin #commutative #morphism #similarity
Equality of Terms Containing Associative-Commutative Functions and Commutative Binding Operators in Isomorphism Complete (DAB), pp. 251–260.
CADECADE-1990-Gramlich #induction #named #proving #theorem proving
UNICOM: A Refined Completion Based Inductive Theorem Prover (BG), pp. 655–656.
CADECADE-1990-Lescanne #implementation #named #set
ORME: An Implementation of Completion Procedures as Sets of Transition Rules (PL), pp. 661–662.
CADECADE-1990-NieP #proving #semantics
A Complete Semantic Back Chaining Proof System (XN, DAP), pp. 16–27.
CADECADE-1990-Peterson #constraints #reduction #set
Complete Sets of Reductions with Constraints (GEP), pp. 381–395.
LICSLICS-1990-CosmadakisMR #lazy evaluation
Completeness for typed lazy inequalities (SSC, ARM, JGR), pp. 312–320.
PODSPODS-1989-YuanC #algorithm #database #evaluation #query #relational
A Sound and Complete Query Evaluation Algorithm for Relational Databases with Disjunctive Information (LYY, DAC), pp. 66–74.
VLDBVLDB-1989-Creasy #concept #named
ENIAM: A More Complete Conceptual Schema Language (PNC), pp. 107–114.
ICALPICALP-1989-Bruyere #finite
Completion of Finite Codes with Finite Deciphering Delay (VB), pp. 151–163.
ICALPICALP-1989-Hastad #rank
Tensor Rank is NP-Complete (JH), pp. 451–460.
ICALPICALP-1989-MannaP
Completing the Temporal Picture (ZM, AP), pp. 534–558.
POPLPOPL-1989-Baudinet #logic programming
Temporal Logic Programming is Complete and Expressive (MB), pp. 267–280.
ICSEICSE-1989-Howden #validation
Error-Based Validation Completeness (WEH), p. 357.
ICSEICSE-1989-JaffeL #realtime #requirements #robust #safety #specification
Completeness, Robustness, and Safety in Real-Time Software Requirements Specification (MSJ, NGL), pp. 302–311.
ICSEICSE-1989-Kemmerer
Completely Validated Software (RAK), pp. 359–360.
ICSEICSE-1989-Linger #re-engineering
Mathematics-Based Software Engineering for Completely Validated Software (RCL), p. 358.
CSLCSL-1989-DeckerC
Generalizing Allowedness While Retaining Completeness of SLDNF-Resolution (HD, LC), pp. 98–115.
CSLCSL-1989-PasztorS #theorem
A Streamlined Temporal Completeness Theorem (AP, IS), pp. 322–336.
CSLCSL-1989-Stark #proving
A Direct Proof for the Completeness of SLD-Resolution (RFS), pp. 382–383.
CSLCSL-1989-Stark89a #logic programming #quantifier #source code
A Quantifier-Free Completion of Logic Programs (RFS), pp. 384–395.
LICSLICS-1989-Robinson #how #question
How Complete is PER? (ER), pp. 106–111.
ICLPNACLP-1989-DungK #on the #source code
On the Generalized Predicate Completion of Non-Horn Programs (PMD, KK), pp. 587–603.
RTARTA-1989-AnantharamanHM #named #term rewriting
SbReve2: A Term Rewriting Laboratory with (AC-) Unfailing Completion (SA, JH, JM), pp. 533–537.
RTARTA-1989-AvenhausMS #named #term rewriting
COMTES — An Experimental Environment for the Completion of Term Rewriting Systems (JA, KM, JS), pp. 542–546.
RTARTA-1989-BairdPW #commutative #reduction #set
Complete Sets of Reductions Modulo Associativity, Commutativity and Identity (TBB, GEP, RWW), pp. 29–44.
RTARTA-1989-BertlingG #optimisation
Completion-Time Optimization of Rewrite-Time Goal Solving (HB, HG), pp. 45–58.
RTARTA-1989-BundgenK
Computing Ground Reducability and Inductively Complete Positions (RB, WK), pp. 59–75.
RTARTA-1989-Christian #performance #summary
Fast Knuth-Bendix Completion: Summary (JC), pp. 551–555.
RTARTA-1989-Snyder #algorithm #equation #generative #performance #set
Efficient Ground Completion: An O(n log n) Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E (WS), pp. 419–433.
RTARTA-1989-ZhangK
Consider Only General Superpositions in Completion Procedures (HZ, DK), pp. 513–527.
SIGMODSIGMOD-1988-YuanC #algorithm #database #evaluation #null #query #relational
A Sound and Complete Query Evaluation Algorithm for Relational Databases with Null Values (LYY, DAC), pp. 74–81.
VLDBVLDB-1988-OrlandicP
Compact 0-Complete Trees (RO, JLP), pp. 372–381.
ESOPESOP-1988-BertlingGS #equation #named #specification
CEC: A System for the Completion of Conditional Equational Specifications (HB, HG, RS), pp. 378–379.
STOCSTOC-1988-Ben-OrGW #distributed #fault tolerance #theorem
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) (MBO, SG, AW), pp. 1–10.
ICALPICALP-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.
PPDPALP-1988-Bousdira #term rewriting
A Completion Procedure for Hierarchical Conditional Rewriting Systems (WB), pp. 93–107.
CADECADE-1988-AabyN #logic
Propositional Temporal Interval Logic is PSPACE Complete (AAA, KTN), pp. 218–237.
CADECADE-1988-Jacquet #synthesis #type system
Program Synthesis by Completion with Dependent Subtypes (PJ), pp. 550–562.
CSLCSL-1988-Dahlhaus #nondeterminism #polynomial
Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time (ED), pp. 52–62.
CSLCSL-1988-Wagner #automaton #logic #on the #problem #source code
On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs (HW), pp. 384–399.
ICLPJICSCP-1988-Chan88 #database
Constructive Negation Based on the Completed Database (DC), pp. 111–125.
ICLPJICSCP-1988-KempT88 #database #evaluation #query #top-down
Completeness of a Top-Down Query Evaluation Procedure for Stratified Databases (DBK, RWT), pp. 178–194.
ICLPJICSCP-1988-Kunen88 #database
Some Remarks on the Completed Database (KK), pp. 978–992.
ICLPJICSCP-1988-LoboMR88 #source code
Weak Completion Theory for Non-Horn Programs (JL, JM, AR), pp. 828–842.
ICLPJICSCP-1988-Moinard88
Pointwise Circumscription is Equivalent to Predicate Completion (Sometimes) (YM), pp. 1097–1105.
LICSLICS-1988-GallierSNP
Rigid E-Unification is NP-Complete (JHG, WS, PN, DAP), pp. 218–227.
LICSLICS-1988-Maher #algebra #axiom #finite #infinity
Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees (MJM), pp. 348–357.
LICSLICS-1988-Wand #named #type inference
Corrigendum: Complete Type Inference for Simple Objects (MW), p. 132.
PODSPODS-1987-AbiteboulV #database #specification
A Transcation Language Complete for Database Update and Specification (SA, VV), pp. 260–268.
STOCSTOC-1987-GoldreichMW #game studies #how #protocol #theorem
How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority (OG, SM, AW), pp. 218–229.
ICALPICALP-1987-Diekert #concurrent #on the #process
On the Knuth-Bendix Completion for Concurrent Processes (VD), pp. 42–53.
ICALPICALP-1987-HowellR #equivalence #reachability
Completeness Rules for Reachability, Containment, and Equivalence, with Respect to Conflict-Free Vector Replacement Systems (RRH, LER), pp. 509–520.
ICALPICALP-1987-Kuich #theorem
The Kleene and the Parikh Theorem in Complete Semirings (WK), pp. 212–225.
ICALPICALP-1987-Miyano #algorithm #problem
The Lexicographically First Maximal Subgraph Problems: P-Completeness and NC Algorithms (SM), pp. 425–434.
POPLPOPL-1987-LeivantF
Skinny and Fleshy Failures of Relative Completeness (DL, TF), pp. 246–252.
POPLPOPL-1987-WidomGS #network #proving
Completeness and Incompleteness of Trace-Based Network Proof Systems (JW, DG, FBS), pp. 27–38.
ICLPICLP-1987-Vieille87 #proving
A Database-Complete Proof Procedure Based on SLD-Resolution (LV), pp. 74–103.
LICSLICS-1987-Wand #type inference
Complete Type Inference for Simple Objects (MW), pp. 37–44.
RTARTA-1987-BachmairD #congruence
Completion for Rewriting Modulo a Congruence (LB, ND), pp. 192–203.
RTARTA-1987-GallierS
A General Complete E-Unification Procedure (JHG, WS), pp. 216–227.
RTARTA-1987-Kirchner #infinity #process #set
Schematization of Infinite Sets of Rewrite Rules. Application to the Divergence of Completion Processes (HK), pp. 180–191.
ICLPSLP-1987-Blair87 #logic programming
Canoncical Conservative Extensions of Logic Program Completions (HAB), pp. 154–161.
ICLPSLP-1987-Kale87 #logic programming #parallel
“Completeness” and “Full Parallelism” of Parallel Logic Programming Schemes (LVK), pp. 125–133.
ICLPSLP-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.
PODSPODS-1986-Hadzilacos #transaction
Deleting Completed Transactions (TH, MY), pp. 43–46.
VLDBVLDB-1986-Motro #query
Completeness Information and Its Application to Query Processing (AM), pp. 170–178.
ICALPICALP-1986-Fribourg #induction #strict
A Strong Restriction of the Inductive Completion Procedure (LF), pp. 105–115.
ICALPICALP-1986-HartmanisH #complexity
Complexity Classes Without Machines: On Complete Languages for UP (JH, LAH), pp. 123–135.
ICALPICALP-1986-HartmanisLY #complexity #set
Containment, Separation, Complete Sets, and Immunity of Complexity Classes (JH, ML, YY), pp. 136–145.
ICALPICALP-1986-MonienS
Min Cut is NP-Complete for Edge Weighted Trees (BM, IHS), pp. 265–274.
CADECADE-1986-Comon #anti #term rewriting
Sufficient Completeness, Term Rewriting Systems and “Anti-Unification” (HC), pp. 128–140.
CADECADE-1986-Dietrich #algebra #logic
Relating Resolution and Algebraic Completion for Horn Logic (RD), pp. 62–78.
CADECADE-1986-HsiangR #proving #theorem proving
A New Method for Establishing Refutational Completeness in Theorem Proving (JH, MR), pp. 141–152.
CADECADE-1986-KapurN #problem #set #unification
NP-Completeness of the Set Unification and Matching Problems (DK, PN), pp. 489–495.
ICLPICLP-1986-BarbutiM86 #logic programming #source code
Completeness of the SLDNF-resolution for a class of logic programs (RB, MM), pp. 600–614.
LICSLICS-1986-GermanCH #axiom
True Relative Completeness of an Axiom System for the Language L4 (Abridged) (SMG, EMC, JYH), pp. 11–25.
LICSLICS-1986-RoundsK #calculus #logic #representation
A Complete Logical Calculus for Record Structures Representing Linguistic Information (WCR, RTK), pp. 38–43.
DACDAC-1985-Joseph #approach
An expert systems approach to completing partially routed printed circuit boards (RLJ), pp. 523–528.
ICALPICALP-1985-Coppo #recursion #theorem
A Completeness Theorem for Recursively Defined Types (MC), pp. 120–129.
ICALPICALP-1985-HartmanisI #on the #problem
On Complete Problems for NP∩CoNP (JH, NI), pp. 250–259.
ICALPICALP-1985-Hortala-GonzalezR #hoare #logic #nondeterminism #source code #standard #theorem
Hoare’s Logic for Nondeterministic Regular Programs: A Nonstandard Completeness Theorem (MTHG, MRA), pp. 270–280.
ICALPICALP-1985-Stirling #composition #proving #set
A Complete Compositional Model Proof System for a Subset of CCS (CS), pp. 475–486.
ICALPICALP-1985-ZwiersRB #composition #concurrent #network
Compositionality and Concurrent Networks: Soundness and Completeness of a Proofsystem (JZ, WPdR, PvEB), pp. 509–519.
SIGIRSIGIR-1985-DAmoreM #theory and practice
One-Time Complete Indexing of Text: Theory and Practice (RJD, CPM), pp. 155–164.
ICSEICSE-1985-MillerS
Completely Monotone Regression Estimates of Software Failure Rates (DRM, AS), pp. 343–349.
RTARTA-1985-Buchberger #development
Basic Features and Development of the Critical-Pair/Completion Procedure (BB), pp. 1–45.
STOCSTOC-1984-BlumerBEHM #linear #set
Building a Complete Inverted File for a Set of Text Files in Linear Time (AB, JB, AE, DH, RMM), pp. 349–358.
STOCSTOC-1984-Levin #problem
Problems, Complete in “Average” Instance (LAL), p. 465.
ICALPICALP-1984-IzumiIH #algebra #axiom #regular expression
A Complete Axiom System for Algebra of Closed-Regular Expression (HI, YI, NH), pp. 260–269.
POPLPOPL-1984-Grabowski #logic #on the #programming
On Relative Completeness of Programming Logics (MG), pp. 258–261.
POPLPOPL-1984-JouannaudK #equation #set
Completion of a Set of Rules Modulo a Set of Equations (JPJ, HK), pp. 83–92.
CADECADE-1984-Kirchner84a #algorithm #data type #induction
A General Inductive Completion Algorithm and Application to Abstract Data Types (HK), pp. 282–302.
CADECADE-1984-Ursic #linear #problem
A Linear Characterization of NP-Complete Problems (SU), pp. 80–100.
ICLPILPC-1984-DershowitzJ84 #logic programming
Logic Programming by Completion (ND, NAJ), pp. 313–320.
ICLPILPC-1984-Sintzoff84 #bound #source code #strict
Bounded-Horizon Success-Complete Restriction of Inference Programs (MS), pp. 139–150.
ICALPICALP-1982-Gerth #ada #axiom #hoare
A Sound and Complete Hoare Axiomatization of the Ada-Rendevous (RG), pp. 252–264.
ICALPICALP-1982-GoralcikovaGK #bound #morphism #pseudo
A Boundary of Isomorphism Completeness in the Lattice of Semigroup Pseudovarieties (AG, PG, VK), pp. 292–299.
ICALPICALP-1982-Perrin
Completing Biprefix Codes (DP), pp. 397–406.
ICALPICALP-1982-Sipser #on the #set
On Relativization and the Existence of Complete Sets (MS), pp. 523–531.
POPLPOPL-1982-Henson #generative #interpreter #semantics
Completion Semantics, Interpreter Generation (MCH, RT), pp. 242–254.
POPLPOPL-1982-MeyerM #axiom #recursion #source code
Axiomatic Definability and Completeness for Recursive Programs (ARM, JCM), pp. 337–346.
ICLPILPC-1982-Blair82
The Undecidability of Two Completeness Notions for the “Negation as Failure” (HAB), pp. 164–168.
DACDAC-1981-Wada
A dogleg “optimal” channel router with completion enhancements (MMW), pp. 762–768.
STOCSTOC-1981-MonienS #problem
Bandwidth Constrained NP-Complete Problems (BM, IHS), pp. 207–217.
STOCSTOC-1981-PatersonRS #bound
Bounds on Minimax Edge Length for Complete Binary Trees (Extended Abstract) (MP, WLR, LS), pp. 293–299.
STOCSTOC-1981-UkkonenS #lalr #testing
LALR(k) Testing is PSPACE-Complete (EU, ESS), pp. 202–206.
ICSEICSE-1981-Howden #testing
Completeness Criteria for Testing Elementary Program Functions (WEH), pp. 235–243.
STOCSTOC-1980-Mirkowska #algorithm #axiom #bound #nondeterminism
Complete Axiomatization of Algorithmic Properties of Program Schemes with Bounded Nondeterministic Interpretations (GM), pp. 14–21.
STOCSTOC-1980-SadriU #axiom #database #dependence #relational #scalability
A Complete Axiomatization for a Large Class of Dependencies in Relational Databases (FS, JDU), pp. 117–122.
ICALPICALP-1980-EvenY #complexity
Cryptocomplexity and NP-Completeness (SE, YY), pp. 195–207.
POPLPOPL-1980-DemersD80a #design #principle
“Type-Completeness” as a Language Design Principle (AJD, JED), pp. 234–244.
CADECADE-1980-CoxP #algorithm
A Complete, Nonredundant Algorithm for Reversed Skolemization (PTC, TP), pp. 374–385.
CADECADE-1980-Noll #how
A Note on Resolution: How to Get Rid of Factoring without Loosing Completeness (HN), pp. 250–263.
DACDAC-1979-Oakes #design
The complete VLSI design system (MFO), pp. 452–460.
STOCSTOC-1979-Berman #axiom #semantics
A Completeness Technique for D-Axiomatizable Semantics (FB), pp. 160–166.
STOCSTOC-1979-GilbertLT #polynomial #problem
The Pebbling Problem is Complete in Polynomial Space (JRG, TL, RET), pp. 237–248.
STOCSTOC-1979-Valiant79a #algebra
Completeness Classes in Algebra (LGV), pp. 249–261.
STOCSTOC-1978-GurariI #problem
An NP-Complete Number-Theoretic Problem (EMG, OHI), pp. 205–215.
STOCSTOC-1978-KirkpatrickH #on the #problem
On the Completeness of a Generalized Matching Problem (DGK, PH), pp. 240–245.
STOCSTOC-1978-Yannakakis #problem
Node- and Edge-Deletion NP-Complete Problems (MY), pp. 253–264.
ICALPICALP-1978-Berman #complexity
Relationship Between Density and Deterministic Complexity of NP-Complete Languages (PB), pp. 63–71.
ICALPICALP-1978-Harel #logic #source code
Arithmetical Completeness in Logics of Programs (DH), pp. 268–288.
ICALPICALP-1978-Lingas #game studies #problem
A PSPACE Complete Problem Related to a Pebble Game (AL), pp. 300–321.
SIGMODSIGMOD-1977-BeeriFH #axiom #database #dependence #functional #multi
A Complete Axiomatization for Functional and Multivalued Dependencies in Database Relations (CB, RF, JHH), pp. 47–61.
STOCSTOC-1977-HarelMP #logic #source code
Computability and Completeness in Logics of Programs (Preliminary Report) (DH, ARM, VRP), pp. 261–268.
STOCSTOC-1977-HarelPS #axiom #deduction #proving #recursion #source code
A Complete Axiomatic System for Proving Deductions about Recursive Programs (DH, AP, JS), pp. 249–260.
POPLPOPL-1977-CherniavskyK #consistency #hoare #programming language #semantics
A Complete and Consistent Hoare Semantics for a Simple Programming Language (JCC, SNK), pp. 1–9.
STOCSTOC-1976-CardozaLM #commutative #exponential #petri net #problem
Exponential Space Complete Problems for Petri Nets and Commutative Semigroups: Preliminary Report (EC, RJL, ARM), pp. 50–54.
STOCSTOC-1976-GareyGJ #geometry #problem
Some NP-Complete Geometric Problems (MRG, RLG, DSJ), pp. 10–22.
STOCSTOC-1976-HartmanisB #morphism #on the #set
On Isomorphisms and Density of NP and Other Complete Sets (JH, LB), pp. 30–40.
STOCSTOC-1976-MandersA #polynomial #problem
NP-Complete Decision Problems for Quadratic Polynomials (KLM, LMA), pp. 23–29.
STOCSTOC-1976-Owicki #consistency #deduction #parallel #source code #verification
A Consistent and Complete Deductive System for the Verification of Parallel Programs (SSO), pp. 73–86.
STOCSTOC-1975-EvenT #combinator #polynomial #problem
a Combinatorial Problem which is Complete in Polynomial Space (SE, RET), pp. 66–71.
STOCSTOC-1974-GareyJS #problem
Some Simplified NP-Complete Problems (MRG, DSJ, LJS), pp. 47–63.
STOCSTOC-1974-JonesL #polynomial #problem
Complete Problems for Deterministic Polynomial Time (NDJ, WTL), pp. 40–46.
ICALPICALP-1974-ShamirB
Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages (ES, CB), pp. 27–33.
STOCSTOC-1973-Sethi #problem
Complete Register Allocation Problems (RS), pp. 182–195.
SOSPSOSP-1973-Ullman #polynomial #problem #scheduling
Polynomial Complete Scheduling Problems (JDU), pp. 96–101.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.