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:
higher (477)
first (293)
logic (289)
program (169)
model (163)

Stem order$ (all stems)

1669 papers:

WICSAWICSA-2015-BangM #design #detection #higher-order
Proactive Detection of Higher-Order Software Design Conflicts (JYB, NM), pp. 155–164.
CASECASE-2015-HandokoL #order #performance #privacy
Efficient order sharing with privacy preservation via double auction with split delivery (SDH, HCL), pp. 69–74.
CASECASE-2015-LinSPV #modelling #order
A SysML profile supporting change orders in model driven engineering (HYL, SS, NP, VV), pp. 1054–1059.
CASECASE-2015-XuZLW #order #probability #scheduling #throughput
Stochastic customer order scheduling to maximize throughput (XX, YZ, HL, MW), pp. 665–670.
DATEDATE-2015-DoumaAP #estimation #execution #performance #precise
Fast and precise cache performance estimation for out-of-order execution (RD, SA, ADP), pp. 1132–1137.
PODSPODS-2015-BeameBGS #first-order #symmetry
Symmetric Weighted First-Order Model Counting (PB, GVdB, EG, DS), pp. 313–328.
SIGMODSIGMOD-2015-JiZJNHF #data type #execution #quality #query
Quality-Driven Continuous Query Execution over Out-of-Order Data Streams (YJ, HZ, ZJ, AN, GH, CF), pp. 889–894.
SIGMODSIGMOD-2015-MavroforakisCOK #composition #encryption #revisited
Modular Order-Preserving Encryption, Revisited (CM, NC, AO, GK, RC), pp. 763–777.
VLDBVLDB-2015-AkidauBCCFLMMPS #approach #bound #correctness #data flow #latency
The Dataflow Model: A Practical Approach to Balancing Correctness, Latency, and Cost in Massive-Scale, Unbounded, Out-of-Order Data Processing (TA, RB, CC, SC, RFM, RL, SM, DM, FP, ES, SW), pp. 1792–1803.
VLDBVLDB-2015-KimBPIMR #agile #visualisation
Rapid Sampling for Visualizations with Ordering Guarantees (AK, EB, AGP, PI, SM, RR), pp. 521–532.
FoSSaCSFoSSaCS-2015-SchubertUZ #first-order #logic #on the
On the Mints Hierarchy in First-Order Intuitionistic Logic (AS, PU, KZ), pp. 451–465.
TACASTACAS-2015-BransenBCD #attribute grammar #order #scheduling #using
Linearly Ordered Attribute Grammar Scheduling Using SAT-Solving (JB, LTvB, KC, AD), pp. 289–303.
ICPCICPC-2015-BusjahnBBCPSST #eye tracking #linear #order
Eye movements in code reading: relaxing the linear order (TB, RB, AB, MEC, JHP, CS, BS, ST), pp. 255–265.
PEPMPEPM-2015-AsadaS0 #first-order #functional #refinement #relational #source code #verification
Verifying Relational Properties of Functional Programs by First-Order Refinement (KA, RS, NK), pp. 61–72.
PEPMPEPM-2015-BinsbergenBD #attribute grammar #automation #dependence #order
Linearly Ordered Attribute Grammars: with Automatic Augmenting Dependency Selection (LTvB, JB, AD), pp. 49–60.
PEPMPEPM-2015-BransenDS #evaluation #higher-order #incremental
Incremental Evaluation of Higher Order Attributes (JB, AD, SDS), pp. 39–48.
PEPMPEPM-2015-KootH #analysis #exception #functional #higher-order #semantics #strict #type system
Type-based Exception Analysis for Non-strict Higher-order Functional Languages with Imprecise Exception Semantics (RK, JH), pp. 127–138.
PEPMPEPM-2015-VerstoepH #analysis #functional #higher-order #strict
Polyvariant Cardinality Analysis for Non-strict Higher-order Functional Languages: Brief Announcement (HV, JH), pp. 139–142.
PLDIPLDI-2015-NguyenH #higher-order #source code
Relatively complete counterexamples for higher-order programs (PCN, DVH), pp. 446–456.
PLDIPLDI-2015-ZhangKW #memory management #modelling #partial order #reduction
Dynamic partial order reduction for relaxed memory models (NZ, MK, CW), pp. 250–259.
STOCSTOC-2015-KesselheimKN #order #problem
Secretary Problems with Non-Uniform Arrival Order (TK, RDK, RN), pp. 879–888.
STOCSTOC-2015-KorulaMZ #online #order #random
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (NK, VSM, MZ), pp. 889–898.
DLTDLT-2015-OttoK #automaton #order
Deterministic Ordered Restarting Automata that Compute Functions (FO, KK), pp. 401–412.
ICALPICALP-v2-2015-ColcombetS #linear #order #quantifier #set
Limited Set quantifiers over Countable Linear Orderings (TC, AVS), pp. 146–158.
ICALPICALP-v2-2015-MichalewskiM #higher-order #logic #monad #quantifier
Baire Category Quantifier in Monadic Second Order Logic (HM, MM), pp. 362–374.
LATALATA-2015-JanickiKKM #order #subclass
Order Structures for Subclasses of Generalised Traces (RJ, JK, MK, LM), pp. 689–700.
LATALATA-2015-LeonM #partial order #set
Building Bridges Between Sets of Partial Orders (HPdL, AM), pp. 145–160.
FMFM-2015-SchmittU #axiom #first-order #logic
Axiomatization of Typed First-Order Logic (PHS, MU), pp. 470–486.
SEFMSEFM-2015-KnapikNP #generative #order
Generating None-Plans in Order to Find Plans (MK, AN, WP), pp. 310–324.
ICFPICFP-2015-AvanziniLM #complexity #first-order #functional #higher-order #source code
Analysing the complexity of functional programs: higher-order meets first-order (MA, UDL, GM), pp. 152–164.
ICFPICFP-2015-Dunfield #morphism #polymorphism
Elaborating evaluation-order polymorphism (JD), pp. 256–268.
ICFPICFP-2015-KeilT #contract #higher-order
Blame assignment for higher-order contracts with intersection and union (MK, PT), pp. 375–386.
ICFPICFP-2015-NeisHKMDV #compilation #higher-order #imperative #named
Pilsner: a compositionally verified compiler for a higher-order imperative language (GN, CKH, JOK, CM, DD, VV), pp. 166–178.
CSCWCSCW-2015-RedaelliC #coordination
Coordination-Artifacts Suiting: When Plans are in the Midst of Ordering Systems (IR, AC), pp. 165–178.
ICMLICML-2015-DasBB #modelling #order #parametricity
Ordered Stick-Breaking Prior for Sequential MCMC Inference of Bayesian Nonparametric Models (MKD, TB, CB), pp. 550–559.
ICMLICML-2015-TraskGR #modelling #order #scalability #word
Modeling Order in Neural Word Embeddings at Scale (AT, DG, MR), pp. 2266–2275.
ICMLICML-2015-ZhouZS #analysis #bound #convergence #fault #first-order
ℓ₁,p-Norm Regularization: Error Bounds and Convergence Rate Analysis of First-Order Methods (ZZ, QZ, AMCS), pp. 1501–1510.
KDDKDD-2015-CaiTFJH #higher-order #mining #named #performance
Facets: Fast Comprehensive Mining of Coevolving High-order Time Series (YC, HT, WF, PJ, QH), pp. 79–88.
RecSysRecSys-2015-KarSA #linear #online #video
Selection and Ordering of Linear Online Video Ads (WK, VS, PA), pp. 203–210.
SIGIRSIGIR-2015-MalherbeCB #categorisation #order #performance
Bringing Order to the Job Market: Efficient Job Offer Categorization in E-Recruitment (EM, MC, AB), pp. 1101–1104.
ECOOPECOOP-2015-KeilT #contract #higher-order #named
TreatJS: Higher-Order Contracts for JavaScripts (MK, PT), pp. 28–51.
OOPSLAOOPSLA-2015-OuD #automation #memory management #named #order #parametricity
AutoMO: automatic inference of memory order parameters for C/C++11 (PO, BD), pp. 221–240.
PPDPPPDP-2015-StievenartNMR #abstract interpretation #concurrent #debugging #detection #higher-order #source code
Detecting concurrency bugs in higher-order programs through abstract interpretation (QS, JN, WDM, CDR), pp. 232–243.
POPLPOPL-2015-BartheGAHRS #approximate #design #difference #higher-order #privacy #refinement #relational
Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy (GB, MG, EJGA, JH, AR, PYS), pp. 55–68.
ICSEICSE-v1-2015-MilicevicNKJ #constraints #higher-order #relational #theorem proving
Alloy*: A General-Purpose Higher-Order Relational Constraint Solver (AM, JPN, EK, DJ), pp. 609–619.
CGOCGO-2015-LeissaKH #graph #higher-order #representation
A graph-based higher-order intermediate representation (RL, MK, SH), pp. 202–212.
PPoPPPPoPP-2015-ThomsonD #concurrent #lazy evaluation #partial order #reduction #testing
The lazy happens-before relation: better partial-order reduction for systematic concurrency testing (PT, AFD), pp. 259–260.
CADECADE-2015-GorznyP #first-order #proving #towards
Towards the Compression of First-Order Resolution Proofs by Lowering Unit Clauses (JG, BWP), pp. 356–366.
CADECADE-2015-Libal #higher-order #unification
Regular Patterns in Second-Order Unification (TL), pp. 557–571.
CADECADE-2015-Plaisted #automation #deduction #first-order
History and Prospects for First-Order Automated Deduction (DAP), pp. 3–28.
CAVCAV-2015-KuwaharaSU0 #abstraction #functional #higher-order #source code #termination
Predicate Abstraction and CEGAR for Disproving Termination of Higher-Order Functional Programs (TK, RS, HU, NK), pp. 287–303.
CSLCSL-2015-Berardi #comprehension #higher-order #induction
Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness (SB), pp. 343–358.
CSLCSL-2015-BovaM #finite #first-order #query
First-Order Queries on Finite Abelian Groups (SB, BM), pp. 41–59.
CSLCSL-2015-Charatonik0 #linear #logic #order
Two-variable Logic with Counting and a Linear Order (WC, PW), pp. 631–647.
CSLCSL-2015-ClementeL #analysis #automaton #first-order #reachability
Reachability Analysis of First-order Definable Pushdown Systems (LC, SL), pp. 244–259.
CSLCSL-2015-GrelloisM #higher-order #linear #logic #model checking #relational #semantics
Relational Semantics of Linear Logic and Higher-order Model Checking (CG, PAM), pp. 260–276.
CSLCSL-2015-MogaveroP #first-order #logic
Binding Forms in First-Order Logic (FM, GP), pp. 648–665.
CSLCSL-2015-Paperman #first-order #logic
Finite-Degree Predicates and Two-Variable First-Order Logic (CP), pp. 616–630.
CSLCSL-2015-SalvatiW #behaviour #higher-order #source code
A Model for Behavioural Properties of Higher-order Programs (SS, IW), pp. 229–243.
ICLPICLP-2015-Hallen #data mining #higher-order #logic #mining #specification
Higher Order Support in Logic Specification Languages for Data Mining Applications (MvdH).
LICSLICS-2015-EnqvistSV #algebra #bisimulation #higher-order #logic #monad
Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras (SE, FS, YV), pp. 353–365.
LICSLICS-2015-GradelPSK #first-order #polynomial
Characterising Choiceless Polynomial Time with First-Order Interpretations (EG, WP, SS, LK), pp. 677–688.
LICSLICS-2015-Ong #bibliography #higher-order #model checking #perspective
Higher-Order Model Checking: An Overview (LO), pp. 1–15.
ASEASE-2014-HarmanJMP #effectiveness #empirical #higher-order #performance
Angels and monsters: an empirical investigation of potential test effectiveness and efficiency improvement from strongly subsuming higher order mutation (MH, YJ, PRM, MP), pp. 397–408.
ASEASE-2014-KusanoW #abstraction #optimisation #partial order #reduction
Assertion guided abstraction: a cooperative optimization for dynamic partial order reduction (MK, CW), pp. 175–186.
DACDAC-2014-LeeL #embedded #runtime
Area-Efficient Event Stream Ordering for Runtime Observability of Embedded Systems (JCL, RL), p. 6.
DATEDATE-2014-BanagaayaAST #network #order #reduction
Implicit index-aware model order reduction for RLC/RC networks (NB, GA, WHAS, CT), pp. 1–6.
DATEDATE-2014-MurilloWCLA #automation #concurrent #constraints #debugging #detection
Automatic detection of concurrency bugs through event ordering constraints (LGM, SW, JC, RL, GA), pp. 1–6.
DATEDATE-2014-SongDY #analysis #bound #multi #order #parametricity #performance #reduction
Zonotope-based nonlinear model order reduction for fast performance bound analysis of analog circuits with multiple-interval-valued parameter variations (YS, SMPD, HY), pp. 1–6.
DocEngDocEng-2014-FerilliGRE #detection #order
Abstract argumentation for reading order detection (SF, DG, DR, FE), pp. 45–48.
PODSPODS-2014-DurandSS #database #first-order #query
Enumerating answers to first-order queries over databases of low degree (AD, NS, LS), pp. 121–131.
SIGMODSIGMOD-2014-MoerkotteDMNB #order
Exploiting ordered dictionaries to efficiently construct histograms with q-error guarantees in SAP HANA (GM, DD, NM, AN, AB), pp. 361–372.
SIGMODSIGMOD-2014-ZhuLWX #approach #graph #order #query #reachability #scalability
Reachability queries on large dynamic graphs: a total order approach (ADZ, WL, SW, XX), pp. 1323–1334.
ESOPESOP-2014-CockxPD #independence #similarity
Overlapping and Order-Independent Patterns — Definitional Equality for All (JC, FP, DD), pp. 87–106.
ESOPESOP-2014-KuwaharaTU0 #automation #functional #higher-order #source code #termination #verification
Automatic Termination Verification for Higher-Order Functional Programs (TK, TT, HU, NK), pp. 392–411.
ESOPESOP-2014-YoshimizuHFL #higher-order #metric #proving #quantum
Measurements in Proof Nets as Higher-Order Quantum Circuits (AY, IH, CF, UDL), pp. 371–391.
FoSSaCSFoSSaCS-2014-KobayashiIT #higher-order
Unsafe Order-2 Tree Languages Are Context-Sensitive (NK, KI, TT), pp. 149–163.
WRLAWRLA-2014-LucasM #order #termination
Strong and Weak Operational Termination of Order-Sorted Rewrite Theories (SL, JM), pp. 178–194.
ICSMEICSME-2014-SpasojevicLN #documentation
Overthrowing the Tyranny of Alphabetical Ordering in Documentation Systems (BS, ML, ON), pp. 511–515.
PEPMPEPM-J-2013-WeijersHH14 #fault #higher-order #polymorphism #security
Security type error diagnosis for higher-order, polymorphic languages (JW, JH, SH), pp. 200–218.
PLDIPLDI-2014-CaiGRO #difference #formal method #higher-order #λ-calculus
A theory of changes for higher-order languages: incrementalizing λ-calculi by static differentiation (YC, PGG, TR, KO), p. 17.
STOCSTOC-2014-ForbesSS #algebra #branch #multi #order #set #source code
Hitting sets for multilinear read-once algebraic branching programs, in any order (MAF, RS, AS), pp. 867–875.
STOCSTOC-2014-GroheKS #first-order #graph
Deciding first-order properties of nowhere dense graphs (MG, SK, SS), pp. 89–98.
STOCSTOC-2014-KesselheimTRV #online
Primal beats dual on online packing LPs in the random-order model (TK, KR, AT, BV), pp. 303–312.
DLTDLT-J-2013-AtigKS14 #multi #order
Adjacent Ordered Multi-Pushdown Systems (MFA, KNK, PS), pp. 1083–1096.
ICALPICALP-v2-2014-Jancar #bisimulation #equivalence #first-order
Bisimulation Equivalence of First-Order Grammars (PJ), pp. 232–243.
ICALPICALP-v2-2014-JungLGS #first-order #logic #probability
Monodic Fragments of Probabilistic First-Order Logic (JCJ, CL, SG, LS), pp. 256–267.
ICALPICALP-v2-2014-PlaceZ #first-order #quantifier #word
Going Higher in the First-Order Quantifier Alternation Hierarchy on Words (TP, MZ), pp. 342–353.
LATALATA-2014-GantyR #order #verification
Ordered Counter-Abstraction — Refinable Subword Relations for Parameterized Verification (PG, AR), pp. 396–408.
LATALATA-2014-OttoM #automaton #order
Extended Two-Way Ordered Restarting Automata for Picture Languages (FO, FM), pp. 541–552.
FMFM-2014-ZeydaSCS #composition #higher-order #object-oriented
A Modular Theory of Object Orientation in Higher-Order UTP (FZ, TLVLS, AC, AS), pp. 627–642.
SEFMSEFM-2014-DobrikovL #model checking #optimisation #partial order #reduction #using
Optimising the ProB Model Checker for B Using Partial Order Reduction (ID, ML), pp. 220–234.
ICFPICFP-2014-BergstromFLRS #effectiveness #higher-order #optimisation
Practical and effective higher-order optimizations (LB, MF, ML, JHR, NS), pp. 81–93.
ICFPICFP-2014-KakiJ #analysis #framework #higher-order #relational
A relational framework for higher-order shape analysis (GK, SJ), pp. 311–324.
ICFPICFP-2014-McBride #how #order
How to keep your neighbours in order (CTM), pp. 297–309.
ICFPICFP-2014-Winograd-CortH #first-order #how
Settable and non-interfering signal functions for FRP: how a first-order switch is more than enough (DWC, PH), pp. 213–225.
IFLIFL-2014-FredrikssonGW #higher-order #towards
Towards native higher-order remote procedure calls (OF, DRG, BW), p. 10.
GT-VMTGT-VMT-2014-DeckwerthV #constraints #generative #graph transformation #higher-order
Generating Preconditions from Graph Constraints by Higher Order Graph Transformation (FD, GV).
ICGTICGT-2014-PoskittP #graph #higher-order #monad #source code #verification
Verifying Monadic Second-Order Properties of Graph Programs (CMP, DP), pp. 33–48.
HCIDUXU-ELAS-2014-Trocka-Leszczynska #order
The Contemporary Rural Landscape in the South-Western Region of Poland (Sudeten Region) — A Search for Spatial Order (ETL), pp. 470–481.
HCILCT-NLE-2014-PaisT #deduction #first-order #logic #novel #proving
Novel Didactic Proof Assistant for First-Order Logic Natural Deduction (JP, AT), pp. 441–451.
ICMLICML-c1-2014-MeiZZ #first-order #logic #modelling #robust
Robust RegBayes: Selectively Incorporating First-Order Logic Domain Knowledge into Bayesian Models (SM, JZ, JZ), pp. 253–261.
ICMLICML-c2-2014-LiZ #higher-order #learning #problem
High Order Regularization for Semi-Supervised Learning of Structured Output Problems (YL, RSZ), pp. 1368–1376.
ICMLICML-c2-2014-RippelGA #learning #order
Learning Ordered Representations with Nested Dropout (OR, MAG, RPA), pp. 1746–1754.
ICPRICPR-2014-BuiNLYK #detection #order #statistics #using
Boosted Stable Path for Staff-Line Detection Using Order Statistic Downscaling and Coarse-to-Fine Technique (HNB, ISN, GL, HJY, SHK), pp. 522–526.
ICPRICPR-2014-GhoraiC #algorithm #composition #higher-order #image #using
An Image Inpainting Algorithm Using Higher Order Singular Value Decomposition (MG, BC), pp. 2867–2872.
ICPRICPR-2014-LeiYL #order #recognition #representation
Local Gradient Order Pattern for Face Representation and Recognition (ZL, DY, SZL), pp. 387–392.
ICPRICPR-2014-LiYLMDWX #higher-order #multi
Multiple-Output Regression with High-Order Structure Information (CL, LY, QL, FM, WD, YW, JX), pp. 3868–3873.
KDDKDD-2014-PurushothamMKO #feature model #higher-order #interactive #learning #modelling
Factorized sparse learning models with interpretable high order feature interactions (SP, MRM, CCJK, RO), pp. 552–561.
KEODKEOD-2014-Kraines #ontology #order #question #semantics #similarity
Can SKOS Ontologies Improve the Accuracy of Measuring Semantic Similarity of Purchase Orders? (SBK), pp. 248–255.
KRKR-2014-AsuncionZZ #first-order #logic programming #semantics #source code
Logic Programs with Ordered Disjunction: First-Order Semantics and Expressiveness (VA, YZ, HZ).
KRKR-2014-BroeckMD #first-order
Skolemization for Weighted First-Order Model Counting (GVdB, WM, AD).
KRKR-2014-CharalambidisR #higher-order #logic programming
Constructive Negation in Extensional Higher-Order Logic Programming (AC, PR).
KRKR-2014-Lin #first-order #formal method #linear #logic #source code
A Formalization of Programs in First-Order Logic with a Discrete Linear Order (FL).
KRKR-2014-Lin14a #axiom #first-order #higher-order #induction #semantics
A First-Order Semantics for Golog and ConGolog under a Second-Order Induction Axiom for Situations (FL).
KRKR-2014-Zhou #first-order #logic #revisited
First-Order Default Logic Revisited (YZ).
RecSysRecSys-2014-GingerichA
Content ordering based on commuting patterns (TG, OA), pp. 365–366.
SIGIRSIGIR-2014-ParkS #detection #higher-order #modelling #probability
Second order probabilistic models for within-document novelty detection in academic articles (LAFP, SS), pp. 1103–1106.
PPDPPPDP-2014-StulovaMH #debugging #higher-order #source code
Assertion-based Debugging of Higher-Order (C)LP Programs (NS, JFM, MVH), pp. 225–235.
POPLPOPL-2014-AbdullaAJS #partial order #reduction
Optimal dynamic partial order reduction (PAA, SA, BJ, KFS), pp. 373–384.
POPLPOPL-2014-Birkedal #composition #concurrent #higher-order #imperative #reasoning #source code
Modular reasoning about concurrent higher-order imperative programs (LB), pp. 1–2.
POPLPOPL-2014-LagoSA #functional #higher-order #induction #on the #probability #source code
On coinductive equivalences for higher-order probabilistic functional programs (UDL, DS, MA), pp. 297–308.
POPLPOPL-2014-PaganiSV #higher-order #quantum #semantics
Applying quantitative semantics to higher-order quantum computing (MP, PS, BV), pp. 647–658.
POPLPOPL-2014-RamsayNO #abstraction #approach #higher-order #model checking #refinement
A type-directed abstraction refinement approach to higher-order model checking (SJR, RPN, CHLO), pp. 61–72.
POPLPOPL-2014-SergeyVJ #analysis #composition #higher-order #theory and practice
Modular, higher-order cardinality analysis in theory and practice (IS, DV, SLPJ), pp. 335–348.
SLESLE-J-2012-KrishnanW #analysis #attribute grammar #composition #higher-order #termination
Monolithic and modular termination analyses for higher-order attribute grammars (LK, EVW), pp. 511–526.
ASPLOSASPLOS-2014-BornholtMM #first-order #named #nondeterminism
Uncertain: a first-order type for uncertain data (JB, TM, KSM), pp. 51–66.
HPCAHPCA-2014-GopeL
Atomic SC for simple in-order processors (DG, MHL), pp. 404–415.
PPoPPPPoPP-2014-DrachslerVY #concurrent #logic
Practical concurrent binary search trees via logical ordering (DD, MTV, EY), pp. 343–356.
CAVCAV-2014-HansenLLN0 #abstraction #automaton #partial order #reduction #women
Diamonds Are a Girl’s Best Friend: Partial Order Reduction for Timed Automata with Abstractions (HH, SWL, YL, TKN, JS), pp. 391–406.
CAVCAV-2014-LeGQC #analysis #higher-order
Shape Analysis via Second-Order Bi-Abduction (QLL, CG, SQ, WNC), pp. 52–68.
CAVCAV-2014-Voronkov #architecture #first-order #named #proving #theorem proving
AVATAR: The Architecture for First-Order Theorem Provers (AV), pp. 696–710.
ICLPICLP-J-2014-CharalambidisER #higher-order #logic programming #semantics
Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation (AC, , PR), pp. 725–737.
IJCARIJCAR-2014-Lindblad #calculus #higher-order #logic
A Focused Sequent Calculus for Higher-Order Logic (FL), pp. 61–75.
IJCARIJCAR-2014-Otten #first-order #logic #named #proving
MleanCoP: A Connection Prover for First-Order Modal Logic (JO), pp. 269–276.
LICSLICS-CSL-2014-BernardoSV #higher-order #interactive #on the #power of
On the discriminating power of passivation and higher-order interaction (MB, DS, VV), p. 10.
LICSLICS-CSL-2014-BovaGS #logic #model checking #order #set
Model checking existential logic on partially ordered sets (SB, RG, SS), p. 10.
LICSLICS-CSL-2014-Chen #first-order #query #set
The tractability frontier of graph-like first-order query sets (HC), p. 9.
LICSLICS-CSL-2014-Mahboubi #order #proving #theorem
Computer-checked mathematics: a formal proof of the odd order theorem (AM), p. 1.
LICSLICS-CSL-2014-PlaceZ #first-order #logic #regular expression
Separating regular languages with first-order logic (TP, MZ), p. 10.
LICSLICS-CSL-2014-TsukadaO #composition #game studies #higher-order #model checking
Compositional higher-order model checking via ω-regular games over Böhm trees (TT, CHLO), p. 10.
LICSLICS-CSL-2014-Williams #first-order #graph #performance
Faster decision of first-order graph properties (RW), p. 6.
RTARTA-TLCA-2014-FuhsK #first-order
First-Order Formative Rules (CF, CK), pp. 240–256.
CASECASE-2013-IsmailH #3d #anti #higher-order #using
Trajectory tracking and anti-sway control of three-dimensional offshore boom cranes using second-order sliding modes (RMTRI, QPH), pp. 996–1001.
CASECASE-2013-SinhaK #constraints #policy
Production and subcontracting policies for assemble-to-order systems with service level constraints (AKS, AK), pp. 570–575.
CASECASE-2013-WangSS #novel #order #polynomial #problem #scheduling
A novel quadratic formulation for customer order scheduling problem (LW, ZS, LS), pp. 576–580.
DATEDATE-2013-ChenD #parallel #predict #simulation #using
Optimized out-of-order parallel discrete event simulation using predictions (WC, RD), pp. 3–8.
DATEDATE-2013-MohanramWI #certification #compilation #memory management #named #order #reduction
Mempack: an order of magnitude reduction in the cost, risk, and time for memory compiler certification (KM, MW, SI), pp. 1490–1493.
DRRDRR-2013-TaghvaPM #higher-order #markov #modelling
Post processing with first- and second-order hidden Markov models (KT, SP, SM).
ICDARICDAR-2013-ClausnerPA #documentation #evaluation #order #recognition
The Significance of Reading Order in Document Recognition and Its Evaluation (CC, SP, AA), pp. 688–692.
ICDARICDAR-2013-LiPXW #analysis #consistency #online #order #verification
A Stroke Order Verification Method for On-Line Handwritten Chinese Characters Based on Tempo-spatial Consistency Analysis (RL, LP, EX, NW), pp. 999–1003.
ICDARICDAR-2013-StammLD #analysis #approach #documentation #multi #partial order
Continuous Partial-Order Planning for Multichannel Document Analysis: A Process-Driven Approach (KS, ML, AD), pp. 626–630.
PODSPODS-2013-KazanaS #bound #first-order #query
Enumeration of first-order queries on classes of structures with bounded expansion (WK, LS), pp. 297–308.
VLDBVLDB-2013-BakibayevKOZ #database
Aggregation and Ordering in Factorised Databases (NB, TK, DO, JZ), pp. 1990–2001.
VLDBVLDB-2013-SzlichtaGGZ #complexity #dependence #order
Expressiveness and Complexity of Order Dependencies (JS, PG, JG, CZ), pp. 1858–1869.
VLDBVLDB-2014-SalloumDST13 #data flow #online
Online Ordering of Overlapping Data Sources (MS, XLD, DS, VJT), pp. 133–144.
ITiCSEITiCSE-2013-KyrilovN #assessment #automation #first-order #information management #logic #representation
Automatic formative assessment of exercises on knowledge representation in first-order logic (AK, DCN), p. 343.
ESOPESOP-2013-KobayashiI #higher-order #model checking #recursion #source code
Model-Checking Higher-Order Programs with Recursive Types (NK, AI), pp. 431–450.
ESOPESOP-2013-ToninhoCP #higher-order #integration #monad #process
Higher-Order Processes, Functions, and Sessions: A Monadic Integration (BT, LC, FP), pp. 350–369.
FoSSaCSFoSSaCS-2013-BauerHK #higher-order #monad #on the #parametricity
On Monadic Parametricity of Second-Order Functionals (AB, MH, AK), pp. 225–240.
FoSSaCSFoSSaCS-2013-Czajka #higher-order #logic #recursion
Partiality and Recursion in Higher-Order Logic (LC0), pp. 177–192.
PEPMPEPM-2013-SatoUK #higher-order #model checking #scalability #source code #towards
Towards a scalable software model checker for higher-order programs (RS, HU, NK), pp. 53–62.
PEPMPEPM-2013-WeijersHH #fault #higher-order #polymorphism #security
Security type error diagnosis for higher-order, polymorphic languages (JW, JH, SH), pp. 3–12.
PLDIPLDI-2013-SwamyWSCL #higher-order #monad #source code #verification
Verifying higher-order programs with the dijkstra monad (NS, JW, CS, JC, BL), pp. 387–398.
STOCSTOC-2013-KwokLLGT #algorithm #analysis #clustering #difference #higher-order
Improved Cheeger’s inequality: analysis of spectral partitioning algorithms through higher order spectral gap (TCK, LCL, YTL, SOG, LT), pp. 11–20.
DLTDLT-2013-AtigKS #multi #order
Adjacent Ordered Multi-Pushdown Systems (MFA, KNK, PS), pp. 58–69.
DLTDLT-2013-Shur #anti #finite #order
Languages with a Finite Antidictionary: Growth-Preserving Transformations and Available Orders of Growth (AMS), pp. 445–457.
ICALPICALP-v1-2013-BohlerCKLPZ #complexity #diagrams #higher-order #on the
On the Complexity of Higher Order Abstract Voronoi Diagrams (CB, PC, RK, CHL, EP, MZ), pp. 208–219.
LATALATA-2013-Ong #automaton #higher-order #model checking #recursion
Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking (LO), pp. 13–41.
ICFPICFP-2013-AxelssonC #functional #higher-order #source code #syntax #using
Using circular programs for higher-order syntax: functional pearl (EA, KC), pp. 257–262.
ICFPICFP-2013-BroadbentCHS #approach #higher-order #named #verification
C-SHORe: a collapsible approach to higher-order verification (CHB, AC, MH, OS), pp. 13–24.
ICFPICFP-2013-HidakaAHKN #graph #order #query #recursion
Structural recursion for querying ordered graphs (SH, KA, ZH, HK, KN), pp. 305–318.
ICFPICFP-2013-Krishnaswami #functional #higher-order #programming
Higher-order functional reactive programming without spacetime leaks (NRK), pp. 221–232.
ICFPICFP-2013-TuronDB #concurrent #higher-order #hoare #logic #reasoning #refinement
Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency (AT, DD, LB), pp. 377–390.
GCMGCM-J-2012-Radke #graph #higher-order #monad
HR* Graph Conditions Between Counting Monadic Second-Order and Second-Order Graph Formulas (HR).
HCIDHM-HB-2013-ZhaoLZ #analysis #higher-order #statistics
Higher Order Statistics Analyses Based on the Mathematical Model of Surface Electromyography (YZ, DL, JZ), pp. 402–408.
ICMLICML-c3-2013-IshtevaPS #order #using
Unfolding Latent Tree Structures using 4th Order Tensors (MI, HP, LS), pp. 316–324.
ICMLICML-c3-2013-Mairal #first-order #optimisation
Optimization with First-Order Surrogate Functions (JM), pp. 783–791.
KDIRKDIR-KMIS-2013-LitvakM #named #order
SmartNews: Bringing Order into Comments Chaos (ML, LM), pp. 191–196.
RecSysRecSys-2013-WestonYW #learning #rank #recommendation #statistics
Learning to rank recommendations with the k-order statistic loss (JW, HY, RJW), pp. 245–248.
SEKESEKE-2013-ChaoY #analysis #order #reachability #scalability
A Best Method to Synthesize Very Large K-th Order Systems without Reachability Analysis (S) (DYC, THY), pp. 417–420.
SEKESEKE-2013-WangKWN #case study #feature model #first-order #metric #statistics
A Study on First Order Statistics-Based Feature Selection Techniques on Software Metric Data (HW, TMK, RW, AN), pp. 467–472.
SIGIRSIGIR-2013-JameelL #order #segmentation #topic #word
An unsupervised topic segmentation model incorporating word order (SJ, WL), pp. 203–212.
ECOOPECOOP-2013-MaierO #higher-order #incremental #programming
Higher-Order Reactive Programming with Incremental Lists (IM, MO), pp. 707–731.
ECOOPECOOP-2013-SvendsenBP #case study #composition #concurrent #higher-order #library #named #specification
Joins: A Case Study in Modular Specification of a Concurrent Reentrant Higher-Order Library (KS, LB, MJP), pp. 327–351.
OOPSLAOOPSLA-2013-CoonsMM #bound #partial order #reduction
Bounded partial-order reduction (KEC, MM, KSM), pp. 833–848.
PPDPPPDP-2013-Garcia-PerezNM #order #semantics
Deriving the full-reducing Krivine machine from the small-step operational semantics of normal order (ÁGP, PN, JJMN), pp. 85–96.
PPDPPPDP-2013-WangCGN #higher-order #reasoning #relational #specification
Reasoning about higher-order relational specifications (YW, KC, AG, GN), pp. 157–168.
PPDPPPDP-2013-YamadaKS #order #polynomial #recursion
Unifying the Knuth-Bendix, recursive path and polynomial orders (AY, KK, TS), pp. 181–192.
POPLPOPL-2013-Gonthier #order #proving #theorem
Engineering mathematics: the odd order theorem proof (GG), pp. 1–2.
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-Fernandez-RoperoPCP #process #refactoring
Assessing the best-order for business process model refactoring (MFR, RPC, JACL, MP), pp. 1397–1402.
ESEC-FSEESEC-FSE-2013-LiRSY #constraints #higher-order #invariant
Second-order constraints in dynamic invariant inference (KL, CR, YS, MY), pp. 103–113.
SLESLE-2013-SoderbergH #attribute grammar #higher-order
Circular Higher-Order Reference Attribute Grammars (ES, GH), pp. 302–321.
ASPLOSASPLOS-2013-McFarlinTZ #performance #question
Discerning the dominant out-of-order performance advantage: is it speculation or dynamism? (DSM, CT, CBZ), pp. 241–252.
ASPLOSASPLOS-2013-XiangDLB #higher-order #locality #named
HOTL: a higher order theory of locality (XX, CD, HL, BB), pp. 343–356.
HPDCHPDC-2013-YinLBGN #dataset #order #performance #pipes and filters #using
Efficient analytics on ordered datasets using MapReduce (JY, YL, MB, LG, AN), pp. 125–126.
SOSPSOSP-2013-WeissHAA #game studies #named #parallel #thread
ROOT: replaying multithreaded traces with resource-oriented ordering (ZW, TH, ACAD, RHAD), pp. 373–387.
CADECADE-2013-BlanchetteP #first-order #morphism #named #polymorphism
TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism (JCB, AP), pp. 414–420.
CADECADE-2013-ChihaniMR #first-order #logic #proving
Foundational Proof Certificates in First-Order Logic (ZC, DM, FR), pp. 162–177.
CADECADE-2013-KersaniP #decidability #first-order
Completeness and Decidability Results for First-Order Clauses with Indices (AK, NP), pp. 58–75.
CAVCAV-2013-AlglaveKT #bound #concurrent #model checking #partial order #performance
Partial Orders for Efficient Bounded Model Checking of Concurrent Software (JA, DK, MT), pp. 141–157.
CAVCAV-2013-KovacsV #first-order #proving #theorem proving
First-Order Theorem Proving and Vampire (LK, AV), pp. 1–35.
CSLCSL-2013-BroadbentK #higher-order #model checking #recursion
Saturation-Based Model Checking of Higher-Order Recursion Schemes (CHB, NK), pp. 129–148.
CSLCSL-2013-HampsonK #first-order #linear #logic
One-variable first-order linear temporal logics with counting (CH, AK), pp. 348–362.
CSLCSL-2013-HarwathS #first-order #invariant #locality #logic #on the #quantifier
On the locality of arb-invariant first-order logic with modulo counting quantifiers (FH, NS), pp. 363–379.
LICSLICS-2013-AlurDT #higher-order #monad #string #transducer
From Monadic Second-Order Definable String Transformations to Transducers (RA, ADG, AT), pp. 458–467.
LICSLICS-2013-EickmeyerKK #first-order #graph #invariant #logic #model checking
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes (KE, KiK, SK), pp. 134–142.
LICSLICS-2013-GoncharovS #hoare #logic
A Relatively Complete Generic Hoare Logic for Order-Enriched Effects (SG, LS), pp. 273–282.
LICSLICS-2013-Halpern #first-order #logic #proving #security #using
From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic (JYH), pp. 2–3.
LICSLICS-2013-KreutzerR #higher-order #logic #monad
Quantitative Monadic Second-Order Logic (SK, CR), pp. 113–122.
RTARTA-2013-BaumgartnerKLV #anti #higher-order
A Variant of Higher-Order Anti-Unification (AB, TK, JL, MV), pp. 113–127.
RTARTA-2013-FelgenhauerO #diagrams #order #proving
Proof Orders for Decreasing Diagrams (BF, VvO), pp. 174–189.
RTARTA-2013-SternagelT #formal method #order
Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion (CS, RT), pp. 287–302.
VMCAIVMCAI-2013-ZhengS0LD0 #network #partial order #reduction #using
State Space Reduction for Sensor Networks Using Two-Level Partial Order Reduction (MZ, DS, JS, YL, JSD, YG), pp. 515–535.
CASECASE-2012-IsmailDH #higher-order #using
Observer-based trajectory tracking for a class of underactuated Lagrangian systems using higher-order sliding modes (RMTRI, TDN, QPH), pp. 1204–1209.
CASECASE-2012-WeiM #design #framework #order #process #scheduling
Design of an order acceptance and scheduling module in a unified framework with product and process features (JW, YSM), pp. 968–973.
DACDAC-2012-SuYZ #named #order #performance #reduction
AMOR: an efficient aggregating based model order reduction method for many-terminal interconnect circuits (YS, FY, XZ), pp. 295–300.
DACDAC-2012-ZhangLWFW #higher-order #performance #reduction
Fast nonlinear model order reduction via associated transforms of high-order volterra transfer functions (YZ, HL, QW, NF, NW), pp. 289–294.
DATEDATE-2012-AridhiZT #order #reduction #simulation #towards #using
Towards improving simulation of analog circuits using model order reduction (HA, MHZ, ST), pp. 1337–1342.
DATEDATE-2012-ChenHD #design #parallel #simulation
Out-of-order parallel simulation for ESL design (WC, XH, RD), pp. 141–146.
DATEDATE-2012-DamavandpeymaSBGC #data flow #graph #modelling
Modeling static-order schedules in synchronous dataflow graphs (MD, SS, TB, MG, HC), pp. 775–780.
DATEDATE-2012-GaoXCG #design
Design of an intrinsically-linear double-VCO-based ADC with 2nd-order noise shaping (PG, XX, JC, GGEG), pp. 1215–1220.
DATEDATE-2012-NassarSGD #named #performance
RSM: A small and fast countermeasure for AES, secure against 1st and 2nd-order zero-offset SCAs (MN, YS, SG, JLD), pp. 1173–1178.
DATEDATE-2012-RosiereDDW #design
An out-of-order superscalar processor on FPGA: The ReOrder Buffer design (MR, JLD, ND, FW), pp. 1549–1554.
VLDBVLDB-2012-AhmadKKN #higher-order #named
DBToaster: Higher-order Delta Processing for Dynamic, Frequently Fresh Views (YA, OK, CK, MN), pp. 968–979.
VLDBVLDB-2012-SzlichtaGG #dependence #order
Fundamentals of Order Dependencies (JS, PG, JG), pp. 1220–1231.
WRLAWRLA-J-2010-DuranM12 #on the #order
On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories (FD, JM), pp. 816–850.
ESOPESOP-2012-LeeOCY #first-order #framework #named
GMeta: A Generic Formal Metatheory Framework for First-Order Representations (GL, BCdSO, SC, KY), pp. 436–455.
FoSSaCSFoSSaCS-2012-BouyerBMU #concurrent #game studies #order
Concurrent Games with Ordered Objectives (PB, RB, NM, MU), pp. 301–315.
FoSSaCSFoSSaCS-2012-BoveDS #automation #first-order #functional #interactive #reasoning #source code
Combining Interactive and Automatic Reasoning in First Order Theories of Functional Programs (AB, PD, ASR), pp. 104–118.
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.
WRLAWRLA-2012-GutierrezMR #axiom #order #similarity
Order-Sorted Equality Enrichments Modulo Axioms (RG, JM, CR), pp. 162–181.
ICSMEICSM-2012-BiegelBHD #developer #how #order
The Order of Things: How developers sort fields and methods (BB, FB, WH, SD), pp. 88–97.
SASSAS-2012-Ledesma-GarzaR #analysis #functional #higher-order #reachability #source code
Binary Reachability Analysis of Higher Order Functional Programs (RLG, AR), pp. 388–404.
SASSAS-2012-MadhavanRV #analysis #composition #higher-order #source code
Modular Heap Analysis for Higher-Order Programs (RM, GR, KV), pp. 370–387.
STOCSTOC-2012-LeeGT #clustering #higher-order #multi
Multi-way spectral partitioning and higher-order cheeger inequalities (JRL, SOG, LT), pp. 1117–1130.
STOCSTOC-2012-LeonardiR #order
Prior-free auctions with ordered bidders (SL, TR), pp. 427–434.
FLOPSFLOPS-2012-Terauchi #automation #functional #higher-order #source code #verification
Automated Verification of Higher-Order Functional Programs (TT), p. 2.
FLOPSFLOPS-2012-TobitaTK #analysis #higher-order #model checking
Exact Flow Analysis by Higher-Order Model Checking (YT, TT, NK), pp. 275–289.
ICALPICALP-v1-2012-GeorgiadisT #independence #order
Dominators, Directed Bipolar Orders, and Independent Spanning Trees (LG, RET), pp. 375–386.
ICALPICALP-v2-2012-GavenciakKO #first-order
Deciding First Order Properties of Matroids (TG, DK, SiO), pp. 239–250.
LATALATA-2012-Bozzelli #abstraction #constraints #termination
Strong Termination for Gap-Order Constraint Abstractions of Counter Systems (LB), pp. 155–168.
LATALATA-2012-Oliveira #generative #partial order
Canonizable Partial Order Generators (MdOO), pp. 445–457.
FMFM-2012-HieronsMN #distributed #order #testing #using
Using Time to Add Order to Distributed Testing (RMH, MGM, MN), pp. 232–246.
ICFPICFP-2012-EarlSMH #analysis #automaton #higher-order #source code
Introspective pushdown analysis of higher-order programs (CE, IS, MM, DVH), pp. 177–188.
ICFPICFP-2012-LippmeierCKLJ #higher-order #performance
Work efficient higher-order vectorisation (BL, MMTC, GK, RL, SLPJ), pp. 259–270.
ICFPICFP-2012-MyreenO #higher-order #logic #ml #synthesis
Proof-producing synthesis of ML from higher-order logic (MOM, SO), pp. 115–126.
ICFPICFP-2012-NeatherwayRO #algorithm #higher-order #model checking
A traversal-based algorithm for higher-order model checking (RPN, SJR, CHLO), pp. 353–364.
CIKMCIKM-2012-CamposDJN #approach #higher-order #identification #named #web
GTE: a distributional second-order co-occurrence approach to improve the identification of top relevant dates in web snippets (RC, GD, AJ, CN), pp. 2035–2039.
CIKMCIKM-2012-RamachandranG #graph #identification #representation
A word-order based graph representation for relevance identification (LR, EFG), pp. 2327–2330.
ICPRICPR-2012-AlbarelliBRVT #graph #higher-order #recognition #representation
A stable graph-based representation for object recognition through high-order matching (AA, FB, LR, SV, AT), pp. 3341–3344.
ICPRICPR-2012-AtaY #induction
Searching for the optimal ordering of classes in rule induction (SA, OTY), pp. 1277–1280.
ICPRICPR-2012-CourtyAL #approach #classification #image
A classwise supervised ordering approach for morphology based hyperspectral image classification (NC, EA, SL), pp. 1997–2000.
ICPRICPR-2012-HouZQ #higher-order
Diffusion-driven high-order matching of partial deformable shapes (TH, MZ, HQ), pp. 137–140.
ICPRICPR-2012-KananA #order #pseudo #recognition #using
Recognition of facial expressions using locally weighted and adjusted order Pseudo Zernike Moments (HRK, MA), pp. 3419–3422.
ICPRICPR-2012-MinKCK #approach #detection #higher-order #using
A superpixel MRF approach using high-order likelihood for moving object detection (JM, HK, JC, ISK), pp. 266–269.
ICPRICPR-2012-RubioSLP #graph #higher-order #image #representation
Image contextual representation and matching through hierarchies and higher order graphs (JCR, JS, AML, NP), pp. 2664–2667.
KDIRKDIR-2012-SpiegelA #analysis #distance #invariant
An Order-invariant Time Series Distance Measure — Position on Recent Developments in Time Series Analysis (SS, SA), pp. 264–268.
KEODKEOD-2012-LuC #clustering #documentation #order #recommendation
Bringing Order to Legal Documents — An Issue-based Recommendation System Via Cluster Association (QL, JGC), pp. 76–88.
KRKR-2012-MaBL #framework
Revising Partial Pre-Orders with Partial Pre-Orders: A Unit-Based Revision Framework (JM, SB, WL).
KRKR-2012-VlaeminckVBD #complexity #logic #order #semantics
Ordered Epistemic Logic: Semantics, Complexity and Applications (HV, JV, MB, MD).
KRKR-2012-WilsonM #axiom #diagrams #framework #order
An Axiomatic Framework for Influence Diagram Computation with Partially Ordered Utilities (NW, RM).
SIGIRSIGIR-2012-BenderskyC #dependence #higher-order #information retrieval #modelling #query #using
Modeling higher-order term dependencies in information retrieval using query hypergraphs (MB, WBC), pp. 941–950.
OOPSLAOOPSLA-2012-KulkarniC #compilation #machine learning #optimisation #problem #using
Mitigating the compiler optimization phase-ordering problem using machine learning (SK, JC), pp. 147–162.
OOPSLAOOPSLA-2012-Tobin-HochstadtH #contract #execution #higher-order #symbolic computation
Higher-order symbolic execution via contracts (STH, DVH), pp. 537–554.
PPDPPPDP-2012-BacciCFV #automation #first-order #source code #specification #synthesis
Automatic synthesis of specifications for first order curry programs (GB, MC, MAF, AV), pp. 25–34.
PADLPADL-2012-BransenMDS #algorithm #attribute grammar
The Kennedy-Warren Algorithm Revisited: Ordering Attribute Grammars (JB, AM, AD, SDS), pp. 183–197.
POPLPOPL-2012-KrishnaswamiBH #bound #functional #higher-order #programming
Higher-order functional reactive programming in bounded space (NRK, NB, JH), pp. 45–58.
SACSAC-2012-PetitLR #data type #query
Revisiting formal ordering in data stream querying (LP, CL, CR), pp. 813–818.
LDTALDTA-2012-LinckeS #concept #higher-order #object-oriented
From HOT to COOL: transforming higher-order typed languages to concept-constrained object-oriented languages (DL, SS), p. 3.
SLESLE-2012-KrishnanW #analysis #attribute grammar #higher-order #termination
Termination Analysis for Higher-Order Attribute Grammars (LK, EVW), pp. 44–63.
ASPLOSASPLOS-2012-LinNGR #consistency #performance
Efficient sequential consistency via conflict ordering (CL, VN, RG, BR), pp. 273–286.
CAVCAV-2012-HopkinsMO #equivalence #higher-order #ml #named
Hector: An Equivalence Checker for a Higher-Order Fragment of ML (DH, ASM, CHLO), pp. 774–780.
CSLCSL-2012-BaillotL #complexity #higher-order
Higher-Order Interpretations and Program Complexity (PB, UDL), pp. 62–76.
CSLCSL-2012-CarraroS #consistency #equation #formal method #modelling #on the #λ-calculus
On the equational consistency of order-theoretic models of the λ-calculus (AC, AS), pp. 152–166.
CSLCSL-2012-HetzlS #first-order #logic
Herbrand-Confluence for Cut Elimination in Classical First Order Logic (SH, LS), pp. 320–334.
CSLCSL-2012-Kuske #automation #linear #morphism #order
Isomorphisms of scattered automatic linear orders (DK), pp. 455–469.
CSLCSL-2012-KuusistoMV #decidability #first-order #geometry
Undecidable First-Order Theories of Affine Geometries (AK, JM, JV), pp. 470–484.
ICSTICST-2012-DelamareK #algorithm #aspect-oriented #integration #order #search-based
A Genetic Algorithm for Computing Class Integration Test Orders for Aspect-Oriented Systems (RD, NAK), pp. 804–813.
ICSTICST-2012-KintisPM #first-order #higher-order
Isolating First Order Equivalent Mutants via Second Order Mutation (MK, MP, NM), pp. 701–710.
IJCARIJCAR-2012-Brown #automation #higher-order #named #proving
Satallax: An Automatic Higher-Order Prover (CEB), pp. 111–117.
IJCARIJCAR-2012-RathsO #first-order #library #logic #problem
The QMLTP Problem Library for First-Order Modal Logics (TR, JO), pp. 454–461.
LICSLICS-2012-ChenF #on the #order
On the Ordered Conjecture (YC, JF), pp. 225–234.
LICSLICS-2012-ElberfeldGT #first-order #higher-order #logic #monad
Where First-Order and Monadic Second-Order Logic Coincide (ME, MG, TT), pp. 265–274.
LICSLICS-2012-EngelmannKS #first-order #higher-order #model checking #monad
First-Order and Monadic Second-Order Model-Checking on Ordered Structures (VE, SK, SS), pp. 275–284.
LICSLICS-2012-GollerJL #complexity #first-order
The Complexity of Decomposing Modal and First-Order Theories (SG, JCJ, ML), pp. 325–334.
LICSLICS-2012-Jancar #decidability #equivalence #first-order
Decidability of DPDA Language Equivalence via First-Order Grammars (PJ), pp. 415–424.
LICSLICS-2012-KieronskiMPT #equivalence #first-order #logic
Two-Variable First-Order Logic with Equivalence Closure (EK, JM, IPH, LT), pp. 431–440.
LICSLICS-2012-KrebsS #first-order
Non-definability of Languages by Generalized First-order Formulas over (N, +) (AK, AVS), pp. 451–460.
LICSLICS-2012-PierardS #calculus #distributed #higher-order
A Higher-Order Distributed Calculus with Name Creation (AP, ES), pp. 531–540.
LICSLICS-2012-Tan #automaton #order
An Automata Model for Trees with Ordered Data Values (TT), pp. 586–595.
LICSLICS-2012-TraytelPB #category theory #composition #data type #higher-order #logic #proving #theorem proving
Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving (DT, AP, JCB), pp. 596–605.
RTARTA-2012-FuhsK #higher-order #polynomial
Polynomial Interpretations for Higher-Order Rewriting (CF, CK), pp. 176–192.
RTARTA-2012-ThiemannAN #formal method #multi #on the #order #termination
On the Formalization of Termination Techniques based on Multiset Orderings (RT, GA, JN), pp. 339–354.
ICSTSAT-2012-IserTS #optimisation #order #relational
Optimizing MiniSAT Variable Orderings for the Relational Model Finder Kodkod — (Poster Presentation) (MI, MT, CS), pp. 483–484.
ICSTSAT-2012-TanjoTB #csp #encoding #named #order #satisfiability #using
Azucar: A SAT-Based CSP Solver Using Compact Order Encoding — (Tool Presentation) (TT, NT, MB), pp. 456–462.
VMCAIVMCAI-2012-BozzelliP #abstraction #constraints #verification
Verification of Gap-Order Constraint Abstractions of Counter Systems (LB, SP), pp. 88–103.
VMCAIVMCAI-2012-CharltonHR #higher-order #named #source code #verification
Crowfoot: A Verifier for Higher-Order Store Programs (NC, BH, BR), pp. 136–151.
ASEASE-2011-BokorKSS #partial order #reduction
Supporting domain-specific state space reductions through local partial-order reduction (PB, JK, MS, NS), pp. 113–122.
CASECASE-2011-DotoliFI #first-order #hybrid #petri net
A freeway traffic control model by first order hybrid Petri nets (MD, MPF, GI), pp. 425–431.
DATEDATE-2011-ChenM #composition #functional #generative #testing
Decision ordering based property decomposition for functional test generation (MC, PM), pp. 167–172.
VLDBVLDB-2011-VuB #evaluation #higher-order #named
HOMES: A Higher-Order Mapping Evaluation System (HV, MB), pp. 1399–1402.
ESOPESOP-2011-KoutavasH #encryption #higher-order #testing
A Testing Theory for a Higher-Order Cryptographic Language — (Extended Abstract) (VK, MH), pp. 358–377.
FoSSaCSFoSSaCS-2011-Kobayashi #algorithm #automaton #higher-order #linear #model checking #recursion
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes (NK0), pp. 260–274.
FoSSaCSFoSSaCS-2011-PierardS #bisimulation #calculus #distributed #higher-order #process
Sound Bisimulations for Higher-Order Distributed Process Calculus (AP, ES), pp. 123–137.
TACASTACAS-2011-CimattiNR #abstraction #lazy evaluation #partial order #reduction
Boosting Lazy Abstraction for SystemC with Partial Order Reduction (AC, IN, MR), pp. 341–356.
SCAMSCAM-2011-NicolayRMJ #automation #higher-order #parallel #source code
Automatic Parallelization of Side-Effecting Higher-Order Scheme Programs (JN, CDR, WDM, VJ), pp. 185–194.
PEPMPEPM-2011-VardoulakisS #continuation #multi #stack
Ordering multiple continuations on the stack (DV, OS), pp. 13–22.
PLDIPLDI-2011-Godefroid #generative #higher-order #testing
Higher-order test generation (PG), pp. 258–269.
PLDIPLDI-2011-KobayashiSU #abstraction #higher-order #model checking
Predicate abstraction and CEGAR for higher-order model checking (NK, RS, HU), pp. 222–233.
SASSAS-2011-MightH #abstract interpretation #concurrent #higher-order #product line #source code #static analysis
A Family of Abstract Interpretations for Static Analysis of Concurrent Higher-Order Programs (MM, DVH), pp. 180–197.
DLTDLT-J-2009-BloomE11 #algebra #linear #order
Algebraic Linear Orderings (SLB, ), pp. 491–515.
CIAACIAA-J-2010-KufleitnerL11 #automaton #order
Partially Ordered Two-Way BüChi Automata (MK, AL), pp. 1861–1876.
AFLAFL-2011-IvanM #context-free grammar #generative #word
Müller context-free grammars generating well-ordered words (SI, ÁM), pp. 225–240.
CIAACIAA-2011-CastanoC #approach #satisfiability
Variable and Clause Ordering in an FSA Approach to Propositional Satisfiability (JMC, RC), pp. 76–87.
CIAACIAA-2011-FlouriJMIP #automaton #order
Tree Template Matching in Ranked Ordered Trees by Pushdown Automata (TF, JJ, BM, CSI, SPP), pp. 273–281.
DLTDLT-2011-BattagliaGS #multi #order
Counting the Orderings for Multisets in Consecutive Ones Property and PQ-Trees (GB, RG, NS), pp. 58–69.
DLTDLT-2011-Esik #linear #order
Scattered Context-Free Linear Orderings (), pp. 216–227.
ICALPICALP-v2-2011-AndersonMSS #first-order #invariant #locality #logic #query
Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates (MA, DvM, NS, LS), pp. 368–379.
ICALPICALP-v2-2011-BouajjaniMM #robust
Deciding Robustness against Total Store Ordering (AB, RM, EM), pp. 428–440.
ICALPICALP-v2-2011-CartonCP #linear #order #regular expression #word
Regular Languages of Words over Countable Linear Orderings (OC, TC, GP), pp. 125–136.
ICALPICALP-v2-2011-SalvatiW #higher-order
Krivine Machines and Higher-Order Schemes (SS, IW), pp. 162–173.
LATALATA-2011-PolicritiT #finite #set
Well-Quasi-Ordering Hereditarily Finite Sets (AP, AIT), pp. 440–451.
IFMIFM-J-2009-BenesBBCSV11 #automaton #component #ltl #partial order #reduction
Partial order reduction for state/event LTL with application to component-interaction automata (NB, LB, BB, IC, JS, PV), pp. 877–890.
ICFPICFP-2011-DisneyFM #contract #higher-order
Temporal higher-order contracts (TD, CF, JM), pp. 176–188.
HCIHIMI-v2-2011-RorieKMBMMVSB #order #tool support
A Preliminary Investigation of Training Order for Introducing NextGen Tools (RCR, AK, CAM, SB, GM, KM, KPLV, TZS, VB), pp. 526–533.
HCIHIMI-v2-2011-TakadamaOSMOIHS #order #question #what
What Kinds of Human Negotiation Skill Can Be Acquired by Changing Negotiation Order of Bargaining Agents? (KT, AO, KS, HM, MO, YI, KH, HS), pp. 335–344.
ICEISICEIS-v1-2011-BiniLSSA #algorithm
Non-exhaustive Join Ordering Search Algorithms for LJQO (TAB, AL, MSS, FS, ECdA), pp. 151–156.
ICEISICEIS-v2-2011-JiaWLW #higher-order #research
The Research on Stability of Supply Chain under High Order Delay (SJ, LW, CL, QW), pp. 361–367.
ICEISICEIS-v3-2011-HuaQL #order
Optimal Order Lot Sizing and Pricing with Carbon Trade (GH, HQ, JL), pp. 533–536.
CIKMCIKM-2011-YanGC #higher-order #learning #query #recommendation
Context-aware query recommendation by learning high-order relation in query logs (XY, JG, XC), pp. 2073–2076.
ICMLICML-2011-BuffoniCGU #learning #standard
Learning Scoring Functions with Order-Preserving Losses and Standardized Supervision (DB, CC, PG, NU), pp. 825–832.
KDDKDD-2011-MiettinenV #matrix #order
Model order selection for boolean matrix factorization (PM, JV), pp. 51–59.
MLDMMLDM-2011-AidosF #clustering #higher-order
Hierarchical Clustering with High Order Dissimilarities (HA, ALNF), pp. 280–293.
RecSysRecSys-2011-Karatzoglou #collaboration #modelling #order
Collaborative temporal order modeling (AK), pp. 313–316.
SEKESEKE-2011-Kaiser #concurrent #debugging #higher-order #using
Constructing Subtle Concurrency Bugs Using Synchronization-Centric Second-Order Mutation Operators (LWGK), pp. 244–249.
SEKESEKE-2011-NunezOGG #framework #order
Computational Reflection in order to support Context-Awareness in a Robotics Framework (SMN, FO, MG, VGD), pp. 533–538.
SEKESEKE-2011-SantosSN #functional #order #performance #reuse #testing
Reusing Functional Testing in order to Decrease Performance and Stress Testing Costs (IdSS, ARS, PdAdSN), pp. 470–474.
SEKESEKE-2011-WangLWL #automation #bibliography #generative #integration #order
A Brief Survey on Automatic Integration Test Order Generation (ZW, BL, LW, QL), pp. 254–257.
SIGIRSIGIR-2011-TonellottoMO #order #retrieval
Effect of different docid orderings on dynamic pruning retrieval strategies (NT, CM, IO), pp. 1179–1180.
BXBX-2011-Schmitt #higher-order #π-calculus
Reversible Higher Order π Calculus (AS), p. 63.
OOPSLAOOPSLA-2011-PuBS #algorithm #first-order #programming #synthesis
Synthesis of first-order dynamic programming algorithms (YP, RB, SS), pp. 83–98.
PPDPPPDP-2011-InabaHHKN #higher-order #logic #monad #using #verification
Graph-transformation verification using monadic second-order logic (KI, SH, ZH, HK, KN), pp. 17–28.
PPDPPPDP-2011-VirsedaM #composition #constraints #declarative #higher-order #programming #semantics
A modular semantics for higher-order declarative programming with constraints (RdVV, FPM), pp. 41–52.
PADLPADL-2011-FodorAR
Results on Out-of-Order Event Processing (PF, DA, SR), pp. 220–234.
POPLPOPL-2011-AttiyaGHKMV #algorithm #concurrent #order
Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated (HA, RG, DH, PK, MMM, MTV), pp. 487–498.
POPLPOPL-2011-OngR #algebra #data type #functional #higher-order #pattern matching #source code #verification
Verifying higher-order functional programs with pattern-matching algebraic data types (CHLO, SJR), pp. 587–598.
SACSAC-2011-DinhT #concept #order #word
Biomedical concept extraction based on combining the content-based and word order similarities (DD, LT), pp. 1159–1163.
SACSAC-2011-DumasDBB #partial order #verification
Application of partial-order methods for the verification of closed-loop SDL systems (XD, PD, FB, EB), pp. 1666–1673.
ESEC-FSEESEC-FSE-2011-HarmanJL #generative #higher-order #testing
Strong higher order mutation-based test data generation (MH, YJ, WBL), pp. 212–222.
LDTALDTA-2011-EconomopoulosF #higher-order #syntax
Higher-order transformations with nested concrete syntax (GRE, BF), p. 4.
HPCAHPCA-2011-LeeSNY #analysis #order
Offline symbolic analysis to infer Total Store Order (DL, MS, SN, ZY), pp. 357–358.
PPoPPPPoPP-2011-HassaanBP #algorithm #comparison #order #parallel
Ordered vs. unordered: a comparison of parallelism and work-efficiency in irregular algorithms (MAH, MB, KP), pp. 3–12.
PPoPPPPoPP-2011-JenistaED #execution #named
OoOJava: software out-of-order execution (JCJ, YHE, BD), pp. 57–68.
CADECADE-2011-Brown #higher-order #problem #proving #satisfiability #sequence #theorem proving
Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems (CEB), pp. 147–161.
CADECADE-2011-Claessen #automation #first-order #logic #reasoning
The Anatomy of Equinox — An Extensible Automated Reasoning Tool for First-Order Logic and Beyond — (Talk Abstract) (KC), pp. 1–3.
CADECADE-2011-ClaessenLS #first-order #logic
Sort It Out with Monotonicity — Translating between Many-Sorted and Unsorted First-Order Logic (KC, AL, NS), pp. 207–221.
CADECADE-2011-KovacsMV #on the #order
On Transfinite Knuth-Bendix Orders (LK, GM, AV), pp. 384–399.
CADECADE-2011-SchneiderS #automation #first-order #ontology #owl #proving #reasoning #theorem proving #using
Reasoning in the OWL 2 Full Ontology Language Using First-Order Automated Theorem Proving (MS, GS), pp. 461–475.
CSLCSL-2011-BesC #algebra #linear #order
Algebraic Characterization of FO for Scattered Linear Orderings (AB, OC), pp. 67–81.
CSLCSL-2011-CantoneLA #decidability #logic #order #quantifier #set
A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics (DC, CL, MNA), pp. 129–143.
CSLCSL-2011-DurandS #complexity #higher-order #logic #problem #query
Enumeration Complexity of Logical Query Problems with Second-order Variables (AD, YS), pp. 189–202.
CSLCSL-2011-Eickmeyer #first-order #logic #random
Non-Definability Results for Randomised First-Order Logic (KE), pp. 218–232.
CSLCSL-2011-Kieronski #decidability #linear #logic #order
Decidability Issues for Two-Variable Logics with Several Linear Orders (EK), pp. 337–351.
ICLPICLP-2011-Brass #declarative
Declarative Output by Ordering Text Pieces (SB), pp. 151–161.
ICLPICLP-2011-Simko #logic programming #order
Accepting the natural order of rules in a logic program with preferences (AS), pp. 284–289.
ISSTAISSTA-2011-PradelG #detection #order
Detecting anomalies in the order of equally-typed method arguments (MP, TRG), pp. 232–242.
ISSTAISSTA-2011-TateishiPT #analysis #higher-order #logic #monad #string
Path- and index-sensitive string analysis based on monadic second-order logic (TT, MP, OT), pp. 166–176.
LICSLICS-2011-BarrasJSW #decidability #first-order #higher-order #named #type system
CoQMTU: A Higher-Order Type Theory with a Predicative Hierarchy of Universes Parametrized by a Decidable First-Order Theory (BB, JPJ, PYS, QW), pp. 143–151.
LICSLICS-2011-Clairambault #higher-order #morphism
Isomorphisms of Types in the Presence of Higher-Order References (PC), pp. 152–161.
LICSLICS-2011-HasuoH #geometry #higher-order #interactive #quantum #semantics
Semantics of Higher-Order Quantum Computation via Geometry of Interaction (IH, NH), pp. 237–246.
LICSLICS-2011-Kobayashi #higher-order #model checking #theory and practice
Higher-Order Model Checking: From Theory to Practice (NK0), pp. 219–224.
LICSLICS-2011-Krokhin #complexity #first-order
The Complexity of Evaluating First-Order Sentences over a Fixed Structure (AAK), p. 331.
LICSLICS-2011-MadelaineM #first-order #logic #similarity
A Tetrachotomy for Positive First-Order Logic without Equality (FRM, BM), pp. 311–320.
RTARTA-2011-AotoYC #higher-order #induction #theorem
Natural Inductive Theorems for Higher-Order Rewriting (TA, TY, YC), pp. 107–121.
RTARTA-2011-AvanziniEM #exponential #order #term rewriting
A Path Order for Rewrite Systems that Compute Exponential Time Functions (MA, NE, GM), pp. 123–138.
RTARTA-2011-GasconMR #first-order #unification
First-Order Unification on Compressed Terms (AG, SM, LR), pp. 51–60.
RTARTA-2011-KopR #algebra #dependence #functional #higher-order
Higher Order Dependency Pairs for Algebraic Functional Systems (CK, FvR), pp. 203–218.
RTARTA-2011-Roux #dependence #higher-order #refinement
Refinement Types as Higher-Order Dependency Pairs (CR), pp. 299–312.
ICSTSAT-2011-PetkeJ #csp #encoding #order #satisfiability
The Order Encoding: From Tractable CSP to Tractable SAT (JP, PJ), pp. 371–372.
TLCATLCA-2011-AbelP #dependent type #higher-order #unification
Higher-Order Dynamic Pattern Unification for Dependent Types and Records (AA, BP), pp. 10–26.
CASECASE-2010-DoraiswamiCK #order #physics
Model order selection criterion with application to physical systems (RD, LC, HMK), pp. 393–398.
DATEDATE-2010-ChenQM #generative #performance #satisfiability #testing
Efficient decision ordering techniques for SAT-based test generation (MC, XQ, PM), pp. 490–495.
DATEDATE-2010-El-MoselhyD #order #reduction #statistics #using
Variation-aware interconnect extraction using statistical moment preserving model order reduction (TAEM, LD), pp. 453–458.
DATEDATE-2010-IqbalSH #estimation #execution #named #order #pipes and filters #recursion
RMOT: Recursion in model order for task execution time estimation in a software pipeline (NI, MAS, JH), pp. 953–956.
DATEDATE-2010-LiZYZ #functional
Proactive NBTI mitigation for busy functional units in out-of-order microprocessors (LL, YZ, JY, JZ), pp. 411–416.
DATEDATE-2010-MahmoodBMMD #modelling #multi #order #programming
Passive reduced order modeling of multiport interconnects via semidefinite programming (ZM, BNB, TM, AM, LD), pp. 622–625.
DATEDATE-2010-PanYZS #approach #megamodelling #order #performance #reduction
An efficient transistor-level piecewise-linear macromodeling approach for model order reduction of nonlinear circuits (XP, FY, XZ, YS), pp. 1673–1676.
DATEDATE-2010-VillenaS #named #order #reduction
HORUS — high-dimensional Model Order Reduction via low moment-matching upgraded sampling (JFV, LMS), pp. 465–470.
PODSPODS-2010-BenediktPV #higher-order #query
Positive higher-order queries (MB, GP, HV), pp. 27–38.
PODSPODS-2010-Wijsen #database #first-order #nondeterminism #on the #query
On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases (JW), pp. 179–190.
SIGMODSIGMOD-2010-ZhaoDTT #approach #elicitation #order
Call to order: a hierarchical browsing approach to eliciting users’ preference (FZ, GD, KLT, AKHT), pp. 27–38.
VLDBVLDB-2010-LevinKSS #constraints #interactive #order
Interactive Route Search in the Presence of Order Constraints (RL, YK, ES, YS), pp. 117–128.
VLDBVLDB-2010-ZhangMKC #evaluation #order #performance
Efficient Skyline Evaluation over Partially Ordered Domains (SZ, NM, BK, DWLC), pp. 1255–1266.
ESOPESOP-2010-NaumannB #bound #first-order #higher-order #information management
Dynamic Boundaries: Information Hiding by Second Order Framing with First Order Assertions (DAN, AB), pp. 2–22.
FASEFASE-2010-LauterburgKMA #heuristic #partial order #reduction
Evaluating Ordering Heuristics for Dynamic Partial-Order Reduction Techniques (SL, RKK, DM, GA), pp. 308–322.
FoSSaCSFoSSaCS-2010-Stirling #decidability #higher-order
Introduction to Decidability of Higher-Order Matching (CS), p. 1.
TACASTACAS-2010-Aderhold #analysis #automation #higher-order #recursion #source code #termination
Automated Termination Analysis for Programs with Second-Order Recursion (MA), pp. 221–235.
TACASTACAS-2010-MalinowskiN #automaton #bound #model checking #partial order #satisfiability #semantics
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata (JM, PN), pp. 405–419.
WRLAWRLA-2010-DuranM #equation #maude #order #specification
A Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specifications (FD, JM), pp. 69–85.
WRLAWRLA-2010-DuranM10a #maude #order
A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories (FD, JM), pp. 86–103.
PEPMPEPM-2010-Haftmann #haskell #higher-order #logic
From higher-order logic to Haskell: there and back again (FH), pp. 155–158.
FLOPSFLOPS-2010-HaftmannN #code generation #higher-order #term rewriting
Code Generation via Higher-Order Rewrite Systems (FH, TN), pp. 103–117.
CIAACIAA-2010-KufleitnerL #automaton #order
Partially Ordered Two-Way Büchi Automata (MK, AL), pp. 181–190.
ICALPICALP-v2-2010-BraudC #automaton #linear #order
Linear Orders in the Pushdown Hierarchy (LB, AC), pp. 88–99.
ICALPICALP-v2-2010-LanesePSS #calculus #communication #higher-order #on the #process
On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi (IL, JAP, DS, AS), pp. 442–453.
LATALATA-2010-CabessaV #classification #first-order #network
A Hierarchical Classification of First-Order Recurrent Neural Networks (JC, AEPV), pp. 142–153.
LATALATA-2010-JordanZ #first-order #quantifier
Untestable Properties Expressible with Four First-Order Quantifiers (CJ, TZ), pp. 333–343.
LATALATA-2010-VelardoD #comparison #order #petri net
Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data (FRV, GD), pp. 524–535.
SEFMSEFM-2010-BarnatBR #parallel #partial order #reduction
Parallel Partial Order Reduction with Topological Sort Proviso (JB, LB, PR), pp. 222–231.
ICFPICFP-2010-Crary #higher-order #logic #representation
Higher-order representation of substructural logics (KC), pp. 131–142.
ICFPICFP-2010-DreyerNB #higher-order #reasoning #relational
The impact of higher-order state and control effects on local relational reasoning (DD, GN, LB), pp. 143–156.
ICFPICFP-2010-HoldermansH #analysis #higher-order #polymorphism
Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators (SH, JH), pp. 63–74.
GT-VMTGT-VMT-2010-MolR #graph #on the #order
On A Graph Formalism for Ordered Edges (MdM, AR).
ICGTICGT-2010-GadducciLV #calculus #higher-order #semantics #μ-calculus
Counterpart Semantics for a Second-Order μ-Calculus (FG, ALL, AV), pp. 282–297.
CHICHI-2010-WeaverBSIL #analysis #artificial reality #empirical #order #using
An empirical task analysis of warehouse order picking using head-mounted displays (KW, HB, TS, HI, ML), pp. 1695–1704.
CSCWCSCW-2010-GeigerR #order #wiki
The work of sustaining order in wikipedia: the banning of a vandal (RSG, DR), pp. 117–126.
CIKMCIKM-2010-FiranGNP #classification #image #order #social
Bringing order to your photos: event-driven classification of flickr images based on social knowledge (CSF, MG, WN, RP), pp. 189–198.
ECIRECIR-2010-KimZH #multi #order
Aggregation of Multiple Judgments for Evaluating Ordered Lists (HDK, CZ, JH), pp. 166–178.
ICPRICPR-2010-CordellaSMS #graph #order #traversal
Writing Order Recovery from Off-Line Handwriting by Graph Traversal (LPC, CDS, AM, AS), pp. 1896–1899.
ICPRICPR-2010-MezghaniPMLG #network #order
A Computer-Aided Method for Scoliosis Fusion Level Selection by a Topologicaly Ordered Self Organizing Kohonen Network (NM, PP, AM, HL, JAdG), pp. 4012–4015.
ICPRICPR-2010-PlazaP #image #order
Impact of Vector Ordering Strategies on Morphological Unmixing of Remotely Sensed Hyperspectral Images (AP, JP), pp. 4412–4415.
ICPRICPR-2010-SemenovichS #higher-order #performance
Tensor Power Method for Efficient MAP Inference in Higher-order MRFs (DS, AS), pp. 734–737.
ICPRICPR-2010-WangJHT #higher-order #kernel #learning #multi
Multiple Kernel Learning with High Order Kernels (SW, SJ, QH, QT), pp. 2138–2141.
ICPRICPR-2010-WangM #learning #order #process #using
Gaussian Process Learning from Order Relationships Using Expectation Propagation (RW, SJM), pp. 605–608.
ICPRICPR-2010-ZhaoGC #higher-order #image #recognition #representation
High-Order Circular Derivative Pattern for Image Representation and Recognition (SZ, YG, TC), pp. 2246–2249.
KDDKDD-2010-FangNF
Discovering significant relaxed order-preserving submatrices (QF, WN, JF), pp. 433–442.
KDDKDD-2010-LuWZB
Ensemble pruning via individual contribution ordering (ZL, XW, XZ, JB), pp. 871–880.
KEODKEOD-2010-ChanLB #automation #evolution #higher-order #ontology #reasoning #representation
Higher-order Representation and Reasoning for Automated Ontology Evolution (MC, JL, AB), pp. 84–93.
KMISKMIS-2010-KadhemAK #database #encryption #order #performance #relational
A Secure and Efficient Order Preserving Encryption Scheme for Relational Databases (HK, TA, HK), pp. 25–35.
KRKR-2010-BelardinelliL #first-order #interactive #logic #multi
Interactions between Time and Knowledge in a First-order Logic for Multi-Agent Systems (FB, AL).
SIGIRSIGIR-2010-LiLX10a #identification #music #robust
Robust music identification based on low-order zernike moment in the compressed domain (WL, YL, XX), pp. 739–740.
ICMTICMT-2010-TisiCJ #atl #higher-order
Improving Higher-Order Transformations Support in ATL (MT, JC, FJ), pp. 215–229.
OOPSLAOOPSLA-2010-KleinFF #higher-order #random testing #source code #testing
Random testing for higher-order, stateful programs (CK, MF, RBF), pp. 555–566.
LOPSTRLOPSTR-2010-BacciC #first-order #functional #logic programming #source code
Abstract Diagnosis of First Order Functional Logic Programs (GB, MC), pp. 215–233.
LOPSTRLOPSTR-2010-CalvesF #first-order
The First-Order Nominal Link (CC, MF), pp. 234–248.
PPDPPPDP-2010-Gacek #higher-order #specification #syntax
Relating nominal and higher-order abstract syntax specifications (AG), pp. 177–186.
PADLPADL-2010-Perera #first-order #interactive #programming
First-Order Interactive Programming (RP), pp. 186–200.
POPLPOPL-2010-DreyerNRB #data type #higher-order #logic #relational
A relational modal logic for higher-order stateful ADTs (DD, GN, AR, LB), pp. 185–198.
POPLPOPL-2010-JostHLH #higher-order #resource management #source code
Static determination of quantitative resource usage for higher-order programs (SJ, KH, HWL, MH), pp. 223–236.
POPLPOPL-2010-KobayashiTU #higher-order #multi #recursion #transducer #verification
Higher-order multi-parameter tree transducers and recursion schemes for program verification (NK, NT, HU), pp. 495–508.
HPCAHPCA-2010-AbellaCVCG
High-Performance low-vcc in-order core (JA, PC, XV, JC, AG), pp. 1–11.
HPCAHPCA-2010-HiltonR #energy #execution #named
BOLT: Energy-efficient Out-of-Order Latency-Tolerant execution (ADH, AR), pp. 1–12.
CAVCAV-2010-BasinKM #first-order #logic #monitoring #policy
Policy Monitoring in First-Order Temporal Logic (DAB, FK, SM), pp. 1–18.
CSLCSL-2010-FioreH #equation #higher-order #logic
Second-Order Equational Logic (Extended Abstract) (MPF, CKH), pp. 320–335.
CSLCSL-2010-GanzowK #algorithm #higher-order #induction #logic #monad
New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures (TG, LK), pp. 366–380.
CSLCSL-2010-KuncakPS #calculus #data type #order #set
Ordered Sets in the Calculus of Data Structures (VK, RP, PS), pp. 34–48.
CSLCSL-2010-MartinM #complexity #first-order #logic #similarity
The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case (BM, JM), pp. 426–438.
CSLCSL-2010-SchwentickZ #logic #order
Two-Variable Logic with Two Order Relations — (Extended Abstract) (TS, TZ), pp. 499–513.
ICLPICLP-2010-Pahlavi10 #higher-order #learning #logic
Higher-order Logic Learning and λ-Progol (NP), pp. 281–285.
ICTSSICTSS-2010-CabralPV #algorithm #integration #order #problem
A Pareto Ant Colony Algorithm Applied to the Class Integration and Test Order Problem (RdVC, AP, SRV), pp. 16–29.
ICTSSICTSS-2010-Gladisch #first-order #generative #logic #quantifier #source code #specification #testing
Test Data Generation for Programs with Quantified First-Order Logic Specifications (CG), pp. 158–173.
IJCARIJCAR-2010-Aderhold #automation #axiom #higher-order #induction #recursion #source code #synthesis
Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion (MA), pp. 263–277.
IJCARIJCAR-2010-BackesB #higher-order #logic
Analytic Tableaux for Higher-Order Logic with Choice (JB, CEB), pp. 76–90.
IJCARIJCAR-2010-BlanchetteK #higher-order
Monotonicity Inference for Higher-Order Formulas (JCB, AK), pp. 91–106.
IJCARIJCAR-2010-ShermanGD #partial order #type system
A Slice-Based Decision Procedure for Type-Based Partial Orders (ES, BJG, MBD), pp. 156–170.
IJCARIJCAR-2010-WinklerM #order #termination #tool support
Termination Tools in Ordered Completion (SW, AM), pp. 518–532.
LICSLICS-2010-He #finite #first-order #on the #quantifier #strict
On the Strictness of the First-Order Quantifier Structure Hierarchy over Finite Structures (YH), pp. 170–178.
LICSLICS-2010-KreutzerT #bound #complexity #higher-order #logic #monad
Lower Bounds for the Complexity of Monadic Second-Order Logic (SK, ST), pp. 189–198.
RTARTA-2010-AppelOS #composition #higher-order
Higher-Order (Non-)Modularity (CA, VvO, JGS), pp. 17–32.
RTARTA-2010-Bahr10a #partial order #term rewriting
Partial Order Infinitary Term Rewriting and Böhm Trees (PB), pp. 67–84.
RTARTA-2010-KutsiaM #order #regular expression #unification
Order-Sorted Unification with Regular Expression Sorts (TK, MM), pp. 193–208.
TAPTAP-2010-AhnD #axiom #first-order #logic #testing #verification
Testing First-Order Logic Axioms in Program Verification (KYA, ED), pp. 22–37.
ASEASE-2009-HewettK #automation #component #generative #integration #order #testing
Automated Test Order Generation for Software Component Integration Testing (RH, PK), pp. 211–220.
CASECASE-2009-CaldwellM #estimation #higher-order
Second-order optimal estimation of slip state for a simple slip-steered vehicle (TMC, TDM), pp. 133–139.
DACDAC-2009-ChenCH #design #information retrieval #order
New spare cell design for IR drop minimization in Engineering Change Order (HTC, CCC, TH), pp. 402–407.
DACDAC-2009-MarcilioSAR #behaviour #novel #verification
A novel verification technique to uncover out-of-order DUV behaviors (GM, LCVdS, BA, SR), pp. 448–453.
DACDAC-2009-XiongVZ #correlation #ranking #statistics
Statistical ordering of correlated timing quantities and its application for path ranking (JX, CV, VZ), pp. 122–125.
DATEDATE-2009-KwonYUJ #performance #problem
In-network reorder buffer to improve overall NoC performance while resolving the in-order requirement problem (WCK, SY, JU, SWJ), pp. 1058–1063.
DocEngDocEng-2009-PeroniV #order
Annotations with EARMARK for arbitrary, overlapping and out-of order markup (SP, FV), pp. 171–180.
ICDARICDAR-2009-ElbaatiKEA #order
Temporal Order Recovery of the Scanned Handwriting (AE, MK, AE, AMA), pp. 1116–1120.
ICDARICDAR-2009-KatayamaUS #order #probability
Stochastic Model of Stroke Order Variation (YK, SU, HS), pp. 803–807.
ICDARICDAR-2009-MarinaiMS #clustering #order #using
Mathematical Symbol Indexing Using Topologically Ordered Clusters of Shape Contexts (SM, BM, GS), pp. 1041–1045.
SIGMODSIGMOD-2009-AndreiCCJS #clustering #optimisation
Ordering, distinctness, aggregation, partitioning and DQP optimization in sybase ASE 15 (MA, XC, SC, CJ, ES), pp. 917–924.
SIGMODSIGMOD-2009-BinnigHF #in memory #memory management #string
Dictionary-based order-preserving string compression for main memory column stores (CB, SH, FF), pp. 283–296.
SIGMODSIGMOD-2009-ChenCMPSS #database #optimisation #order
Partial join order optimization in the paraccel analytic database (YC, RLC, WJM, SP, AS, ESJ), pp. 905–908.
SIGMODSIGMOD-2009-Neumann #optimisation #query
Query simplification: graceful degradation for join-order optimization (TN0), pp. 403–414.
SIGMODSIGMOD-2009-WeiLLGRC
Supporting a spectrum of out-of-order event processing technologies: from aggressive to conservative methodologies (MW, ML, ML, DG, EAR, KTC), pp. 1031–1034.
WRLAWRLA-2008-HolenJW09 #calculus #first-order #maude #proving
Proof Search for the First-Order Connection Calculus in Maude (BH, EBJ, AW), pp. 173–188.
WRLAWRLA-2008-LucasM09 #equation #order #source code #termination
Operational Termination of Membership Equational Programs: the Order-Sorted Way (SL, JM), pp. 207–225.
ESOPESOP-2009-LakinP #functional #higher-order #induction #programming
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming (MRL, AMP), pp. 47–61.
ESOPESOP-2009-SiekGT #design #higher-order
Exploring the Design Space of Higher-Order Casts (JGS, RG, WT), pp. 17–31.
FoSSaCSFoSSaCS-2009-BansalBL #order
Beyond Shapes: Lists with Ordered Data (KB, RB, ÉL), pp. 425–439.
FoSSaCSFoSSaCS-2009-BroadbentO #higher-order #model checking #on the #recursion
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes (CHB, CHLO), pp. 107–121.
ICPCICPC-2009-LinsteadHLB #first-order #java #markov #modelling
Capturing Java naming conventions with first-order Markov models (EL, LH, CVL, PB), pp. 313–314.
PEPMPEPM-2009-PardoFS #higher-order #monad #source code
Shortcut fusion rules for the derivation of circular and higher-order monadic programs (AP, JPF, JS), pp. 81–90.
STOCSTOC-2009-CardinalFJJM #algorithm #partial order #performance
An efficient algorithm for partial order production (JC, SF, GJ, RMJ, JIM), pp. 93–100.
DLTDLT-2009-KudinovS #order #word
Definability in the Infix Order on Words (OVK, VLS), pp. 454–465.
ICALPICALP-v1-2009-FarzanM #order
Dynamic Succinct Ordered Trees (AF, JIM), pp. 439–450.
ICALPICALP-v1-2009-GuhaH #bound #order #random #theorem
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams (SG, ZH), pp. 513–524.
ICALPICALP-v2-2009-BeaudryL #monad
Faithful Loops for Aperiodic E-Ordered Monoids (MB, FL), pp. 55–66.
ICALPICALP-v2-2009-BlumensathOW #bound #finite #higher-order #monad #word
Boundedness of Monadic Second-Order Formulae over Finite Words (AB, MO, MW), pp. 67–78.
LATALATA-2009-Courcelle #algorithm #graph #higher-order #logic #monad
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications (BC), pp. 19–22.
FMFM-2009-LangM #composition #confluence #detection #partial order #reduction #using
Partial Order Reductions Using Compositional Confluence Detection (FL, RM), pp. 157–172.
IFMIFM-2009-BenesBCSVZ #ltl #partial order #reduction
Partial Order Reduction for State/Event LTL (NB, LB, IC, JS, PV, BZ), pp. 307–321.
ICFPICFP-2009-ChlipalaMMSW #effectiveness #higher-order #imperative #interactive #proving #source code
Effective interactive proofs for higher-order imperative programs (AC, JGM, GM, AS, RW), pp. 79–90.
HCIHCI-AUII-2009-TokosumiM #component #higher-order
Extracting High-Order Aesthetic and Affective Components from Composer’s Writings (AT, HM), pp. 679–682.
ICEISICEIS-AIDSS-2009-KuoWHH #clustering #network #optimisation #order #using
An Order Clustering System using ART2 Neural Network and Particle Swarm Optimization Methodn (RJK, MJW, TWH, TLH), pp. 54–59.
ICEISICEIS-AIDSS-2009-YangLSKCGP #graph #learning
Graph Structure Learning for Task Ordering (YY, AL, HS, BK, CMC, RG, KP), pp. 164–169.
ICEISICEIS-DISI-2009-AmiratO #architecture #first-order #metamodelling #named
C3: A Metamodel for Architecture Description Language based on First-order Connector Types (AA, MO), pp. 76–81.
ECIRECIR-2009-LlorenteR #automation #higher-order #image #statistics #using
Using Second Order Statistics to Enhance Automated Image Annotation (AL, SMR), pp. 570–577.
ICMLICML-2009-DavisD #higher-order #logic #markov
Deep transfer via second-order Markov logic (JD, PMD), pp. 217–224.
ICMLICML-2009-McFeeL #kernel #multi #partial order
Partial order embedding with multiple kernels (BM, GRGL), pp. 721–728.
ICMLICML-2009-QianJZHW #higher-order #random #sequence
Sparse higher order conditional random fields for improved sequence labeling (XQ, XJ, QZ, XH, LW), pp. 849–856.
ICMLICML-2009-UsunierBG #classification #order #ranking
Ranking with ordered weighted pairwise classification (NU, DB, PG), pp. 1057–1064.
MLDMMLDM-2009-SeredinKM #machine learning #order #set
Selection of Subsets of Ordered Features in Machine Learning (OS, AK, VM), pp. 16–28.
RecSysRecSys-2009-QasimOWHO #partial order #recommendation
A partial-order based active cache for recommender systems (UQ, VO, YfBW, MEH, MTÖ), pp. 209–212.
RecSysRecSys-2009-TylerZCZ #categorisation #recommendation
Ordering innovators and laggards for product categorization and recommendation (SKT, SZ, YC, YZ), pp. 29–36.
ECMFAECMDA-FA-2009-TisiJFCB #higher-order #model transformation #on the
On the Use of Higher-Order Model Transformations (MT, FJ, PF, SC, JB), pp. 18–33.
PPDPPPDP-2009-BentonKBH #higher-order #program transformation #relational #semantics
Relational semantics for effect-based program transformations: higher-order store (NB, AK, LB, MH), pp. 301–312.
PPDPPPDP-2009-Kobayashi #higher-order #model checking
Model-checking higher-order functions (NK), pp. 25–36.
PPDPPPDP-2009-Virseda #algorithm #debugging #declarative #framework #higher-order #logic #source code #verification
A higher-order logical framework for the algorithmic debugging and verification of declarative programs (RdVV), pp. 49–60.
POPLPOPL-2009-JonssonN #call-by #higher-order #supercompilation
Positive supercompilation for a higher order call-by-value language (PAJ, JN), pp. 277–288.
POPLPOPL-2009-Kobayashi #higher-order #recursion #source code #verification
Types and higher-order recursion schemes for verification of higher-order programs (NK), pp. 416–428.
SACSAC-2009-LeinoM #first-order #reasoning #smt
Reasoning about comprehensions with first-order SMT solvers (KRML, RM), pp. 615–622.
SACSAC-2009-PereiraTLP #network
Preservation of ordering in a network of brokers (CMMP, CACT, DCL, MdGCP), pp. 88–89.
SACSAC-2009-ZhangLZZZZ #first-order #linear #optimisation
Optimizing techniques for saturated arithmetic with first-order linear recurrence (WZ, LL, CZ, HZ, BZ, CZ), pp. 1883–1889.
ESEC-FSEESEC-FSE-2009-LiuYNMS #order #refactoring #smell
Facilitating software refactoring with appropriate resolution order of bad smells (HL, LY, ZN, ZM, WS), pp. 265–268.
CGOCGO-2009-SpearMSW #memory management #transaction
Reducing Memory Ordering Overheads in Software Transactional Memory (MFS, MMM, MLS, PW), pp. 13–24.
HPCAHPCA-2009-AgarwalPJ
In-Network Snoop Ordering (INSO): Snoopy coherence on unordered interconnects (NA, LSP, NKJ), pp. 67–78.
HPCAHPCA-2009-ChenA #fine-grained #first-order #parallel #thread #throughput
A first-order fine-grained multithreaded throughput model (XEC, TMA), pp. 329–340.
HPCAHPCA-2009-HiltonNR #named
iCFP: Tolerating all-level cache misses in in-order processors (ADH, SN, AR), pp. 431–442.
HPCAHPCA-2009-StephensonZR #lightweight #order
Lightweight predication support for out of order processors (MS, LZ, RR), pp. 201–212.
CADECADE-2009-RoedererPS #axiom #named
Divvy: An ATP Meta-system Based on Axiom Relevance Ordering (AR, YP, GS), pp. 157–162.
CADECADE-2009-SutcliffeBBT #automation #development #higher-order #logic #proving #theorem proving
Progress in the Development of Automated Theorem Proving for Higher-Order Logic (GS, CB, CEB, FT), pp. 116–130.
CAVCAV-2009-HopkinsO #equivalence #higher-order #model checking #named
Homer: A Higher-Order Observational Equivalence Model checkER (DH, CHLO), pp. 654–660.
CAVCAV-2009-KahlonWG #partial order #reduction
Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique (VK, CW, AG), pp. 398–413.
CSLCSL-2009-AdlerW #first-order
Tree-Width for First Order Formulae (IA, MW), pp. 71–85.
CSLCSL-2009-Kreutzer #higher-order #logic #monad #on the
On the Parameterised Intractability of Monadic Second-Order Logic (SK), pp. 348–363.
CSLCSL-2009-SchwinghammerBRY #higher-order #hoare
Nested Hoare Triples and Frame Rules for Higher-Order Store (JS, LB, BR, HY), pp. 440–454.
CSLCSL-2009-Tatsuta #calculus #commutative #first-order
Non-Commutative First-Order Sequent Calculus (MT), pp. 470–484.
LICSLICS-2009-KieronskiT #equivalence #finite #first-order #logic #on the #satisfiability
On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations (EK, LT), pp. 123–132.
LICSLICS-2009-KobayashiO #calculus #higher-order #model checking #recursion #type system #μ-calculus
A Type System Equivalent to the Modal μ-Calculus Model Checking of Higher-Order Recursion Schemes (NK, CHLO), pp. 179–188.
LICSLICS-2009-MadelaineM #complexity #first-order #logic #similarity
The Complexity of Positive First-order Logic without Equality (FRM, BM), pp. 429–438.
LICSLICS-2009-Mimram #first-order
The Structure of First-Order Causality (SM), pp. 212–221.
LICSLICS-2009-PfenningS #logic programming #order #semantics
Substructural Operational Semantics as Ordered Logic Programming (FP, RJS), pp. 101–110.
RTARTA-2009-AvanziniM #dependence #order #polynomial
Dependency Pairs and Polynomial Path Orders (MA, GM), pp. 48–62.
TLCATLCA-2009-FaggianP #linear #partial order
Partial Orders, Event Structures and Linear Strategies (CF, MP), pp. 95–111.
TLCATLCA-2009-MostrousY #communication #higher-order #mobile #optimisation #process
Session-Based Communication Optimisation for Higher-Order Mobile Processes (DM, NY), pp. 203–218.
TLCATLCA-2009-Strassburger #higher-order #linear #logic #multi #proving
Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic (LS), pp. 309–324.
VMCAIVMCAI-2009-DimoulasW #higher-order #problem
The Higher-Order Aggregate Update Problem (CD, MW), pp. 44–58.
CASECASE-2008-DotoliFM #automation #fault #first-order #hybrid #monitoring #petri net
Fault monitoring of automated manufacturing systems by first order hybrid Petri nets (MD, MPF, AMM), pp. 181–186.
DACDAC-2008-KunduGG #design #partial order #reduction #scalability #testing
Partial order reduction for scalable testing of systemC TLM designs (SK, MKG, RG), pp. 936–941.
DACDAC-2008-TarjanBS #named
Federation: repurposing scalar cores for out-of-order instruction issue (DT, MB, KS), pp. 772–775.
DACDAC-2008-YanZTCM #distributed #linear #named #network #order #reduction
DeMOR: decentralized model order reduction of linear networks with massive ports (BY, LZ, SXDT, JC, BM), pp. 409–414.
DATEDATE-2008-FreuerJGN #constraints #design #higher-order #on the #verification
On the Verification of High-Order Constraint Compliance in IC Design (JBF, GJ, JG, WN), pp. 26–31.
DATEDATE-2008-MokhovY #configuration management #graph #partial order #synthesis
Conditional Partial Order Graphs and Dynamically Reconfigurable Control Synthesis (AM, AY), pp. 1142–1147.
DATEDATE-2008-VillenaS #algorithm #named #order #reduction #scalability
SPARE — a Scalable algorithm for passive, structure preserving, Parameter-Aware model order REduction (JFV, LMS), pp. 586–591.
PODSPODS-2008-CormodeKT
Time-decaying aggregates in out-of-order streams (GC, FK, ST), pp. 89–98.
PODSPODS-2008-LiuPRY #algorithm #problem
A generic flow algorithm for shared filter ordering problems (ZL, SP, AR, HY), pp. 79–88.
SIGMODSIGMOD-2008-FengFN #order #ranking
Discovering bucket orders from full rankings (JF, QF, WN), pp. 55–66.
SIGMODSIGMOD-2008-SilbersteinCSVYR #distributed #order #performance
Efficient bulk insertion into a distributed ordered table (AS, BFC, US, EV, RY, RR), pp. 765–778.
VLDBVLDB-2008-LiTSPJM #architecture
Out-of-order processing: a new architecture for high-performance stream systems (JL, KT, VS, VP, TJ, DM), pp. 274–288.
VLDBVLDB-2008-ZhangPWN #correlation #higher-order #mining
Mining non-redundant high order correlations in binary data (XZ, FP, WW, ABN), pp. 1178–1188.
ESOPESOP-2008-Ong #approach #higher-order #semantics #verification
Verification of Higher-Order Computation: A Game-Semantic Approach (CHLO), pp. 299–306.
ESOPESOP-2008-PoswolskyS #dependent type #encoding #higher-order #programming
Practical Programming with Higher-Order Encodings and Dependent Types (AP, CS), pp. 93–107.
FoSSaCSFoSSaCS-2008-GianantonioHL #higher-order #λ-calculus
RPO, Second-Order Contexts, and λ-Calculus (PDG, FH, ML), pp. 334–349.
TACASTACAS-2008-WangYKG #partial order #reduction
Peephole Partial Order Reduction (CW, ZY, VK, AG), pp. 382–396.
SCAMSCAM-2008-JiaH #fault #higher-order #mutation testing #testing #using
Constructing Subtle Faults Using Higher Order Mutation Testing (YJ, MH), pp. 249–258.
WCREWCRE-2008-Muliawan #higher-order #model transformation #using
Extending a Model Transformation Language Using Higher Order Transformations (OM), pp. 315–318.
DLTDLT-J-2007-DiekertGK08 #bibliography #finite #first-order #logic #word
A Survey on Small Fragments of First-Order Logic over Finite Words (VD, PG, MK), pp. 513–548.
DLTDLT-2008-DAlessandroV #formal method
Well Quasi-orders in Formal Language Theory (FD, SV), pp. 84–95.
ICALPICALP-A-2008-ChildsL #bound #order #quantum
Optimal Quantum Adversary Lower Bounds for Ordered Search (AMC, TL), pp. 869–880.
ICALPICALP-A-2008-Courcelle #aspect-oriented #graph #higher-order #logic #monad
Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects (BC), pp. 1–13.
ICALPICALP-A-2008-HaeuplerKMST #algorithm #incremental #performance
Faster Algorithms for Incremental Topological Ordering (BH, TK, RM, SS, RET), pp. 421–433.
ICALPICALP-B-2008-BirkedalRSY #higher-order #logic
A Simple Model of Separation Logic for Higher-Order Store (LB, BR, JS, HY), pp. 348–360.
ICALPICALP-B-2008-BojanczykS #first-order #logic #quantifier
Tree Languages Defined in First-Order Logic with One Quantifier Alternation (MB, LS), pp. 233–245.
LATALATA-2008-KitaevMS #morphism #order #word
Counting Ordered Patterns in Words Generated by Morphisms (SK, TM, PS), pp. 287–298.
ICFPICFP-2008-Chlipala #higher-order #parametricity #semantics #syntax
Parametric higher-order abstract syntax for mechanized semantics (AC), pp. 143–156.
CAiSECAiSE-2008-KinderenG #reasoning
Reasoning about Substitute Choices and Preference Ordering in e-Services (SdK, JG), pp. 390–404.
ICEISICEIS-ISAS2-2008-SchmitzAFA #implementation #nondeterminism #order
Defining the Implementation Order of Software Projects in Uncertain Environments (EAS, AJA, MCF, CMdA), pp. 23–29.
CIKMCIKM-2008-AzzopardiV #evaluation #higher-order #information management #named
Retrievability: an evaluation measure for higher order information access tasks (LA, VV), pp. 561–570.
CIKMCIKM-2008-NguyenS08a #correlation #order #query #rank
Polyhedral transformation for indexed rank order correlation queries (PN, NS), pp. 1477–1478.
ICMLICML-2008-KuzelkaZ #estimation #first-order #performance
Fast estimation of first-order clause coverage through randomization and maximum likelihood (OK, FZ), pp. 504–511.
ICPRICPR-2008-ChenCW #higher-order #named #performance #using
HOPS: Efficient region labeling using Higher Order Proxy Neighborhoods (AYCC, JJC, LW), pp. 1–4.
ICPRICPR-2008-ParamanandR #geometry #higher-order #performance
Efficient geometric matching with higher-order features (CP, ANR), pp. 1–4.
ICPRICPR-2008-ShenZL #detection #higher-order #programming #using
Deformable surface stereo tracking-by-detection using Second Order Cone Programming (SS, YZ, YL), pp. 1–4.
ICPRICPR-2008-ShoemakerBHBK #detection #performance
Detecting and ordering salient regions for efficient browsing (LS, REB, LOH, KWB, WPK), pp. 1–4.
ICPRICPR-2008-XiaoL #higher-order #using
Improvement on Mean Shift based tracking using second-order information (LX, PL), pp. 1–4.
ICPRICPR-2008-ZhangW #clustering #order #ranking
Partial closure-based constrained clustering with order ranking (SZ, HSW), pp. 1–4.
KDDKDD-2008-EshghiR #locality #order #rank #statistics
Locality sensitive hash functions based on concomitant rank order statistics (KE, SR), pp. 221–229.
KDDKDD-2008-HuangDLL #clustering #equivalence #higher-order
Simultaneous tensor subspace selection and clustering: the equivalence of high order svd and k-means clustering (HH, CHQD, DL, TL), pp. 327–335.
KRKR-2008-BelardinelliL #first-order #logic
A Complete First-Order Logic of Knowledge and Time (FB, AL), pp. 705–714.
KRKR-2008-FaberTW #equivalence #logic programming #order #source code
Notions of Strong Equivalence for Logic Programs with Ordered Disjunction (WF, HT, SW), pp. 433–443.
KRKR-2008-VassosLL #first-order
First-Order Strong Progression for Local-Effect Basic Action Theories (SV, GL, HJL), pp. 662–672.
KRKR-2008-WittocxMD #approximate #first-order #logic #reasoning
Approximate Reasoning in First-Order Logic Theories (JW, MM, MD), pp. 103–112.
SEKESEKE-2008-HewettKS #generative #integration #object-oriented #order #performance #testing
Test Order Generation for Efficient Object-oriented Class Integration Testing (RH, PK, DS), pp. 703–708.
SIGIRSIGIR-2008-KeskustaloJPK #higher-order #performance #visualisation
Intuition-supporting visualization of user’s performance based on explicit negative higher-order relevance (HK, KJ, AP, JK), pp. 675–682.
LOPSTRLOPSTR-2008-ArroyoRTV #approach #functional #higher-order #source code
A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs (GA, JGR, ST, GV), pp. 40–54.
PPDPPPDP-2008-ChitilD #algorithm #debugging #finite #functional #higher-order #source code
Comprehending finite maps for algorithmic debugging of higher-order functional programs (OC, TD), pp. 205–216.
PPDPPPDP-2008-LucasM #dependence #order
Order-sorted dependency pairs (SL, JM), pp. 108–119.
POPLPOPL-2008-Pientka #higher-order #programming #syntax
A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions (BP), pp. 371–382.
POPLPOPL-2008-Zeilberger #higher-order #syntax
Focusing and higher-order abstract syntax (NZ), pp. 359–369.
SACSAC-2008-Djelloul #constraints #first-order
Combination of decomposability and propagation for solving first-order constraints in decomposable theories (KD), pp. 1728–1732.
SACSAC-2008-LevadaMTS #estimation #higher-order #parametricity #pseudo
Spatially non-homogeneous potts model parameter estimation on higher-order neighborhood systems by maximum pseudo-likelihood (ALML, NDAM, AT, DHPS), pp. 1733–1737.
SACSAC-2008-SansL #algebra #interface #named #order #visualisation #xquery
IFOX: interface for ordered XQuery an algebraic oriented tool for ordered XQuery visualization (VS, DL), pp. 1252–1257.
SACSAC-2008-SchmitzAA #implementation #nondeterminism #order
A method for defining the implementation order of software projects under uncertainty (EAS, AJA, CMdA), pp. 844–845.
SACSAC-2008-SteffenelKB #order #pervasive
Total order broadcast on pervasive systems (LAS, MKP, YB), pp. 2202–2206.
SLESLE-2008-GorpKJ #higher-order #integration #model transformation
Transformation Language Integration Based on Profiles and Higher Order Transformations (PVG, AK, DJ), pp. 208–226.
HPCAHPCA-2008-ChenMP #constraints #graph #memory management #runtime #using #validation
Runtime validation of memory ordering using constraint graph checking (KC, SM, PP), pp. 415–426.
HPCAHPCA-2008-SalverdaZ #constraints #performance
Fundamental performance constraints in horizontal fusion of in-order cores (PS, CBZ), pp. 252–263.
LCTESLCTES-2008-DelavalGP #automation #data flow #higher-order #source code #type system
A type system for the automatic distribution of higher-order synchronous dataflow programs (GD, AG, MP), pp. 101–110.
LCTESLCTES-2008-HomayounPMV #adaptation #embedded #energy #performance
Improving performance and reducing energy-delay with adaptive resource resizing for out-of-order embedded processors (HH, SP, MAM, AVV), pp. 71–78.
SMTSMT-2007-BongioKLLM08 #encoding #first-order #proving #smt
Encoding First Order Proofs in SMT (JB, CK, HL, CL, REM), pp. 71–84.
CAVCAV-2008-VakkalankaGK #order #reduction #source code #verification
Dynamic Verification of MPI Programs with Reductions in Presence of Split Operations and Relaxed Orderings (SSV, GG, RMK), pp. 66–79.
CSLCSL-2008-AbelR #higher-order #type system
Syntactic Metatheory of Higher-Order Subtyping (AA, DR), pp. 446–460.
CSLCSL-2008-BlanquiJR #order
The Computability Path Ordering: The End of a Quest (FB, JPJ, AR), pp. 1–14.
ICLPICLP-2008-CodishLS #constraints #partial order #problem
Telecommunications Feature Subscription as a Partial Order Constraint Problem (MC, VL, PJS), pp. 749–753.
ICLPICLP-2008-NearBF #declarative #first-order #logic #named #proving #theorem proving
αleanTAP: A Declarative Theorem Prover for First-Order Classical Logic (JPN, WEB, DPF), pp. 238–252.
IJCARIJCAR-2008-BenzmullerPTF #automation #higher-order #logic #named #proving #theorem proving
LEO-II — A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description) (CB, LCP, FT, AF), pp. 162–170.
IJCARIJCAR-2008-BenzmullerRS #higher-order #logic #named
THF0 — The Core of the TPTP Language for Higher-Order Logic (CB, FR, GS), pp. 491–506.
IJCARIJCAR-2008-Korovin #first-order #logic #named #proving #theorem proving
iProver — An Instantiation-Based Theorem Prover for First-Order Logic (System Description) (KK), pp. 292–298.
IJCARIJCAR-2008-SchmidtT #first-order #logic
A General Tableau Method for Deciding Description Logics, Modal Logics and Related First-Order Fragments (RAS, DT), pp. 194–209.
LICSLICS-2008-Burel #deduction #first-order #representation #type system #using
A First-Order Representation of Pure Type Systems Using Superdeduction (GB), pp. 253–263.
LICSLICS-2008-CarayolHMOS #automaton #game studies #higher-order
Winning Regions of Higher-Order Pushdown Games (AC, MH, AM, CHLO, OS), pp. 193–204.
LICSLICS-2008-Fiore #higher-order #syntax
Second-Order and Dependently-Sorted Abstract Syntax (MPF), pp. 57–68.
LICSLICS-2008-LanesePSS #calculus #decidability #higher-order #on the #process
On the Expressiveness and Decidability of Higher-Order Process Calculi (IL, JAP, DS, AS), pp. 145–155.
LICSLICS-2008-Pottier #anti #higher-order
Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule (FP), pp. 331–340.
RTARTA-2008-ArrighiD #algebra #confluence #encoding #higher-order #λ-calculus
Linear-algebraic λ-calculus: higher-order, encodings, and confluence (PA, GD), pp. 17–31.
RTARTA-2008-KuhlmannN #automaton #logic #order
Logics and Automata for Totally Ordered Trees (MK, JN), pp. 217–231.
RTARTA-2008-LevyV #higher-order #perspective #unification
Nominal Unification from a Higher-Order Perspective (JL, MV), pp. 246–260.
TAPTAP-2008-Cao #equivalence #finite #higher-order #π-calculus
Equivalence Checking for a Finite Higher Order π-Calculus (ZC), pp. 30–47.
FATESTestCom-FATES-2008-BochmannHJJ #automaton #partial order #testing
Testing Systems Specified as Partial Order Input/Output Automata (GvB, SH, CJ, GVJ), pp. 169–183.
DACDAC-2007-FengLZ #analysis #higher-order #parametricity #performance #reduction #statistics #using
Fast Second-Order Statistical Static Timing Analysis Using Parameter Dimension Reduction (ZF, PL, YZ), pp. 244–249.
DACDAC-2007-SingheeR #performance #statistics
Beyond Low-Order Statistical Response Surfaces: Latent Variable Regression for Efficient, Highly Nonlinear Fitting (AS, RAR), pp. 256–261.
DACDAC-2007-YanTLM #higher-order #named #reduction
SBPOR: Second-Order Balanced Truncation for Passive Order Reduction of RLC Circuits (BY, SXDT, PL, BM), pp. 158–161.
DATEDATE-2007-FanMTCH #correlation #order #reduction #statistics
Statistical model order reduction for interconnect circuits considering spatial correlations (JF, NM, SXDT, YC, XH), pp. 1508–1513.
HTHT-2007-GodboleJMR #concept #interactive #learning #towards
Toward interactive learning by concept ordering (SG, SJ, SM, GR), pp. 149–150.
ICDARICDAR-2007-CeciBPM #approach #data mining #detection #mining #order
A Data Mining Approach to Reading Order Detection (MC, MB, GP, DM), pp. 924–928.
ICDARICDAR-2007-EspositoFMB #automation #documentation #first-order #incremental #learning #logic #web
Incremental Learning of First Order Logic Theories for the Automatic Annotations of Web Documents (FE, SF, NDM, TMAB), pp. 1093–1097.
SIGMODSIGMOD-2007-LiWLWC #clustering #ranking
Supporting ranking and clustering as generalized order-by and group-by (CL, MW, LL, HW, KCCC), pp. 127–138.
VLDBVLDB-2007-LeeZLL #order
Approaching the Skyline in Z Order (KCKL, BZ, HL, WCL), pp. 279–290.
ITiCSEITiCSE-2007-PecinovskyP #interface #order
Order of explanation should be interface: abstract classes — overriding (RP, JP), p. 338.
WRLAWRLA-2006-FarzanM07 #partial order #programming language #reduction #semantics
Partial Order Reduction for Rewriting Semantics of Programming Languages (AF, JM), pp. 61–78.
ESOPESOP-2007-LiOS #compilation #higher-order #logic #set
Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic (GL, SO, KS), pp. 205–219.
ESOPESOP-2007-Pitts #equivalence #higher-order
Techniques for Contextual Equivalence in Higher-Order, Typed Languages (AMP), p. 1.
FoSSaCSFoSSaCS-2007-HagueO #analysis #automaton #higher-order
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems (MH, CHLO), pp. 213–227.
FoSSaCSFoSSaCS-2007-YoshidaHB #higher-order #logic #reasoning
Logical Reasoning for Higher-Order Functions with Local State (NY, KH, MB), pp. 361–377.
PLDIPLDI-2007-ShpeismanMABGHMS #order
Enforcing isolation and ordering in STM (TS, VM, ARAT, SB, DG, RLH, KFM, BS), pp. 78–88.
STOCSTOC-2007-LauNSS #constraints #design #network #order
Survivable network design with degree or order constraints (LCL, JN, MRS, MS), pp. 651–660.
CIAACIAA-2007-Volkov #automaton #partial order
Synchronizing Automata Preserving a Chain of Partial Orders (MVV), pp. 27–37.
DLTDLT-2007-DiekertK #first-order #on the #word
On First-Order Fragments for Words and Mazurkiewicz Traces (VD, MK), pp. 1–19.
ICALPICALP-2007-GuhaM #bound #estimation #multi #streaming
Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming (SG, AM), pp. 704–715.
LATALATA-2007-Komendantskaya #deduction #first-order #network
First-order deduction in neural networks (EK), pp. 307–318.
LATALATA-2007-MrazOP #automaton
Free Word-Order and Restarting Automata (FM, FO, MP), pp. 425–436.
ICFPICFP-2007-Park #higher-order #type safety
Type-safe higher-order channels in ML-like languages (SP), pp. 191–202.
ICFPICFP-2007-Sereni #analysis #functional #graph #higher-order #source code #termination
Termination analysis and call graph construction for higher-order functional programs (DS), pp. 71–84.
HCIHCI-AS-2007-Tsuchiya #fault #metric #order
Medication Errors Caused by Order Entry System and Prevention Measures (FT), pp. 535–543.
HCIHCI-IDU-2007-NingT #functional #how #order #usability
How to Use Emotional Usability to Make the Product Serves a Need Beyond the Traditional Functional Objective to Satisfy the Emotion Needs of the User in Order to Improve the Product Differentiator — Focus on Home Appliance Product (LN, ST), pp. 587–593.
HCIOCSC-2007-ViegasWM #order #wiki
The Hidden Order of Wikipedia (FBV, MW, MMM), pp. 445–454.
ICEISICEIS-AIDSS-2007-Janicki #partial order
Pairwise Comparisons, Incomparability and Partial Orders (RJ), pp. 297–302.
ICEISICEIS-DISI-2007-GroppeGL #order #using
Using an index of precomputed joins in order to speed up SPARQL processing (SG, JG, VL), pp. 13–20.
ECIRECIR-2007-MelucciP07a #named #order #rank
PageRank: When Order Changes (MM, LP), pp. 581–588.
ICMLICML-2007-WachmanK #kernel #learning #order
Learning from interpretations: a rooted kernel for ordered hypergraphs (GW, RK), pp. 943–950.
MLDMMLDM-2007-WangXC #approach #classification #mining #novel
A Novel Rule Ordering Approach in Classification Association Rule Mining (YJW, QX, FC), pp. 339–348.
SEKESEKE-2007-HewettKM #order #predict
Predicting Order of Likelihood of Defective Software Modules (RH, PK, AvdM), pp. 93–98.
SIGIRSIGIR-2007-SchuldtGOH #on the #retrieval
On the importance of preserving the part-order in shape retrieval (AS, BG, OO, OH), pp. 771–772.
OOPSLAOOPSLA-2007-ShanerLN #composition #higher-order #source code #verification
Modular verification of higher-order methods with mandatory calls specified by model programs (SMS, GTL, DAN), pp. 351–368.
PPDPPPDP-2007-Hamana #data type #higher-order #induction #semantics #type system
Higher-order semantic labelling for inductive datatype systems (MH), pp. 97–108.
PADLPADL-2007-Liang #aspect-oriented #higher-order #linear #logic #programming
Aspect-Oriented Programming in Higher-Order and Linear Logic (CCL), pp. 305–319.
POPLPOPL-2007-Might #analysis #higher-order #source code
Logic-flow analysis of higher-order programs (MM), pp. 185–198.
POPLPOPL-2007-PearlmutterS #higher-order #lazy evaluation #multi
Lazy multivariate higher-order forward-mode AD (BAP, JMS), pp. 155–160.
SACSAC-2007-DjelloulDF #constraints #finite #first-order #infinity #prolog #theorem proving #towards #unification #using
Toward a first-order extension of Prolog’s unification using CHR: a CHR first-order constraint solver over finite or infinite trees (KD, TBHD, TWF), pp. 58–64.
SACSAC-2007-YangWK #analysis #modelling #partial order
General dominant relationship analysis based on partial order models (ZY, BW, MK), pp. 470–474.
ESEC-FSEESEC-FSE-2007-AcharyaXPX #api #mining #partial order #source code #specification
Mining API patterns as partial orders from source code: from usage scenarios to specifications (MA, TX, JP, JX), pp. 25–34.
SPLCSPLC-2007-JanotaK #feature model #higher-order #logic #modelling #reasoning
Reasoning about Feature Models in Higher-Order Logic (MJ, JRK), pp. 13–22.
SPLCSPLC-2007-OldevikH #higher-order #product line
Higher-Order Transformations for Product Lines (JO, ØH), pp. 243–254.
CGOCGO-2007-KulkarniWT #algorithm #heuristic #optimisation #order
Evaluating Heuristic Optimization Phase Order Search Algorithms (PAK, DBW, GST), pp. 157–169.
HPCAHPCA-2007-QuinonesPG #branch #execution #predict
Improving Branch Prediction and Predicated Execution in Out-of-Order Processors (EQ, JMP, AG), pp. 75–84.
PPoPPPPoPP-2007-PraunCC #order #parallel #transaction
Implicit parallelism with ordered transactions (CvP, LC, CC), pp. 79–89.
CADECADE-2007-DeshaneHJLLM #encoding #first-order #proving #satisfiability
Encoding First Order Proofs in SAT (TD, WH, PJ, HL, CL, REM), pp. 476–491.
CADECADE-2007-LiS #compilation #higher-order #logic
Compilation as Rewriting in Higher Order Logic (GL, KS), pp. 19–34.
CSLCSL-2007-CarayolL #infinity #order
MSO on the Infinite Binary Tree: Choice and Order (AC, CL), pp. 161–176.
CSLCSL-2007-Dawar #automaton #first-order #locality #logic #model checking
Model-Checking First-Order Logic: Automata and Locality (AD), p. 6.
LICSLICS-2007-AlurABEIL #first-order #logic #word
First-Order and Temporal Logics for Nested Words (RA, MA, PB, KE, NI, LL), pp. 151–160.
LICSLICS-2007-CateBV #first-order #logic #theorem
Lindstrom theorems for fragments of first-order logic (BtC, JvB, JAV), pp. 280–292.
LICSLICS-2007-SangiorgiKS #bisimulation #higher-order
Environmental Bisimulations for Higher-Order Languages (DS, NK, ES), pp. 293–302.
LICSLICS-2007-Stirling #automaton #game studies #higher-order
Higher-Order Matching, Games and Automata (CS), pp. 326–335.
RTARTA-2007-HendrixM #on the #order #specification
On the Completeness of Context-Sensitive Order-Sorted Specifications (JH, JM), pp. 229–245.
FATESTestCom-FATES-2007-HaarJJ #automaton #partial order #testing
Testing Input/Output Partial Order Automata (SH, CJ, GVJ), pp. 171–185.
TLCATLCA-2007-LiptonN #constraints #higher-order #logic programming #programming language #semantics
Higher-Order Logic Programming Languages with Constraints: A Semantics (JL, SN), pp. 272–289.
TLCATLCA-2007-MostrousY #higher-order #mobile #process #type system
Two Session Typing Systems for Higher-Order Mobile Processes (DM, NY), pp. 321–335.
TLCATLCA-2007-ShkaravskaKE #analysis #first-order #polynomial
Polynomial Size Analysis of First-Order Functions (OS, RvK, MCJDvE), pp. 351–365.
TLCATLCA-2007-Tatsuta #higher-order #quantifier #set
Simple Saturated Sets for Disjunction and Second-Order Existential Quantification (MT), pp. 366–380.
VMCAIVMCAI-2007-BouillaguetKWZR #data type #first-order #proving #theorem proving #using #verification
Using First-Order Theorem Provers in the Jahob Data Structure Verification System (CB, VK, TW, KZ, MCR), pp. 74–88.
DACDAC-2006-ChenRPR #algorithm
A test pattern ordering algorithm for diagnosis with truncated fail data (GC, SMR, IP, JR), pp. 399–404.
DACDAC-2006-LiS #linear #network #order #reduction
Model order reduction of linear networks with massive ports via frequency-dependent port packing (PL, WS), pp. 267–272.
DACDAC-2006-MuraliABM #fault tolerance #multi #network
A multi-path routing strategy with guaranteed in-order packet delivery and fault-tolerance for networks on chip (SM, DA, LB, GDM), pp. 845–848.
DACDAC-2006-StojanovicBDW #effectiveness #implementation #queue
A cost-effective implementation of an ECC-protected instruction queue for out-of-order microprocessors (VS, RIB, JD, RW), pp. 705–708.
DACDAC-2006-YuSH #analysis #grid #order #performance #power management #reduction
Fast analysis of structured power grid by triangularization based structure preserving model order reduction (HY, YS, LH), pp. 205–210.
DATEDATE-2006-EyermanEB #design #embedded #performance
Efficient design space exploration of high performance embedded out-of-order processors (SE, LE, KDB), pp. 351–356.
DATEDATE-2006-MajidzadehS #design #higher-order #novel
Arbitrary design of high order noise transfer function for a novel class of reduced-sample-rate sigma-delta-pipeline ADCs (VM, OS), pp. 138–143.
DATEDATE-2006-MartinezLC #order #reduction #using
Nonlinear model order reduction using remainder functions (JAM, SPL, DMC), pp. 281–282.
DATEDATE-2006-PanditKMP #hardware #higher-order #synthesis
High level synthesis of higher order continuous time state variable filters with minimum sensitivity and hardware count (SP, SK, CAM, AP), pp. 1203–1204.
DATEDATE-2006-SundaresanM #energy #optimisation
Value-based bit ordering for energy optimization of on-chip global signal buses (KS, NRM), pp. 624–625.
DATEDATE-2006-ZengFSCZC #domain model #order #reduction
Time domain model order reduction by wavelet collocation method (XZ, LF, YS, WC, DZ, CC), pp. 21–26.
PODSPODS-2006-CondonDHW #algorithm #pipes and filters #problem
Flow algorithms for two pipelined filter ordering problems (AC, AD, LH, NW), pp. 193–202.
PODSPODS-2006-GuhaM #approximate #order
Approximate quantiles and the order of the stream (SG, AM), pp. 273–279.
PODSPODS-2006-YangKC #constraints
Efficiently ordering subgoals with access constraints (GY, MK, VKC), pp. 183–192.
SIGMODSIGMOD-2006-DasHKS #query
Ordering the attributes of query results (GD, VH, NK, SS), pp. 395–406.
FoSSaCSFoSSaCS-2006-Cao #bisimulation #higher-order #π-calculus
More on Bisimulations for Higher Order π-Calculus (ZC), pp. 63–78.
FoSSaCSFoSSaCS-2006-KuskeL #first-order
First-Order and Counting Theories of ω-Automatic Structures (DK, ML), pp. 322–336.
TACASTACAS-2006-GhicaM #composition #concurrent #higher-order #source code
Compositional Model Extraction for Higher-Order Concurrent Programs (DRG, ASM), pp. 303–317.
TACASTACAS-2006-NiebertP #ltl #model checking #partial order #performance
Efficient Model Checking for LTL with Partial Order Snapshots (PN, DP), pp. 272–286.
TACASTACAS-2006-SiminiceanuC #diagrams #metric
New Metrics for Static Variable Ordering in Decision Diagrams (RS, GC), pp. 90–104.
PEPMPEPM-2006-WangCK #aspect-oriented #functional #higher-order #weaving
Type-directed weaving of aspects for higher-order functional languages (MW, KC, SCK), pp. 78–87.
FLOPSFLOPS-2006-CasasCH #approach #evaluation #functional #higher-order #lazy evaluation
A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems (AC, DC, MVH), pp. 146–162.
DLTDLT-J-2005-BesC06 #linear #order #theorem #word
A Kleene Theorem for Languages of Words Indexed by Linear Orderings (AB, OC), pp. 519–542.
DLTDLT-2006-DAlessandroRV #finite #order #set
Well Quasi Orders and the Shuffle Closure of Finite Sets (FD, GR, SV), pp. 260–269.
ICALPICALP-v2-2006-HondaBY #higher-order #logic
Descriptive and Relative Completeness of Logics for Higher-Order Functions (KH, MB, NY), pp. 360–371.
ICALPICALP-v2-2006-Stirling #approach #game studies #higher-order
A Game-Theoretic Approach to Deciding Higher-Order Matching (CS), pp. 348–359.
FMFM-2006-JohnstonWBSR #model checking #modelling #order #performance
Model-Based Variable and Transition Orderings for Efficient Symbolic Model Checking (WJ, KW, LvdB, PAS, PJR), pp. 524–540.
ICGTICGT-2006-RiedlSF #generative #graph grammar #order #strict #string #word
String Generating Hypergraph Grammars with Word Order Restrictions (MR, SS, IF), pp. 138–152.
ICMLICML-2006-AgarwalBB #graph #higher-order #learning
Higher order learning with graphs (SA, KB, SB), pp. 17–24.
ICMLICML-2006-Martinez-MunozS #order
Pruning in ordered bagging ensembles (GMM, AS), pp. 609–616.
ICMLICML-2006-McAuleyCSF #higher-order #image #learning
Learning high-order MRF priors of color images (JJM, TSC, AJS, MOF), pp. 617–624.
ICPRICPR-v2-2006-CaiUS #algorithm #online #performance #recognition
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition (WC, SU, HS), pp. 986–989.
ICPRICPR-v2-2006-HorvathJZK #detection #higher-order
A Higher-Order Active Contour Model for Tree Detection (PH, IJ, JZ, ZK), pp. 130–133.
ICPRICPR-v2-2006-junling #distance #metric #multi #recognition #standard
Multi-order Standard Deviation Based Distance Metrics and its Application in Handwritten Chinese Character Recognition (Rj), pp. 1114–1117.
ICPRICPR-v3-2006-ChairunnandaGC #distance #edit distance #sequence #using
Enhancing Edit Distance on Real Sequences Filters using Histogram Distance on Fixed Reference Ordering (PC, VG, LC), pp. 582–585.
ICPRICPR-v3-2006-ChengC #problem
A Complementary Ordering Method for Class Imbalanced Problem (HTC, CSC), pp. 429–432.
KDDKDD-2006-GionisMPU #algorithm #order
Algorithms for discovering bucket orders from data (AG, HM, KP, AU), pp. 561–566.
KDDKDD-2006-HashimotoAUKM #mining #order #performance #probability
A new efficient probabilistic model for mining labeled ordered trees (KH, KFAK, NU, MK, HM), pp. 177–186.
KDDKDD-2006-LiuZWMP #clustering #difference #order #set
Clustering pair-wise dissimilarity data into partially ordered sets (JL, QZ, WW, LM, JP), pp. 637–642.
KRKR-2006-ChenLWZ #first-order #logic programming #source code
First-Order Loop Formulas for Normal Logic Programs (YC, FL, YW, MZ), pp. 298–307.
KRKR-2006-SannerM #calculus #first-order #hybrid #logic #reasoning
An Ordered Theory Resolution Calculus for Hybrid Reasoning in First-Order Extensions of Description Logic (SS, SAM), pp. 100–111.
KRKR-2006-ZamanskyA #first-order #logic #nondeterminism #semantics
Non-Deterministic Semantics for First-Order Paraconsistent Logics (AZ, AA), pp. 431–439.
SIGIRSIGIR-2006-FengLWBMZM #named #order #web
AggregateRank: bringing order to web sites (GF, TYL, YW, YB, ZM, XDZ, WYM), pp. 75–82.
QAPLQAPL-2005-BaierDG06 #branch #partial order #probability #reduction
Partial Order Reduction for Probabilistic Branching Time (CB, PRD, MG), pp. 97–116.
PPDPPPDP-2006-GabbayM #logic
One-and-a-halfth-order logic (MG, AM), pp. 189–200.
POPLPOPL-2006-KoutavasW #bisimulation #higher-order #imperative #reasoning #source code
Small bisimulations for reasoning about higher-order imperative programs (VK, MW), pp. 141–152.
SACSAC-2006-DjelloulD #constraints #finite #first-order #formal method #infinity
Solving first-order constraints in the theory of finite or infinite trees: introduction to the decomposable theories (KD, TBHD), pp. 7–14.
SACSAC-2006-RodriguesMC #order
From spontaneous total order to uniform total order: different degrees of optimistic delivery (LR, JM, NC), pp. 723–727.
CGOCGO-2006-KulkarniWTD #optimisation #order
Exhaustive Optimization Phase Order Space Exploration (PAK, DBW, GST, JWD), pp. 306–318.
HPCAHPCA-2006-Prvulovic #concurrent #detection #effectiveness #named
CORD: cost-effective (and nearly overhead-free) order-recording and data race detection (MP), pp. 232–243.
LCTESLCTES-2006-KulkarniWTD #optimisation #order
In search of near-optimal optimization phase orderings (PAK, DBW, GST, JWD), pp. 83–92.
CAVCAV-2006-KahlonGS #concurrent #model checking #on the fly #partial order #source code #transaction #using
Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions (VK, AG, NS), pp. 286–299.
CSLCSL-2006-DurandO #first-order #query
First-Order Queries over One Unary Function (AD, FO), pp. 334–348.
CSLCSL-2006-HellaT #higher-order #logic #problem
Complete Problems for Higher Order Logics (LH, JMTT), pp. 380–394.
CSLCSL-2006-RabinovichT #decidability
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates (AMR, WT), pp. 562–574.
CSLCSL-2006-ReusS #higher-order #logic
Separation Logic for Higher-Order Store (BR, JS), pp. 575–590.
ICLPICLP-2006-DaoD #constraints #first-order #formal method
Solving First-Order Constraints in the Theory of the Evaluated Trees (TBHD, KD), pp. 423–424.
IJCARIJCAR-2006-GelderS #automation #generative #higher-order #logic #parsing
Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation (AVG, GS), pp. 156–161.
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-KoprowskiZ #automation #infinity #order #recursion #term rewriting
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems (AK, HZ), pp. 332–346.
IJCARIJCAR-2006-Krauss #higher-order #logic #recursion
Partial Recursive Functions in Higher-Order Logic (AK), pp. 589–603.
IJCARIJCAR-2006-Pientka #approach #higher-order #lightweight #unification
Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach (BP), pp. 362–376.
IJCARIJCAR-2006-Rabe #dependent type #first-order #logic
First-Order Logic with Dependent Types (FR), pp. 377–391.
LICSLICS-2006-ChaubardPS #composition #first-order
First Order Formulas with Modular Predicates (LC, JÉP, HS), pp. 211–220.
LICSLICS-2006-DawarGKS #approximate #first-order #optimisation #problem
Approximation Schemes for First-Order Definable Optimisation Problems (AD, MG, SK, NS), pp. 411–420.
LICSLICS-2006-LaroseLT #constraints #first-order #problem
A Characterisation of First-Order Constraint Satisfaction Problems (BL, CL, CT), pp. 201–210.
LICSLICS-2006-Ong #higher-order #model checking #on the #recursion
On Model-Checking Trees Generated by Higher-Order Recursion Schemes (CHLO), pp. 81–90.
LICSLICS-2006-Otto #bound #first-order #logic #monad #problem
The Boundedness Problem for Monadic Universal First-Order Logic (MO), pp. 37–48.
RTARTA-2006-Bruggink #finite #higher-order #product line #proving #using
A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property (HJSB), pp. 372–386.
RTARTA-2006-CodishLS #constraints #partial order #termination
Solving Partial Order Constraints for LPO Termination (MC, VL, PJS), pp. 4–18.
RTARTA-2006-JouannaudR #higher-order
Higher-Order Orderings for Normal Rewriting (JPJ, AR), pp. 387–399.
RTARTA-2006-Koprowski #higher-order #recursion
Certified Higher-Order Recursive Path Ordering (AK), pp. 227–241.
RTARTA-2006-LevySV #bound #higher-order #unification
Bounded Second-Order Unification Is NP-Complete (JL, MSS, MV), pp. 400–414.
RTARTA-2006-Obua #higher-order #logic
Checking Conservativity of Overloaded Definitions in Higher-Order Logic (SO), pp. 212–226.
DACDAC-2005-KlemasDW #algorithm #order #reduction
Segregation by primary phase factors: a full-wave algorithm for model order reduction (TJK, LD, JKW), pp. 943–946.
DACDAC-2005-SouMD #approach #optimisation #order #reduction
A quasi-convex optimization approach to parameterized model order reduction (KCS, AM, LD), pp. 933–938.
DACDAC-2005-WanR #linear #reduction
Operator-based model-order reduction of linear periodically time-varying systems (YW, JSR), pp. 391–396.
DATEDATE-2005-BhaduriV #higher-order #induction #metric
Inductive and Capacitive Coupling Aware Routing Methodology Driven by a Higher Order RLCK Moment Metric (AB, RV), pp. 922–923.
DATEDATE-2005-LiLLPN #modelling #order #parametricity #performance #reduction #using #variability
Modeling Interconnect Variability Using Efficient Parametric Model Order Reduction (PL, FL, XL, LTP, SRN), pp. 958–963.
DATEDATE-2005-PomeranzR05a #detection #fault #heuristic
The Accidental Detection Index as a Fault Ordering Heuristic for Full-Scan Circuits (IP, SMR), pp. 1008–1013.
HTHT-2005-HorieYK #analysis #higher-order #rank #web
Higher-order rank analysis for web structure (IH, KY, KK), pp. 98–106.
ICDARICDAR-2005-Meunier #order
Optimized XY-Cut for Determining a Page Reading Order (JLM), pp. 347–351.
ICDARICDAR-2005-QiaoY #approach #image #novel #order
A Novel Approach to Recover Writing Order From Single Stroke Offline Handwritten Images (YQ, MY), pp. 227–231.
ICDARICDAR-2005-RousseauAC #online #order #recognition
Recovery of a Drawing Order from Off-Line Isolated Letters Dedicated to On-Line Recognition (LR, ÉA, JC), pp. 1121–1125.
SIGMODSIGMOD-2005-ChanET
Stratified Computation of Skylines with Partially-Ordered Domains (CYC, PKE, KLT), pp. 203–214.
VLDBVLDB-2005-GuravannavarRS #optimisation #order #parametricity #query
Optimizing Nested Queries with Parameter Sort Orders (RG, HSR, SS), pp. 481–492.
ESOPESOP-2005-BieringBT #higher-order #logic
BI Hyperdoctrines and Higher-Order Separation Logic (BB, LB, NTS), pp. 233–247.
FoSSaCSFoSSaCS-2005-CalcagnoGH #first-order #logic
From Separation Logic to First-Order Logic (CC, PG, MH), pp. 395–409.
FoSSaCSFoSSaCS-2005-MurawskiW #algol #decidability #higher-order
Third-Order Idealized Algol with Iteration Is Decidable (ASM, IW), pp. 202–218.
WCREWCRE-2005-SpoonS #higher-order #navigation #scalability #semantics
Semantic Navigation of Large Code Bases in Higher-Order, Dynamically Typed Languages (SAS, OS), pp. 219–228.
PLDIPLDI-2005-KrishnaswamiA #encapsulation #higher-order
Permission-based ownership: encapsulating state in higher-order typed languages (NRK, JA), pp. 96–106.
DLTDLT-J-2004-RispalC05 #linear #order #set
Complementation of rational sets on countable scattered linear orderings (CR, OC), pp. 767–786.
DLTDLT-2005-BedonR #linear #order #theorem #word
Schützenberger and Eilenberg Theorems for Words on Linear Orderings (NB, CR), pp. 134–145.
DLTDLT-2005-BesC #linear #order #theorem #word
A Kleene Theorem for Languages of Words Indexed by Linear Orderings (AB, OC), pp. 158–167.
ICALPICALP-2005-ReusS #higher-order #hoare #logic
About Hoare Logics for Higher-Order Store (BR, TS), pp. 1337–1348.
IFMIFM-2005-Lang #composition #flexibility #on the fly #partial order #verification
Exp.Open 2.0: A Flexible Tool Integrating Partial Order, Compositional, and On-The-Fly Verification Methods (FL), pp. 70–88.
ICFPICFP-2005-BergerHY #alias #analysis #higher-order #imperative #logic
A logical analysis of aliasing in imperative higher-order functions (MB, KH, NY), pp. 280–293.
EDOCEDOC-2005-WangM #order
Intelligent Aggregation of Purchase Orders in e-Procurement (GW, SM), pp. 27–38.
CIKMCIKM-2005-HaradaH #order #using
Order checking in a CPOE using event analyzer (LH, YH), pp. 549–555.
ICMLICML-2005-DriessensD #first-order #learning #modelling
Combining model-based and instance-based learning for first order regression (KD, SD), pp. 193–200.
ICMLICML-2005-NatarajanTADFR #first-order #learning #modelling #probability
Learning first-order probabilistic models with combining rules (SN, PT, EA, TGD, AF, ACR), pp. 609–616.
KDDKDD-2005-GaoLZCM #clustering #consistency #graph #higher-order #semistructured data
Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering (BG, TYL, XZ, QC, WYM), pp. 41–50.
KDDKDD-2005-UkkonenFM #partial order
Finding partial orders from unordered 0-1 data (AU, MF, HM), pp. 285–293.
SIGIRSIGIR-2005-LiangDT #order #query #summary #using
Using query term order for result summarisation (SFL, SD, JT), pp. 629–630.
PADLPADL-2005-NieuwenborghHV #logic programming #order
An Ordered Logic Program Solver (DVN, SH, DV), pp. 128–142.
POPLPOPL-2005-FlanaganG #model checking #partial order #reduction
Dynamic partial-order reduction for model checking software (CF, PG), pp. 110–121.
SACSAC-2005-Moore #order
Order relations and rigor in computing (REM), p. 2.
SACSAC-2005-Moore05a #order
Order relations and rigor in computing (REM), pp. 1431–1433.
CADECADE-2005-CastelliniS #first-order #logic #proving #theorem proving
Proof Planning for First-Order Temporal Logic (CC, AS), pp. 235–249.
CADECADE-2005-ChaudhuriP #first-order #linear #logic #proving #theorem proving
A Focusing Inverse Method Theorem Prover for First-Order Linear Logic (KC, FP), pp. 69–83.
CADECADE-2005-ContejeanC #first-order #logic #proving #similarity
Reflecting Proofs in First-Order Logic with Equality (EC, PC), pp. 7–22.
CADECADE-2005-Lev-AmiIRSSY #data type #first-order #linked data #logic #open data #reachability #simulation #using #verification
Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures (TLA, NI, TWR, SS, SS, GY), pp. 99–115.
CADECADE-2005-Pientka #higher-order #logic programming
Tabling for Higher-Order Logic Programming (BP), pp. 54–68.
CADECADE-2005-ZhangSM #decidability #first-order
The Decidability of the First-Order Theory of Knuth-Bendix Order (TZ, HBS, ZM), pp. 131–148.
CSLCSL-2005-BenediktS #invariant #query #towards
Towards a Characterization of Order-Invariant Queries over Tame Structures (MB, LS), pp. 276–291.
CSLCSL-2005-CourcelleD #composition #graph #higher-order #logic #monad
The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic (BC, CD), pp. 325–338.
CSLCSL-2005-SeveriV #modelling #order
Order Structures on Böhm-Like Models (PS, FJdV), pp. 103–118.
CSLCSL-2005-Stirling #game studies #higher-order
Higher-Order Matching and Games (CS), pp. 119–134.
FATESFATES-2005-PeledQ #partial order
Time Unbalanced Partial Order (DP, HQ), pp. 152–169.
ICLPICLP-2005-NadathurL #higher-order #on the fly #unification
Practical Higher-Order Pattern Unification with On-the-Fly Raising (GN, NL), pp. 371–386.
LICSLICS-2005-BirkedalTY #higher-order #semantics #type system
Semantics of Separation-Logic Typing and Higher-Order Frame Rules (LB, NTS, HY), pp. 260–269.
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-KieronskiO #decidability #first-order #logic
Small Substructures and Decidability Issues for First-Order Logic with Two Variables (EK, MO), pp. 448–457.
LICSLICS-2005-Lago #geometry #higher-order #linear #recursion
The Geometry of Linear Higher-Order Recursion (UDL), pp. 366–375.
RTARTA-2005-DershowitzE #order
Leanest Quasi-orderings (ND, ECE), pp. 32–45.
RTARTA-2005-FernandezGR #order #termination
Orderings for Innermost Termination (MLF, GG, AR), pp. 17–31.
RTARTA-2005-Hamana #algebra #higher-order #termination
Universal Algebra for Termination of Higher-Order Rewriting (MH), pp. 135–149.
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-DurairajK #constraints #dependence #performance #satisfiability
Variable Ordering for Efficient SAT Search by Analyzing Constraint-Variable Dependencies (VD, PK), pp. 415–422.
ICTSSTestCom-2005-CampbellVHP #multi #order
Multiplexing of Partially Ordered Events (CC, MV, JH, AP), pp. 97–110.
TLCATLCA-2005-AehligMO #decidability #higher-order #monad #recursion
The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable (KA, JGdM, CHLO), pp. 39–54.
TLCATLCA-2005-BoveC #higher-order #recursion
Recursive Functions with Higher Order Domains (AB, VC), pp. 116–130.
TLCATLCA-2005-SchurmannPS #calculus #encoding #functional #higher-order #programming
The [triangle]-Calculus. Functional Programming with Higher-Order Encodings (CS, AP, JS), pp. 339–353.
TLCATLCA-2005-Zanardini #higher-order
Higher-Order Abstract Non-interference (DZ), pp. 417–432.
ASEASE-2004-DwyerRTV #interactive #model checking #order
Analyzing Interaction Orderings with Model Checking (MBD, R, OT, WV), pp. 154–163.
DACDAC-2004-VisweswariahRKWN #analysis #first-order #incremental #statistics
First-order incremental block-based statistical timing analysis (CV, KR, KK, SGW, SN), pp. 331–336.
DACDAC-2004-WangJHS #bound #model checking #satisfiability
Refining the SAT decision ordering for bounded model checking (CW, HJ, GDH, FS), pp. 535–538.
DACDAC-2004-YangM #adaptation #higher-order #modelling
An Essentially Non-Oscillatory (ENO) high-order accurate Adaptive table model for device modeling (BY, BM), pp. 864–867.
DATEDATE-v1-2004-LegerR #first-order
A Digital Test for First-Order [Sigma-Delta] Modulators (GL, AR), pp. 708–709.
DATEDATE-v2-2004-Feldmann #linear #order #reduction #scalability
Model Order Reduction Techniques for Linear Systems with Large Numbers of Terminals (PF), pp. 944–947.
DATEDATE-v2-2004-FengZCZF #analysis #order #reduction
Direct Nonlinear Order Reduction with Variational Analysis (LF, XZ, CC, DZ, QF), pp. 1316–1321.
PODSPODS-2004-BenediktLBW #first-order
A Characterization of First-Order Topological Properties of Planar Spatial Data (MB, CL, JVdB, TW), pp. 107–114.
PODSPODS-2004-FaginPKT #dependence #higher-order
Composing Schema Mappings: Second-Order Dependencies to the Rescue (RF, PGK, LP, WCT), pp. 83–94.
PODSPODS-2004-GreenwaldK #network #statistics
Power-Conserving Computation of Order-Statistics over Sensor Networks (MG, SK), pp. 275–285.
PODSPODS-2004-Marx #first-order #xpath
Conditional XPath, the First Order Complete XPath Dialect (MM), pp. 13–22.
PODSPODS-2004-NashL #data access #first-order #query
Processing First-Order Queries under Limited Access Patterns (AN, BL), pp. 307–318.
SIGMODSIGMOD-2004-AgrawalKSX #encryption
Order-Preserving Encryption for Numeric Data (RA, JK, RS, YX), pp. 563–574.
SIGMODSIGMOD-2004-BabuMMNW #adaptation #pipes and filters
Adaptive Ordering of Pipelined Stream Filters (SB, RM, KM, IN, JW), pp. 407–418.
VLDBVLDB-2004-NeumannM #framework #optimisation #order
A Combined Framework for Grouping and Order Optimization (TN, GM), pp. 960–971.
FoSSaCSFoSSaCS-2004-GenestMMP #partial order #specification #using #verification
Specifying and Verifying Partial Order Properties Using Template MSCs (BG, MM, AM, DP), pp. 195–210.
TACASTACAS-2004-BeauquierCP #automation #first-order #logic #parametricity #protocol #state machine #verification
Automatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic (DB, TC, EP), pp. 372–387.
TACASTACAS-2004-LugiezNZ #approach #automaton #explosion #partial order #problem #semantics
A Partial Order Semantics Approach to the Clock Explosion Problem of Timed Automata (DL, PN, SZ), pp. 296–311.
ICSMEICSM-2004-GalliLNW #debugging #testing
Ordering Broken Unit Tests for Focused Debugging (MG, ML, ON, RW), pp. 114–123.
WCREWCRE-2004-LakhotiaM #anti #order
Imposing Order on Program Statements to Assist Anti-Virus Scanners (AL, MM), pp. 161–170.
DLTDLT-2004-DAlessandroV #set
Avoidable Sets and Well Quasi-Orders (FD, SV), pp. 139–150.
DLTDLT-2004-RispalC #linear #order #set
Complementation of Rational Sets on Countable Scattered Linear Orderings (CR, OC), pp. 381–392.
ICALPICALP-2004-Kunc
Regular Solutions of Language Inequalities and Well Quasi-orders (MK), pp. 870–881.
ICFPICFP-2004-GauthierP #canonical #first-order #higher-order #matter #recursion
Numbering matters: first-order canonical forms for second-order recursive types (NG, FP), pp. 150–161.
ICFPICFP-2004-MarlowJ #higher-order #performance
Making a fast curry: push/enter vs. eval/apply for higher-order languages (SM, SLPJ), pp. 4–15.
ICGTICGT-2004-Casas-GarrigaB #partial order
Coproduct Transformations on Lattices of Closed Partial Orders (GCG, JLB), pp. 336–351.
ICGTICGT-2004-Rensink #first-order #graph #logic #representation #using
Representing First-Order Logic Using Graphs (AR), pp. 319–335.
ICEISICEIS-v2-2004-Azevedo #bibliography #order #requirements
Order Planning Decision Support System for Customer Driven Manufacturing: Overview of Main System Requirements (HP, ALA), pp. 417–422.
ICMLICML-2004-DingH #clustering
Linearized cluster assignment via spectral ordering (CHQD, XH).
ICMLICML-2004-NatteeSNO #first-order #learning #mining #multi
Learning first-order rules from data with multiple parts: applications on mining chemical compound data (CN, SS, MN, TO).
ICPRICPR-v2-2004-BoyerJ #detection #order #robust
Perceptual Organization in Range Data: Robust Detection of Low Order Surfaces in Heavy Clutter (KLB, KJ), pp. 102–105.
ICPRICPR-v2-2004-Clocksin #order #recognition #using
Handwritten Syriac Character Recognition using Order Structure Invariance (WFC), pp. 562–565.
ICPRICPR-v4-2004-KobayashiO #higher-order #identification #multi #polynomial #using
Action and Simultaneous Multiple-Person Identification Using Cubic Higher-Order Local Auto-Correlation (TK, NO), pp. 741–744.
ICPRICPR-v4-2004-Syeda-Mahmood #clustering
Order-Preserving Clustering and Its Application to Gene Expression Data (TFSM), pp. 637–640.
KDDKDD-2004-TanJ #multi
Ordering patterns by combining opinions from multiple sources (PNT, RJ), pp. 695–700.
KRKR-2004-Davis #communication #first-order
A First-Order Theory of Communicating First-Order Formulas (ED), pp. 235–245.
SEKESEKE-2004-KhoshgoftaarXG #modelling #multi #optimisation
Multi-Objective Optimization by CBR GA-Optimizer for Module-Order Modeling (TMK, YX, KG), pp. 220–225.
PPDPPPDP-2004-HondaY #composition #higher-order #logic #polymorphism
A compositional logic for polymorphic higher-order functions (KH, NY), pp. 191–202.
POPLPOPL-2004-Yoshida #dependent type #higher-order #mobile #process
Channel dependent types for higher-order mobile processes (NY), pp. 147–160.
SACSAC-2004-BettiniBL #calculus #higher-order #mixin
A core calculus of higher-order mixins and classes (LB, VB, SL), pp. 1508–1509.
SACSAC-2004-KehagiasSCM #data flow
Information agents cooperating with heterogenous data sources for customer-order management (DK, ALS, KCC, PAM), pp. 52–57.
ICSEICSE-2004-ZhangGZ #diagrams #dynamic analysis #order #performance #slicing #using
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams (XZ, RG, YZ), pp. 502–511.
HPCAHPCA-2004-CristalOLV #commit
Out-of-Order Commit Processors (AC, DO, JL, MV), pp. 48–59.
CAVCAV-2004-Arons #algorithm #execution #verification
Verification of an Advanced mips-Type Out-of-Order Execution Algorithm (TA), pp. 414–426.
CAVCAV-2004-GoelB #abstraction #functional #model checking #order #simulation
Symbolic Simulation, Model Checking and Abstraction with Partially Ordered Boolean Functional Vectors (AG, REB), pp. 255–267.
CAVCAV-2004-GopalakrishnanYS #execution #memory management #order #performance #verification
QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings (GG, YY, HS), pp. 401–413.
CAVCAV-2004-RayH #deduction #first-order #pipes and filters #quantifier #using #verification
Deductive Verification of Pipelined Machines Using First-Order Quantification (SR, WAHJ), pp. 31–43.
CSLCSL-2004-GrooteS #higher-order #linear #λ-calculus
Higher-Order Matching in the Linear λ-calculus with Pairing (PdG, SS), pp. 220–234.
CSLCSL-2004-Skelley #bound #higher-order
A Third-Order Bounded Arithmetic Theory for PSPACE (AS), pp. 340–354.
FATESFATES-2004-KapoorB #mutation testing #testing
Ordering Mutants to Minimise Test Effort in Mutation Testing (KK, JPB), pp. 195–209.
ICLPICLP-2004-NieuwenborghHV #multi #on the #order #source code
On Programs with Linearly Ordered Multiple Preferences (DVN, SH, DV), pp. 180–194.
IJCARIJCAR-2004-BofillR #order
Redundancy Notions for Paramodulation with Non-monotonic Orderings (MB, AR), pp. 107–121.
IJCARIJCAR-2004-GilHSZ #algorithm #constraints #finite #order #performance #problem
Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract (ÀJG, MH, GS, BZ), pp. 244–258.
IJCARIJCAR-2004-Gottlob #finite #higher-order #logic #research
Second-Order Logic over Finite Structures — Report on a Research Programme (GG), pp. 229–243.
IJCARIJCAR-2004-Lochner #order
A Redundancy Criterion Based on Ground Reducibility by Ordered Rewriting (BL), pp. 45–59.
IJCARIJCAR-2004-RiazanovV #constraints #performance
Efficient Checking of Term Ordering Constraints (AR, AV), pp. 60–74.
LICSLICS-2004-CookK #higher-order
A Second-Order Theory for NL (SAC, AK), pp. 398–407.
LICSLICS-2004-DalmauKL #first-order #graph #problem #reflexive
First-Order Definable Retraction Problems for Posets and Reflexive Graph (VD, AAK, BL), pp. 232–241.
LICSLICS-2004-GroheS #first-order #linear #logic
The Succinctness of First-Order Logic on Linear Orders (MG, NS), pp. 438–447.
LICSLICS-2004-Luosto #linear #order
Equicardinality on Linear Orders (KL), pp. 458–465.
LICSLICS-2004-NguyenC #higher-order
VTC circ: A Second-Order Theory for TCcirc (PN, SAC), pp. 378–387.
RTARTA-2004-AotoYT #higher-order #induction #theorem
Inductive Theorems for Higher-Order Rewriting (TA, TY, YT), pp. 269–284.
RTARTA-2004-Blanqui #higher-order #term rewriting #termination #type system
A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems (FB), pp. 24–39.
RTARTA-2004-LevySV #higher-order #monad #unification
Monadic Second-Order Unification Is NP-Complete (JL, MSS, MV), pp. 55–69.
RTARTA-2004-Toyama #higher-order #lisp #term rewriting #termination
Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms (YT), pp. 40–54.
DACDAC-2003-GadN #congruence #order #reduction #using
Model order reduction of nonuniform transmission lines using integrated congruence transform (EG, MSN), pp. 238–243.
DACDAC-2003-GoelHB #order #representation
Symbolic representation with ordered function templates (AG, GH, REB), pp. 431–435.
DACDAC-2003-LiP #named #order #reduction
NORM: compact model order reduction of weakly nonlinear systems (PL, LTP), pp. 472–477.
DACDAC-2003-MeiAI #order #performance #reduction
Efficient model order reduction including skin effect (SM, CSA, YII), pp. 232–237.
DACDAC-2003-VasilyevRW #algorithm #generative #modelling
A TBR-based trajectory piecewise-linear algorithm for generating accurate low-order models for nonlinear analog circuits and MEMS (DV, MR, JW), pp. 490–495.
DATEDATE-2003-MansourM #reduction
Model-Order Reduction Based on PRONY’s Method (MMM, AM), pp. 10530–10535.
ICDARICDAR-2003-KangD #classification #dependence #higher-order #multi
Combining Multiple Classifiers based on Third-Order Dependency (HJK, DSD), pp. 21–25.
ICDARICDAR-2003-NakaiSS #generative #recognition #taxonomy
Generation of Hierarchical Dictionary for Stroke-order Free Kanji Handwriting Recognition Based on Substroke HMM (MN, HS, SS), pp. 514–518.
VLDBVLDB-2003-LernerS #named #optimisation #order #query
AQuery: Query Language for Ordered Data, Optimization Techniques, and Experiments (AL, DS), pp. 345–356.
VLDBVLDB-2003-LongS #execution #query #scalability
Optimized Query Execution in Large Search Engines with Global Page Ordering (XL, TS), pp. 129–140.
VLDBVLDB-2003-QianZXP #multi
The ND-Tree: A Dynamic Indexing Technique for Multidimensional Non-ordered Discrete Data Spaces (GQ, QZ, QX, SP), pp. 620–631.
VLDBVLDB-2003-WangC #query
Avoiding Ordering and Grouping In Query Processing (XW, MC), pp. 826–837.
ESOPESOP-2003-HaackW #fault #higher-order #slicing
Type Error Slicing in Implicitly Typed Higher-Order Languages (CH, JBW), pp. 284–301.
FoSSaCSFoSSaCS-2003-AbelMU #data type #higher-order
Generalized Iteration and Coiteration for Higher-Order Nested Datatypes (AA, RM, TU), pp. 54–69.
FoSSaCSFoSSaCS-2003-Bonelli #calculus #higher-order #normalisation
A Normalisation Result for Higher-Order Calculi with Explicit Substitutions (EB), pp. 153–168.
FoSSaCSFoSSaCS-2003-MomiglianoA #higher-order #multi #syntax
Multi-level Meta-reasoning with Higher-Order Abstract Syntax (AM, SA), pp. 375–391.
DLTDLT-2003-DAlessandroV #on the
On Well Quasi-orders on Languages (FD, SV), pp. 230–241.
ICALPICALP-2003-Cachat #automaton #game studies #graph #higher-order
Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games (TC), pp. 556–569.
ICALPICALP-2003-Hannay #axiom #data type #higher-order
Axiomatic Criteria for Quotients and Subobjects for Higher-Order Data Types (JEH), pp. 903–917.
ICALPICALP-2003-KlaedtkeR #higher-order #logic #monad
Monadic Second-Order Logics with Cardinalities (FK, HR), pp. 681–696.
ICFPICFP-2003-WashburnW #encoding #higher-order #morphism #parametricity #polymorphism #syntax
Boxes go bananas: encoding higher-order abstract syntax with parametric polymorphism (GW, SW), pp. 249–262.
IFLIFL-2003-VasconcelosH #equation #functional #higher-order #polymorphism #recursion #source code
Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs (PBV, KH), pp. 86–101.
CIKMCIKM-2003-FisherLSW #performance #xml
Efficient ordering for XML data (DKF, FL, WMS, RKW), pp. 350–357.
ICMLICML-2003-PorterEHT #classification #order #scalability #statistics
Weighted Order Statistic Classifiers with Large Rank-Order Margin (RBP, DE, DRH, JT), pp. 600–607.
KDDKDD-2003-GionisKM #order
Fragments of order (AG, TK, HM), pp. 129–136.
KDDKDD-2003-Kamishima #collaboration #order #recommendation
Nantonac collaborative filtering: recommendation based on order responses (TK), pp. 583–588.
ECOOPECOOP-2003-Ernst #higher-order
Higher-Order Hierarchies (EE), pp. 303–328.
GPCEGPCE-2003-WangM #on the #staged
On Stage Ordering in Staged Computation (ZW, RRM), pp. 77–96.
LOPSTRLOPSTR-2003-YokoyamaHT #higher-order #program transformation
Deterministic Higher-Order Patterns for Program Transformation (TY, ZH, MT), pp. 128–142.
POPLPOPL-2003-DreyerCH #higher-order #type system
A type system for higher-order modules (DD, KC, RH), pp. 236–249.
POPLPOPL-2003-HofmannJ #first-order #functional #predict #source code
Static prediction of heap space usage for first-order functional programs (MH, SJ), pp. 185–197.
POPLPOPL-2003-SchmittS #calculus #distributed #higher-order #process
The m-calculus: a higher-order distributed process calculus (AS, JBS), pp. 50–61.
HPCAHPCA-2003-MutluSWP #execution #scalability
Runahead Execution: An Alternative to Very Large Instruction Windows for Out-of-Order Processors (OM, JS, CW, YNP), pp. 129–140.
PPoPPPPoPP-2003-FrensW #matrix #memory management #parallel
Factorization with morton-ordered quadtree matrices for memory re-use and parallelism (JDF, DSW), pp. 144–154.
CADECADE-2003-KorovinV #order
An AC-Compatible Knuth-Bendix Order (KK, AV), pp. 47–59.
CADECADE-2003-MehtaN #higher-order #logic #pointer #proving #source code
Proving Pointer Programs in Higher-Order Logic (FM, TN), pp. 121–135.
CADECADE-2003-Nivelle #axiom #first-order #proving
Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms (HdN), pp. 365–379.
CADECADE-2003-PientkaP #higher-order #optimisation #unification
Optimizing Higher-Order Pattern Unification (BP, FP), pp. 473–487.
CADECADE-2003-Schmidt-Schauss #bound #decidability #higher-order
Decidability of Arity-Bounded Higher-Order Matching (MSS), pp. 488–502.
CADECADE-2003-SchmidtH #axiom #first-order
A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae (RAS, UH), pp. 412–426.
CAVCAV-2003-LahiriB #deduction #verification
Deductive Verification of Advanced Out-of-Order Microprocessors (SKL, REB), pp. 341–353.
CSLCSL-2003-Vermeulen #first-order #logic #semantics
More Computation Power for a Denotational Semantics for First Order Logic (KFMV), pp. 530–543.
ICLPICLP-2003-NieuwenborghV #order
Order and Negation as Failure (DVN, DV), pp. 194–208.
ICLPICLP-2003-Pientka #higher-order
Higher-Order Substitution Tree Indexing (BP), pp. 377–391.
ICLPICLP-2003-Smaus #equation #first-order #question #semantics
Is There an Optimal Generic Semantics for First-Order Equations? (JGS), pp. 438–450.
LICSLICS-2003-GurevichS #higher-order #monad
Spectra of Monadic Second-Order Formulas with One Unary Function (YG, SS), pp. 291–300.
LICSLICS-2003-KhoussainovRS #automation #on the #partial order
On Automatic Partial Orders (BK, SR, FS), pp. 168–177.
LICSLICS-2003-KorovinV #order
Orienting Equalities with the Knuth-Bendix Order (KK, AV), p. 75–?.
RTARTA-2003-BorrallerasR #order #semantics
Monotonic AC-Compatible Semantic Path Orderings (CB, AR), pp. 279–295.
RTARTA-2003-Bruggink #higher-order
Residuals in Higher-Order Rewriting (HJSB), pp. 123–137.
RTARTA-2003-Comon-LundhC #decidability #encryption #first-order #logic #protocol
New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols (HCL, VC), pp. 148–164.
RTARTA-2003-KhasidashviliG #partial order #semantics #term rewriting
Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication) (ZK, JRWG), pp. 467–482.
RTARTA-2003-SalvatiG #complexity #higher-order #linear #on the #λ-calculus
On the Complexity of Higher-Order Matching in the Linear λ-Calculus (SS, PdG), pp. 234–245.
TLCATLCA-2003-Power #higher-order
A Universal Embedding for the Higher Order Structure of Computational Effects (JP), pp. 301–315.
DACDAC-2002-AttarhaN #analysis #fault #modelling #using
Signal integrity fault analysis using reduced-order modeling (AA, MN), pp. 367–370.
DACDAC-2002-DanielP #distributed #order #reduction #strict
Model order reduction for strictly passive and causal distributed systems (LD, JRP), pp. 46–51.
DACDAC-2002-PhillipsDS #order #reduction
Guaranteed passive balancing transformations for model order reduction (JRP, LD, LMS), pp. 52–57.
DATEDATE-2002-BystrovKY #design #modelling #partial order #visualisation
Visualization of Partial Order Models in VLSI Design Flow (AVB, MK, AY), p. 1089.
DATEDATE-2002-Dubrova #composition #order
Composition Trees in Finding Best Variable Orderings for ROBDDs (ED), p. 1084.
DATEDATE-2002-MishraDNT #automation #execution #functional #multi #pipes and filters #verification
Automatic Verification of In-Order Execution In Microprocessors with Fragmented Pipelines and Multicycle Functional Units (PM, NDD, AN, HT), pp. 36–43.
DATEDATE-2002-Velev #similarity #using #verification
Using Rewriting Rules and Positive Equality to Formally Verify Wide-Issue Out-of-Order Microprocessors with a Reorder Buffer (MNV), pp. 28–35.
DATEDATE-2002-XuM #matrix
Formulation of Low-Order Dominant Poles for Y-Matrix of Interconnects (QX, PM), pp. 820–825.
SIGMODSIGMOD-2002-TatarinovVBSSZ #database #order #query #relational #using #xml
Storing and querying ordered XML using a relational database system (IT, SV, KSB, JS, EJS, CZ), pp. 204–215.
ESOPESOP-2002-Glew #formal method #higher-order
A Theory of Second-Order Trees (NG), pp. 147–161.
ESOPESOP-2002-Weirich #analysis #higher-order
Higher-Order Intensional Type Analysis (SW), pp. 98–114.
FoSSaCSFoSSaCS-2002-Courcelle #higher-order #monad #semantics
Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations (BC), pp. 1–4.
FoSSaCSFoSSaCS-2002-DanvyN #continuation #first-order
A First-Order One-Pass CPS Transformation (OD, LRN), pp. 98–113.
FoSSaCSFoSSaCS-2002-KnapikNU #automaton #higher-order
Higher-Order Pushdown Trees Are Easy (TK, DN, PU), pp. 205–222.
PEPMPEPM-2002-GomezL #analysis #automation #bound #higher-order
Automatic time-bound analysis for a higher-order language (GG, YAL), pp. 75–86.
SASSAS-2002-ManevichRFGS #first-order #representation #static analysis
Compactly Representing First-Order Structures for Static Analysis (RM, GR, JF, DG, SS), pp. 196–212.
FLOPSFLOPS-2002-KasuyaSA #higher-order #normalisation #term rewriting
Descendants and Head Normalization of Higher-Order Rewrite Systems (HK, MS, KA), pp. 198–211.
DLTDLT-2002-BruyereC #automaton #linear #order
Automata on Linear Orderings (VB, OC), pp. 103–115.
ICALPICALP-2002-Colcombet #decidability #first-order #graph #on the #product line #reachability
On Families of Graphs Having a Decidable First Order Theory with Reachability (TC), pp. 98–109.
ICFPICFP-2002-FindlerF #contract #higher-order
Contracts for higher-order functions (RBF, MF), pp. 48–59.
ICFPICFP-2002-NeubauerT #higher-order #morphism #polymorphism
Type classes with more higher-order polymorphism (MN, PT), pp. 179–190.
ICGTICGT-2002-MontanariR #algebra #graph grammar #linear #order
Linear Ordered Graph Grammars and Their Algebraic Foundations (UM, LR), pp. 317–333.
ICGTICGT-2002-WooY #order
Hierarchical Vertex Ordering (SHW, SBY), pp. 393–401.
ICPRICPR-v2-2002-ForestiCS #adaptation #higher-order #pattern matching #pattern recognition #recognition
Adaptive High Order Neural Trees for Pattern Recognition (GLF, CM, LS), p. 877–?.
ICPRICPR-v3-2002-RavindranF #linear
A Simple Linear Method to Obtain Height Ordering of Scene Points (PR, NJF), pp. 719–722.
KRKR-2002-Gardenfors #concept #higher-order #induction #similarity
The Role of Higher Order Similarity in Induction and Concept Formation (PG), p. 629.
KRKR-2002-Lakemeyer #first-order #knowledge base #reasoning
Evaluation-Based Reasoning with Disjunctive Information in First-Order Knowledge Bases (GL), pp. 73–81.
SEKESEKE-2002-BriandFL #algorithm #integration #metric #order #search-based #using
Using genetic algorithms and coupling measures to devise optimal integration test orders (LCB, JF, YL), pp. 43–50.
SEKESEKE-2002-WohlinA #order
Analysing primary and lower order project success drivers (CW, AAA), pp. 393–400.
GPCEGPCE-2002-Saraiva #attribute grammar #component #higher-order #programming
Component-Based Programming for Higher-Order Attribute Grammars (JS), pp. 268–282.
LOPSTRLOPSTR-2002-ColvinHHS #higher-order #logic programming #refinement #source code
Refinement of Higher-Order Logic Programs (RC, IJH, DH, PAS), pp. 126–143.
LOPSTRLOPSTR-2002-FioravantiPP #higher-order #logic #logic programming #monad #program transformation #source code
Combining Logic Programs and Monadic Second Order Logics by Program Transformation (FF, AP, MP), pp. 160–181.
PPDPPPDP-2002-OstrovskyPT #calculus #higher-order #towards
Towards a primitive higher order calculus of broadcasting systems (KO, KVSP, WT), pp. 2–13.
PADLPADL-2002-Liang #compilation #higher-order #logic programming
Compiler Construction in Higher Order Logic Programming (CL), pp. 47–63.
PADLPADL-2002-VandeginsteSD #garbage collection #order #prolog
Segment Order Preserving and Generational Garbage Collection for Prolog (RV, KFS, BD), pp. 299–317.
POPLPOPL-2002-SuANPT #constraints #first-order #type system
The first-order theory of subtyping constraints (ZS, AA, JN, TP, RT), pp. 203–216.
SACSAC-2002-FujimotoNHN #latency #order
Response order rearrangement on a caching proxy for reducing WWW latency (HF, TN, KH, SN), pp. 845–851.
SPLCSPLC-2002-Mannion #first-order #logic #product line #using #validation
Using First-Order Logic for Product Line Model Validation (MM), pp. 176–187.
HPCAHPCA-2002-WangWCGKS #execution #memory management
Memory Latency-Tolerance Approaches for Itanium Processors: Out-of-Order Execution vs. Speculative Precomputation (PHW, HW, JDC, EG, RMK, JPS), pp. 187–196.
CADECADE-2002-AudemardB #finite #generative #reasoning #symmetry
Reasoning by Symmetry and Function Ordering in Finite Model Generation (GA, BB), pp. 226–240.
CADECADE-2002-BofillR #order
Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation (MB, AR), pp. 456–470.
CADECADE-2002-BorrallerasLR #order #recursion
Recursive Path Orderings Can Be Context-Sensitive (CB, SL, AR), pp. 314–331.
CADECADE-2002-Brown #higher-order #proving #set #theorem proving
Solving for Set Variables in Higher-Order Theorem Proving (CEB), pp. 408–422.
CADECADE-2002-Hurd #first-order #interface #logic
An LCF-Style Interface between HOL and First-Order Logic (JH), pp. 134–138.
CAVCAV-2002-BarrettDS #first-order #incremental #satisfiability
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT (CWB, DLD, AS), pp. 236–249.
CAVCAV-2002-Jacobi #model checking #pipes and filters #verification
Formal Verification of Complex Out-of-Order Pipelines by Combining Model-Checking and Theorem-Proving (CJ0), pp. 309–323.
CSLCSL-2002-Goubault-Larrecq #constraints #higher-order #set
Higher-Order Positive Set Constraints (JGL), pp. 473–489.
CSLCSL-2002-Schmidt-SchaussS #bound #decidability #higher-order #unification
Decidability of Bounded Higher-Order Unification (MSS, KUS), pp. 522–536.
ICLPICLP-2002-Pientka #higher-order #logic programming
A Proof-Theoretic Foundation for Tabled Higher-Order Logic Programming (BP), pp. 271–286.
LICSLICS-2002-FrickG #complexity #first-order #higher-order #logic #monad #revisited
The Complexity of First-Order and Monadic Second-Order Logic Revisited (MF, MG), pp. 215–224.
LICSLICS-2002-HodkinsonWZ #branch #decidability #first-order #logic
Decidable and Undecidable Fragments of First-Order Branching Temporal Logics (IMH, FW, MZ), pp. 393–402.
LICSLICS-2002-Ong #algol #decidability #equivalence
Observational Equivalence of 3rd-Order Idealized Algol is Decidable (CHLO), pp. 245–256.
RTARTA-2002-DoughertyW #decidability #higher-order
A Decidable Variant of Higher Order Matching (DJD, TW), pp. 340–351.
RTARTA-2002-LevyV #higher-order #problem #unification
Currying Second-Order Unification Problems (JL, MV), pp. 326–339.
VMCAIVMCAI-2002-CoppoD #higher-order #mobile
A Fully Abstract Model for Higher-Order Mobile Ambients (MC, MDC), pp. 255–271.
ASEASE-2001-BastenB #clustering #partial order #process #reduction
Enhancing Partial-Order Reduction via Process Clustering (TB, DB), pp. 245–253.
ASEASE-2001-CookIM #higher-order #proving #synthesis #theorem proving
Higher Order Function Synthesis Through Proof Planning (AC, AI, GM), pp. 307–310.
DACDAC-2001-LepakLH #constraints
Simultaneous Shield Insertion and Net Ordering under Explicit RLC Noise Constraint (KML, IL, LH), pp. 199–202.
DATEDATE-2001-StaverenV #order
Order determination for frequency compensation of negative-feedback systems (AvS, CJMV), p. 815.
ICDARICDAR-2001-BagdanovW #classification #documentation #fine-grained #first-order #graph #random #using
Fine-Grained Document Genre Classification Using First Order Random Graphs (ADB, MW), pp. 79–85.
ICDARICDAR-2001-BelaidBVK #adaptation #segmentation
Adaptive Technology for Mail-Order Form Segmentation (AB, YB, LNV, SK), pp. 689–693.
PODSPODS-2001-Schuldt #execution #order #process #protocol #transaction
Process Locking: A Protocol based on Ordered Shared Locks for the Execution of Transactional Processes (HS).
FoSSaCSFoSSaCS-2001-RocklHB #formal method #higher-order #induction #syntax #π-calculus
Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the π-Calculus and Mechanizing the Theory of Contexts (CR, DH, SB), pp. 364–378.
TACASTACAS-2001-RuysLKLM #algebra #analysis #partial order #probability #process #using
First Passage Time Analysis of Stochastic Process Algebra Using Partial Orders (TCR, RL, JPK, DL, MM), pp. 220–235.
FLOPSFLOPS-2001-BozzanoDM #bottom-up #effectiveness #first-order #linear #logic programming #semantics #source code
An Effective Bottom-Up Semantics for First-Order Linear Logic Programs (MB, GD, MM), pp. 138–152.
FLOPSFLOPS-2001-DanvyN #higher-order
A Higher-Order Colon Translation (OD, LRN), pp. 78–91.
FLOPSFLOPS-2001-LeachN #constraints #higher-order #logic programming #programming language
A Higher-Order Logic Programming Language with Constraints (JL, SN), pp. 108–122.
FLOPSFLOPS-2001-PolakovY #exception #framework #logic #order #proving
Proving Syntactic Properties of Exceptions in an Ordered Logical Framework (JP, KY), pp. 61–77.
CIAACIAA-2001-HolzerK #encoding #image #order #using
Improving Raster Image Run-Length Encoding Using Data Order (MH, MK), pp. 161–176.
DLTDLT-2001-EiterGS #higher-order #logic #string
Second-Order Logic over Strings: Regular and Non-regular Fragments (TE, GG, TS), pp. 37–56.
DLTDLT-2001-SchwentickTV #automaton
Partially-Ordered Two-Way Automata: A New Characterization of DA (TS, DT, HV), pp. 239–250.
ICALPICALP-2001-HoyerNS #order #quantum #sorting
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness (PH, JN, YS), pp. 346–357.
ICALPICALP-2001-Nielsen #modelling #partial order #question #why
Modelling with Partial Orders — Why and Why Not? (MN), pp. 61–63.
ICEISICEIS-v1-2001-AzevedoTB #enterprise #order
An Intelligent Agent-Based Order Planning for Dynamic Networked Enterprises (ALA, CT, JB), pp. 322–329.
ICEISICEIS-v1-2001-SierraRLG #analysis #image #machine learning #mobile #order #recognition
Machine Learning Approaches for Image Analysis: Recognition of Hand Orders by a Mobile Robot (BS, IR, EL, UG), pp. 330–335.
ICEISICEIS-v2-2001-HikitaM #first-order #logic #modelling #ontology #process
Business Process Modeling Based on the Ontology and First-Order Logic (TH, MJM), pp. 717–723.
KDDKDD-2001-BeygelzimerPM #category theory #dataset #performance #scalability #visualisation
Fast ordering of large categorical datasets for better visualization (AB, CSP, SM), pp. 239–244.
MLDMMLDM-2001-MalerbaELL #first-order #induction #recognition
First-Order Rule Induction for the Recognition of Morphological Patterns in Topographic Maps (DM, FE, AL, FAL), pp. 88–101.
SACSAC-2001-MaddiD #algorithm #performance
An efficient algorithm for causal messages ordering (AM, FD), pp. 499–503.
HPCAHPCA-2001-MichaudS #data flow #scalability
Data-Flow Prescheduling for Large Instruction Windows in Out-of-Order Processors (PM, AS), pp. 27–36.
PPoPPPPoPP-2001-WiseFGA #matrix
Language support for Morton-order matrices (DSW, JDF, YG, GAA), pp. 24–33.
CSLCSL-2001-Bezem #higher-order #logic programming #source code
An Improved Extensionality Criterion for Higher-Order Logic Programs (MB), pp. 203–216.
CSLCSL-2001-Koriche #approximate #first-order #logic #reasoning
A Logic for Approximate First-Order Reasoning (FK), pp. 262–276.
CSLCSL-2001-KorovinaK #higher-order #semantics
Semantic Characterisations of Second-Order Computability over the Real Numbers (MVK, OVK), pp. 160–172.
CSLCSL-2001-Schurmann #encoding #higher-order #recursion
Recursion for Higher-Order Encodings (CS), pp. 585–599.
CSLCSL-2001-Schweikardt #database #order
The Natural Order-Generic Collapse for ω-Representable Databases over the Rational and the Real Ordered Group (NS), pp. 130–144.
ICLPICLP-2001-KaneiwaT #order
An Order-Sorted Resolution with Implicitly Negative Sorts (KK, ST), pp. 300–314.
IJCARIJCAR-2001-BeckertS #calculus #first-order #logic
A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities (BB, SS), pp. 626–641.
IJCARIJCAR-2001-Beeson #higher-order #proving #theorem proving
A Second-Order Theorem Prover Applied to Circumscription (MB), pp. 318–324.
IJCARIJCAR-2001-HahnleMR #graph #order
Ordered Resolution vs. Connection Graph Resolution (RH, NVM, ER), pp. 182–194.
IJCARIJCAR-2001-HodasT #agile #first-order #implementation #linear #logic #named #proving #theorem proving
lolliCop — A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic (JSH, NT), pp. 670–684.
IJCARIJCAR-2001-Pientka #higher-order #logic programming #reduction #source code #termination
Termination and Reduction Checking for Higher-Order Logic Programs (BP), pp. 401–415.
IJCARIJCAR-2001-Waldmann #order
Superposition and Chaining for Totally Ordered Divisible Abelian Groups (UW), pp. 226–241.
LICSLICS-2001-Avigad #first-order #logic
Eliminating Definitions and Skolem Functions in First-Order Logic (JA), pp. 139–146.
LICSLICS-2001-CookK #higher-order #reasoning #theorem #using
A Second-Order System for Polytime Reasoning Using Graedel’s Theorem (SAC, AK), pp. 177–186.
LICSLICS-2001-GodoyN #constraints #deduction #monad #on the
On Ordering Constraints for Deduction with Built-In Abelian Semigroups, Monoids and Groups (GG, RN), pp. 38–47.
LICSLICS-2001-HuuskonenH #logic #on the #order
On Definability of Order in Logic with Choice (TH, TH), pp. 167–172.
RTARTA-2001-BerarducciB #algebra #higher-order #recursion
General Recursion on Second Order Term Algebras (AB, CB), pp. 15–30.
RTARTA-2001-BonelliKR #first-order #higher-order
From Higher-Order to First-Order Rewriting (EB, DK, AR), pp. 47–62.
RTARTA-2001-KorovinV #order #using #verification
Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order (KK, AV), pp. 137–153.
RTARTA-2001-Raamsdonk #higher-order #on the #termination
On Termination of Higher-Order Rewriting (FvR), pp. 261–275.
RTARTA-2001-VestergaardB #confluence #first-order #proving #using #λ-calculus
A Formalised First-Order Confluence Proof for the λ-Calculus Using One-Sorted Variable Names (RV, JB), pp. 306–321.
TLCATLCA-2001-Altenkirch #algebra #first-order
Representations of First Order Function Types as Terminal Coalgebras (TA), pp. 8–21.
TLCATLCA-2001-Geuvers #dependent type #higher-order #induction #type system
Induction Is Not Derivable in Second Order Dependent Type Theory (HG), pp. 166–181.
TLCATLCA-2001-Leiss #higher-order #independence #representation
Second-Order Pre-Logical Relations and Representation Independence (HL), pp. 298–314.
TLCATLCA-2001-Matthes #higher-order #induction #λ-calculus #μ-calculus
Parigot’s Second Order λμ-Calculus and Inductive Types (RM), pp. 329–343.
TLCATLCA-2001-Schubert #complexity #order
The Complexity of β-Reduction in Low Orders (AS), pp. 400–414.
DACDAC-2000-GadDNA #distributed #multi #order #reduction
Passive model order reduction of multiport distributed interconnects (EG, AD, MSN, RA), pp. 526–531.
DACDAC-2000-LuJCF #performance #using
Efficient variable ordering using aBDD based sampling (YL, JJ, EMC, MF), pp. 687–692.
DACDAC-2000-WangN #analysis #linear #multi #order
Extended Krylov subspace method for reduced order analysis of linear circuits with multiple sources (JMW, TVN), pp. 247–252.
DACDAC-2000-YuWK #algorithm #network #order #reduction
Passive model order reduction algorithm based on Chebyshev expansion of impulse response of interconnect networks (QY, JMW, ESK), pp. 520–525.
DATEDATE-2000-BrennerV #performance
Faster Optimal Single-Row Placement with Fixed Ordering (UB, JV), pp. 117–121.
FoSSaCSFoSSaCS-2000-Hannay #higher-order #simulation #system f
A Higher-Order Simulation Relation for System F (JEH), pp. 130–145.
FoSSaCSFoSSaCS-2000-Schubert #first-order #logic #type inference
Type Inference for First-Order Logic (AS), pp. 297–313.
TACASTACAS-2000-ClarkeJM #partial order #protocol #reduction #security #verification
Partial Order Reductions for Security Protocol Verification (EMC, SJ, WRM), pp. 503–518.
TACASTACAS-2000-KrimmM #communication #composition #generative #partial order #reduction
Compositional State Space Generation with Partial Order Reductions for Asynchronous Communicating Systems (JPK, LM), pp. 266–282.
ICALPICALP-2000-LugiezS #decidability #first-order #logic
Decidable First-Order Transition Logics for PA-Processes (DL, PS), pp. 342–353.
CHICHI-2000-ChenD #automation #categorisation #order #web
Bringing order to the Web: automatically categorizing search results (HC, STD), pp. 145–152.
ICEISICEIS-2000-AldenbergHP #higher-order
High-Order Effects of Groupware: A Case of Censequences of Lotus Notes (BA, MSHH, SCAP), pp. 377–384.
ICEISICEIS-2000-AzevedoS #distributed #enterprise #order
Distributed Order Planning for Networked Enterprises (ALA, JPdS), pp. 97–101.
ICMLICML-2000-DyB #identification #learning #order #set
Feature Subset Selection and Order Identification for Unsupervised Learning (JGD, CEB), pp. 247–254.
ICPRICPR-v1-2000-Mitchell #analysis #documentation #layout #segmentation #using
Document Page Segmentation and Layout Analysis Using Soft Ordering (PEM, HY), pp. 1458–1461.
ICPRICPR-v3-2000-KletteZ #bound #fault #multi #order
Multigrid Error Bounds for Moments of Arbitrary Order (RK, JDZ), pp. 3790–3793.
KDDKDD-2000-MannilaM #partial order
Global partial orders from sequential data (HM, CM), pp. 161–168.
KRKR-2000-Massacci #first-order #reduction
Reduction rules and universal variables for first order tableaux and DPLL (FM), pp. 186–197.
KRKR-2000-MontanariPS #automation #deduction #first-order #logic
Supporting automated deduction in first-order modal logics (AM, AP, MS), pp. 547–556.
KRKR-2000-Pino-PerezU #abduction
Ordering explanations and the structural rules for abduction (RPP, CU), pp. 637–646.
LOPSTRLOPSTR-2000-SerebrenikS #analysis #logic programming #source code #termination
Non-tranformational termination analysis of logic programs, based on general term-orderings (AS, DDS).
LOPSTRLOPSTR-2000-SeresS #higher-order #logic programming #source code
Higher-order transformation of logic programs (SS, JMS).
LOPSTRLOPSTR-2000-VanhoofB #analysis #composition #higher-order #towards
Towards a modular binding-time analysis for higher-order Mercury (WV, MB).
LOPSTRLOPSTR-J-2000-SerebrenikS #analysis #logic programming #source code #termination
Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings (AS, DDS), pp. 69–85.
LOPSTRLOPSTR-J-2000-SeresS #higher-order #logic programming #source code
Higher-Order Transformation of Logic Programs (SS, JMS), pp. 57–68.
PPDPPPDP-2000-Polakow #linear #logic programming #order
Linear logic programming with an ordered context (JP), pp. 68–79.
SACSAC-2000-BusiZ #coordination #data-driven #order
Event Notification in Data-driven Coordination Languages: Comparing the Ordered and Unordered Interpretations (NB, GZ), pp. 233–239.
SACSAC-2000-NakanoHSN #effectiveness #order #web
Controlling Transmission Order of Inline Objects for Effective Web Page Publishing (TN, KH, SS, SN), pp. 942–947.
FSEFSE-2000-Jackson #automation #first-order #logic #relational
Automating first-order relational logic (DJ), pp. 130–139.
HPCAHPCA-2000-StetsDKRS #memory management #network #order
The Effect of Network Total Order, Broadcast, and Remote-Write Capability on Network-Based Shared Memory Computing (RS, SD, LIK, UR, MLS), pp. 265–276.
CADECADE-2000-AndrewsB #education #higher-order #logic #named #proving #theorem proving #tutorial #using
Tutorial: Using TPS for Higher-Order Theorem Proving and ETPS for Teaching Logic (PBA, CEB), pp. 511–512.
CADECADE-2000-Baumgartner #first-order #named
FDPLL — A First Order Davis-Putnam-Longeman-Loveland Procedure (PB), pp. 200–219.
CADECADE-2000-BorrallerasFR #order #semantics
Complete Monotonic Semantic Path Orderings (CB, MF, AR), pp. 346–364.
CADECADE-2000-MichaelA #bytecode #higher-order #logic #semantics #syntax
Machine Instruction Syntax and Semantics in Higher Order Logic (NGM, AWA), pp. 7–24.
CADECADE-2000-SpencerH #order
Support Ordered Resolution (BS, JDH), pp. 385–400.
CAVCAV-2000-AyariB #bound #higher-order #logic #monad
Bounded Model Construction for Monadic Second-Order Logics (AA, DAB), pp. 99–112.
CAVCAV-2000-BehrmannHV #how #matter #model checking #order
Distributing Timed Model Checking — How the Search Order Matters (GB, TH, FWV), pp. 216–231.
CAVCAV-2000-Cohen #encryption #first-order #named #protocol #verification
TAPS: A First-Order Verifier for Cryptographic Protocols (EC), pp. 568–571.
CAVCAV-2000-StollerUL #detection #distributed #partial order #performance #using
Efficient Detection of Global Properties in Distributed Systems Using Partial-Order Methods (SDS, LU, YAL), pp. 264–279.
ICLPCL-2000-Apt #first-order #logic #semantics
A Denotational Semantics for First-Order Logic (KRA), pp. 53–69.
ICLPCL-2000-LaceyRS #higher-order #logic programming #synthesis
Logic Program Synthesis in a Higher-Order Setting (DL, JR, AS), pp. 87–100.
CSLCSL-2000-Naijun #calculus #higher-order
Completeness of Higher-Order Duration Calculus (ZN), pp. 442–456.
LICSLICS-2000-GroheS #first-order #on the #query
On First-Order Topological Queries (MG, LS), pp. 349–360.
LICSLICS-2000-KorovinV #algebra
A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering (KK, AV), pp. 291–302.
LICSLICS-2000-Kripke #algorithm #first-order #theorem
From the Church-Turing Thesis to the First-Order Algorithm Theorem (SK), p. 177.
LICSLICS-2000-LindellW #decidability #finite #first-order
The Role of Decidability in First Order Separations over Classes of Finite Structures (SL, SW), pp. 45–50.
RTARTA-2000-Blanqui #confluence #higher-order #term rewriting #termination
Termination and Confluence of Higher-Order Rewrite Systems (FB), pp. 47–61.
RTARTA-2000-BonelliKR #higher-order
A de Bruijn Notation for Higher-Order Rewriting (EB, DK, AR), pp. 62–79.
RTARTA-2000-Groote #higher-order #linear
Linear Higher-Order Matching Is NP-Complete (PdG), pp. 127–140.
RTARTA-2000-LevyV #constraints #higher-order #linear #unification
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints (JL, MV), pp. 156–171.
ASEASE-1999-FuchsST #first-order #logic #natural language
Controlled Natural Language Can Replace First-Order Logic (NEF, US, ST), pp. 295–298.
DACDAC-1999-Freund #algorithm #modelling #simulation
Passive Reduced-Order Models for Interconnect Simulation and Their Computation via Krylov-Subspace Algorithms (RWF), pp. 195–200.
DACDAC-1999-LiuPS #analysis
Model Order-Reduction of RC(L) Interconnect Including Variational Analysis (YL, LTP, AJS), pp. 201–206.
DACDAC-1999-LiWW #approach #equation #generative #modelling #performance
An Efficient Lyapunov Equation-Based Approach for Generating Reduced-Order Models of Interconnect (JRL, FW, JW), pp. 1–6.
DACDAC-1999-SalekLP #generative #independence #named #using
MERLIN: Semi-Order-Independent Hierarchical Buffered Routing Tree Generation Using Local Neighborhood Search (AHS, JL, MP), pp. 472–478.
DACDAC-1999-Sheehan #equation #named #order #performance #reduction #using
ENOR: Model Order Reduction of RLC Circuits Using Nodal Equations for Efficient Factorization (BNS), pp. 17–21.
DATEDATE-1999-Sheehan #reduction #using
Projective Convolution: RLC Model-Order Reduction Using the Impulse Response (BNS), p. 669–?.
ICDARICDAR-1999-KatoY #image #multi #order
Recovery of Drawing Order from Scanned Images of Multi-Stroke Handwriting (YK, MY), pp. 261–264.
SIGMODSIGMOD-1999-AnkerstBKS #clustering #identification #named
OPTICS: Ordering Points To Identify the Clustering Structure (MA, MMB, HPK, JS), pp. 49–60.
SIGMODSIGMOD-1999-MankuRL #dataset #online #order #performance #random #scalability #statistics
Random Sampling Techniques for Space Efficient Online Computation of Order Statistics of Large Datasets (GSM, SR, BGL), pp. 251–262.
ESOPESOP-1999-Thiemann #higher-order
Higher-Order Code Splicing (PT), pp. 243–257.
PASTEPASTE-1999-NaumovichCC #analysis #data flow #partial order #performance #using #verification
Using Partial Order Techniques to Improve Performance of Data Flow Analysis Based Verification (GN, LAC, JMC), pp. 57–65.
FLOPSFLOPS-1999-AntoyT #higher-order
Typed Higher-Order Narrowing without Higher-Order Strategies (SA, APT), pp. 335–353.
FLOPSFLOPS-1999-MarinIS #higher-order #lazy evaluation #on the
On Reducing the Search Space of Higher-Order Lazy Narrowing (MM, TI, TS), pp. 319–334.
FLOPSFLOPS-1999-MoorS #higher-order #program transformation
Higher Order Matching for Program Transformation (OdM, GS), pp. 209–224.
DLTDLT-1999-KarhumakiP #complexity #on the #order #string
On the complexity of computing the order of repetition of a string (JK, WP), pp. 178–184.
ICALPICALP-1999-EngelfrietH #finite #higher-order #logic #monad #transducer
Two-Way Finite State Transducers and Monadic Second-Order Logic (JE, HJH), pp. 311–320.
ICALPICALP-1999-FlescaG #graph #order #query #regular expression
Partially Ordered Regular Languages for Graph Queries (SF, SG), pp. 321–330.
ICALPICALP-1999-FrickG #first-order #graph
Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs (MF, MG), pp. 331–340.
ICALPICALP-1999-KrauseSW #approximate #problem
Approximations by OBDDs and the Variable Ordering Problem (MK, PS, IW), pp. 493–502.
FMFM-v1-1999-Pavlovic #first-order #parametricity #semantics #specification
Semantics of First Order Parametric Specifications (DP), pp. 155–172.
FMFM-v2-1999-JimenezO #algebra #framework #higher-order
An Algebraic Framework for Higher-Order Modules (RMJ, FO), pp. 1778–1797.
FMFM-v2-1999-Martin #first-order #logic
Relating Z and First-Order Logic (AM), pp. 1266–1280.
HPCAHPCA-1999-HilyS #effectiveness #execution #multi #thread
Out-of-Order Execution may not be Cost-Effective on Processors Featuring Simultaneous Multithreading (SH, AS), pp. 64–67.
HPCAHPCA-1999-HongMSKAW #effectiveness #memory management #order
Access Order and Effective Bandwidth for Streams on a Direct Rambus Memory (SIH, SAM, MHS, RHK, JHA, WAW), pp. 80–89.
CADECADE-1999-Benzmuller #higher-order
Extensional Higher-Order Paramodulation and RUE-Resolution (CB), pp. 399–413.
CADECADE-1999-DemriG #first-order #logic
Tractable Transformations from Modal Provability Logics into First-Order Logic (SD, RG), pp. 16–30.
CADECADE-1999-KonradW #first-order #generative #logic
System Description: Kimba, A Model Generator for Many-Valued First-Order Logics (KK, DAW), pp. 282–286.
CADECADE-1999-Lopes #automation #generative #higher-order #logic #proving
Automatic Generation of Proof Search Strategies for Second-order Logic (RHCL), pp. 414–428.
CADECADE-1999-Weidenbach #analysis #automation #first-order #logic #protocol #security #towards
Towards an Automatic Analysis of Security Protocols in First-Order Logic (CW), pp. 314–328.
CADECADE-1999-Wierzbicki #complexity #higher-order
Complexity of the higher order matching (TW), pp. 82–96.
CSLCSL-1999-CompagnoniG #higher-order #symmetry #type system
Anti-Symmetry of Higher-Order Subtyping (ABC, HG), pp. 420–438.
ICLPICLP-1999-KaneiwaT #logic #order
Event, Property, and Hierarchy in Order-Sorted Logic (KK, ST), pp. 94–108.
ICLPICLP-1999-MomiglianoP #higher-order #problem
The Relative Complement Problem for Higher-Order Patterns (AM, FP), pp. 380–394.
LICSLICS-1999-AtseriasK #finite #first-order #fixpoint #logic #set
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory (AA, PGK), pp. 275–284.
LICSLICS-1999-BofillGNR #order
Paramodulation with Non-Monotonic Orderings (MB, GG, RN, AR), pp. 225–233.
LICSLICS-1999-Hofmann #analysis #higher-order #semantics #syntax
Semantical Analysis of Higher-Order Abstract Syntax (MH0), pp. 204–213.
LICSLICS-1999-JouannaudR #higher-order #recursion
The Higher-Order Recursive Path Ordering (JPJ, AR), pp. 402–411.
RTARTA-1999-DowekHK #first-order #higher-order #logic #named
HOL-λσ: An Intentional First-Order Expression of Higher-Order Logic (GD, TH, CK), pp. 317–331.
RTARTA-1999-NieuwenhuisR #constraints #order
Solved Forms for Path Ordering Constraints (RN, JMR), pp. 1–15.
RTARTA-1999-Raamsdonk #higher-order
Higher-Order Rewriting (FvR), pp. 220–239.
RTARTA-1999-Stuber #order
Theory Path Orderings (JS), pp. 148–162.
DACDAC-1998-LiuPS #modelling #named #order
ftd: An Exact Frequency to Time Domain Conversion for Reduced Order RLC Interconnect Models (YL, LTP, AJS), pp. 469–472.
DACDAC-1998-MarquesKWS #3d #modelling #performance
A Mixed Nodal-Mesh Formulation for Efficient Extraction and Passive Reduced-Order Modeling of 3D Interconnects (NAM, MK, JW, LMS), pp. 297–302.
DACDAC-1998-QiuWP #estimation #order #statistics #using
Maximum Power Estimation Using the Limiting Distributions of Extreme Order Statistics (QQ, QW, MP), pp. 684–689.
DACDAC-1998-TaylorQBDHHR #functional #multi #verification
Functional Verification of a Multiple-issue, Out-of-Order, Superscalar Alpha Processor — The DEC Alpha 21264 Microprocessor (SAT, MQ, DB, ND, SH, JH, CR), pp. 638–643.
DATEDATE-1998-FreundF #approximate #linear #modelling #multi #scalability #using
Reduced-Order Modeling of Large Linear Passive Multi-Terminal Circuits Using Matrix-Pade Approximation (RWF, PF), pp. 530–537.
DATEDATE-1998-MarquesKWS #3d #algorithm #modelling #order #performance #reduction
An Efficient Algorithm for Fast Parasitic Extraction and Passive Order Reduction of 3D Interconnect Models (NAM, MK, JW, LMS), pp. 538–543.
DATEDATE-1998-VercauterenVJL #analysis #partial order #performance #using #verification
Efficient Verification using Generalized Partial Order Analysis (SV, DV, GGdJ, BL), pp. 782–789.
HTHT-1998-Ricardo #higher-order #hypermedia
Stalking the Paratext: Speculations on Hypertext Links as a Second Order Text (FJR), pp. 142–151.
PODSPODS-1998-Etessami #first-order #morphism
Dynamic Tree Isomorphism via First-Order Updates (KE), pp. 235–243.
TACASTACAS-1998-KurshanLMPY #partial order #reduction
Static Partial Order Reduction (RPK, VL, MM, DP, HY), pp. 345–357.
PASTEPASTE-1998-WadellA #higher-order #performance #source code #visualisation
Visualizing the Performance of Higher-Order Programs (OW, JMA), pp. 75–82.
SASSAS-1998-Volpe #alias #first-order #logic programming #source code
A First-Order Language for Expressing Aliasing and Type Properties of Logic Programs (PV), pp. 184–199.
STOCSTOC-1998-BlumKRV #problem
Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems (AB, GK, RR, SV), pp. 100–105.
ICALPICALP-1998-AlurMP #partial order
Deciding Global Partial-Order Properties (RA, KLM, DP), pp. 41–52.
ICALPICALP-1998-BorchertKS #first-order #on the
On Existentially First-Order Definable Languages and Their Relation to NP (BB, DK, FS), pp. 17–28.
ICALPICALP-1998-ChuangGHKL #canonical #encoding #graph #multi #order
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses (RCNC, AG, XH, MYK, HIL), pp. 118–129.
ICALPICALP-1998-Walukiewicz98a #higher-order #reduction
A Total AC-Compatible Reduction Ordering on Higher-Order Terms (DW), pp. 530–542.
FMFM-1998-Karlsen #framework #higher-order #integration #tool support
The UniForM WorkBench — A Higher Order Tool Integration Framework (EWK), pp. 266–280.
ICFPICFP-1998-HannanH #higher-order
Higher-Order Arity Raising (JH, PH), pp. 27–38.
IFLIFL-1998-Pape #higher-order
Higher Order Demand Propagation (DP), pp. 153–168.
ICMLICML-1998-ReddyT #first-order #learning #source code
Learning First-Order Acyclic Horn Programs from Entailment (CR, PT), pp. 472–480.
ICPRICPR-1998-FlorebySS #bound #fourier #image #order #using
Boundary finding using Fourier surfaces of increasing order [simulated medical images] (LF, LS, KS), pp. 465–467.
KDDKDD-1998-SteegRW #correlation #detection #higher-order #multi #performance
Coincidence Detection: A Fast Method for Discovering Higher-Order Correlations in Multidimensional Data (EWS, DAR, EW), pp. 112–120.
KRKR-1998-BaiolettiMM #constraints #encoding #partial order
Encoding Planning Constraints into Partial Order Planners (MB, SM, AM), pp. 608–616.
KRKR-1998-BuccafurriLR #logic #order #semantics
Disjunctive Ordered Logic: Semantics and Expressiveness (FB, NL, PR), pp. 418–431.
KRKR-1998-Levesque #first-order #knowledge base #reasoning
A Completeness Result for Reasoning with Incomplete First-Order Knowledge Bases (HJL), pp. 14–23.
SIGIRSIGIR-1998-KaszkielZ #database #documentation #evaluation #query #scalability
Term-Ordered Query Evaluation versus Document-Ordered Query Evaluation for Large Document Databases (MK, JZ), pp. 343–344.
ECOOPECOOP-1998-BonoF #calculus #first-order #imperative
An Imperative, First-Order Calculus with Object Extension (VB, KF), pp. 462–497.
PPDPALP-PLILP-1998-Pitts #higher-order #semantics
Operational Versus Denotational Methods in the Semantics of Higher Order Languages (AMP), pp. 282–283.
POPLPOPL-1998-HannanH #higher-order
Higher-Order unCurrying (JH, PH), pp. 1–11.
POPLPOPL-1998-JagannathanTWW #alias #analysis #higher-order
Single and Loving It: Must-Alias Analysis for Higher-Order Languages (SJ, PT, SW, AKW), pp. 329–341.
POPLPOPL-1998-Schubert #higher-order #morphism #polymorphism #type inference #unification
Second-Order Unification and Type Inference for Church-Style Polymorphism (AS), pp. 279–288.
ASPLOSASPLOS-1998-Le #execution #runtime
An Out-of-Order Execution Technique for Runtime Binary Translators (BCL), pp. 151–158.
ASPLOSASPLOS-1998-RanganathanGAB #database #performance
Performance of Database Workloads on Shared-Memory Systems with Out-of-Order Processors (PR, KG, SVA, LAB), pp. 307–318.
ASPLOSASPLOS-1998-SchnarrL #performance #simulation #using
Fast Out-Of-Order Processor Simulation Using Memoization (ES, JRL), pp. 283–294.
CADECADE-1998-BachmairGV #constraints #similarity
Elimination of Equality via Transformation with Ordering Constraints (LB, HG, AV), pp. 175–190.
CADECADE-1998-BenzmullerK #higher-order
Extensional Higher-Order Resolution (CB, MK), pp. 56–71.
CADECADE-1998-BenzmullerK98a #higher-order #proving #theorem proving
System Description: LEO — A Higher-Order Theorem Prover (CB, MK), pp. 139–144.
CADECADE-1998-Pagano #calculus #first-order #higher-order #reduction
X.R.S : Explicit Reduction Systems — A First-Order Calculus for Higher-Order Calculi (BP), pp. 72–87.
CADECADE-1998-RichardsonSG #higher-order #logic #proving #theorem proving
System Description: Proof Planning in Higher-Order Logic with Lambda-Clam (JR, AS, IG), pp. 129–133.
CAVCAV-1998-AbdullaJKP #approach #partial order #reduction #verification
A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract) (PAA, BJ, MK, DP), pp. 379–390.
CAVCAV-1998-Peled #partial order #reduction
Ten Years of Partial Order Reduction (DP), pp. 17–28.
CAVCAV-1998-SkakkebaekJD #execution #incremental #using #verification
Formal Verification of Out-of-Order Execution Using Incremental Flushing (JUS, RBJ, DLD), pp. 98–109.
CAVCAV-1998-Thathachar #on the #order
On the Limitations of Ordered Representations of Functions (JST), pp. 232–243.
CAVCAV-1998-XuCSCM #first-order #graph #logic #model checking #multi #using
Model Checking for a First-Order Temporal Logic Using Multiway Decision Graphs (YX, EC, XS, FC, OAM), pp. 219–231.
CSLCSL-1998-KempeS #algebra #first-order #on the #power of #specification
On the Power of Quantifers in First-Order Algebraic Specification (DK, AS), pp. 45–57.
CSLCSL-1998-Lukasiewicz #first-order #logic #probability #semantics
Many-Valued First-Order Logics with Probabilistic Semantics (TL), pp. 415–429.
ICTSSIWTCS-1998-PetrenkoUC #concurrent #detection #fault #using
Using Partial-Orders for Detecting Faults in Concurrent Systems (AP, AU, VC), pp. 175–190.
LICSLICS-1998-BaldwinB #embedded #finite #modelling #order
Embedded Finite Models, Stability Theory and the Impact of Order (JTB, MB), pp. 490–500.
LICSLICS-1998-Bars #higher-order #logic
Fragments of Existential Second-Order Logic without 0-1 Laws (JMLB), pp. 525–536.
LICSLICS-1998-Bernstein #congruence #higher-order #semantics #theorem
A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages (KLB), pp. 153–164.
LICSLICS-1998-ComonNNR #order #problem
Decision Problems in Ordered Rewriting (HC, PN, RN, MR), pp. 276–286.
LICSLICS-1998-DawarHS #finite #quantifier
Ordering Finite Variable Types with Generalized Quantifiers (AD, LH, AS), pp. 28–43.
LICSLICS-1998-EiterGG #higher-order #logic #string
Existential Second-Order Logic over Strings (TE, GG, YG), pp. 16–27.
LICSLICS-1998-KolaitisO #bound #first-order #logic #on the #problem
On the Boundedness Problem for Two-Variable First-Order Logic (PGK, MO), pp. 513–524.
LICSLICS-1998-MullerNT #constraints #first-order
The First-Order Theory of Ordering Constraints over Feature Trees (MM, JN, RT), pp. 432–443.
LICSLICS-1998-Veanes #higher-order #unification
The Relation Between Second-Order Unification and Simultaneous Rigid E-Unification (MV), pp. 264–275.
LICSLICS-1998-Viswanathan #abstraction #first-order #recursion #type system
Full Abstraction for First-Order Objects with Recursive Types and Subtyping (RV), pp. 380–391.
RTARTA-1998-AotoT #termination
Termination Transformation by Tree Lifting Ordering (TA, YT), pp. 256–270.
RTARTA-1998-DanvyR #higher-order #partial evaluation
Higher-Order Rewriting and Partial Evaluation (OD, KHR), pp. 286–301.
RTARTA-1998-Levy #decidability #higher-order #problem #unification
Decidable and Undecidable Second-Order Unification Problems (JL), pp. 47–60.
RTARTA-1998-MullerN #constraints #higher-order #logic #monad
Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic (MM, JN), pp. 196–210.
DACDAC-1997-ElfadelL #modelling #network
Zeros and Passivity of Arnoldi-Reduced-Order Models for Interconnect Networks (IME, DDL), pp. 28–33.
DACDAC-1997-HongKP #statistics
Potential-Driven Statistical Ordering of Transformations (IH, DK, MP), pp. 347–352.
ICDARICDAR-1997-LallicanV #approach #order
A Kalman Approach for Stroke Order Recovering from Off-Line Handwriting (PML, CVG), pp. 519–523.
ICDARICDAR-1997-OlivierJA #markov #optimisation #order #recognition
Markov Model Order Optimization for Text Recognition (CO, FJ, MA), pp. 548–551.
TACASTACAS-1997-EmersonJP #partial order #reduction #symmetry
Combining Partial Order and Symmetry Reductions (EAE, SJ, DP), pp. 19–34.
TACASTACAS-1997-KelbMMG #flexibility #higher-order #logic #monad #named #tool support
MOSEL: A FLexible Toolset for Monadic Second-Order Logic (PK, TMS, MM, CG), pp. 183–202.
PLDIPLDI-1997-JensenJKS #automation #higher-order #logic #monad #pointer #source code #using #verification
Automatic Verification of Pointer Programs using Monadic Second-Order Logic (JLJ, MEJ, NK, MIS), pp. 226–236.
SASSAS-1997-Braunburger #analysis #automation #order #polynomial #termination #using
Automatic Termination Analysis for Partial Functions Using Polynomial Orderings (JB), pp. 330–344.
SASSAS-1997-PanitzS #automation #functional #higher-order #named #proving #source code #strict #termination
TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language (SEP, MSS), pp. 345–360.
DLTDLT-1997-Ilie #order #word
Remarks on Well Quasi Orders of Words (LI), pp. 399–409.
DLTDLT-1997-Stefaneas #first-order #logic
Chartering first order logic (PSS), pp. 579–592.
ICALPICALP-1997-Ablayev #branch #nondeterminism #order #source code
Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs (FMA), pp. 195–202.
ICALPICALP-1997-CosmoG #composition #higher-order #on the #λ-calculus
On Modular Properties of Higher Order Extensional λ Calculi (RDC, NG), pp. 237–247.
ICALPICALP-1997-GrossiI #algorithm #order #performance #problem
Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract) (RG, GFI), pp. 605–615.
ICALPICALP-1997-Wilke #first-order #logic #strict
Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic (TW), pp. 347–357.
CIAAWIA-1997-Trahtman #automaton #estimation #finite #order #precise #testing
A Precise Estimation of the Order of Local Testability of a Deterministic Finite Automaton (ANT), pp. 198–212.
ICFPICFP-1997-BlumeA #approach #higher-order #named #optimisation
λ-Splitting: A Higher-Order Approach to Cross-Module Optimizations (MB, AWA), pp. 112–124.
ICFPICFP-1997-Crary #higher-order #implementation #type system
Foundations for the Implementation of Higher-Order Subtyping (KC), pp. 125–135.
ICGTGG-Handbook-Vol1-Courcelle #graph transformation #higher-order #logic #monad
The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic (BC), pp. 313–400.
HCIHCI-SEC-1997-GreylingT #internet
Hierarchical Ordering of Internet Mental Model Categorisations (MG, AT), pp. 261–265.
EDOCEDOC-1997-ClassenWH #adaptation #corba #higher-order #towards #workflow
Towards evolutionary and adaptive workflow systems-infrastructure support based on Higher-Order Object Nets and CORBA (IC, HW, YH), p. 300–?.
ICMLICML-1997-BottaGP #first-order #learning #logic #named
FONN: Combining First Order Logic with Connectionist Learning (MB, AG, RP), pp. 46–56.
ECOOPECOOP-1997-Liquori #first-order
An Extended Theory of Primitive Objects: FIrst Order System (LL), pp. 146–169.
TOOLSTOOLS-ASIA-1997-Jin #composition #inheritance #object-oriented #paradigm #semantics
An Order-Based Composition Semantics for the Inheritance in Logic-Based Object-Oriented Paradigm (ZJ), pp. 110–120.
PPDPALP-1997-Almendros-JimenezG #lazy evaluation #order #parametricity
Lazy Narrowing with Parametric Order Sorted Types (JMAJ, AGL), pp. 159–173.
PPDPALP-1997-KirchnerR #equation #higher-order #unification
Higher-Order Equational Unification via Explicit Substitutions (CK, CR), pp. 61–75.
PPDPALP-1997-Steggles #algebra #higher-order #specification
Parameterised Higher-Order Algebraic Specifications (LJS), pp. 76–98.
PPDPALP-1997-SuzukiNI #calculus #functional #higher-order #lazy evaluation #logic
Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-Order Functional Logic Language (TS, KN, TI), pp. 99–113.
LOPSTRLOPSTR-1997-NaishS #higher-order #re-engineering
A Higher Order Reconstruction of Stepwise Enhancement (LN, LS), pp. 245–262.
PPDPPLILP-1997-Mossin #graph #higher-order
Higher-Order Value Flow Graphs (CM), pp. 159–173.
POPLPOPL-1997-BourdoncleM #higher-order #multi #polymorphism
Type-Checking Higher-Order Polymorphic Multi-Methods (FB, SM), pp. 302–315.
POPLPOPL-1997-SeidlS #constraints #deforestation #higher-order
Constraints to Stop Higher-Order Deforestation (HS, MHS), pp. 400–413.
SACSAC-1997-Mao #constraints #order #parallel #problem #scheduling
A parallel multi-operation scheduling problem with machine order constraints (WM), pp. 473–477.
SACSAC-1997-ShumskyWME #constraints #finite #first-order #generative #heuristic
Direct finite first-order model generation with negative constraint propagation heuristic (OS, RWW, WM, FE), pp. 25–29.
HPDCHPDC-1997-FriedmanR #performance #protocol
Packing Messages as a Tool for Boosting the Performance of Total Ordering Protocols (RF, RvR), pp. 233–242.
CADECADE-1997-BjornerSU #first-order #integration #reasoning
A Practical Integration of First-Order Reasoning and Decision Procedures (NB, MES, TEU), pp. 101–115.
CADECADE-1997-GanzingerMW #order #type system
Soft Typing for Ordered Resolution (HG, CM, CW), pp. 321–335.
CADECADE-1997-Hickey #framework #higher-order #implementation #logic #named
Nuprl-Light: An Implementation Framework for Higher-Order Logics (JJH), pp. 395–399.
CADECADE-1997-Nivelle #classification #order
A Classification of Non-liftable Orders for Resolution (HdN), pp. 336–350.
CAVCAV-1997-AlurBHQR #partial order #reduction
Partial-Order Reduction in Symbolic State Space Exploration (RA, RKB, TAH, SQ, SKR), pp. 340–351.
CAVCAV-1997-KokkarinenPV #partial order #reduction
Relaxed Visibility Enhances Partial Order Reduction (IK, DP, AV), pp. 328–339.
CSLCSL-1997-ComonJ #automaton #higher-order
Higher-Order Matching and Tree Automata (HC, YJ), pp. 157–176.
CSLCSL-1997-HartonasH #concurrent #functional #higher-order
Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (Extended Abstract) (CH, MH), pp. 239–254.
CSLCSL-1997-Schiering #approach #graph #higher-order #logic #monad
A Hierarchical Approach to Monadic Second-Order Logic over Graphs (IS), pp. 424–440.
CSLCSL-1997-Schwentick #higher-order #logic #power of
Padding and the Expressive Power of Existential Second-Order Logics (TS), pp. 461–477.
CSLCSL-1997-Staiger #higher-order #monad
Rich ω-Words and Monadic Second-Order Arithmetic (LS), pp. 478–490.
ICLPICLP-1997-Gonzalez-MorenoHR #functional #higher-order #logic programming
A Higher Order Rewriting Logic for Functional Logic Programming (JCGM, MTHG, MRA), pp. 153–167.
LICSLICS-1997-Baader #order #reduction
Combination of Compatible Reduction Orderings that are Total on Ground Terms (FB), pp. 2–13.
LICSLICS-1997-CervesatoP #higher-order #linear
Linear Higher-Order Pre-Unification (IC, FP), pp. 422–433.
LICSLICS-1997-EtessamiVW #first-order #logic
First-Order Logic with Two Variables and Unary Temporal Logic (KE, MYV, TW), pp. 228–235.
LICSLICS-1997-Goubault-Larrecq #higher-order #unification
Ramified Higher-Order Unification (JGL), pp. 410–421.
LICSLICS-1997-McDowellM #higher-order #logic #reasoning #syntax
A Logic for Reasoning with Higher-Order Abstract Syntax (RM, DM), pp. 434–445.
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-KapurS #order #proving #term rewriting #termination
A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems (DK, GS), pp. 142–156.
RTARTA-1997-Marcinkowski #first-order
Undecidability of the First Order Theory of One-Step Right Ground Rewriting (JM), pp. 241–253.
RTARTA-1997-OgataOF #automaton #named #order #term rewriting
TRAM: An Abstract Machine for Order-Sorted Conditioned Term Rewriting Systems (KO, KO, KF), pp. 335–338.
RTARTA-1997-Vorobyov #decidability #first-order #linear
The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable (SGV), pp. 254–268.
TLCATLCA-1997-DespeyrouxPS #higher-order #recursion #syntax
Primitive Recursion for Higher-Order Abstract Syntax (JD, FP, CS), pp. 147–163.
DACDAC-1996-PhilippsCL #analysis #performance #reduction
Efficient Full-Wave Electromagnetic Analysis via Model-Order Reduction of Fast Integral Transforms (JRP, EC, DDL), pp. 377–382.
PODSPODS-1996-AbiteboulHB #database #first-order #logic #query
Temporal Versus First-Order Logic to Query Temporal Databases (SA, LH, JVdB), pp. 49–57.
PODSPODS-1996-StolboushkinT #database #linear #order #query
Linear vs. Order Contstrained Queries Over Rational Databases (APS, MAT), pp. 17–27.
SIGMODSIGMOD-1996-SimmenSM #optimisation #order
Fundamental Techniques for Order Optimization (DES, EJS, TM), pp. 57–67.
SIGMODSIGMOD-1996-VanceM #agile #optimisation
Rapid Bushy Join-order Optimization with Cartesian Products (BV, DM), pp. 35–46.
ESOPESOP-1996-RohwedderP #higher-order #logic programming #source code #termination
Mode and Termination Checking for Higher-Order Logic Programs (ER, FP), pp. 296–310.
TACASTACAS-1996-ChouP #model checking #partial order #reduction #verification
Formal Verification of a Partial-Order Reduction Technique for Model Checking (CTC, DP), pp. 241–257.
SASSAS-1996-AndersenH #analysis #functional #higher-order #partial evaluation #termination
Termination Analysis for Offline Partial Evaluation of a Higher Order Functional Language (PHA, CKH), pp. 67–82.
ICALPICALP-1996-Pin #automaton #calculus #first-order #power of
The Expressive Power of Existential First Order Sentences of Büchi’s Sequential Calculus (JÉP), pp. 300–311.
IFLIFL-1996-DebbabiFT #algorithm #analysis #concurrent #control flow #higher-order #source code #type system
A Type-Based Algorithm for the Control-Flow Analysis of Higher-Order Concurrent Programs (MD, AF, NT), pp. 247–266.
ICPRICPR-1996-Horikawa #correlation #higher-order #pattern matching #pattern recognition #recognition #similarity
Pattern recognition with invariance to similarity transformations based on the third-order correlation (YH), pp. 200–204.
ICPRICPR-1996-LiuCC #graph #online #order #recognition #relational #using
Stroke order and stroke number free on-line Chinese character recognition using attributed relational graph matching (JL, WkC, MMYC), pp. 259–263.
ICPRICPR-1996-YuCXY #3d #approximate #higher-order
3D shape and motion by SVD under higher-order approximation of perspective projection (HY, QC, GX, MY), pp. 456–460.
KRKR-1996-Brafman #first-order #statistics
“Statistical” First Order Conditionals (RIB), pp. 398–409.
KRKR-1996-Sharma #inheritance #partial order
Partial Orders of Sorts and Inheritances (or Placing Inheritance in Context) (NS), pp. 280–290.
PPDPALP-1996-Almendros-JimenezGG #algebra #functional #logic programming #order #polymorphism #semantics
Algebraic Semantics for Functional Logic Programming with Polymorphic Order-Sorted Types (JMAJ, AGF, AGL), pp. 299–313.
PPDPALP-1996-ManoO #higher-order #normalisation #term rewriting
Unique Normal Form Property of Higher-Order Rewriting Systems (KM, MO), pp. 269–283.
PPDPALP-1996-Marchiori96a #abstract domain #first-order #logic #using
Prime Factorizations of Abstract Domains Using First Order Logic (EM), pp. 209–223.
PPDPALP-1996-OlveszkyL #order #termination
Order-Sorted Termination: The Unsorted Way (PCÖ, OL), pp. 92–106.
LOPSTRLOPSTR-1996-FribourgR #constraints #verification
Symbolic Verification with Gap-Order Constraints (LF, JR), pp. 20–37.
PPDPPLILP-1996-Hamilton #deforestation #higher-order
Higher Order Deforestation (GWH), pp. 213–227.
POPLPOPL-1996-Ashley #analysis #flexibility #higher-order
A Practical and Flexible Flow Analysis for Higher-Order Languages (JMA), pp. 184–194.
POPLPOPL-1996-GordonR #calculus #first-order #similarity #type system
Bisimilarity for a First-Order Calculus of Objects with Subtyping (ADG, GDR), pp. 386–395.
SACSAC-1996-DemoenET #garbage collection #order #prolog
Segment order preserving copying garbage collection for WAM based Prolog (BD, GE, PT), pp. 380–386.
SACSAC-1996-LeungC #network
A stroke-order free Chinese handwriting input system based on relative stroke positions and back-propagation networks (WnL, KsC), pp. 22–27.
SACSAC-1996-SperberGT #higher-order
Bootstrapping higher-order program transformers from interpreters (MS, RG, PT), pp. 408–413.
CCCC-1996-GeserKLRS #fixpoint #higher-order
Non-monotone Fixpoint Iterations to Resolve Second Order Effects (AG, JK, GL, OR, BS), pp. 106–120.
HPDCHPDC-1996-KumarSSG #algorithm #distributed #problem #robust #search-based
Robust and Distributed Genetic Algorithm for Ordering Problems (AK, AS, AS, RKG), pp. 253–262.
CADECADE-1996-SagonasSW #automaton #source code
An Abstract Machine for Fixed-Order Dynamically Stratified Programs (KFS, TS, DSW), pp. 328–342.
CSLCSL-1996-Geuvers #dependent type #higher-order #logic #modelling #type system
Extending Models of Second Order Predicate Logic to Models of Second Dependent Type Theory (HG), pp. 167–181.
ISSTAISSTA-1996-GodefroidPS #concurrent #industrial #partial order #source code #using #validation
Using Partial-Order Methods in the Formal Validation of Industrial Concurrent Programs (PG, DP, MGS), pp. 261–269.
ICLPJICSLP-1996-DowekHKP #higher-order #unification
Unification via Explicit Substitutions: The Case of Higher-Order Patterns (GD, TH, CK, FP), pp. 259–273.
LICSLICS-1996-BasinG #analysis #complexity #order
Complexity Analysis Based on Ordered Resolution (DAB, HG), pp. 456–465.
LICSLICS-1996-Nurmonen #finite #order #quantifier
Counting Modulo Quantifiers on Finite Linearly Ordered Trees (JN), pp. 484–493.
LICSLICS-1996-Selinger #finite #modelling
Order-Incompleteness and Finite λ Models (Extended Abstract) (PS), pp. 432–439.
LICSLICS-1996-TiurynU #decidability #higher-order #problem #type system
The Subtyping Problem for Second-Order Types is Undecidable (JT, PU), pp. 74–85.
LICSLICS-1996-WillemsW #branch #linear #model checking #partial order
Partial-Order Methods for Model Checking: From Linear Time to Branching Time (BW, PW), pp. 294–303.
RTARTA-1996-CurienQS #higher-order #performance
Efficient Second-Order Matching (RC, ZQ, HS), pp. 317–331.
RTARTA-1996-FettigL #finite #higher-order #unification #λ-calculus
Unification of Higher-Order patterns in a Simply Typed λ-Calculus with Finite Products and terminal Type (RF, BL), pp. 347–361.
RTARTA-1996-HanusP #higher-order
Higher-Order Narrowing with Definitional Trees (MH, CP), pp. 138–152.
RTARTA-1996-JouannaudR #higher-order #normalisation #recursion
A Recursive Path Ordering for Higher-Order Terms in η-Long β-Normal Form (JPJ, AR), pp. 108–122.
RTARTA-1996-Levy #higher-order #linear #unification
Linear Second-Order Unification (JL), pp. 332–346.
RTARTA-1996-Oostrom #higher-order #product line
Higher-Order Families (VvO), pp. 392–407.
RTARTA-1996-Treinen #decidability #first-order
The First-Order Theory of One-Step Rewriting is Undecidable (RT), pp. 276–286.
RTARTA-1996-Virga #dependent type #higher-order
Higher-Order Superposition for Dependent Types (RV), pp. 123–137.
DACDAC-1995-FeldmannF #algorithm #linear #modelling #scalability
Reduced-Order Modeling of Large Linear Subcircuits via a Block Lanczos Algorithm (PF, RWF), pp. 474–479.
DACDAC-1995-SilveiraKW #3d #modelling #performance
Efficient Reduced-Order Modeling of Frequency-Dependent Coupling Inductances Associated with 3-D Interconnect Structures (LMS, MK, JW), pp. 376–380.
ICDARICDAR-v1-1995-AbuhaibaDH
Line extraction and stroke ordering of text pages (ISIA, SD, MJJH), pp. 390–393.
PODSPODS-1995-GrumbachS #constraints #database
Dense-Order Constraint Databases (SG, JS), pp. 66–77.
SIGMODSIGMOD-1995-Levine #parallel
Order-of-Magnitude Advantage of TPC-C Though Massive Parallelism (CL), pp. 464–465.
ESOPESOP-J-1994-AbadiC95 #formal method #higher-order
A Theory of Primitive Objects: Second-Order Systems (MA, LC), pp. 81–116.
TACASTACAS-1995-HenriksenJJKPRS #higher-order #logic #monad #named
Mona: Monadic Second-Order Logic in Practice (JGH, JLJ, MEJ, NK, RP, TR, AS), pp. 89–110.
PEPMPEPM-1995-MalmkjaerO #higher-order
Polyvariant Specialisation for Higher-Order, Block-Structured Languages (KM, ), pp. 66–76.
PEPMPEPM-1995-Sands #higher-order
Higher Order Expression Procedures (DS), pp. 178–189.
PLDIPLDI-1995-AikenFL #analysis #higher-order #memory management
Better Static Memory Management: Improving Region-Based Analysis of Higher-Order Languages (AA, MF, RL), pp. 174–185.
SASSAS-1995-Giesl #analysis #functional #order #source code #termination #using
Termination Analysis for Functional Programs using Term Orderings (JG), pp. 154–171.
SASSAS-1995-Mohnen #analysis #higher-order #inheritance #performance
Efficient Closure Utilisation by Higher-Order Inheritance Analysis (MM), pp. 261–278.
SASSAS-1995-Tofte #functional #higher-order
Region Inference for Higher-Order Functional Languages (MT), pp. 19–20.
DLTDLT-1995-SchieringT #automaton #first-order #logic
Counter-Free Automata, First-Order Logic and Star-Free Expressions (IS, WT), pp. 166–175.
ICALPICALP-1995-Rubio #order
Extension Orderings (AR), pp. 511–522.
AFPAFP-1995-Jones95 #functional #higher-order #morphism #polymorphism #programming
Functional Programming with Overloading and Higher-Order Polymorphism (MPJ), pp. 97–136.
ICMLICML-1995-OliveiraS #graph #order
Inferring Reduced Ordered Decision Graphs of Minimum Description Length (ALO, ALSV), pp. 421–429.
KDDKDD-1995-AugierVK #algorithm #first-order #learning #logic #search-based
Learning First Order Logic Rules with a Genetic Algorithm (SA, GV, YK), pp. 21–26.
SIGIRSIGIR-1995-Finch #documentation #partial order #representation
Partial Orders for Document Representation: A New Methodology for Combining Document Features (SF), pp. 264–272.
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.
POPLPOPL-1995-Biswas #higher-order
Higher-Order Functors with Transparent Signatures (SKB), pp. 154–163.
POPLPOPL-1995-JagannathanW #analysis #higher-order
A Unified Treatment of Flow Analysis in Higher-Order Languages (SJ, SW), pp. 393–407.
POPLPOPL-1995-Leroy #higher-order
Applicative Functors and Fully Transparent Higher-Order Modules (XL), pp. 142–153.
POPLPOPL-1995-SansomJ #functional #higher-order #profiling #strict
Time and Space Profiling for Non-Strict Higher-Order Functional Languages (PMS, SLPJ), pp. 355–366.
HPCAHPCA-1995-McKeeW
Access Ordering and Memory-Conscious Cache Utilization (SAM, WAW), pp. 253–262.
HPDCHPDC-1995-BaldoniMR #multi #order #performance #realtime
Efficient Causally Ordered Communications for Multimedia Real-Time Applications (RB, AM, MR), pp. 140–147.
CAVCAV-1995-BasinK #hardware #higher-order #logic #monad #using #verification
Hardware Verification using Monadic Second-Order Logic (DAB, NK), pp. 31–41.
ICLPICLP-1995-Beierle #logic programming #order #polymorphism #source code
Type Inferencing for Polymorphic Order-Sorted Logic Programs (CB), pp. 765–779.
ICLPICLP-1995-CervesatoCM #calculus #framework #logic programming #order
A Modal Calculus of Partially Ordered Events in a Logic Programming Framework (IC, LC, AM), pp. 299–313.
ICLPICLP-1995-NilssonH #higher-order #logic programming #source code
Constructing Logic Programs with Higher-Order Predicates (JFN, AH), p. 827.
ICLPILPS-1995-KuchenA #higher-order
Higher Order Babel (HK, JA), p. 633.
ICLPILPS-1995-Prehofer #call-by #functional #higher-order #logic programming
A Call-by-Need Strategy for Higher-Order Functional-Logic Programming (CP), pp. 147–161.
LICSLICS-1995-Comon #automaton #higher-order #logic #monad
Sequentiality, Second Order Monadic Logic and Tree Automata (HC), pp. 508–517.
LICSLICS-1995-ComonNR #constraints #order #theorem proving
Orderings, AC-Theories and Symbolic Constraint Solving (Extended Abstract) (HC, RN, AR), pp. 375–385.
LICSLICS-1995-DowekHK #higher-order #unification
Higher-Order Unification via Explicit Substitutions (Extended Abstract) (GD, TH, CK), pp. 366–374.
LICSLICS-1995-Dutertre #first-order #logic #proving
Complete Proof Systems for First Order Interval Temporal Logic (BD), pp. 36–43.
LICSLICS-1995-LincolnSS #higher-order #linear #logic #problem
Decision Problems for Second-Order Linear Logic (PL, AS, NS), pp. 476–485.
LICSLICS-1995-ParedaensBG #finite #first-order #query
First-order Queries on Finite Structures over the Reals (JP, JVdB, DVG), pp. 79–87.
RTARTA-1995-Boulton #higher-order #semantics #strict
A Restricted Form on Higher-Order Rewriting Applied to an HDL Semantics (RJB), pp. 309–323.
RTARTA-1995-Giesl #generative #order #polynomial #proving #termination
Generating Polynomial Orderings for Termination Proofs (JG), pp. 426–431.
RTARTA-1995-KuriharaKO #multi #order #reduction
Completion for Multiple Reduction Orderings (MK, HK, AO), pp. 71–85.
RTARTA-1995-LysneP #higher-order #term rewriting #termination
A Termination Ordering for Higher Order Rewrite System (OL, JP), pp. 26–40.
RTARTA-1995-Nipkow #higher-order #term rewriting
Higher-Order Rewrite Systems (Abstract) (TN), p. 256.
RTARTA-1995-Steinbach #automation #order #proving #termination
Automatic Termination Proofs With Transformation Orderings (JS), pp. 11–25.
TLCATLCA-1995-DespeyrouxFH #coq #higher-order #syntax
Higher-Order Abstract Syntax in Coq (JD, APF, AH), pp. 124–138.
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-Springintveld #higher-order
Third-Order Matching in the Presence of Type Constructors (JS), pp. 428–442.
DACDAC-1994-AzizTB #finite #state machine
BDD Variable Ordering for Interacting Finite State Machines (AA, ST, RKB), pp. 283–288.
DACDAC-1994-DrechslerSTBP #diagrams #functional #order #performance #representation
Efficient Representation and Manipulation of Switching Functions Based on Ordered Kronecker Functional Decision Diagrams (RD, AS, MT, BB, MAP), pp. 415–419.
PODSPODS-1994-HillebrandK #database #functional #order #query #λ-calculus
Functional Database Query Languages as Typed Lambda Calculi of Fixed Order (GGH, PCK), pp. 222–231.
VLDBVLDB-1994-Galindo-LegariaPK #performance #question #random #why
Fast, Randomized Join-Order Selection — Why Use Transformations? (CAGL, AP, MLK), pp. 85–95.
VLDBVLDB-1994-LitwinNS #data type #distributed #order #product line #scalability
RP*: A Family of Order Preserving Scalable Distributed Data Structures (WL, MAN, DAS), pp. 342–353.
ESOPESOP-1994-AbadiC #formal method
A Theory of Primitive Objects — Scond-Order Systems (MA, LC), pp. 1–25.
ESOPESOP-1994-Boerio #higher-order #polymorphism #λ-calculus
Extending Pruning Techniques to Polymorphic Second order λ-Calculus (LB), pp. 120–134.
ESOPESOP-1994-MacQueenT #higher-order #semantics
A Semantics for Higher-Order Functors (DBM, MT), pp. 409–423.
PEPMPEPM-1994-Baker-Finch #higher-order #static analysis #type system
Type Theory and Projections for Higher-Order Static Analysis (CABF), pp. 43–52.
PEPMPEPM-1994-Thiemann #higher-order
Higher-Order Redundancy Elimination (PT), pp. 73–83.
ICALPICALP-1994-CosmoK #algebra #first-order #recursion #term rewriting #λ-calculus
Combining First Order Algebraic Rewriting Systems, Recursion and Extensional λ Calculi (RDC, DK), pp. 462–472.
ICALPICALP-1994-Hennessy #higher-order #modelling #process
Higher-Order Process and Their Models (MH), pp. 286–303.
ICALPICALP-1994-HintermeierKK #dynamic typing #equation #order
Dynamically-Typed Computations for Order-Sorted Equational Presentations (CH, CK, HK), pp. 450–461.
LISPLFP-1994-KfouryW #algorithm #higher-order #type inference #λ-calculus
A Direct Algorithm for Type Inference in the Rank-2 Fragment of the Second-Order λ-Calculus (AJK, JBW), pp. 196–207.
LISPLFP-1994-StefanescuZ #analysis #equation #framework #functional #higher-order #source code
An Equational Framework for the Flow Analysis of Higher Order Functional Programs (DCS, YZ), pp. 318–327.
ICGTTAGT-1994-Courcelle #composition #graph #higher-order #logic #monad
The Definition in Monadic Second-Order Logic of Modular Decompositions of Ordered Graphs (BC), pp. 487–501.
KRKR-1994-Koubarakis #complexity #constraints #first-order
Complexity Results for First-Order Theories of Temporal Constraints (MK), pp. 379–390.
KRKR-1994-LakemeyerM #decidability #first-order #power of
Enhancing the Power of a Decidable First-Order Reasoner (GL, SM), pp. 403–414.
SEKESEKE-1994-Sakalauskaite #branch #calculus #first-order #logic
A complete sequent calculus for a first order branching temporal logic (JS), pp. 274–280.
SEKESEKE-1994-SuzukiT #abstraction #behaviour #retrieval #using
Associative program retrieval using partially-ordered behavioral abstractions of a program (HS, NT), pp. 395–404.
PPDPALP-1994-BidoitH #behaviour #first-order #logic #proving #standard #theorem
Proving Behavioural Theorems with Standard First-Order Logic (MB, RH), pp. 41–58.
PPDPALP-1994-JonesR #functional #graph #higher-order
Higher-Order Minimal Functional Graphs (NDJ, MR), pp. 242–252.
LOPSTRLOPSTR-1994-TarauD #continuation #first-order #logic programming
Logic Programming and Logic Grammars with First-Order Continuations (PT, VD), pp. 215–230.
PPDPPLILP-1994-Serrano #analysis #compilation #control flow #functional #higher-order #using
Using Higher-Order Control Flow Analysis When Compiling Functional Languages (MS), pp. 447–448.
POPLPOPL-1994-Bloom #communication #higher-order #named #λ-calculus
CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms (BB), pp. 339–347.
POPLPOPL-1994-HarperL #approach #higher-order
A Type-Theoretic Approach to Higher-Order Modules with Sharing (RH, ML), pp. 123–137.
POPLPOPL-1994-NielsonN #communication #concurrent #finite #higher-order #source code
Higher-Order Concurrent Programs with Finite Communication Topology (HRN, FN), pp. 84–97.
POPLPOPL-1994-Qian #equation #higher-order #logic programming
Higher-Order Equational Logic Programming (ZQ), pp. 254–267.
SACSAC-1994-RondogiannisW #data flow #hardware #higher-order #implementation
Higher-order dataflow and its implementation on stock hardware (PR, WWW), pp. 431–435.
CADECADE-1994-BachmairG #order
Ordered Chaining for Total Orderings (LB, HG), pp. 435–450.
CADECADE-1994-BasinW #order #termination
Termination Orderings for Rippling (DAB, TW), pp. 466–483.
CADECADE-1994-BronsardRH #induction #order #using
Induction using Term Orderings (FB, USR, RWH), pp. 102–117.
CADECADE-1994-ChuP #first-order #proving #semantics #theorem proving #using
Semantically Guided First-Order Theorem Proving using Hyper-Linking (HC, DAP), pp. 192–206.
CADECADE-1994-Hutter #induction #order #proving #synthesis
Synthesis of Induction Orderings for Existence Proofs (DH), pp. 29–41.
CADECADE-1994-JohannK #constant #order #unification #λ-calculus
Unification in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading (PJ, MK), pp. 620–634.
CADECADE-1994-KlingenbeckH #semantics #strict
Semantic Tableaux with Ordering Restrictions (SK, RH), pp. 708–722.
CADECADE-1994-MullerW #composition #higher-order #theory and practice
Theory and Practice of Minimal Modular Higher-Order E-Unification (OM, FW), pp. 650–664.
CADECADE-1994-Prehofer #decidability #higher-order #problem #unification
Decidable Higher-Order Unification Problems (CP), pp. 635–649.
CADECADE-1994-SturgillS #first-order #logic #novel #parallel
A Novel Asynchronous Parallelism Scheme for First-Order Logic (DBS, AMS), pp. 484–498.
CAVCAV-1994-GeistB #automation #model checking #performance
Efficient Model Checking by Automated Ordering of Transition Relation Partitions (DG, IB), pp. 299–310.
CAVCAV-1994-Peled #model checking #on the fly #partial order #reduction
Combining Partial Order Reductions with On-the-fly Model-Checking (DP), pp. 377–390.
ICLPICLP-1994-CairesM #higher-order #logic programming #polymorphism #unification
Higher-Order Polymorphic Unification for Logic Programming (LC, LM), pp. 419–433.
ICLPICLP-1994-Reddy #aspect-oriented #higher-order #logic programming
Higher-order Aspects of Logic Programming (USR), pp. 402–418.
ICLPILPS-1994-McCartyS #first-order #interpreter #logic #prolog
A PROLOG Interpreter for First-Order Intuitionistic Logic (LTM, LAS), p. 685.
ICLPILPS-1994-SchulteS #concurrent #constraints #encapsulation #higher-order #programming
Encapsulated Search for Higher-order Concurrent Constraint Programming (CS, GS), pp. 505–520.
LICSLICS-1994-ColsonE #higher-order #on the
On Strong Stability and Higher-Order Sequentiality (LC, TE), pp. 103–108.
LICSLICS-1994-HellaKL #finite #how #linear #modelling #order
How to Define a Linear Order on Finite Models (LH, PGK, KL), pp. 40–49.
LICSLICS-1994-LincolnS #calculus #first-order #linear #logic #proving
Proof Search in First-Order Linear Logic and Other Cut-Free Sequent Calculi (PL, NS), pp. 282–291.
LICSLICS-1994-Prehofer #higher-order
Higher-Order Narrowing (CP), pp. 507–516.
LICSLICS-1994-Sewell #axiom #bisimulation #equation #first-order
Bisimulation is Not Finitely (First Order) Equationally Axiomatisable (PS), pp. 62–70.
LICSLICS-1994-Wells #decidability #higher-order #λ-calculus
Typability and Type-Checking in the Second-Order λ-Calculus are Equivalent and Undecidable (JBW), pp. 176–185.
ICDARICDAR-1993-ChhabraABCLSSW #geometry #higher-order #recognition #statistics
High-order statistically derived combinations of geometric features for handprinted character recognition (AKC, ZA, DB, GC, KL, PS, RS, BW), pp. 397–401.
ICDARICDAR-1993-SaitohTY #documentation #image #segmentation
Document image segmentation and text area ordering (TS, MT, TY), pp. 323–329.
PODSPODS-1993-MaierV #order
A Call to Order (DM, BV), pp. 1–16.
PODSPODS-1993-Raz #order #transaction
Extended Commitment Ordering or Guaranteeing Global Serializability by Applying Commitment Order Selectivity to Global Transactions (YR), pp. 83–96.
SIGMODSIGMOD-1993-Guting #higher-order #modelling #optimisation #query #specification
Second-Order Signature: A Tool for Specifying Data Models, Query Processing, and Optimization (RHG), pp. 277–286.
PEPMPEPM-1993-Consel93a #higher-order #partial evaluation
A Tour of Schism: A Partial Evaluation System For Higher-Order Applicative Languages (CC), pp. 145–154.
PEPMPEPM-1993-Davis #analysis #higher-order
Higher-order Binding-time Analysis (KD), pp. 78–87.
PLDIPLDI-1993-Bourdoncle #debugging #higher-order #imperative
Abstract Debugging of Higher-Order Imperative Languages (FB), pp. 46–55.
DLTDLT-1993-DassowMP #order
Iterative Reading of Numbers: The Ordered Case (JD, SM, GP), pp. 157–168.
ICALPICALP-1993-KannegantiC #higher-order #programming language #question #what
What is a Universal Higher-Order Programming Language? (RK, RC), pp. 682–695.
ICALPICALP-1993-LodayaT #decidability #logic #partial order
Decidability of a Partial Order Based Temporal Logic (KL, PST), pp. 582–592.
FPCAFPCA-1993-Jones #higher-order #morphism #polymorphism
A System of Constructor Classes: Overloading and Implicit Higher-Order Polymorphism (MPJ), pp. 52–64.
FPCAFPCA-1993-SastryCA #analysis #functional #strict
Order-of-evaluation Analysis for Destructive Updates in Strict Functional Languages with Flat Aggregates (AVSS, WDC, ZMA), pp. 266–275.
CIKMCIKM-1993-CosarLS #bound #multi #optimisation #query
Multiple Query Optimization with Depth-First Branch-and-Bound and Dynamic Query Ordering (AC, EPL, JS), pp. 433–438.
ICMLICML-1993-CarpinetoR #approach #clustering #concept #named
GALOIS: An Order-Theoretic Approach to Conceptual Clustering (CC, GR), pp. 33–40.
SEKESEKE-1993-Cooke93a #multi #order #programming language
A High Level Programming Language Based Upon Ordered Multisets (DEC), pp. 117–124.
ECOOPECOOP-1993-CaseauP #higher-order #object-oriented
Attaching Second-Order Types to Methods in an Object-Oriented Language (YC, LP), pp. 142–160.
PPDPPLILP-1993-Rosendahl #higher-order #sequence
Higher-Order Chaotic Iteration Sequences (MR), pp. 332–345.
SACSAC-1993-CorcoranW #algorithm #named #research #search-based
LibGA: A User-Friendly Workbench for Order-Based Genetic Algorithm Research (ALC, RLW), pp. 111–117.
HPDCHPDC-1993-AmerCCD #multi #partial order #reliability
Partial Order Transport Service for Multimedia Applications: Reliable Service (PDA, TJC, CC, MD), pp. 272–280.
HPDCHPDC-1993-NakamuraT #network #performance #protocol
Starvation-Prevented Priority-Based Total Ordering Broadcast Protocol on High-Speed Single Channel Network (AN, MT), pp. 281–288.
SOSPSOSP-1993-CheritonS #communication #comprehension #order
Understanding the Limitations of Causally and Totally Ordered Communication (DRC, DS), pp. 44–57.
CAVCAV-1993-GodefroidP #dependence #partial order #verification
Refining Dependencies Improves Partial-Order Verification Methods (Extended Abstract) (PG, DP), pp. 438–449.
CSLCSL-1993-Milner #calculus #higher-order
Higher-Order Action Calculi (RM), pp. 238–260.
ICLPICLP-1993-McCarty #higher-order #induction #logic #prolog #proving #source code
Proving Inductive Properties of Prolog Programs in Second-Order Intuitionistic Logic (LTM), pp. 44–63.
ICLPILPS-1993-Ait-KaciPG #order #unification
Order-Sorted Feature Theory Unification (HAK, AP, SCG), pp. 506–524.
ICLPILPS-1993-Felty #definite clause grammar #higher-order #parsing #syntax
Definite Clause Grammars for Parsing Higher-Order Syntax (APF), p. 668.
ICLPILPS-1993-Spencer #order #strict
The Ordered Clause Restriction of Model Elimination and SLI Resolution (BS), p. 678.
RTARTA-1993-DelorP #commutative #order
Extension of the Associative Path Ordering to a Chain of Associative Commutative Symbols (CD, LP), pp. 389–404.
RTARTA-1993-GuiO #algebra #higher-order #named #specification
LAMBDALG: Higher Order Algebraic Specification Language (YG, MO), pp. 462–466.
RTARTA-1993-LevyA #order #term rewriting
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations (JL, JAC), pp. 17–31.
RTARTA-1993-NivelaN #first-order
Saturation of First-Order (Constrained) Clauses with the Saturate System (PN, RN), pp. 436–440.
RTARTA-1993-RubioN #order
A Precedence-Based Total AC-Compatible Ordering (AR, RN), pp. 374–388.
RTARTA-1993-Werner #approach #order #semantics
A Semantic Approach to Order-Sorted Rewriting (AW), pp. 47–61.
TLCATLCA-1993-BarbaneraF #higher-order #term rewriting
Combining First and Higher Order Rewrite Systems with Type Assignment Systems (FB, MF), pp. 60–74.
TLCATLCA-1993-JacobsM #dependent type #higher-order #logic #type system
Translating Dependent Type Theory into Higher Order Logic (BJ, TFM), pp. 209–229.
TLCATLCA-1993-Nipkow #confluence #higher-order #orthogonal #term rewriting
Orthogonal Higher-Order Rewrite Systems are Confluent (TN), pp. 306–317.
DACDAC-1992-MercerKR #functional #generative #order #performance
Functional Approaches to Generating Orderings for Efficient Symbolic Representations (MRM, RK, DER), pp. 624–627.
PODSPODS-1992-Meyden #complexity #order #query
The Complexity of Querying Indefinite Data about Linearly Ordered Domains (RvdM), pp. 331–345.
VLDBVLDB-1992-Raz #multi #principle #using
The Principle of Commitment Ordering, or Guaranteeing Serializability in a Heterogeneous Environment of Multiple Autonomous Resource Mangers Using Atomic Commitment (YR), pp. 292–312.
PEPMPEPM-1992-Chin #higher-order #lazy evaluation
Fully Lazy Higher-Order Removal (WNC), pp. 38–47.
PEPMPEPM-1992-RufW #analysis #control flow #higher-order #using
Improving the Accuracy of Higher-Order Specialization using Control Flow Analysis (ER, DW), pp. 67–74.
STOCSTOC-1992-GroveHK #first-order #logic
Asymptotic Conditional Probabilities for First-Order Logic (AJG, JYH, DK), pp. 294–305.
SASWSA-1992-Hamilton #analysis #first-order #functional #lazy evaluation #source code
Sharing Analysis of Lazy First-Order Functional Programs (GWH), pp. 68–78.
SASWSA-1992-ParkG #analysis #lazy evaluation
Order-of-Demand Analysis for Lazy Languages (YGP, BG), pp. 91–101.
ICALPICALP-1992-Straubing #complexity #first-order #power of
Circuit Complexity and the Expressive Power of Generalized First-Order Formulas (HS), pp. 16–27.
CHICHI-1992-WareK #visual notation
Orderable Dimensions of Visual Texture for Data Display: Orientation, Size and Contrast (CW, WK), pp. 203–209.
KRKR-1992-BollingerP #constraints #logic #order
An Order-Sorted Logic with Sort Literals and Disjointness Constraints (TB, UP), pp. 413–424.
KRKR-1992-GabbayO #higher-order #logic #quantifier
Quantifier Elimination in Second-Order Predicate Logic (DMG, HJO), pp. 425–435.
KRKR-1992-MintonDBP #partial order #performance
Total Order vs. Partial Order Planning: Factors Influencing Performance (SM, MD, JLB, ABP), pp. 83–92.
KRKR-1992-Nayak #order #reasoning #using
Order of Magnitude Reasoning using Logarithms (PPN), pp. 201–210.
KRKR-1992-PenberthyW #named #partial order
UCPOP: A Sound, Complete, Partial Order Planner for ADL (JSP, DSW), pp. 103–114.
ICMLML-1992-FengM #higher-order #induction #logic #towards
Towards Inductive Generalization in Higher Order Logic (CF, SM), pp. 154–162.
ICMLML-1992-FisherXZ #clustering
Ordering Effects in Clustering (DHF, LX, NZ), pp. 162–168.
ICMLML-1992-OmlinG #higher-order #network #using
Training Second-Order Recurrent Neural Networks using Hints (CWO, CLG), pp. 361–366.
SEKESEKE-1992-Reif #correctness #first-order #specification
Correctness of Full First-Order Specifications (WR), pp. 276–283.
PPDPALP-1992-AptMP #first-order #formal method #prolog
A Theory of First-Order Built-in’s of Prolog (KRA, EM, CP), pp. 69–83.
PPDPALP-1992-BachmairGW #first-order #proving #theorem proving
Theorem Proving for Hierarchic First-Order Theories (LB, HG, UW), pp. 420–434.
PPDPALP-1992-Gnaedig #order #termination
Termination of Order-sorted Rewriting (IG), pp. 37–52.
PPDPPLILP-1992-Hoa #bottom-up #higher-order #interpreter #logic programming #programming language
A Bottom-Up Interpreter for a Higher-Order Logic Programming Language (AHBH), pp. 326–340.
PPDPPLILP-1992-Reus #algebra #higher-order #implementation #specification
Implementing Higher-Order Functions in an Algebraic Specification Language with Narrowing (BR), pp. 483–484.
POPLPOPL-1992-BruceM #higher-order #modelling #morphism #polymorphism #recursion #type system
PER Models of Subtyping, Recursive Types and Higher-Order Polymorphism (KBB, JCM), pp. 316–327.
POPLPOPL-1992-JagadeesanP #functional #higher-order #logic #semantics
Abstract Semantics for a Higher-Order Functional Language with Logic Variables (RJ, KP), pp. 355–366.
POPLPOPL-1992-Tofte #higher-order
Principal Signatures for Higher-Order Program Modules (MT), pp. 189–199.
CADECADE-1992-Boudet #algebra #order #unification
Unification in Order-Sorted Algebras with Overloading (AB), pp. 193–207.
CADECADE-1992-DoughertyJ #approach #combinator #higher-order #logic
A Combinatory Logic Approach to Higher-order E-unification (Extended Abstract) (DJD, PJ), pp. 79–93.
CADECADE-1992-Fisher #first-order #normalisation
A Normal Form for First-Order Temporal Formulae (MF), pp. 370–384.
CADECADE-1992-Kesner #order #orthogonal #term rewriting
Free Sequentially in Orthogonal Order-Sorted Rewriting Systems with Constructors (DK), pp. 603–617.
CADECADE-1992-NieuwenhuisR #proving #theorem proving
Theorem Proving with Ordering Constrained Clauses (RN, AR), pp. 477–491.
CSLCSL-1992-Gavilanes-FrancoLR #higher-order #reasoning
Reasoning with Higher Order Partial Functions (AGF, FLC, MRA), pp. 167–181.
CSLCSL-1992-Tyszkiewicz #higher-order #monad #on the
On Asymptotic Probabilities of Monadic Second Order Properties (JT), pp. 425–439.
ICTSSIWPTS-1992-DriraASC #consistency #detection #fault #testing
Characterizing and Ordering Errors Detected by Conformance Testing (KD, PA, BS, AMC), pp. 67–78.
ICLPJICSLP-1992-QianW #higher-order
Higher-Order E-Unification for Arbitrary Theories (ZQ, KW), pp. 52–66.
LICSLICS-1992-Dowek #decidability #higher-order
Third Order Matching is Decidable (GD), pp. 2–10.
LICSLICS-1992-Stolboushkin #axiom #finite #linear #modelling #order
Axiomatizable Classes of Finite Models and Definability of Linear Order (APS), pp. 64–70.
DACDAC-1991-ButlerRKM #diagrams #heuristic #order #performance
Heuristics to Compute Variable Orderings for Efficient Manipulation of Ordered Binary Decision Diagrams (KMB, DER, RK, MRM), pp. 417–420.
DACDAC-1991-HussG #testing
Optimal Ordering of Analog Integrated Circuit Tests to Minimize Test Time (SDH, RSG), pp. 494–499.
ESOPESOP-J-1990-Bondorf91 #automation #equation #higher-order #recursion
Automatic Autoprojection of Higher Order Recursive Equations (AB), pp. 3–34.
PLDIPLDI-1991-Reppy #concurrent #higher-order #named
CML: A Higher-Order Concurrent Language (JHR), pp. 293–305.
SASWSA-1991-Chin #deforestation #first-order #functional #source code
Generalising Deforestation for All First-Order Functional Programs (WNC), pp. 173–181.
SASWSA-1991-CousotC #abstract interpretation #functional #higher-order #relational #source code
Relational Abstract Interpretation of Higher Order Functional Programs (extended abstract) (PC, RC), pp. 33–36.
ICALPICALP-1991-CulikD #generative #image #order
Balancing Order and Chaos in Image Generation (Extended Abstract) (KCI, SD), pp. 600–614.
ICALPICALP-1991-RaviAK #approximate #graph #problem #scheduling
Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion (RR, AA, PNK), pp. 751–762.
FPCAFPCA-1991-Henglein #analysis #higher-order #performance #type inference
Efficient Type Inference for Higher-Order Binding-Time Analysis (FH), pp. 448–472.
FPCAFPCA-1991-LeungM #lazy evaluation #reasoning
Reasoning about Simple and Exhaustive Demand in Highter-Order Lazy Languages (AL, PM), pp. 328–351.
FPCAFPCA-1991-NipkowS #order #unification
Type Classes and Overloading Resolution via Order-Sorted Unification (TN, GS), pp. 1–14.
KRKR-1991-GabbayLV #logic programming #order #semantics #source code
Credulous vs. Sceptical Semantics for Ordered Logic Programs (DMG, EL, DV), pp. 208–217.
ICMLML-1991-KowalczykFG #higher-order #network
Discovering Production Rules with Higher Order Neural Networks (AK, HLF, KG), pp. 158–162.
ICMLML-1991-NichollW #modelling #order
Computer Modelling of Acquisition Orders in Child Language (SN, DCW), pp. 100–104.
ICMLML-1991-RichardsM #first-order
First-Order Theory Revision (BLR, RJM), pp. 447–451.
PPDPPLILP-1991-ChenW #abstraction #compilation #higher-order #logic programming
Compilation of Predicate Abstractions in Higher-Order Logic Programming (WC, DSW), pp. 287–298.
PPDPPLILP-1991-Gloess #logic #order
U-Log, An Ordered Sorted Logic with Typed Attributes (PYG), pp. 275–286.
PPDPPLILP-1991-ProiettiP #logic programming #named #order #source code
Unfolding — Definition — Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs (MP, AP), pp. 347–358.
PPDPPLILP-1991-VogtSK #attribute grammar #evaluation #higher-order #incremental #performance
Efficient Incremental Evaluation of Higher order Attribute Grammars (HV, SDS, MFK), pp. 231–242.
POPLPOPL-1991-AbramskyJ #analysis #approach #higher-order #polymorphism #relational #strict
A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions (SA, TPJ), pp. 49–54.
POPLPOPL-1991-HengleinM #complexity #higher-order #type inference #λ-calculus
The Complexity of Type Inference for Higher-Order Typed λ Calculi (FH, HGM), pp. 119–130.
POPLPOPL-1991-JoungS #coordination #first-order #interactive #multi
Coordinating First-Order Multiparty Interactions (YJJ, SAS), pp. 209–220.
CAVCAV-1991-GodefroidW #concurrent #partial order #performance #safety #using #verification
Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties (PG, PW), pp. 332–342.
CAVCAV-1991-Nesi #higher-order #induction #logic #process #proving #specification
Mechanizing a Proof by Induction of Process Algebrs Specifications in Higher Order Logic (MN), pp. 288–298.
CAVCAV-1991-ProbstL #model checking #partial order
Partial-Order Model Checking: A Guide for the Perplexed (DKP, HFL), pp. 322–331.
CSLCSL-1991-Dahlhaus #first-order #how #memory management #modelling
How to Implement First Order Formulas in Local Memory Machine Models (ED), pp. 68–78.
CSLCSL-1991-Oguztuzun #equivalence #first-order #logic
A Fragment of First Order Logic Adequate for Observation Equivalence (HO), pp. 278–292.
ICLPICLP-1991-Hagiya #higher-order #proving #theorem proving #unification
Higher-Order Unification as a Theorem Proving Procedure (MH), pp. 270–284.
ICLPICLP-1991-Sato #first-order #logic programming
Full First Order Logic Programming and Truth Predicate (TS), p. 948.
ICLPISLP-1991-BeierleMS #automaton #order #polymorphism
Extending the Warren Abstract Machine to Polymorphic Order-Sorted Resolution (CB, GM, HS), pp. 272–286.
ICLPISLP-1991-Carpenter #first-order
Typed Feature Structures: A Generalization of First-Order Terms (BC), pp. 187–201.
ICLPISLP-1991-Caseau #abstract interpretation #constraints #order
Abstract Interpretation of Constraints on Order-Sorted Domains (YC), pp. 435–452.
ICLPISLP-1991-SatoM #first-order #interpreter #source code #top-down
A Complete Top-Down Interpreter for First Order Programs (TS, FM), pp. 35–53.
ICLPISLP-1991-Wadge #higher-order #logic programming
Higher-Order Horn Logic Programming (WWW), pp. 289–303.
LICSLICS-1991-AvronH #database #first-order #on the #query
On First Order Database Query Languages (AA, YH), pp. 226–231.
LICSLICS-1991-JouannaudO #algebra #execution #higher-order #specification
A Computation Model for Executable Higher-Order Algebraic Specification Languages (JPJ, MO), pp. 350–361.
LICSLICS-1991-KiferW #first-order #logic programming #morphism #polymorphism
A First-Order Theory of Types and Polymorphism in Logic Programming (MK, JW), pp. 310–321.
LICSLICS-1991-Nipkow #higher-order
Higher-Order Critical Pairs (TN), pp. 342–349.
LICSLICS-1991-PacholskiS #higher-order #on the #similarity
On the 0-1 Law for the class of Existential Second Order Minimal Gödel Sentences with Equality (LP, WS), pp. 280–285.
RTARTA-1991-Deruyver #equation #first-order #logic #named #proving #theorem proving
EMMY: A Refutational Theorem Prover for First-Order Logic with Equation (AD), pp. 439–441.
RTARTA-1991-Domenjoud #order #unification
AC Unification Through Order-Sorted AC1 Unification (ED), pp. 98–111.
RTARTA-1991-NipkowQ #composition #higher-order
Modular Higher-Order E-Unification (TN, ZQ), pp. 200–214.
RTARTA-1991-Wolfram #equation #higher-order #unification
Rewriting, and Equational Unification: the Higher-Order Cases (DAW), pp. 25–36.
VLDBVLDB-1990-RamakrishnanSS #bottom-up #evaluation #fixpoint #logic programming #source code
Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs (RR, DS, SS), pp. 359–371.
ESOPESOP-1990-Bondorf #automation #equation #higher-order #recursion
Automatic Autoprojection of Higher Order Recursive Equations (AB), pp. 70–87.
ESOPESOP-1990-GoldbergP #analysis #functional #higher-order #implementation #optimisation #stack
Higher Order Escape Analysis: Optimizing Stack Allocation in Functional Program Implementations (BG, YGP), pp. 152–160.
ESOPESOP-1990-Sands #analysis #complexity #higher-order #lazy evaluation
Complexity Analysis for a Lazy Higher-Order Language (DS), pp. 361–376.
PLDIPLDI-1990-TeitelbaumC #attribute grammar #editing #higher-order
Higher-Order Attribute Grammars and Editing Environments (TT, RC), pp. 197–208.
STOCSTOC-1990-Mulmuley #diagrams #order
Output Sensitive Construction of Levels and Voronoi Diagrams in R^d of Order 1 to k (KM), pp. 322–330.
ICALPICALP-1990-Comon #algebra #equation #order
Equational Formulas in Order-Sorted Algebras (HC), pp. 674–688.
ICALPICALP-1990-JagadeesanP #calculus #formal method #higher-order #process
A Domain-Theoretic Model for a Higher-Order Process Calculus (RJ, PP), pp. 181–194.
ICALPICALP-1990-PeledP #liveness #partial order #proving
Proving Partial Order Liveness Properties (DP, AP), pp. 553–571.
LISPLFP-1990-Burn #analysis #using
Using Projection Analysis of Evaluation-Order and Its Application (GLB), pp. 227–240.
LISPLFP-1990-Consel #analysis #functional #higher-order
Binding Time Analysis for High Order Untyped Functional Languages (CC), pp. 264–272.
LISPLFP-1990-DraghicescuP #analysis #composition
A Compositional Analysis of Evaluation-Order and Its Application (MD, SP), pp. 242–250.
ICGTGG-1990-Engelfriet #graph #higher-order #logic #monad
A Characterization of Context-Free NCE Graph Languages by Monadic Second-Order Logic on Trees (JE), pp. 311–327.
ICMLML-1990-Bostrom #approach #order
Generalizing the Order of Goals as an Approach to Generalizing Number (HB), pp. 260–267.
SIGIRSIGIR-1990-FoxCDH #information retrieval #order
Order Preserving Minimal Perfect Hash Functions and Information Retrieval (EAF, QFC, AMD, LSH), pp. 279–311.
PPDPALP-1990-DebartEL #equation #logic programming #multi #order #using
Multi-Modal Logic Programming using Equational and Order-Sorted Logic (FD, PE, ML), pp. 55–69.
PPDPALP-1990-Hofbauer #multi #order #proving #recursion #termination
Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths (DH), pp. 347–358.
PPDPALP-1990-Qian #algebra #higher-order
Higher-Order Order-Sorted Algebras (ZQ), pp. 86–100.
PPDPALP-1990-Sato #equivalence #first-order
An Equivalence Preserving First Order Unfold/fold Transformation System (TS), pp. 173–188.
PPDPALP-1990-Steinbach #term rewriting
AC-Termination of Rewrite Systems: A Modified Knuth-Bendix Ordering (JS), pp. 372–386.
PPDPPLILP-1990-Queinnec #compilation #higher-order #lisp
Compilation of Non-Linear, Second Order Patterns on S-Expressions (CQ), pp. 340–357.
POPLPOPL-1990-Deutsch #alias #functional #higher-order #on the #specification
On Determining Lifetime and Aliasing of Dynamically Allocated Data in Higher-Order Functional Specifications (AD), pp. 157–168.
POPLPOPL-1990-HarperMM #higher-order
Higher-Order Modules and the Phase Distinction (RH, JCM, EM), pp. 341–354.
ICSEICSE-1990-GanzingerS #composition #horn clause #order #specification
System Support for Modular Order-Sorted Horn Clause Specifications (HG, RS), pp. 150–159.
PPoPPPPoPP-1990-WhitfieldS #approach #optimisation
An Approach to Ordering Optimizing Transformations (DW, MLS), pp. 137–146.
CADECADE-1990-BachmairG #on the #order #strict
On Restrictions of Ordered Paramodulation with Simplification (LB, HG), pp. 427–441.
CADECADE-1990-Hagiya #higher-order #programming #proving #unification #using
Programming by Example and Proving by Example Using Higher-order Unification (MH), pp. 588–602.
CADECADE-1990-MartinN #confluence #order
Ordered Rewriting and Confluence (UM, TN), pp. 366–380.
CADECADE-1990-PymW #first-order
Investigations into Proof-Search in a System of First-Order Dependent Function Types (DJP, LAW), pp. 236–250.
CADECADE-1990-Snyder #higher-order
Higher Order E-Unification (WS), pp. 573–587.
CADECADE-1990-Steinbach #order
Improving Assoviative Path Orderings (JS), pp. 411–425.
CAVCAV-1990-Godefroid #automation #partial order #using #verification
Using Partial Orders to Improve Automatic Verification Methods (PG), pp. 176–185.
CAVCAV-1990-LoewensteinD #higher-order #logic #multi #protocol #simulation #using #verification
Verification of a Multiprocessor Cache Protocol Using Simulation Relations and Higher-Order Logic (PL, DLD), pp. 302–311.
CAVCAV-1990-ProbstL #explosion #partial order #problem #semantics #using
Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems (DKP, HFL), pp. 146–155.
ICLPCLP-1990-LauP90 #first-order #logic #recursion #specification #synthesis #top-down
Top-down Synthesis of Recursive Logic Procedures from First-order Logic Specifications (KKL, SDP), pp. 667–684.
ICLPCLP-1990-Miller90 #higher-order #logic programming
Higher-Order Logic Programming (DM), p. 784.
ICLPCLP-1990-Sheng90 #higher-order #logic programming #relational
HIFUNLOG : Logic Programming with Higher-order Relational Functions (YHS), pp. 529–545.
CSLCSL-1990-ArnborgPS #automaton #higher-order #logic #monad
Monadic Second Order Logic, Tree Automata and Forbidden Minors (SA, AP, DS), pp. 1–16.
LICSLICS-1990-Courcelle #graph #higher-order #monad #on the #set
On the Expression of Monadic Second-Order Graph Properties Without Quantifications Over Sets of Edges (Extended Abstract) (BC), pp. 190–196.
LICSLICS-1990-Lescanne #order
Well Rewrite Orderings (PL), pp. 249–256.
ICLPNACLP-1990-Umrigar #order #prolog #unification
Finding Advantageous Orders for Argument Unification for the Prolog WAM (ZDU), pp. 80–96.
DACDAC-1989-Groenveld #on the
On Global Wire Ordering for Macro-Cell Routing (PG), pp. 155–160.
PODSPODS-1989-Cosmadakis #first-order #on the #query #recursion
On the First-Order Expressibility of Recursive Queries (SSC), pp. 311–323.
SIGMODSIGMOD-1989-KiferL #higher-order #inheritance #named #reasoning
F-Logic: A Higher-Order language for Reasoning about Objects, Inheritance, and Scheme (MK, GL), pp. 134–146.
PLDIPLDI-1989-VogtSK #attribute grammar #higher-order
Higher-Order Attribute Grammars (HV, SDS, MFK), pp. 131–145.
STOCSTOC-1989-GoodmanPS #coordination #exponential #order #representation
Coordinate Representation of Order Types Requires Exponential Storage (JEG, RP, BS), pp. 405–410.
STOCSTOC-1989-KaoS #order
Local Reorientation, Global Order, and Planar Topology (Preliminary Version) (MYK, GES), pp. 286–296.
STOCSTOC-1989-Kenyon-MathieuK #partial order #verification
Verifying Partial Orders (CKM, VK), pp. 367–374.
ICALPICALP-1989-Courcelle #equation #graph #higher-order #logic #monad
The Definability of Equational Graphs in Monadic Second-Order Logic (BC), pp. 207–221.
FPCAFPCA-1989-BjernerH #analysis #approach #composition #first-order #functional #lazy evaluation #source code
A Composition Approach to Time Analysis of First Order Lazy Functional Programs (BB, SH), pp. 157–165.
FPCAFPCA-1989-NielsonN #higher-order
Transformations on Higher-Order Functions (HRN, FN), pp. 129–143.
KRKR-1989-McAllesterGF #first-order #syntax #taxonomy
Taxonomic Syntax for First Order Inference (DAM, RG, TF), pp. 289–300.
KRKR-1989-Zadrozny #order #set
Cardinalities and Well Orderings in a Common-Sense Set Theory (WZ), pp. 486–497.
ICMLML-1989-DietzenP #framework #higher-order #logic
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization (SD, FP), pp. 447–449.
POPLPOPL-1989-Parker #partial order #programming
Partial Order Programming (DSPJ), pp. 260–266.
POPLPOPL-1989-Thomsen #calculus #communication #higher-order
A Calculus of Higher Order Communicating Systems (BT), pp. 143–154.
CSLCSL-1989-Ohlbach #first-order #logic #multi #proving
New Ways for Developing Proof Theories for First-Order Multi Modal Logics (HJO), pp. 271–308.
LICSLICS-1989-AbiteboulV #first-order #fixpoint #logic
Fixpoint Extensions of First-Order Logic and Datalog-Like Languages (SA, VV), pp. 71–79.
ICLPNACLP-1989-ChenKW #first-order #higher-order #logic programming #named #semantics
HiLog: A First-Order Semantics for Higher-Order Logic Programming Constructs (WC, MK, DSW), pp. 1090–1114.
ICLPNACLP-1989-MarkovitchS #approach #automation #machine learning
Automatic Ordering of Subgoals — A Machine Learning Approach (SM, PDS), pp. 224–240.
RTARTA-1989-Elliott #higher-order #unification
Higher-order Unification with Dependent Function Types (CE), pp. 121–136.
RTARTA-1989-Puel #order #recursion
Embedding with Patterns and Associated Recursive Path Ordering (LP), pp. 371–387.
RTARTA-1989-Steinbach #comparison #order
Extensions and Comparison of Simplification Orderings (JS), pp. 434–448.
DACDAC-1988-Cai88a #layout
Connectivity Biased Channel Construction and Ordering for Building-Block Layout (HC), pp. 560–565.
PODSPODS-1988-Morris #algorithm #exclamation
An Algorithm for Ordering Subgoals in NAIL! (KAM), pp. 82–88.
PODSPODS-1988-UllmanV #complexity
The Complexity of Ordering Subgoals (JDU, MYV), pp. 74–81.
ESOPESOP-1988-Parigot #higher-order #programming #proving #type system
Programming with Proofs: A Second Order Type Theory (MP), pp. 145–159.
PLDIPLDI-1988-PfenningE #higher-order #syntax
Higher-Order Abstract Syntax (FP, CE), pp. 199–208.
PLDIBest-of-PLDI-1988-Shivers88a #analysis #control flow #higher-order #lessons learnt
Higher-order control-flow analysis in retrospect: lessons learned, lessons abandoned (with retrospective) (OS), pp. 257–269.
ICALPICALP-1988-CoriM #approximate #automaton #distributed
Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System (RC, YM), pp. 147–161.
LISPLFP-1988-Pfenning #higher-order #polymorphism #type inference #unification
Partial Polymorphic Type Inference and Higher-Order Unification (FP), pp. 153–163.
ICMLML-1988-Helft #first-order #learning
Learning Systems of First-Order Rules (NH), pp. 395–401.
ICMLML-1988-Mooney #order
Generalizing the Order of Operators in Macro-Operators (RJM), pp. 270–283.
ICMLML-1988-MuggletonB #first-order
Machine Invention of First Order Predicates by Inverting Resolution (SM, WLB), pp. 339–352.
PPDPALP-1988-Smolka #logic programming #order
Logic Programming with Polymorphically Order-Sorted Types (GS), pp. 53–70.
CADECADE-1988-DonatW #higher-order #learning #using
Learning and Applying Generalised Solutions using Higher Order Resolution (MRD, LAW), pp. 41–60.
CADECADE-1988-FeltyM #higher-order #logic programming #programming language #proving #specification #theorem proving
Specifying Theorem Provers in a Higher-Order Logic Programming Language (APF, DM), pp. 61–80.
CADECADE-1988-ZhangK #first-order #proving #theorem proving #using
First-Order Theorem Proving Using Conditional Rewrite Rules (HZ, DK), pp. 1–20.
ICLPJICSCP-1988-GallierI88 #equation #logic #order
Rewriting in Order-sorted Equational Logic (JHG, TI), pp. 280–294.
ICLPJICSCP-1988-HannanM88 #higher-order #implementation #unification
Uses of Higher-Order Unification for Implementing Program Transformers (JH, DM), pp. 942–959.
LICSLICS-1988-Amadio #fixpoint #higher-order #modelling #λ-calculus
A fixed point extension of the second order λ-calculus: observable equivalences and models (RMA), pp. 51–60.
LICSLICS-1988-Breazu-Tannen88a #algebra #higher-order
Combining Algebra and Higher-Order Types (VT), pp. 82–90.
LICSLICS-1988-KolaitisV #higher-order #logic #problem
0-1 Laws and Decision Problems for Fragments of Second-Order Logic (PGK, MYV), pp. 2–11.
DACDAC-1987-FriedmanS #diagrams
Finding the Optimal Variable Ordering for Binary Decision Diagrams (SJF, KJS), pp. 358–356.
PLDIPLDI-1987-Danvy #higher-order #memory management
Memory allocation and higher-order functions (OD), pp. 241–252.
STOCSTOC-1987-DietzS #algorithm #maintenance #order
Two Algorithms for Maintaining Order in a List (PFD, DDS), pp. 365–372.
STOCSTOC-1987-KolaitisV #higher-order #problem
The Decision Problem for the Probabilities of Higher-Order Properties (PGK, MYV), pp. 425–435.
HCIHCI-CE-1987-Feeney
Telephone Ordering System (JWF), pp. 407–414.
POPLPOPL-1987-FelleisenF #calculus #higher-order
A Calculus for Assignments in Higher-Order Languages (MF, DPF), pp. 314–325.
LICSLICS-1987-BachmairD #first-order #proving #theorem proving
Inference Rules for Rewrite-Based First-Order Theorem Proving (LB, ND), pp. 331–337.
LICSLICS-1987-Emden #first-order #functional #logic #programming #relational
First-order Predicate Logic as a Common Basis for Relational and Functional Programming (Abstract) (MHvE), p. 179.
LICSLICS-1987-GaifmanP #concurrent #modelling #partial order
Partial Order Models of Concurrency and the Computation of Functions (HG, VRP), pp. 72–85.
LICSLICS-1987-GoguenM #algebra #multi #order
Order-Sorted Algebra solves the Constructor-Selector, Multiple (JAG, JM), pp. 18–29.
LICSLICS-1987-Mendler #constraints #higher-order #recursion #λ-calculus
Recursive Types and Type Constraints in Second-Order λ Calculus (NPM), pp. 30–36.
LICSLICS-1987-Thomas #first-order #infinity #logic #on the
On Chain Logic, Path Logic, and First-Order Logic over Infinite Trees (WT), pp. 245–256.
RTARTA-1987-Martin #how
How to Choose Weights in the Knuth Bendix Ordering (UM), pp. 42–53.
ICLPSLP-1987-Chen87 #formal method #higher-order #logic
A Theory of Modules Based on Second-Order Logic (WC), pp. 24–33.
ICLPSLP-1987-HuberV87 #order #prolog
Extended Prolog for Order-Sorted Resolution (MH, IV), pp. 34–43.
DACDAC-1986-Maly #order #sequence #testing
Optimal order of the VLSI IC testing sequence (WM), pp. 560–566.
PODSPODS-1986-Naqvi #first-order #query
Negation as Failure for First-Order Queries (SAN), pp. 114–122.
PODSPODS-1986-Robinson #linear #order #statistics #using
Order Preserving Linear Hashing Using Dynamic Key Statistics (JTR), pp. 91–99.
LISPLFP-1986-BoehmCRO #case study #higher-order #programming
Exact Real Arithmetic: A Case Study in Higher Order Programming (HJB, RC, MR, MJO), pp. 162–173.
ICGTGG-1986-Brandenburg #graph grammar #on the #order
On Partially Ordered Graph Grammars (FJB), pp. 99–111.
ICGTGG-1986-Courcelle86a #graph #higher-order #monad #on the #set
On context-free sets of graphs and their monadic second-order theory (BC), pp. 133–146.
POPLPOPL-1986-HudakY #analysis #higher-order #strict #λ-calculus
Higher-Order Strictness Analysis in Untyped λ Calculus (PH, JY), pp. 97–109.
CADECADE-1986-Andrews #higher-order #logic
Connections and Higher-Order Logic (PBA), pp. 1–4.
CADECADE-1986-BuningL #first-order #satisfiability
Classes of First Order Formulas Under Various Satisfiability Definitions (HKB, TL), pp. 553–563.
ICLPICLP-1986-MillerN86 #higher-order #logic programming
Higher-Order Logic Programming (DM, GN), pp. 448–462.
LICSLICS-1986-AmadioBL #equation #higher-order #λ-calculus
The Finitary Projection Model for Second Order λ Calculus and Solutions to Higher Order Domain Equations (RMA, KBB, GL), pp. 122–130.
LICSLICS-1986-BachmairDH #equation #order #proving
Orderings for Equational Proofs (LB, ND, JH), pp. 346–357.
LICSLICS-1986-Gunter #axiom
The Largest First-Order-Axiomatizable Cartesian Closed Category of Domains (CAG), pp. 142–148.
LICSLICS-1986-MakowskyS #equivalence #higher-order #on the #semantics #standard #verification
On the Equivalence of Weak Second Order and Nonstandard Time Semantics For Various Program Verification Systems (JAM, IS), pp. 293–300.
LICSLICS-1986-Mason #equivalence #first-order #lisp #proving #source code
Equivalence of First Order LISP Programs. Proving Properties of Destructive Programs via Transformation (IAM), pp. 105–117.
VLDBVLDB-1985-OzkarahanO #clustering #database #order
Dynamic and Order Preserving Data Partitioning for Database Machines (EAO, AMO), pp. 358–368.
STOCSTOC-1985-Lubiw #matrix #order
Doubly Lexical Orderings of Matrices (AL), pp. 396–404.
ICALPICALP-1985-GoguenJM #algebra #order #semantics
Operational Semantics for Order-Sorted Algebra (JAG, JPJ, JM), pp. 221–231.
FPCAFPCA-1985-Bellot85 #higher-order #programming
High Order Programming in Extended FP (PB), pp. 65–80.
FPCAFPCA-1985-Sheeran85 #architecture #array #design #higher-order #using
Designing Regular Array Architectures using Higher Order Functions (MS), pp. 220–237.
RTARTA-1985-BachmairP #order
Associative Path Orderings (LB, DAP), pp. 241–254.
RTARTA-1985-Rusinowitch #composition #recursion #revisited
Path of Subterms Ordering and Recursive Decomposition Ordering Revisited (MR), pp. 225–240.
ICLPSLP-1985-UmrigarP85 #empirical #first-order #logic #programming
An Experiment in Programming with Full First-Order Logic (ZDU, VP), pp. 40–47.
ICALPICALP-1984-Reisig #partial order #semantics
Partial Order Semantics versus Interleaving Semantics for CSP-like Languages and its Impact on Fairness (WR), pp. 403–413.
CADECADE-1984-Simon #algorithm #higher-order #linear
A Linear Time Algorithm for a Subcase of Second Order Instantiation (DS), pp. 209–223.
ICLPSLP-1984-AponteFR84 #editing #first-order #proving
Editing First-Order Proofs: Programmed Rules vs Derived Rules (MVA, JAF, PR), pp. 92–98.
DACDAC-1983-Kang #linear
Linear ordering and application to placement (SK), pp. 457–464.
ICALPICALP-1983-SpinradV #2d #morphism #partial order #recognition
Recognition and Isomorphism of Two Dimensional Partial Orders (JPS, JV), pp. 676–686.
SIGMODSIGMOD-1982-DongH #approximate #dependence #order
Applying Approximate Order Dependency to Reduce Indexing Space (JD, RH), pp. 119–127.
SIGMODSIGMOD-1982-Kuss #database #distributed #on the
On Totally Ordering Checkpoints in Distributed Data Bases (HK), p. 174.
PLDISCC-1982-LaLondeR #compilation #flexibility
A Flexible Compiler Structure That Allows Dynamic Phase Ordering (WRL, JdR), pp. 134–139.
STOCSTOC-1982-Dietz #maintenance #order
Maintaining Order in a Linked List (PFD), pp. 122–127.
CADECADE-1982-HenschenN #database #first-order #infinity #recursion #representation #sequence
Representing Infinite Sequences of Resolvents in recursive First-Order Horn Databases (LJH, SAN), pp. 342–359.
STOCSTOC-1981-MullerS #automaton #graph #higher-order #logic #problem #reachability
Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems (DEM, PES), pp. 46–54.
ICALPICALP-1981-Pettorossi #order #proving #recursion #term rewriting #termination
Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems (AP), pp. 432–447.
STOCSTOC-1980-Yap #first-order #problem #source code #trade-off
Space-time Tradeoffs and First Order Problems in a Model of Programs (CKY), pp. 318–325.
VLDBVLDB-1979-Svensson #on the #order #performance #query
On Search Performance for Conjunctive Queries in Compressed, Fully Transposed Ordered Files (PS), pp. 155–163.
ICALPICALP-1979-DershowitzM #multi #order #proving #termination
Proving termination with Multiset Orderings (ND, ZM), pp. 188–202.
POPLPOPL-1979-CartwrightM #first-order #logic #programming
First Order Programming Logic (RC, JM), pp. 68–80.
SIGMODSIGMOD-1978-Nicolas #dependence #first-order #formal method #functional #logic #multi
First Order Logic Formalization for Functional, Multivalued and Mutual Dependencies (JMN), pp. 40–46.
SIGMODSIGMOD-1978-YamamotoTUI #design #multi #order
Design of a Generalized Balanced Multiple-Valued File Organization Scheme of Order Two (SY, ST, KU, HI), pp. 47–51.
ICSEICSE-1978-Fisher #design #higher-order #interactive #requirements
The Interaction Between the Preliminary Designs and the Technical Requirements for the DoD Common High Order Language (DAF), pp. 82–83.
SIGMODSIGMOD-1976-WelchG #multi #order #retrieval #using
Retrieval Using Ordered Lists in Inverted and Multilist Files (JWW, JWG), pp. 21–29.
DACDAC-1975-YoshizawaKK #array #heuristic
A heuristic procedure for ordering MOS arrays (HY, HK, KK), pp. 384–393.
SOSPSOSP-1975-ChandyR #execution #order #probability #scheduling
Scheduling Partially Ordered Tasks with Probabilistic Execution Times (KMC, PFR), pp. 169–177.
SIGMODSIGFIDET-1974-MehlW #case study #database #order
A Study of Order Transformations of Hierarchical Structures in IMS Data Base (JWM, CPW), pp. 125–139.
STOCSTOC-1974-Robertson #complexity #higher-order #monad
Structure of Complexity in the Weak Monadic Second-Order Theories of the Natural Numbers (ELR), pp. 161–171.
STOCSTOC-1972-JonesS #first-order #similarity #turing machine
Turing Machines and the Spectra of First-Order Formulas with Equality (NDJ, ALS), pp. 157–167.
DACDAC-1971-LarsenM #clustering #equation #layout #logic
Partitioning and ordering of logic equations for optimum MOS LSI device layout (RPL, LM), pp. 131–142.
SIGMODSIGFIDET-1970-BayerM #maintenance #order #scalability
Organization and Maintenance of Large Ordered Indexes (RB, EMM), pp. 107–141.
STOCSTOC-1970-Manna #higher-order
Second-Order Mathematical Theory of Computation (ZM), pp. 158–168.
STOCSTOC-1969-Young #order #set
Speed-Ups by Changing the Order in Which Sets are Enumerated (Preliminary Version) (PRY), pp. 89–92.

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.