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:
order (313)
logic (134)
class (86)
program (70)
model (37)

Stem first$ (all stems)

651 papers:

HTHT-2015-Graells-Garrido #bias #gender #wiki #women
First Women, Second Sex: Gender Bias in Wikipedia (EGG, ML, FM), pp. 165–174.
PODSPODS-2015-BeameBGS #first-order #symmetry
Symmetric Weighted First-Order Model Counting (PB, GVdB, EG, DS), pp. 313–328.
SIGMODSIGMOD-2015-ZhangYQS #performance
Divide & Conquer: I/O Efficient Depth-First Search (ZZ, JXY, LQ, ZS), pp. 445–458.
ITiCSEITiCSE-2015-ButlerMSSFW
Initiatives to Increase Engagement in First-Year ICT (MB, MM, JS, S, KEF, AW), pp. 308–313.
ITiCSEITiCSE-2015-Cukierman #learning #predict #process #student
Predicting Success in University First Year Computing Science Courses: The Role of Student Participation in Reflective Learning Activities and in I-clicker Activities (DC), pp. 248–253.
ITiCSEITiCSE-2015-Harms15a #java #using
Using Personal Robots and Myro/Java in the First Computer Science Course (DEH), p. 332.
ITiCSEITiCSE-2015-McDermottDC #metric #student
Perseverance Measures and Attainment in First Year Computing Science Students (RM, MD, ÅC), pp. 302–307.
ITiCSEITiCSE-2015-Patitsas #approach #education #student
A Numpy-First Approach to Teaching CS1 to Natural Science Students (EP), p. 333.
FoSSaCSFoSSaCS-2015-SchubertUZ #first-order #logic #on the
On the Mints Hierarchy in First-Order Intuitionistic Logic (AS, PU, KZ), pp. 451–465.
ICSMEICSME-2015-Tymchuk #quality
Treating software quality as a first-class entity (YT), pp. 594–597.
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.
PLDIPLDI-2015-SiekTW
Blame and coercion: together again for the first time (JGS, PT, PW), pp. 425–435.
FMFM-2015-SchmittU #axiom #first-order #logic
Axiomatization of Typed First-Order Logic (PHS, MU), pp. 470–486.
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-LeF #continuation #transaction
Partial aborts for transactions via first-class continuations (ML, MF), pp. 230–242.
ICFPICFP-2015-Rossberg #ml #named
1ML — core and modules united (F-ing first-class modules) (AR), pp. 35–47.
CHICHI-2015-DenisovaC #game studies #question
First Person vs. Third Person Perspective in Digital Games: Do Player Preferences Affect Immersion? (AD, PC), pp. 145–148.
CHICHI-2015-HarrisonRC #design
Infographic Aesthetics: Designing for the First Impression (LH, KR, RC), pp. 1187–1190.
CHICHI-2015-Vicencio-Moreira #game studies
Now You Can Compete With Anyone: Balancing Players of Different Skill Levels in a First-Person Shooter Game (RVM, RLM, CG), pp. 2255–2264.
CSCWCSCW-2015-SteinmacherCGR #open source #social
Social Barriers Faced by Newcomers Placing Their First Contribution in Open Source Software Projects (IS, TC, MAG, DFR), pp. 1379–1392.
HCIHCI-IT-2015-MurataM #analysis #eye tracking #using
Nonlinear Dynamical Analysis of Eye Movement Characteristics Using Attractor Plot and First Lyapunov Exponent (AM, TM), pp. 78–85.
HCIHCI-UC-2015-FrauCT #mobile #predict #probability #prototype #visualisation
Graphic Visualization of Probabilistic Traffic/Trajectory Predictions in Mobile Applications. A First Prototype and Evaluations for General Aviation Purposes (GF, FDC, DT), pp. 154–164.
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.
GPCEGPCE-2015-ScherrC #domain-specific language #embedded #staged
Almost first-class language embedding: taming staged embedded DSLs (MS, SC), pp. 21–30.
ICSEICSE-v2-2015-Jazayeri #case study #experience #learning #programming
Combining Mastery Learning with Project-Based Learning in a First Programming Course: An Experience Report (MJ), pp. 315–318.
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-Plaisted #automation #deduction #first-order
History and Prospects for First-Order Automated Deduction (DAP), pp. 3–28.
CSLCSL-2015-BovaM #finite #first-order #query
First-Order Queries on Finite Abelian Groups (SB, BM), pp. 41–59.
CSLCSL-2015-ClementeL #analysis #automaton #first-order #reachability
Reachability Analysis of First-order Definable Pushdown Systems (LC, SL), pp. 244–259.
CSLCSL-2015-LehtinenQ
Deciding the First Levels of the Modal μ Alternation Hierarchy by Formula Construction (KL, SQ), pp. 457–471.
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.
LICSLICS-2015-GradelPSK #first-order #polynomial
Characterising Choiceless Polynomial Time with First-Order Interpretations (EG, WP, SS, LK), pp. 677–688.
DACDAC-2014-Rutenbar #automation #design #education
The First EDA MOOC: Teaching Design Automation to Planet Earth (RAR), p. 6.
DATEDATE-2014-FrijnsASVGSC #analysis #graph
Timing analysis of First-Come First-Served scheduled interval-timed Directed Acyclic Graphs (RF, SA, SS, JV, MCWG, RRHS, HC), pp. 1–6.
PODSPODS-2014-DurandSS #database #first-order #query
Enumerating answers to first-order queries over databases of low degree (AD, NS, LS), pp. 121–131.
VLDBVLDB-2014-PoessRC #benchmark #industrial #integration #metric #named
TPC-DI: The First Industry Benchmark for Data Integration (MP, TR, BC), pp. 1367–1378.
ITiCSEITiCSE-2014-SchmolitzkyG
Guess my object: an “objects first” game on objects’ behavior and implementation with bluej (AS, TG), pp. 219–224.
TACASTACAS-2014-Lowe #algorithm #concurrent
Concurrent Depth-First Search Algorithms (GL), pp. 202–216.
PLDIPLDI-2014-DeVitoRFAH #generative #runtime #using
First-class runtime generation of high-performance types using exotypes (ZD, DR, MF, AA, PH), p. 11.
STOCSTOC-2014-GroheKS #first-order #graph
Deciding first-order properties of nowhere dense graphs (MG, SK, SS), pp. 89–98.
DLTDLT-2014-MarsaultS
Breadth-First Serialisation of Trees and Rational Languages — (Short Paper) (VM, JS), pp. 252–259.
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.
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.
CHICHI-2014-Vicencio-MoreiraMGB #effectiveness #game studies
The effectiveness (or lack thereof) of aim-assist techniques in first-person shooter games (RVM, RLM, CG, SB), pp. 937–946.
HCIHCI-AIMT-2014-KrogsagerSR #physics
Backchannel Head Nods in Danish First Meeting Encounters with a Humanoid Robot: The Role of Physical Embodiment (AK, NS, MR), pp. 651–662.
HCIHCI-AS-2014-Fragoso #design #interface
Interface Design Strategies and Disruptions of Gameplay: Notes from a Qualitative Study with First-Person Gamers (SF), pp. 593–603.
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.
ICEISICEIS-v2-2014-Kupper #approach #research #social
Measuring the Success of Social CRM — First Approach and Future Research (TK), pp. 573–582.
CIKMCIKM-2014-BalogKS #ad hoc #evaluation
Head First: Living Labs for Ad-hoc Search Evaluation (KB, LK, AS), pp. 1815–1818.
ECIRECIR-2014-GossenNN #user interface
My First Search User Interface (TG, MN, AN), pp. 746–749.
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.
ICPRICPR-2014-AggarwalNJ #perspective
Estimating Floor Regions in Cluttered Indoor Scenes from First Person Camera View (SA, AMN, CVJ), pp. 4275–4280.
ICPRICPR-2014-AllettoSCC #estimation
Head Pose Estimation in First-Person Camera Views (SA, GS, SC, RC), pp. 4188–4193.
ICPRICPR-2014-IwashitaTKR #process #recognition
First-Person Animal Activity Recognition from Egocentric Videos (YI, AT, RK, MSR), pp. 4310–4315.
KMISKMIS-2014-FredjLC #algorithm #guidelines
Characterizing Generalization Algorithms — First Guidelines for Data Publishers (FBF, NL, ICW), pp. 360–366.
KMISKMIS-2014-Grim-Yefsah #case study #information management #process #requirements #using
A First Step in Improving the Requirements Engineering Process by Using the Knowledge Management Perspective — Case Study from French Public Institute (MGY), pp. 280–288.
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-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).
SEKESEKE-2014-ChenM #abstraction #evolution
Change and Role as First-Class Abstractions for Realising Dynamic Evolution (YC, XM), pp. 443–446.
SACSAC-2014-GomesACHS #agile #development #framework #game studies #using
Rapid development of first person serious games using the APEX platform: the asthma game (TG, TA, JCC, MDH, JLS), pp. 169–174.
SACSAC-2014-YooLB #memory management #policy
The least-dirty-first cache replacement policy for phase-change memory (SY, EL, HB), pp. 1449–1454.
ASPLOSASPLOS-2014-BornholtMM #first-order #named #nondeterminism
Uncertain: a first-order type for uncertain data (JB, TM, KSM), pp. 51–66.
CCCC-2014-PrinzSA #compilation #process #towards
A First Step towards a Compiler for Business Processes (TMP, NS, WA), pp. 238–243.
CAVCAV-2014-Voronkov #architecture #first-order #named #proving #theorem proving
AVATAR: The Architecture for First-Order Theorem Provers (AV), pp. 696–710.
IJCARIJCAR-2014-Otten #first-order #logic #named #proving
MleanCoP: A Connection Prover for First-Order Modal Logic (JO), pp. 269–276.
LICSLICS-CSL-2014-Chen #first-order #query #set
The tractability frontier of graph-like first-order query sets (HC), p. 9.
LICSLICS-CSL-2014-PlaceZ #first-order #logic #regular expression
Separating regular languages with first-order logic (TP, MZ), 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.
ASEASE-2013-WeimerFF #adaptation #equivalence #modelling #program repair
Leveraging program equivalence for adaptive program repair: Models and first results (WW, ZPF, SF), pp. 356–366.
DATEDATE-2013-ChangWB #design
Process-variation-aware Iddq diagnosis for nano-scale CMOS designs — the first step (CLC, CHPW, JB), pp. 454–457.
DRRDRR-2013-TaghvaPM #higher-order #markov #modelling
Post processing with first- and second-order hidden Markov models (KT, SP, SM).
PODSPODS-2013-KazanaS #bound #first-order #query
Enumeration of first-order queries on classes of structures with bounded expansion (WK, LS), pp. 297–308.
CSEETCSEET-2013-Vallino #question #re-engineering #student #what
What should students learn in their first (and often only) software engineering course? (JV), pp. 335–337.
ITiCSEITiCSE-2013-Buck #approach #reliability
First, do no harm: a curricular approach to reliability (DB), p. 319.
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.
TFPIETFPIE-2013-Tobin-HochstadtH
From Principles to Practice with Class in the First Year (STH, DVH), pp. 1–15.
WCREWCRE-2013-MemonBNR #user interface
The first decade of GUI ripping: Extensions, applications, and broader impacts (AMM, IB, BNN, BR), pp. 11–20.
ICALPICALP-v2-2013-HenzingerKN #maintenance #network
Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks (MH, SK, DN), pp. 607–619.
IFLIFL-2013-VieraS #composition #semantics #syntax
First Class Syntax, Semantics, and Their Composition (MV, SDS), p. 73.
CHICHI-2013-ReineckeYMMZLG #complexity #predict #quantifier #visual notation
Predicting users’ first impressions of website aesthetics with a quantification of perceived visual complexity and colorfulness (KR, TY, LM, RM, YZ, JL, KZG), pp. 2049–2058.
HCIHCI-IMT-2013-Jokinen #feedback #interactive #multimodal
Multimodal Feedback in First Encounter Interactions (KJ), pp. 262–271.
HCIHIMI-D-2013-ShengLD #comprehension #eye tracking #using
Eyes Don’t Lie: Understanding Users’ First Impressions on Websites Using Eye Tracking (HS, NSL, SD), pp. 635–641.
ICEISICEIS-J-2013-HarbuschP13a #exclamation #optimisation #smarttech #usability #user interface
Optimizing the User Interface of a First-Aid App: A “Realistic” Usability Study with the Smartphone Application “Defi Now!” (KH, JP), pp. 421–437.
ICEISICEIS-v1-2013-KaddesABSA #policy
Enhancement of Generalized Earliest Deadline First Policy (MK, LA, AB, BS, MA), pp. 231–238.
ICEISICEIS-v3-2013-HarbuschP #exclamation #smarttech #usability #user interface
The User Interface of a Medical First Aid Application — A Close-to-Realistic Usability Study with the Smartphone Application “Defi Now!” (KH, JP), pp. 91–98.
CIKMCIKM-2013-ChuklinSR #modelling
Modeling clicks beyond the first result page (AC, PS, MdR), pp. 1217–1220.
ICMLICML-c3-2013-Mairal #first-order #optimisation
Optimization with First-Order Surrogate Functions (JM), pp. 783–791.
KDIRKDIR-KMIS-2013-SilvaPS #education
A Decision Support System for Portuguese Higher Education Course Selection — First Round (JPS, FP, MFS), pp. 360–367.
KDIRKDIR-KMIS-2013-VanthienenC #modelling #process #question
Modeling Business Decisions and Processes — Which Comes First? (JV, FC), pp. 451–456.
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.
TOOLSTOOLS-EUROPE-J-2012-WernliLN13 #incremental
Incremental Dynamic Updates with First-class Contexts (EW, ML, ON), pp. 1–27.
OOPSLAOOPSLA-2013-AzimN #android #testing
Targeted and depth-first exploration for systematic testing of android apps (TA, IN), pp. 641–660.
ICSEICSE-2013-KhooFH #debugging #named
Expositor: scriptable time-travel debugging with first-class traces (YPK, JSF, MH), pp. 352–361.
ICSEICSE-2013-Rajlich #developer #education #re-engineering
Teaching developer skills in the first software engineering course (VR), pp. 1109–1116.
ISMMISMM-2013-Musuvathi #approach #consistency #memory management #modelling
Safety-first approach to memory consistency models (MM), pp. 1–2.
LCTESLCTES-2013-BouakazT #data flow #graph #scheduling
Buffer minimization in earliest-deadline first scheduling of dataflow graphs (AB, JPT), pp. 133–142.
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-KovacsV #first-order #proving #theorem proving
First-Order Theorem Proving and Vampire (LK, AV), pp. 1–35.
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-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-Halpern #first-order #logic #proving #security #using
From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic (JYH), pp. 2–3.
WICSA-ECSAWICSA-ECSA-2012-ZhangUVZHC #architecture #modelling #named
Dedal-CDL: Modeling First-class Architectural Changes in Dedal (H(Z, CU, SV, LZ, MH, BC), pp. 272–276.
DocEngDocEng-2012-IorioPPV #approach #automation #documentation #recognition #xml
A first approach to the automatic recognition of structural patterns in XML documents (ADI, SP, FP, FV), pp. 85–94.
ITiCSEITiCSE-2012-Aycock #named #programming
μPython: non-majors programming from the very first lecture (JA), pp. 345–350.
ITiCSEITiCSE-2012-Kurmas #approach #design
The presenter first design approach (ZK), p. 379.
ITiCSEITiCSE-2012-Rosenbloom #animation
Breadth first search (animation and obstacle avoidance) (AR), p. 375.
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-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.
ICALPICALP-v2-2012-GavenciakKO #first-order
Deciding First Order Properties of Matroids (TG, DK, SiO), pp. 239–250.
FMFM-2012-NedunuriSC #algorithm #performance
Theory and Techniques for Synthesizing Efficient Breadth-First Search Algorithms (SN, DRS, WRC), pp. 308–325.
CSCWCSCW-2012-TangMWRE #coordination #game studies
Verbal coordination in first person shooter games (AT, JM, NW, DFR, WKE), pp. 579–582.
ICPRICPR-2012-KhalifaBGE #image #novel
A novel CAD system for analyzing cardiac first-pass MR images (FK, GMB, GLG, AEB), pp. 77–80.
KDDKDD-2012-CosciaRGP #community #named
DEMON: a local-first discovery method for overlapping communities (MC, GR, FG, DP), pp. 615–623.
OOPSLAOOPSLA-2012-TakikawaSDTF #type system
Gradual typing for first-class classes (AT, TSS, CD, STH, MF), pp. 793–810.
TOOLSTOOLS-EUROPE-2012-WernliLN #incremental
Incremental Dynamic Updates with First-Class Contexts (EW, ML, ON), pp. 304–319.
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.
SACSAC-2012-CosciaCMZ #approach #development #web #web service
An approach to improve code-first web services discoverability at development time (JLOC, MC, CM, AZ), pp. 638–643.
ICSEICSE-2012-LemosFSG #agile #assessment #development #empirical #programming
Development of auxiliary functions: Should you be agile? An empirical assessment of pair programming and test-first programming (OALL, FCF, FFS, AG), pp. 529–539.
LDTALDTA-2012-VieraSD
Grammar fragments fly first-class (MV, SDS, AD), p. 5.
LDTALDTA-2012-VieraSM #attribute grammar #how
UUAG meets AspectAG: how to make attribute grammars first-class (MV, SDS, AM), p. 6.
PPoPPPPoPP-2012-LiuAHLSZWT #gpu #implementation #named
FlexBFS: a parallelism-aware implementation of breadth-first search on GPU (GL, HA, WH, XL, TS, WZ, XW, XT), pp. 279–280.
CSLCSL-2012-HetzlS #first-order #logic
Herbrand-Confluence for Cut Elimination in Classical First Order Logic (SH, LS), pp. 320–334.
CSLCSL-2012-KuusistoMV #decidability #first-order #geometry
Undecidable First-Order Theories of Affine Geometries (AK, JM, JV), pp. 470–484.
ICSTICST-2012-KintisPM #first-order #higher-order
Isolating First Order Equivalent Mutants via Second Order Mutation (MK, MP, NM), pp. 701–710.
IJCARIJCAR-2012-RathsO #first-order #library #logic #problem
The QMLTP Problem Library for First-Order Modal Logics (TR, JO), pp. 454–461.
ISSTAISSTA-2012-ZhangJWLZ #algorithm #detection #towards
A first step towards algorithm plagiarism detection (FZ, YcJ, DW, PL, SZ), pp. 111–121.
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-Schuster #algebra #case study #induction
Induction in Algebra: A First Case Study (PS), pp. 581–585.
TAPTAP-2012-CarlierDG #constraints #design #testing
A First Step in the Design of a Formally Verified Constraint-Based Testing Tool: FocalTest (MC, CD, AG), pp. 35–50.
WICSAWICSA-2011-PetrovBN #analysis #architecture #design #enterprise #multi
The Need for a Multilevel Context-Aware Software Architecture Analysis and Design Method with Enterprise and System Architecture Concerns as First Class Entities (PP, UB, RLN), pp. 147–156.
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.
DACDAC-2011-BayrakRBSI #analysis #automation #towards
A first step towards automatic application of power analysis countermeasures (AGB, FR, PB, FXS, PI), pp. 230–235.
DRRDRR-2011-AwalFMV #database #online
First experiments on a new online handwritten flowchart database (AMA, GF, HM, CVG), pp. 1–10.
ICDARICDAR-2011-GhorbelMLA #interactive #sketching
Interactive Competitive Breadth-First Exploration for Sketch Interpretation (AG, SM, AL, ÉA), pp. 1195–1199.
CSEETCSEET-2011-TabriziVD #case study #development #experience #re-engineering
Development of North Carolina’s first Software Engineering program: An experience report (MHNT, SV, JD), pp. 266–273.
ITiCSEITiCSE-2011-Hijon-NeiraV11a #design #learning
A first step mapping IMS learning design and Merlin-Mo (RHN, JÁVI), p. 365.
ITiCSEITiCSE-2011-Mirolo #recursion
Is iteration really easier to master than recursion: an investigation in a functional-first CS1 context (CM), p. 362.
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.
ICFPICFP-2011-Mitchell #ecosystem #functional #modelling #programming
Functional programming through deep time: modeling the first complex ecosystems on earth (EGM), pp. 28–31.
ICFPICFP-2011-VardoulakisS #analysis #automaton
Pushdown flow analysis of first-class control (DV, OS), pp. 69–80.
CHICHI-2011-KwakCM #online #twitter
Fragile online relationship: a first look at unfollow dynamics in twitter (HK, HC, SBM), pp. 1091–1100.
CSCWCSCW-2011-XuCSHG #comprehension #game studies #online #social
Sociable killers: understanding social relationships in an online first-person shooter game (YX, XC, AS, RH, TG), pp. 197–206.
HCIDUXU-v2-2011-NemeryBK #design #persuasion #social #user interface #validation
First Validation of Persuasive Criteria for Designing and Evaluating the Social Influence of User Interfaces: Justification of a Guideline (AN, EB, SK), pp. 616–624.
HCIHCD-2011-MirandaHB #empirical #interactive
Adjustable Interactive Rings for iDTV: First Results of an Experiment with End-Users (LCdM, HHH, MCCB), pp. 262–271.
HCIHCI-DDA-2011-GodonFRT #design pattern #interactive #internet #library
The First Interaction Design Pattern Library for Internet of Things User Created Applications (MG, MAF, MR, LT), pp. 229–237.
HCIHIMI-v2-2011-HashiguchiO
Proposal of the Kawaii Search System Based on the First Sight of Impression (KH, KO), pp. 21–30.
CIKMCIKM-2011-SantosMO #effectiveness
Effectiveness beyond the first crawl tier (RLTS, CM, IO), pp. 1937–1940.
KMISKMIS-2011-BoughzalaV #collaboration #industrial #maturity
A First Application of a Collaboration Maturity Model in the Automotive Industry (IB, GJdV), pp. 28–37.
ECMFAECMFA-2011-BendraouLCG #modelling
Process-Centred Approaches for Model-Driven Engineering (PMDE) — First Edition (RB, RL, BC, MPG), pp. 383–384.
OOPSLAOOPSLA-2011-PuBS #algorithm #first-order #programming #synthesis
Synthesis of first-order dynamic programming algorithms (YP, RB, SS), pp. 83–98.
OOPSLAOOPSLA-2011-SunshineNSAT
First-class state change in plaid (JS, KN, SS, JA, ÉT), pp. 713–732.
ICSEICSE-2011-Xiao #developer #generative #identification #problem #testing #towards
Problem identification for structural test generation: first step towards cooperative developer testing (XX), pp. 1179–1181.
SLESLE-2011-ErwigW #design #exclamation #process #semantics
Semantics First! — Rethinking the Language Design Process (ME, EW), pp. 243–262.
SLESLE-2011-Wojciechowski #communication #concurrent #scripting language
Typed First-Class Communication Channels and Mobility for Concurrent Scripting Languages (PTW), pp. 378–387.
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-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-Eickmeyer #first-order #logic #random
Non-Definability Results for Randomised First-Order Logic (KE), pp. 218–232.
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-BirkedalMSS
First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees (LB, REM, JS, KS), pp. 55–64.
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-GasconMR #first-order #unification
First-Order Unification on Compressed Terms (AG, SM, LR), pp. 51–60.
ECSAECSA-2010-Hock-koonO #approach
Many to Many Service Discovery: A First Approach (AAHk, MO), pp. 449–456.
QoSAQoSA-2010-BirkmeierO #architecture #development #diagrams #empirical #process #uml #usability
Is BPMN Really First Choice in Joint Architecture Development? An Empirical Study on the Usability of BPMN and UML Activity Diagrams for Business Users (DB, SO), pp. 119–134.
DACDAC-2010-LuoWH #effectiveness #gpu #implementation
An effective GPU implementation of breadth-first search (LL, MDFW, WmWH), pp. 52–55.
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.
ITiCSEITiCSE-2010-BrindaH #case study #design #education #experience
A lecture about teaching informatics in secondary education: lecture design and first experiences (TB, PH), p. 320.
ITiCSEITiCSE-2010-EhlertS #comparison #object-oriented
Comparison of OOP first and OOP later: first results regarding the role of comfort level (AE, CS), pp. 108–112.
ITiCSEITiCSE-2010-GomesM #case study #performance #student
A study on student performance in first year CS courses (AJG, AJM), pp. 113–117.
ITiCSEITiCSE-2010-McDermottBE #student #tool support
Developing tools to encourage reflection in first year students blogs (RM, GB, GE), pp. 147–151.
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.
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.
IFLIFL-2010-HerhutJSPG #case study #concurrent #experience
Concurrent Non-deferred Reference Counting on the Microgrid: First Experiences (SH, CJ, SBS, RP, CG), pp. 185–202.
CHICHI-2010-KuikkaniemiLTSKR #game studies
The influence of implicit and explicit biofeedback in first-person shooter games (KK, TL, MT, TS, IK, NR), pp. 859–868.
CIKMCIKM-2010-RaghavanI #probability #retrieval #theory and practice
Probabilistic first pass retrieval for search advertising: from theory to practice (HR, RI), pp. 1019–1028.
ICPRICPR-2010-KamedaO #image #navigation #retrieval
Image Retrieval of First-Person Vision for Pedestrian Navigation in Urban Area (YK, YO), pp. 364–367.
KEODKEOD-2010-KezadriP #ontology #towards #validation #verification
First Steps Toward a Verification and Validation Ontology (MK, MP), pp. 440–444.
KMISKMIS-2010-FogliP #collaboration #development #web
End-user Development for Knowledge Sharing — A Collaborative Web Mapping Application in the First Aid Domain (DF, LPP), pp. 5–14.
KRKR-2010-BelardinelliL #first-order #interactive #logic #multi
Interactions between Time and Knowledge in a First-order Logic for Multi-Agent Systems (FB, AL).
OOPSLAOOPSLA-2010-VerwaestBGLN #named
Pinocchio: bringing reflection to life with first-class interpreters (TV, CB, DG, AL, ON), pp. 774–789.
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.
PADLPADL-2010-Perera #first-order #interactive #programming
First-Order Interactive Programming (RP), pp. 186–200.
SACSAC-2010-KharaMS
An improved WLAN-first access scheme for UMTS/WLAN integrated system (SK, ISM, DS), pp. 630–634.
SACSAC-2010-Rooney #scheduling
Scheduling intense applications most “surprising” first (SR), pp. 2077–2084.
CAVCAV-2010-BasinKM #first-order #logic #monitoring #policy
Policy Monitoring in First-Order Temporal Logic (DAB, FK, SM), pp. 1–18.
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.
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.
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.
TAPTAP-2010-AhnD #axiom #first-order #logic #testing #verification
Testing First-Order Logic Axioms in Program Verification (KYA, ED), pp. 22–37.
ASEASE-2009-Maalej #integration #revisited #tool support
Task-First or Context-First? Tool Integration Revisited (WM), pp. 344–355.
ICDARICDAR-2009-HamamuraAI09a #pattern matching #pattern recognition #recognition
Bayesian Best-First Search for Pattern Recognition — Application to Address Recognition (TH, TA, BI), pp. 461–465.
SIGMODSIGMOD-2009-LiuJ #named
DataLens: making a good first impression (BL, HVJ), pp. 1115–1118.
CSEETCSEET-2009-Bass #quality
Making Quality Attributes First Class Entities (LB), p. 3.
CSEETCSEET-2009-MaramPMD
Sixteen Roles Performed by Software Engineers in First One Year (MM, PP, SM, ND), pp. 212–215.
ITiCSEITiCSE-2009-Blaheta
Democracy in the classroom: an exercise for the first days of CS1 (DB), pp. 36–39.
ITiCSEITiCSE-2009-DicksonAHA #case study #experience
First experiences with a classroom recording system (PED, WRA, ARH, DTA), pp. 298–302.
ITiCSEITiCSE-2009-DoerschukLM #experience #lessons learnt
INSPIRED broadening participation: first year experience and lessons learned (PID, JL, JM), pp. 238–242.
ITiCSEITiCSE-2009-Lasserre #adaptation #learning #programming
Adaptation of team-based learning on a first term programming class (PL), pp. 186–190.
ITiCSEITiCSE-2009-Saeli #education #how #programming
How to teach programming in secondary education: first results of a PhD project (MS), p. 356.
ITiCSEITiCSE-2009-SchluterB #education #empirical
The attributes of task difficulty in informatics in secondary education: first results of an empirical study (KS, TB), p. 357.
ITiCSEITiCSE-2009-Seidman #3d #game studies #interactive #programming
Alice first: 3D interactive game programming (RHS), p. 345.
WRLAWRLA-2008-HolenJW09 #calculus #first-order #maude #proving
Proof Search for the First-Order Connection Calculus in Maude (BH, EBJ, AW), pp. 173–188.
ICPCICPC-2009-LinsteadHLB #first-order #java #markov #modelling
Capturing Java naming conventions with first-order Markov models (EL, LH, CVL, PB), pp. 313–314.
ICFPICFP-2009-RompfMO #continuation #implementation #polymorphism
Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform (TR, IM, MO), pp. 317–328.
ICFPICFP-2009-VieraSS #aspect-oriented #attribute grammar #haskell #how #programming
Attribute grammars fly first-class: how to do aspect oriented programming in Haskell (MV, SDS, WS), pp. 245–256.
HCIHCI-AUII-2009-BreuerKWPS
Love at First Encounter — Start-Up of New Applications (HB, MK, MW, NP, FS), pp. 585–594.
HCIHCI-VAD-2009-Peters #experience #performance
Influence of Real-World Ten-Pin Bowling Experience on Performance during First-Time Nintendo Wii Bowling Practice (KAP), pp. 396–405.
HCIHCI-VAD-2009-SaariTKKR #adaptation #game studies
Emotionally Adapted Games — An Example of a First Person Shooter (TS, MT, KK, IK, NR), pp. 406–415.
HCIOCSC-2009-FalsteinR #multi
The First Two W’s: Fostering Multicultural Awareness in Children (NF, NR), pp. 462–470.
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.
ICEISICEIS-DISI-2009-KleinschmagerH #aspect-oriented #programming
Is the Application of Aspect-oriented Programming Constructs Beneficial? — First Experimental Results (SK, SH), pp. 196–201.
CIKMCIKM-2009-NakataniJT #towards #web
Easiest-first search: towards comprehension-based web search (MN, AJ, KT), pp. 2057–2060.
ECIRECIR-2009-FetterlyCV #effectiveness
Measuring the Search Effectiveness of a Breadth-First Crawl (DF, NC, VV), pp. 388–399.
POPLPOPL-2009-Leijen #flexibility #morphism #polymorphism #robust #type inference
Flexible types: robust type inference for first-class polymorphism (DL), pp. 66–77.
SACSAC-2009-FaggioliTC #algorithm #implementation #linux
An implementation of the earliest deadline first algorithm in Linux (DF, MT, FC), pp. 1984–1989.
SACSAC-2009-LeinoM #first-order #reasoning #smt
Reasoning about comprehensions with first-order SMT solvers (KRML, RM), pp. 615–622.
SACSAC-2009-NamakiBM #performance
Exhaustion dominated performance: a first attempt (NN, AdB, SMC), pp. 1011–1012.
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.
HPCAHPCA-2009-ChenA #fine-grained #first-order #parallel #thread #throughput
A first-order fine-grained multithreaded throughput model (XEC, TMA), pp. 329–340.
CSLCSL-2009-AdlerW #first-order
Tree-Width for First Order Formulae (IA, MW), pp. 71–85.
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-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.
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.
VLDBVLDB-2008-FranklinHM #tutorial
A first tutorial on dataspaces (MJF, AYH, DM), pp. 1516–1517.
ITiCSEITiCSE-2008-EscribanoGMS #multi
Multidisciplinary projects for first year engineering courses (CE, AG, ÁM, MAS), p. 366.
ITiCSEITiCSE-2008-GoldwasserL08a #python
A python graphics package for the first day and beyond (MHG, DL), p. 326.
ITiCSEITiCSE-2008-SandersL #programming language #python #student
Students’ perceptions of python as a first programming language at wits (IDS, SL), p. 365.
WCREWCRE-2008-Ebraert #feature model #programming
First-Class Change Objects for Feature-Oriented Programming (PE), pp. 319–322.
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.
ICALPICALP-B-2008-BojanczykS #first-order #logic #quantifier
Tree Languages Defined in First-Order Logic with One Quantifier Alternation (MB, LS), pp. 233–245.
ICFPICFP-2008-Leijen #morphism #named #polymorphism #type inference
HMF: simple type inference for first-class polymorphism (DL), pp. 283–294.
ICFPICFP-2008-VytiniotisWJ #haskell #morphism #named #polymorphism
FPH: first-class polymorphism for Haskell (DV, SW, SLPJ), pp. 295–306.
ECIRECIR-2008-RitchieTR #information retrieval #using
Using Terms from Citations for IR: Some First Results (AR, ST, SR), pp. 211–221.
ICMLICML-2008-KuzelkaZ #estimation #first-order #performance
Fast estimation of first-order clause coverage through randomization and maximum likelihood (OK, FZ), pp. 504–511.
KRKR-2008-BelardinelliL #first-order #logic
A Complete First-Order Logic of Knowledge and Time (FB, AL), pp. 705–714.
KRKR-2008-MichaelV
A First Experimental Demonstration of Massive Knowledge Infusion (LM, LGV), pp. 378–389.
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-HondaCD #mobile #named
Mobile-FIRST: a Mobile Agent Based First Responder System (JH, HHC, DD), pp. 565–568.
SIGIRSIGIR-2008-FetterlyCV #effectiveness
Search effectiveness with a breadth-first crawl (DF, NC, VV), pp. 755–756.
PADLPADL-2008-FernandezFFGM #developer #ml #programming #tool support
A Generic Programming Toolkit for PADS/ML: First-Class Upgrades for Third-Party Developers (MFF, KF, JNF, MG, YM), pp. 133–149.
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.
SACSAC-2008-Djelloul #constraints #first-order
Combination of decomposability and propagation for solving first-order constraints in decomposable theories (KD), pp. 1728–1732.
HPCAHPCA-2008-Rattner
Intel’s Tera-scale Computing Project: The first five years, the next five years (JR), p. 1.
OSDIOSDI-2008-YangLBKM #named #operating system
Redline: First Class Support for Interactivity in Commodity Operating Systems (TY, TL, EDB, SFK, JEBM), pp. 73–86.
SMTSMT-2007-BongioKLLM08 #encoding #first-order #proving #smt
Encoding First Order Proofs in SMT (JB, CK, HL, CL, REM), pp. 71–84.
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-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.
TAPTAP-2008-Hennell #experience #verification
The First Thirty Years: Experience with Software Verification (MAH), pp. 1–3.
ECSAECSA-2007-Kjaer #architecture #prototype
First Class Connectors for Prototyping Service Oriented Architectures (KEK), pp. 171–178.
DATEDATE-2007-BrandenburgSHEE #algorithm #approach #design #novel #prototype
From algorithm to first 3.5G call in record time: a novel system design approach based on virtual prototyping and its consequences for interdisciplinary system design teams (MB, AS, SH, JE, TE), pp. 828–830.
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.
ITiCSEITiCSE-2007-DoddsAKL
Breadth-first CS 1 for scientists (ZD, CA, GK, RLH), pp. 23–27.
STOCSTOC-2007-BorgsCDR #analysis
First to market is not everything: an analysis of preferential attachment with fitness (CB, JTC, CD, SR), pp. 135–144.
DLTDLT-2007-DiekertK #first-order #on the #word
On First-Order Fragments for Words and Mazurkiewicz Traces (VD, MK), pp. 1–19.
LATALATA-2007-Komendantskaya #deduction #first-order #network
First-order deduction in neural networks (EK), pp. 307–318.
AGTIVEAGTIVE-2007-BatzKG #evaluation #graph #pattern matching
A First Experimental Evaluation of Search Plan Driven Graph Pattern Matching (GVB, MK, RG), pp. 471–486.
HCIHCI-AS-2007-LowryRH #trust
First Impressions with Websites: The Effect of the Familiarity and Credibility of Corporate Logos on Perceived Consumer Swift Trust of Websites (PBL, TLR, TH), pp. 77–85.
HCIOCSC-2007-Bickmore #lessons learnt #smarttech #social #what
What Would Jiminy Cricket Do? Lessons from the First Social Wearable (TWB), pp. 12–21.
HCIOCSC-2007-DuvalH #design #product line #ubiquitous
First Design of a Ubiquitous System for Affective Bonding and Support with Family and Friends (SD, HH), pp. 70–79.
ICEISICEIS-HCI-2007-DeryckeC #flexibility #framework
A Flexible Infrastructure for P-Learning: A First Application in the Field of Professional Training (AD, VC), pp. 215–222.
ICEISICEIS-SAIC-2007-PetrieLZ #bibliography #challenge #perspective
SWS Challenge — First Year Overview (CJP, HL, MZ), pp. 407–412.
SIGIRSIGIR-2007-IrcingOH #speech
First experiments searching spontaneous Czech speech (PI, DWO, JH), pp. 835–836.
ECOOPECOOP-2007-DoorenS #abstraction #inheritance #using
A Higher Abstraction Level Using First-Class Inheritance Relations (MvD, ES), pp. 425–449.
POPLPOPL-2007-SiskindP #standard
First-class nonstandard interpretations by opening closures (JMS, BAP), pp. 71–76.
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.
ESEC-FSEESEC-FSE-2007-KimE #question
Which warnings should I fix first? (SK, MDE), pp. 45–54.
CADECADE-2007-DeshaneHJLLM #encoding #first-order #proving #satisfiability
Encoding First Order Proofs in SAT (TD, WH, PJ, HL, CL, REM), pp. 476–491.
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.
ICSTSAT-2007-JussilaBSKW #proving #towards
A First Step Towards a Unified Proof Checker for QBF (TJ, AB, CS, DK, CMW), pp. 201–214.
TLCATLCA-2007-ShkaravskaKE #analysis #first-order #polynomial
Polynomial Size Analysis of First-Order Functions (OS, RvK, MCJDvE), pp. 351–365.
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.
CSEETCSEET-2006-HendrixUC #case study #design #experience
Designing a First-Year Project Course to Engage Freshman Software Engineers: An Experience Report (TDH, DAU, JHCI), pp. 25–34.
CSEETCSEET-2006-LundqvistS #re-engineering
A First Course in Software Engineering for Aerospace Engineers (KL, JS), pp. 77–86.
ITiCSEITiCSE-2006-BerginLOM #programming
The first programming course: ideas to end the enrollment decline (JB, RL, BBO, MFM), pp. 301–302.
ITiCSEITiCSE-2006-HoltRS #education #python
Introducing python into the first year curriculum at wits (AH, SR, IDS), p. 335.
ITiCSEITiCSE-2006-PecinovskyPP #approach
Let’s modify the objects-first approach into design-patterns-first (RP, JP, LP), pp. 188–192.
ITiCSEITiCSE-2006-Radenski #python #quote
“Python first”: a lab-based digital introduction to computer science (AR), pp. 197–201.
ITiCSEITiCSE-2006-RauchasSK #education #experience #programming
The effect of prior programming experience in a scheme-based breadth-first curriculum at wits (SR, IDS, BK), p. 326.
ITiCSEITiCSE-2006-Snapp #approach
A Puzzles-First approach to computer science (RRS), p. 310.
ITiCSEITiCSE-2006-WirthB #algorithm #research #student
New algorithms research for first year students (AW, MB), pp. 128–132.
FoSSaCSFoSSaCS-2006-KuskeL #first-order
First-Order and Counting Theories of ω-Automatic Structures (DK, ML), pp. 322–336.
DLTDLT-2006-Lakshmanan
End-Marked Maximal Depth-First Contextual Grammars (LK), pp. 339–350.
ICFPICFP-2006-BlumeAC #programming
Extensible programming with first-class cases (MB, UAA, WC), pp. 239–250.
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-CanKBKOV #information retrieval #scalability
First large-scale information retrieval experiments on turkish texts (FC, SK, EB, CK, HCO, OMV), pp. 627–628.
SACSAC-2006-CutelloNO #algorithm #analysis #heuristic
Analysis of an evolutionary algorithm with HyperMacromutation and stop at first constructive mutation heuristic for solving trap functions (VC, GN, PSO), pp. 945–949.
SACSAC-2006-DantsinWK #algorithm #constraints #problem #quantum #towards
Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems (ED, AW, VK), pp. 1640–1644.
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-SasitornC #java #performance #virtual machine
Efficient first-class generics on stock Java virtual machines (JS, RC), pp. 1621–1628.
SACSAC-2006-ShiJQ #named #towards
ALTER: first step towards dependable grids (XS, HJ, WQ), pp. 805–806.
CSLCSL-2006-DurandO #first-order #query
First-Order Queries over One Unary Function (AD, FO), pp. 334–348.
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-Rabe #dependent type #first-order #logic
First-Order Logic with Dependent Types (FR), pp. 377–391.
IJCARIJCAR-2006-TomanW #dependence #functional #logic #on the
On Keys and Functional Dependencies as First-Class Citizens in Description Logics (DT, GEW), pp. 647–661.
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-Otto #bound #first-order #logic #monad #problem
The Boundedness Problem for Monadic Universal First-Order Logic (MO), pp. 37–48.
DATEDATE-2005-Hughes #challenge
Striking a New Balance in the Nanometer Era: First-Time-Right and Time-to-Market Demands Versus Technology Challenges (GH), p. 3.
ITiCSEITiCSE-2005-BerginW #tutorial
Test-first pair-programming tutorial (JB, EW), p. 416.
ITiCSEITiCSE-2005-Christensen #design #education
Implications of perspective in teaching objects first and object design (HBC), pp. 94–98.
ITiCSEITiCSE-2005-Fossum #interpreter
Classes as first class objects in an environment-passing interpreter (TVF), pp. 261–265.
ITiCSEITiCSE-2005-Hovis #complexity #programming
Managing the complexity in first year programming (RAH), p. 394.
ITiCSEITiCSE-2005-HurtadoV #learning
Learning UNIX in first year of computer engineering (MASH, CVP), p. 392.
ITiCSEITiCSE-2005-MarreroS #programming #testing
Testing first: emphasizing testing in early programming courses (WM, AS), pp. 4–8.
ITiCSEITiCSE-2005-MoritzWPB #multi
From objects-first to design-first with multimedia and intelligent tutoring (SHM, FW, SMP, GDB), pp. 99–103.
ESOPESOP-2005-SecoC #component #polymorphism #type system
Subtyping First-Class Polymorphic Components (JCS, LC), pp. 342–356.
FoSSaCSFoSSaCS-2005-CalcagnoGH #first-order #logic
From Separation Logic to First-Order Logic (CC, PG, MH), pp. 395–409.
PLDIPLDI-2005-AyersSMARW #control flow #distributed #fault #named #re-engineering
TraceBack: first fault diagnosis by reconstruction of distributed control flow (AA, RS, CM, AA, JR, EW), pp. 201–212.
STOCSTOC-2005-BasuPR #algebra #component #set
Computing the first Betti number and the connected components of semi-algebraic sets (SB, RP, MFR), pp. 304–312.
ICFPICFP-2005-MakholmW #mixin #morphism #type inference
Type inference, principal typings, and let-polymorphism for first-class mixin modules (HM, JBW), pp. 156–167.
ICFPICFP-2005-RingenburgG #named
AtomCaml: first-class atomicity via rollback (MFR, DG), pp. 92–104.
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.
ECOOPECOOP-2005-BiermanW #object-oriented
First-Class Relationships in an Object-Oriented Language (GMB, AW), pp. 262–286.
PADLPADL-2005-Ramsey #compilation #declarative
Building the World from First Principles: Declarative Machine Descriptions and Compiler Construction (NR), pp. 1–4.
SACSAC-2005-BaresiCM #adaptation #case study #consistency #experience #modelling
First experiences on constraining consistency and adaptivity of W2000 models (LB, SC, LM), pp. 1674–1678.
SACSAC-2005-BartakR
Limited assignments: a new cutoff strategy for incomplete depth-first search (RB, HR), pp. 388–392.
SACSAC-2005-Bourgeois-RepubliqueVC #algorithm #interactive
An interactive evolutionary algorithm for cochlear implant fitting: first results (CBR, GV, PC), pp. 231–235.
SACSAC-2005-ShangS #database #mining #relational
Depth-first frequent itemset mining in relational databases (XS, KUS), pp. 1112–1117.
SPLCSPLC-2005-Krueger
Change is Good. You Go First (CWK), p. 135.
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-ZhangSM #decidability #first-order
The Decidability of the First-Order Theory of Knuth-Bendix Order (TZ, HBS, ZM), pp. 131–148.
LICSLICS-2005-KieronskiO #decidability #first-order #logic
Small Substructures and Decidability Issues for First-Order Logic with Two Variables (EK, MO), pp. 448–457.
DACDAC-2004-VisweswariahRKWN #analysis #first-order #incremental #statistics
First-order incremental block-based statistical timing analysis (CV, KR, KK, SGW, SN), pp. 331–336.
DATEDATE-v1-2004-LegerR #first-order
A Digital Test for First-Order [Sigma-Delta] Modulators (GL, AR), pp. 708–709.
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-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.
ITiCSEITiCSE-WGR-2004-JacobsonT #array #programming
It is time to emphasize arraylists over arrays in Java-based first programming courses (NJ, AT), pp. 88–92.
ITiCSEITiCSE-WGR-2004-Pillay #programming #search-based
A first course in genetic programming (NP), pp. 93–96.
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.
ICALPICALP-2004-Meer #proving #theorem
Transparent Long Proofs: A First PCP Theorem for NPR (KM), pp. 959–970.
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.
ICGTICGT-2004-Rensink #first-order #graph #logic #representation #using
Representing First-Order Logic Using Graphs (AR), pp. 319–335.
ICEISICEIS-v1-2004-MagnussonNC #concept #enterprise #framework #implementation #towards
A Conceptual Framework for Forecasting ERP Implementation Success — A First Step Towards the Creation of an Implementation Support Tool (JM, AN, FC), pp. 447–453.
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).
KRKR-2004-Davis #communication #first-order
A First-Order Theory of Communicating First-Order Formulas (ED), pp. 235–245.
KRKR-2004-HaarslevM #documentation #optimisation #owl #rdf
Optimization Techniques for Retrieving Resources Described in OWL/RDF Documents: First Results (VH, RM), pp. 163–174.
KRKR-2004-ZhouH #heuristic
Breadth-First Heuristic Search (RZ, EAH), pp. 701–709.
SACSAC-2004-OBrienH #analysis #authoring
Training Needs Analysis: the first step in authoring e-learning content (EO, TH), pp. 935–939.
ISMMISMM-2004-DetlefsFHP #garbage collection
Garbage-first garbage collection (DD, CHF, SH, TP), pp. 37–48.
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.
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.
ASEASE-2003-BarnatBC #ltl #model checking #parallel
Parallel Breadth-First Search LTL Model-Checking (JB, LB, JC), pp. 106–115.
DACDAC-2003-StittLV #approach #clustering #hardware
Dynamic hardware/software partitioning: a first approach (GS, RLL, FV), pp. 250–255.
DATEDATE-2003-FornaciariMSZ #clustering #specification #towards #uml
A First Step Towards Hw/Sw Partitioning of UML Specifications (WF, PM, FS, LZ), pp. 10668–10673.
DATEDATE-2003-KrsticWCLA #fault #modelling #statistics
Delay Defect Diagnosis Based Upon Statistical Timing Models — The First Step (AK, LCW, KTC, JJL, MSA), pp. 10328–10335.
WCREWCRE-2003-FavreGW #metamodelling #reverse engineering
First International Workshop on Meta-Models and Schemas for Reverse Engineering — ateM 2003 (JMF, MWG, AW), pp. 366–367.
ICEISICEIS-v3-2003-ColleSE #experience #framework
A Framework for Business Simulator: A First Experience (FC, KS, PE), pp. 540–543.
KDDKDD-2003-ArgamonSS #mining #multi
Style mining of electronic messages for multiple authorship discrimination: first results (SA, MS, SSS), pp. 475–480.
MLDMMLDM-2003-KostersPP #analysis #complexity #implementation
Complexity Analysis of Depth First and FP-Growth Implementations of APRIORI (WAK, WP, VP), pp. 284–292.
OOPSLAOOPSLA-2003-AllenBC #approach
A first-class approach to genericity (EEA, JB, RC), pp. 96–114.
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.
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-SchmidtH #axiom #first-order
A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae (RAS, UH), pp. 412–426.
CSLCSL-2003-Vermeulen #first-order #logic #semantics
More Computation Power for a Denotational Semantics for First Order Logic (KFMV), pp. 530–543.
ICLPICLP-2003-Smaus #equation #first-order #question #semantics
Is There an Optimal Generic Semantics for First-Order Equations? (JGS), pp. 438–450.
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.
DocEngDocEng-2002-AllierE #approach #image #using
Degraded character image restoration using active contours: a first approach (BA, HE), pp. 142–148.
CSEETCSEET-2002-ThomasR #re-engineering
Workshop 2: First Year Software Engineering (LT, MR), p. 262.
ITiCSEITiCSE-2002-CarboneS #education #learning #question #student #what
A studio-based teaching and learning model in IT: what do first year students think? (AC, JS), pp. 213–217.
ITiCSEITiCSE-2002-SheardDMMW #student
Cheating and plagiarism: perceptions and practices of first year IT students (JS, MD, SM, IM, MW), pp. 183–187.
FoSSaCSFoSSaCS-2002-DanvyN #continuation #first-order
A First-Order One-Pass CPS Transformation (OD, LRN), pp. 98–113.
TACASTACAS-2002-BornotMNZ #black box
Black Box Unfolding with Local First Search (SB, RM, PN, SZ), pp. 386–400.
SASSAS-2002-ManevichRFGS #first-order #representation #static analysis
Compactly Representing First-Order Structures for Static Analysis (RM, GR, JF, DG, SS), pp. 196–212.
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-HansenC #case study #garbage collection
An experimental study of renewal-older-first garbage collection (LTH, WDC), pp. 247–258.
CSCWCSCW-2002-Jouppi #mobile #towards
First steps towards mutually-immersive mobile telepresence (NPJ), pp. 354–363.
ICMLICML-2002-MusleaMK02a #adaptation #automation #detection #towards #validation
Adaptive View Validation: A First Step Towards Automatic View Detection (IM, SM, CAK), pp. 443–450.
KRKR-2002-Lakemeyer #first-order #knowledge base #reasoning
Evaluation-Based Reasoning with Disjunctive Information in First-Order Knowledge Bases (GL), pp. 73–81.
KRKR-2002-Lutz #logic
Adding Numbers to the SHIQ Description Logic: First Results (CL), pp. 191–202.
SEKESEKE-2002-DeshpandeCG #re-engineering #towards #web
Web site auditing: first step towards re-engineering (YD, AC, AG), pp. 731–737.
POPLPOPL-2002-SuANPT #constraints #first-order #type system
The first-order theory of subtyping constraints (ZS, AA, JN, TP, RT), pp. 203–216.
SPLCSPLC-2002-Mannion #first-order #logic #product line #using #validation
Using First-Order Logic for Product Line Model Validation (MM), pp. 176–187.
ASPLOSASPLOS-2002-ZengELV #ecosystem #energy #named #operating system
ECOSystem: managing energy as a first class operating system resource (HZ, CSE, ARL, AV), pp. 123–132.
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.
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.
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-GatosMA #contest #segmentation
First International Newspaper Segmentation Contest (BG, SLM, AA), p. 1190–?.
CSEETCSEET-2001-RatcliffeTW #learning
A Learning Environment for First Year Software Engineers (MR, LT, JW), pp. 268–275.
ITiCSEITiCSE-2001-Murtagh
Teacing breadth-first depth-first (TPM), pp. 37–40.
ITiCSEITiCSE-2001-Stevens #case study #education #experience #re-engineering
Experiences teaching software engineering for the first time (KTS), pp. 77–80.
ITiCSEITiCSE-2001-Velazquez-Iturbide #algorithm #problem
A first problem for the algorithms course (JÁVI), p. 187.
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-SatoSK #calculus
A Simply Typed Context Calculus with First-Class Environments (MS, TS, YK), pp. 359–374.
ICEISICEIS-v1-2001-BettoniF #assessment
The First Tax Return Assessment Expert System in Switzerland (MCB, GF), pp. 391–396.
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.
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.
SIGIRSIGIR-2001-StokesC #classification #detection #documentation #semantics
Combining Semantic and Syntactic Document Classifiers to Improve First Story Detection (NS, JC), pp. 424–425.
ICSEICSE-2001-ModesittBW #bibliography #re-engineering #source code #what
Academic Software Engineering: What Is and What Could Be? Results of the First Annual Survey for International SE Programs (KLM, DJB, LHW), pp. 643–652.
CCCC-2001-YunKM #control flow #pipes and filters #towards
A First Step Towards Time Optimal Software Pipelining of Loops with Control Flows (HSY, JK, SMM), pp. 182–199.
CSLCSL-2001-Koriche #approximate #first-order #logic #reasoning
A Logic for Approximate First-Order Reasoning (FK), pp. 262–276.
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-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.
LICSLICS-2001-Avigad #first-order #logic
Eliminating Definitions and Skolem Functions in First-Order Logic (JA), pp. 139–146.
RTARTA-2001-BonelliKR #first-order #higher-order
From Higher-Order to First-Order Rewriting (EB, DK, AR), pp. 47–62.
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.
CSEETCSEET-2000-Manderson #industrial #re-engineering
Graduate Software Engineering in Practice: First Industrial Contact (RM), p. 192.
ESOPESOP-2000-Danvy #continuation #formal method #implementation
Formalizing Implementation Strategies for First-Class Continuations (OD), pp. 88–103.
ESOPESOP-2000-Russo #ml #standard
First-Class Structures for Standard ML (CVR), pp. 336–350.
ESOPESOP-2000-WellsV #equation #reasoning
Equational Reasoning for Linking with First-Class Primitive Modules (JBW, RV), pp. 412–428.
FoSSaCSFoSSaCS-2000-Schubert #first-order #logic #type inference
Type Inference for First-Order Logic (AS), pp. 297–313.
PLDIPLDI-2000-WanH #functional #programming
Functional reactive programming from first principles (ZW, PH), pp. 242–252.
ICALPICALP-2000-LugiezS #decidability #first-order #logic
Decidable First-Order Transition Logics for PA-Processes (DL, PS), pp. 342–353.
ICFPICFP-2000-Okasaki #algorithm #design #lessons learnt
Breadth-first numbering: lessons from a small exercise in algorithm design (CO), pp. 131–136.
CSCWCSCW-2000-Bajesy #implementation #named
IT2: an information technology initiative for the twenty-first century — NSF plans for implementation (RB), p. 359.
CIKMCIKM-2000-AllanLJ #detection
First Story Detection In TDT Is Hard (JA, VL, HJ), pp. 374–381.
ICPRICPR-v2-2000-DesvignesRCDRD #automation #image #towards
First Steps toward Automatic Location of Landmarks on X-Ray Images (MD, BR, RC, RD, MR, MJD), pp. 2275–2278.
ICPRICPR-v4-2000-Lucas #graph #performance #taxonomy
Efficient Best-First Dictionary Search Given Graph-Based Input (SML), pp. 4434–4437.
KDDKDD-2000-AgarwalAP #generative
Depth first generation of long patterns (RCA, CCA, VVVP), pp. 108–118.
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.
PADLPADL-2000-Tullsen
First Class Patterns (MT), pp. 1–15.
POPLPOPL-2000-Bawden #metaprogramming
First-Class Macros have Types (AB), pp. 133–141.
SACSAC-2000-ChongS
Back to the Basics: A first Class Chalkboard and More (NSTC, MS), pp. 131–136.
FSEFSE-2000-Jackson #automation #first-order #logic #relational
Automating first-order relational logic (DJ), pp. 130–139.
CADECADE-2000-Baumgartner #first-order #named
FDPLL — A First Order Davis-Putnam-Longeman-Loveland Procedure (PB), pp. 200–219.
CAVCAV-2000-Cohen #encryption #first-order #named #protocol #verification
TAPS: A First-Order Verifier for Cryptographic Protocols (EC), pp. 568–571.
ICLPCL-2000-Apt #first-order #logic #semantics
A Denotational Semantics for First-Order Logic (KRA), pp. 53–69.
ICLPCL-2000-Muller #constraints
Promoting Constraints to First-Class Status (TM), pp. 429–447.
LICSLICS-2000-GroheS #first-order #on the #query
On First-Order Topological Queries (MG, LS), pp. 349–360.
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.
ASEASE-1999-FuchsST #first-order #logic #natural language
Controlled Natural Language Can Replace First-Order Logic (NEF, US, ST), pp. 295–298.
ICDARICDAR-1999-DowntonLD #evaluation #lazy evaluation #recognition
Lazy Evaluation for Best-First Contextual Handwriting Recognition (ACD, SML, LD), pp. 589–592.
ICDARICDAR-1999-NuijtG #probability #recognition #towards
A Probabilistic Model for Postcode Recognition: A First Step towards Probabilistic Address Interpretation (MRN, EvG), pp. 761–764.
ITiCSEITiCSE-1999-EllisHSLDCRT #collaboration #education #java #programming
A collaborative strategy for developing shared Java teaching resources to support first year programming (AE, DH, JS, JL, WD, AC, JR, ST), pp. 84–87.
ICALPICALP-1999-FrickG #first-order #graph
Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs (MF, MG), pp. 331–340.
FMFM-v1-1999-Pavlovic #first-order #parametricity #semantics #specification
Semantics of First Order Parametric Specifications (DP), pp. 155–172.
FMFM-v2-1999-Martin #first-order #logic
Relating Z and First-Order Logic (AM), pp. 1266–1280.
AGTIVEAGTIVE-1999-MolE #prototype #proving
A Proof Tool Dedicated to Clean — The First Prototype (MdM, MCJDvE), pp. 271–278.
HCIHCI-EI-1999-HertzumJ
The Evaluator Effect during First-Time Use of the Cognitive Walkthrough Technique (MH, NEJ), pp. 1063–1067.
ICMLICML-1999-Pompe #induction #recursion
Noise-Tolerant Recursive Best-First Induction (UP), pp. 315–324.
UMLUML-1999-DSouzaSB #uml
First-Class Extensibility for UML-Profiles, Stereotypes, Patterns (DD, AS, AB), pp. 265–277.
TOOLSTOOLS-USA-1999-Dedene #case study #education #eiffel #experience #programming language #student
Experiences Teaching Eiffel as a First Programming Language to Economy Students (GD), pp. 584–592.
CADECADE-1999-Bishop
A Breadth-First Strategy for Mating Search (MB), pp. 359–373.
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-Weidenbach #analysis #automation #first-order #logic #protocol #security #towards
Towards an Automatic Analysis of Security Protocols in First-Order Logic (CW), pp. 314–328.
ICLPICLP-1999-GavanelliLMM
Domains as First Class Objects in CLP(FD) (MG, EL, PM, MM), p. 608.
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.
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.
PODSPODS-1998-Etessami #first-order #morphism
Dynamic Tree Isomorphism via First-Order Updates (KE), pp. 235–243.
ITiCSEITiCSE-1998-LeeP #design #education #programming #student
Programming versus design (poster): teaching first year students (PAL, CP), p. 289.
ITiCSEITiCSE-1998-MeyerV #bibliography #education #student
A survey of first computing course students (poster): new findings and their implications for the curriculum (JM, SAV), p. 293.
ITiCSEITiCSE-1998-Richardson #information management #learning #optimisation
First year information systems papers — optimising learning — minimising administration (poster) (ASR), p. 301.
ITiCSEITiCSE-1998-Taylor
Motivating the Church-Turing thesis in the twenty-first century (RGT), pp. 228–231.
ITiCSEITiCSE-1998-WardS #javascript #multi #programming language #student
JavaScript as a first programming language for multimedia students (RW, MS), pp. 249–253.
ITiCSEITiCSE-1998-Wolfer #bound #re-engineering
Graduate software engineering across international boundaries (poster): the first courses (JW), p. 311.
IWPCIWPC-1998-CanforaCLL #legacy #migration #source code #towards
Decomposing Legacy Programs: A First Step Towards Migrating to Client-Server Platforms (GC, AC, ADL, GADL), pp. 136–144.
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.
ICALPICALP-1998-BorchertKS #first-order #on the
On Existentially First-Order Definable Languages and Their Relation to NP (BB, DK, FS), pp. 17–28.
CHICHI-1998-SchianoW #people
The First Noble Truth of CyberSpace: People are People (even when they MOO) (DJS, SW), pp. 352–359.
ICMLICML-1998-ReddyT #first-order #learning #source code
Learning First-Order Acyclic Horn Programs from Entailment (CR, PT), pp. 472–480.
KRKR-1998-Levesque #first-order #knowledge base #reasoning
A Completeness Result for Reasoning with Incomplete First-Order Knowledge Bases (HJL), pp. 14–23.
ECOOPECOOP-1998-BonoF #calculus #first-order #imperative
An Imperative, First-Order Calculus with Object Extension (VB, KF), pp. 462–497.
TOOLSTOOLS-USA-1998-Webre #eiffel #legacy
Rescuing a Legacy System as a First Eiffel Project (HW), p. 500–?.
CADECADE-1998-GorePSV #proving #smarttech #theorem proving
System Description: card TAP: The First Theorem Prover on a Smart Card (RG, JP, AS, HV), pp. 47–50.
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.
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.
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-Viswanathan #abstraction #first-order #recursion #type system
Full Abstraction for First-Order Objects with Recursive Types and Subtyping (RV), pp. 380–391.
VLDBVLDB-1997-HuangJR #optimisation #traversal #using
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations (YWH, NJ, EAR), pp. 396–405.
ITiCSEITiCSE-1997-Goldberg #student
WebCT and first year: student reaction to and use of a Web-based resource in first year computer science (MWG), pp. 127–129.
ITiCSEITiCSE-1997-HaganSM #monitoring #programming
Monitoring and evaluating a redesigned first year programming course (DH, JS, IM), pp. 37–39.
DLTDLT-1997-Stefaneas #first-order #logic
Chartering first order logic (PSS), pp. 579–592.
ICALPICALP-1997-Wilke #first-order #logic #strict
Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic (TW), pp. 347–357.
CIAAWIA-1997-Maout #automaton #tool support
Tools to Implement Automata, a First Step: ASTL (VLM), pp. 104–108.
ICMLICML-1997-BottaGP #first-order #learning #logic #named
FONN: Combining First Order Logic with Connectionist Learning (MB, AG, RP), pp. 46–56.
KDDKDD-1997-AronisP #algorithm #data mining #mining #performance
Increasing the Efficiency of Data Mining Algorithms with Breadth-First Marker Propagation (JMA, FJP), pp. 119–122.
POPLPOPL-1997-Jones #morphism #polymorphism #type inference
First-class Polymorphism with Type Inference (MPJ), pp. 483–496.
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.
PPoPPPPoPP-1997-YangO #parallel
Parallel Breadth-First BDD Construction (BY, DRO), pp. 145–156.
CADECADE-1997-BjornerSU #first-order #integration #reasoning
A Practical Integration of First-Order Reasoning and Decision Procedures (NB, MES, TEU), pp. 101–115.
ICLPILPS-1997-JussienB #constraints #maintenance
Best-First Search for Property Maintenance in Reactive Constraint Systems (NJ, PB), pp. 339–353.
LICSLICS-1997-EtessamiVW #first-order #logic
First-Order Logic with Two Variables and Unary Temporal Logic (KE, MYV, TW), pp. 228–235.
RTARTA-1997-Marcinkowski #first-order
Undecidability of the First Order Theory of One-Step Right Ground Rewriting (JM), pp. 241–253.
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.
DACDAC-1996-TutuianuDP #approximate
An Explicit RC-Circuit Delay Approximation Based on the First Three Moments of the Impulse Response (BT, FD, LTP), pp. 611–616.
PODSPODS-1996-AbiteboulHB #database #first-order #logic #query
Temporal Versus First-Order Logic to Query Temporal Databases (SA, LH, JVdB), pp. 49–57.
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.
ICFPICFP-1996-QueinnecR
Sharing Code through First-class Environments (CQ, DDR), pp. 251–261.
ICFPICFP-1996-Turbak
First-Class Synchronization Barriers (FAT), pp. 157–168.
IFLIFL-1996-Pil
First Class File I/O (MP), pp. 233–246.
CIKMCIKM-1996-BayardoM #query
Processing Queries for First Few Answers (RJBJ, DPM), pp. 45–52.
KRKR-1996-Brafman #first-order #statistics
“Statistical” First Order Conditionals (RIB), pp. 398–409.
PPDPALP-1996-Marchiori96a #abstract domain #first-order #logic #using
Prime Factorizations of Abstract Domains Using First Order Logic (EM), pp. 209–223.
PPDPPLILP-1996-FreireSW #logic programming #scheduling #source code
Beyond Depth-First: Improving Tabled Logic Programs through Alternative Scheduling Strategies (JF, TS, DSW), pp. 243–258.
POPLPOPL-1996-GordonR #calculus #first-order #similarity #type system
Bisimilarity for a First-Order Calculus of Objects with Subtyping (ADG, GDR), pp. 386–395.
RTARTA-1996-Treinen #decidability #first-order
The First-Order Theory of One-Step Rewriting is Undecidable (RT), pp. 276–286.
CSEETCSEE-1995-BeckmanB #process
CMM-Based Software Process Improvement Training: The First Year (KB, RB), p. 117.
TFPIEFPLE-1995-JacquotG #requirements
Requirements for an Ideal First Language (JPJ, JG), pp. 51–63.
DLTDLT-1995-SchieringT #automaton #first-order #logic
Counter-Free Automata, First-Order Logic and Star-Free Expressions (IS, WT), pp. 166–175.
FPCAFPCA-1995-MiraniH
First-Class Schedules and Virtual Maps (RM, PH), pp. 78–85.
AdaEuropeAdaEurope-1995-Laurens #ada
PRONAOS Ground Control Center: First Operational Ada Application in C.N.E.S (AL), pp. 124–138.
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.
SEKESEKE-1995-Lee #execution #logic programming #parallel #source code
Parallel Execution of Logic Programs with Breadth-first Search (WSL), pp. 470–477.
OOPSLAOOPSLA-1995-DucasseBP #dependence
A Reflective Model for First Class Dependencies (SD, MBF, AMPD), pp. 265–280.
POPLPOPL-1995-KingL #algorithm #haskell
Structuring Depth-First Search Algorithms in Haskell (DJK, JL), pp. 344–354.
LICSLICS-1995-Dutertre #first-order #logic #proving
Complete Proof Systems for First Order Interval Temporal Logic (BD), pp. 36–43.
LICSLICS-1995-ParedaensBG #finite #first-order #query
First-order Queries on Finite Structures over the Reals (JP, JVdB, DVG), pp. 79–87.
RTARTA-1995-StickelZ #problem
Studying Quasigroup Identities by Rewriting Techniques: Problems and First Results (MES, HZ), pp. 450–456.
DATEEDAC-1994-BernGMS
Boolean Manipulation with Free BDD’s. First Experimental Results (JB, JG, CM, AS), pp. 200–207.
CSEETCSEE-1994-PreyCF #re-engineering
Software Engineering Beginning in the First Computer Science Course (JCP, JPC, GF), pp. 359–374.
ESOPESOP-1994-Kahrs #ml #morphism #polymorphism
First-Class Polymorphism for ML (SK), pp. 333–347.
ESOPESOP-1994-Moreau #automaton #continuation #evaluation #functional #parallel #source code
The PCKS-Machine: An Abstract Machine for Sound Evaluation of Parallel Functional Programs with First-Class Continuations (LM), pp. 424–438.
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.
FMFME-1994-FitzgeraldBGL #case study #comparative #component #specification
Formal and Informal Specifications of a Secure System Component: first results in a comparative study (JSF, TMB, MAG, PGL), pp. 35–44.
CAiSECAiSE-1994-SwedeV #consistency #development #empirical
Consistent Development: Results of a First Empirical Study on the Relation Between Project Scenario and Success (VvS, HvV), pp. 80–93.
KDDKDD-1994-BrachmanA #database #information management #process #sketching
The Process of Knowledge Discovery in Databases: A First Sketch (RJB, TA), pp. 1–12.
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.
PPDPALP-1994-BidoitH #behaviour #first-order #logic #proving #standard #theorem
Proving Behavioural Theorems with Standard First-Order Logic (MB, RH), pp. 41–58.
LOPSTRLOPSTR-1994-TarauD #continuation #first-order #logic programming
Logic Programming and Logic Grammars with First-Order Continuations (PT, VD), pp. 215–230.
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-SturgillS #first-order #logic #novel #parallel
A Novel Asynchronous Parallelism Scheme for First-Order Logic (DBS, AMS), pp. 484–498.
CADECADE-1994-WirthG #equation #induction #on the
On Notions of Inductive Validity for First-Oder Equational Clauses (CPW, BG), pp. 162–176.
ICLPILPS-1994-McCartyS #first-order #interpreter #logic #prolog
A PROLOG Interpreter for First-Order Intuitionistic Logic (LTM, LAS), p. 685.
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-Sewell #axiom #bisimulation #equation #first-order
Bisimulation is Not Finitely (First Order) Equationally Axiomatisable (PS), pp. 62–70.
ICDARICDAR-1993-MatsuiNYWY #contest #recognition #state of the art
State of the art of handwritten numeral recognition in Japan-The results of the first IPTP character recognition competition (TM, TN, IY, TW, MY), pp. 391–396.
PLDIPLDI-1993-AdamsCS #data type
First-Class Data-Type Representations in SchemeXerox (NA, PC, MS), pp. 139–146.
DLTDLT-1993-BreveglieriCCC #parallel
Fair First Languages and Parallel Programme Schemes (LB, AC, CC, SCR), pp. 389–418.
HCIHCI-ACS-1993-Ala-Siuru #case study #experience #specification #user interface #using
Using QFD Techniques in User Interface Specification: First Experiences (PAS), pp. 456–461.
AdaTRI-Ada-1993-FilareyRRSD #ada #framework
Software First: Applying Ada Megaprogramming Technology to Target Platform Selection Trades (ARF, WER, RR, PS, LDM), pp. 90–101.
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.
SEKESEKE-1993-MassariCCC #database #source code
Programs as Databases: Treating Code and Comments as First Class Objects (AM, GC, PKC, SKC), pp. 78–85.
SIGIRSIGIR-1993-Harman #bibliography #retrieval
Overview of the First Text REtrieval Conference (DH), pp. 36–47.
ICLPILPS-1993-Andrews #logic #prolog #semantics
A Logical Semantics for Depth-First Prolog with Ground Negation (JHA), pp. 220–234.
RTARTA-1993-NivelaN #first-order
Saturation of First-Order (Constrained) Clauses with the Saturate System (PN, RN), pp. 436–440.
TLCATLCA-1993-BarbaneraF #higher-order #term rewriting
Combining First and Higher Order Rewrite Systems with Type Assignment Systems (FB, MF), pp. 60–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.
ICALPICALP-1992-Straubing #complexity #first-order #power of
Circuit Complexity and the Expressive Power of Generalized First-Order Formulas (HS), pp. 16–27.
LISPLFP-1992-DanvyL #continuation
Back to Direct Style II: First-Class Continuations (OD, JLL), pp. 299–310.
AdaTRI-Ada-C-1992-Youtzy #ada #named
Ada: Still Our First Choice (HYJ), pp. 135–139.
ICMLML-1992-ZytkowZZ #fault
The First Phase of Real-World Discovery: Determining Repeatability and Error of Experiments (JMZ, JZ, RZ), pp. 480–485.
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.
LOPSTRLOPSTR-1992-ProiettiP #incremental #logic programming #source code
Best-first Strategies for Incremental Transformations of Logic Programs (MP, AP), pp. 82–98.
CADECADE-1992-Fisher #first-order #normalisation
A Normal Form for First-Order Temporal Formulae (MF), pp. 370–384.
DACDAC-1991-OchiIY
Breadth-First Manipulation of SBDD of Boolean Functions for Vector Processing (HO, NI, SY), pp. 413–416.
ASEKBSE-1991-Sasso91a #question #what
Encouraging the Adoption of KBSE Technology: What Needs to Happen First? (WCS), pp. 237–238.
SASWSA-1991-Chin #deforestation #first-order #functional #source code
Generalising Deforestation for All First-Order Functional Programs (WNC), pp. 173–181.
FMVDME-1991-1-ChalmersDGPZ #using
Using RAISE — First Impressions from the LaCoS Applications (DLC, BD, JG, JSP, EZ), pp. 645–657.
FPCAFPCA-1991-JonesL #functional #strict
Unboxed Values as First Class Citizens in a Non-Strict Functional Language (SLPJ, JL), pp. 636–666.
ICMLML-1991-RichardsM #first-order
First-Order Theory Revision (BLR, RJM), pp. 447–451.
POPLPOPL-1991-DubaHM #continuation #ml #type system
Typing First-Class Continuations in ML (BFD, RH, DBM), pp. 163–173.
POPLPOPL-1991-JoungS #coordination #first-order #interactive #multi
Coordinating First-Order Multiparty Interactions (YJJ, SAS), pp. 209–220.
SOSPSOSP-1991-MarshSLM
First-Class User-Level Theads (BDM, MLS, TJL, EPM), pp. 110–121.
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-Sato #first-order #logic programming
Full First Order Logic Programming and Truth Predicate (TS), p. 948.
ICLPISLP-1991-Carpenter #first-order
Typed Feature Structures: A Generalization of First-Order Terms (BC), pp. 187–201.
ICLPISLP-1991-SatoM #first-order #interpreter #source code #top-down
A Complete Top-Down Interpreter for First Order Programs (TS, FM), pp. 35–53.
LICSLICS-1991-AvronH #database #first-order #on the #query
On First Order Database Query Languages (AA, YH), pp. 226–231.
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.
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.
PLDIPLDI-1990-HiebDB #continuation #representation
Representing Control in the Presence of First-Class Continuations (RH, RKD, CB), pp. 66–77.
LISPLFP-1990-KatzW #continuation #interactive
Continuing into the Future: On the Interaction of Futures and First-Class Continuations (MK, DW), pp. 176–184.
LISPLFP-1990-SheldonG #dependent type
Static Dependent Types for First Class Modules (MAS, DKG), pp. 20–29.
PPDPALP-1990-Sato #equivalence #first-order
An Equivalence Preserving First Order Unfold/fold Transformation System (TS), pp. 173–188.
CADECADE-1990-PymW #first-order
Investigations into Proof-Search in a System of First-Order Dependent Function Types (DJP, LAW), pp. 236–250.
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.
PODSPODS-1989-Cosmadakis #first-order #on the #query #recursion
On the First-Order Expressibility of Recursive Queries (SSC), pp. 311–323.
PLDIPLDI-1989-OTooleG #polymorphism #re-engineering
Type Reconstruction with First-Class Polymorphic Values (JO, DKG), pp. 207–217.
STOCSTOC-1989-AggarwalAK #graph #parallel
Parallel Depth-First Search in General Directed Graphs (Preliminary Version) (AA, RJA, MYK), pp. 297–308.
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.
KRKR-1989-McAllesterGF #first-order #syntax #taxonomy
Taxonomic Syntax for First Order Inference (DAM, RG, TF), pp. 289–300.
ECOOPECOOP-1989-Yelland #object-oriented #semantics #towards
First Steps Towards Fully Abstract Semantics for Object-Oriented Languages (PMY), pp. 347–364.
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-SaletoreK #execution #logic programming #parallel #performance #source code
Obtaining First Solutions Faster in AND-OR Parallel Execution of Logic Programs (VAS, LVK), pp. 390–406.
PLDIPLDI-1988-Reppy
Synchronous Operations as First-Class Values (JHR), pp. 250–259.
ICMLML-1988-Helft #first-order #learning
Learning Systems of First-Order Rules (NH), pp. 395–401.
ICMLML-1988-MuggletonB #first-order
Machine Invention of First Order Predicates by Inverting Resolution (SM, WLB), pp. 339–352.
POPLPOPL-1988-Felleisen #theory and practice
The Theory and Practice of First-Class Prompts (MF), pp. 180–190.
POPLPOPL-1988-JohnsonD #continuation
Stores and Partial Continuations as First-Class Objects in a Language and its Environment (GFJ, DD), pp. 158–168.
CADECADE-1988-ZhangK #first-order #proving #theorem proving #using
First-Order Theorem Proving Using Conditional Rewrite Rules (HZ, DK), pp. 1–20.
ICLPJICSCP-1988-McCroskyK88 #array #prolog #using
Improving First-Class Array Expressions Using Prolog (CM, AJK), pp. 18–25.
PLDIPLDI-1987-Johnson #continuation #named
GL — a denotational testbed with continuations and partial continuations as first-class objects (GFJ), pp. 165–176.
STOCSTOC-1987-AggarwalA #algorithm #random
A Random NC Algorithm for Depth First Search (AA, RJA), pp. 325–334.
ICALPICALP-1987-Miyano #algorithm #problem
The Lexicographically First Maximal Subgraph Problems: P-Completeness and NC Algorithms (SM), pp. 425–434.
SIGIRSIGIR-1987-Losee #database #documentation #modelling #random #retrieval
The Effect of Database Size on Document Retrieval: Random and Best-First Retrieval Models (RML), pp. 164–169.
OOPSLAOOPSLA-1987-Cointe #lisp
Metaclasses are First Class: the ObjVlisp Model (PC), pp. 156–167.
OOPSLAOOPSLA-1987-McCullough
Transparent Forwarding: First Steps (PLM), pp. 331–341.
POPLPOPL-1987-GelernterJL
Environments as First Class Objects (DG, SJ, TL), pp. 98–110.
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-Thomas #first-order #infinity #logic #on the
On Chain Logic, Path Logic, and First-Order Logic over Infinite Trees (WT), pp. 245–256.
PODSPODS-1986-Naqvi #first-order #query
Negation as Failure for First-Order Queries (SAN), pp. 114–122.
ICALPICALP-1986-Lai #communication #detection #distributed #termination
A Termination Detector for Static and Dynamic Distributed Systems with Asynchronous Non-first-in-first-out Communication (Extended Abstract) (THL), pp. 196–205.
OOPSLAOOPSLA-1986-LangP #named #object-oriented
Oaklisp: an Object-Oriented Scheme with First Class Types (KJL, BAP), pp. 30–37.
CADECADE-1986-BuningL #first-order #satisfiability
Classes of First Order Formulas Under Various Satisfiability Definitions (HKB, TL), pp. 553–563.
LICSLICS-1986-Gunter #axiom
The Largest First-Order-Axiomatizable Cartesian Closed Category of Domains (CAG), pp. 142–148.
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.
ICLPSLP-1985-UmrigarP85 #empirical #first-order #logic #programming
An Experiment in Programming with Full First-Order Logic (ZDU, VP), pp. 40–47.
PODSPODS-1984-AbiteboulB #normalisation
Non First Normal Form Relations to Represent Hierarchical Organized Data (SA, NB), pp. 191–200.
ICLPSLP-1984-AponteFR84 #editing #first-order #proving
Editing First-Order Proofs: Programmed Rules vs Derived Rules (MVA, JAF, PR), pp. 92–98.
VLDBVLDB-1983-ArisawaMM #database #relational
Operations and the Properties on Non-First-Normal-Form Relational Databases (HA, KM, TM), pp. 197–204.
DACDAC-1982-Grass #algorithm #bound
A depth-first branch-and-bound algorithm for optimal PLA folding (WG), pp. 133–140.
PODSPODS-1982-JaeschkeS #algebra #normalisation
Remarks on the Algebra of Non First Normal Form Relations (GJ, HJS), pp. 124–138.
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-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.
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.
STOCSTOC-1972-JonesS #first-order #similarity #turing machine
Turing Machines and the Spectra of First-Order Formulas with Equality (NDJ, ALS), pp. 157–167.
DACSHARE-1965-Falkoff #automation #design #process
Formal description of processes — the first step in design automation (ADF).

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.