BibSLEIGH — Kim

Travelled to:

1 × Brazil
1 × Cyprus
1 × Spain
1 × Switzerland
13 × USA
2 × Belgium
2 × Canada
2 × Japan
2 × Sweden
2 × The Netherlands
4 × France
4 × Germany
5 × United Kingdom

Collaborated with:

P.J.Stuckey M.J.G.d.l.Banda N.Hurst P.Moulder H.Søndergaard M.V.Hermenegildo M.Wybrow ∅ G.Puebla M.Codish M.Falaschi R.Helm J.Franze B.Demoen W.Harvey G.Gange M.Wallace C.Goncu W.H.Winsborough F.Bueno A.D.Kelly M.Shi W.Li C.L.McCormack B.Meyer D.W.Albrecht P.A.Bigot S.K.Debray N.Jørgensen S.Michaylov M.Odersky P.W.Dart L.Naish J.Lassez Z.Somogyi R.Rafeh M.Cameron T.Armstrong P.Schachte A.D.Macdonald R.H.C.Yap R.Becket D.Overton D.Jeffery N.Nethercote C.Holzbaur J.Correas M.J.Maher J.K.Slaney T.Walsh

Talks about:

program (15) logic (15) constraint (13) analysi (12) optim (9) hal (6) layout (5) effici (5) model (5) document (4)

Person: Kim Marriott

DBLP: Marriott:Kim

Facilitated 1 volumes:

Contributed to:

2015

2014

2012

2011

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1997

1996

1995

1994

1993

1992

1991

1990

1988

1986

Wrote 51 papers:

DocEng-2015-FranzeMW #documentation #navigation #question: Does a Split-View Aid Navigation Within Academic Documents? (JF, KM, MW), pp. 211–214.
DocEng-2015-GoncuM: Creating eBooks with Accessible Graphics Content (CG, KM), pp. 89–92.
DocEng-2015-MarriottSW #automation #documentation #editing #named #visual notation: VEDD: A Visual Editor for Creation and Semi-Automatic Update of Derived Documents (KM, MS, MW), pp. 125–128.
DocEng-2014-FranzeMW #what: What academics want when reading digitally (JF, KM, MW), pp. 199–202.
DocEng-2012-GangeMS #layout: Optimal guillotine layout (GG, KM, PJS), pp. 13–22.
DocEng-2012-MoulderM #how #layout #learning: Learning how to trade off aesthetic criteria in layout (PM, KM), pp. 33–36.
DocEng-2011-GangeMMS #automation #layout: Optimal automatic table layout (GG, KM, PM, PJS), pp. 23–32.
DocEng-2009-HurstLM #automation #documentation #overview #pretty-printing: Review of automatic document formatting (NH, WL, KM), pp. 99–108.
DocEng-2008-HurstM #layout: Satisficing scrolls: a shortcut to satisfactory layout (NH, KM), pp. 131–140.
DocEng-2008-McCormackMM #adaptation #authoring #diagrams: Authoring adaptive diagrams (CLM, KM, BM), pp. 154–163.
DocEng-2007-HurstM #approximate: Approximating text by its area (NH, KM), pp. 147–150.
DocEng-2007-MarriottMH #automation #documentation #float #multi: Automatic float placement in multi-column documents (KM, PM, NH), pp. 125–134.
PADL-2007-RafehBMW #design: From Zinc to Design Model (RR, MJGdlB, KM, MW), pp. 215–229.
DocEng-2006-HurstMA #layout #problem: Solving the simple continuous table layout problem (NH, KM, DWA), pp. 28–30.
DocEng-2006-HurstMM: Minimum sized text containment shapes (NH, KM, PM), pp. 3–12.
PADL-2006-BecketBMSSW #constraints #theorem proving: Adding Constraint Solving to Mercury (RB, MJGdlB, KM, ZS, PJS, MW), pp. 118–133.
DocEng-2005-HurstMM #towards: Toward tighter tables (NH, KM, PM), pp. 74–83.
ICLP-2005-StuckeyBMMSSWW #independence #modelling #performance: The G12 Project: Mapping Solver Independent Models to Efficient Solutions (PJS, MJGdlB, MJM, KM, JKS, ZS, MW, TW), pp. 9–13.
PDCL-2004-DemoenBHMOS #constraints: Herbrand Constraints in HAL (BD, MJGdlB, WH, KM, DO, PJS), pp. 499–538.
PDCL-2004-PueblaCHBBMS #analysis #composition #framework #source code: A Generic Framework for Context-Sensitive Analysis of Modular Programs (GP, JC, MVH, FB, MJGdlB, KM, PJS), pp. 233–260.
PPDP-2003-CameronBMM #debugging #named #visual notation: ViMer: a visual debugger for mercury (MC, MJGdlB, KM, PM), pp. 56–66.
FLOPS-2002-BandaDMS #tutorial: To the Gates of HAL: A HAL Tutorial (MJGdlB, BD, KM, PJS), pp. 47–66.
ICLP-2001-BandaJMNSH #constraints #theorem proving: Building Constraint Solvers with HAL (MJGdlB, DJ, KM, NN, PJS, CH), pp. 90–104.
CL-2000-BandaSHM #model checking: Model Checking in HAL (MJGdlB, PJS, WH, KM), pp. 1270–1284.
LOPSTR-2000-BuenoBHMPS #analysis #compilation #optimisation: A model for inter-module analysis and optimizing compilation (FB, MJGdlB, MVH, KM, GP, PJS).
LOPSTR-J-2000-BuenoBHMPS #analysis #compilation #optimisation: A Model for Inter-module Analysis and Optimizing Compilation (FB, MJGdlB, MVH, KM, GP, PJS), pp. 86–102.
ICLP-1999-DemoenBHMS #constraints #theorem proving: Herbrand Constraint Solving in HAL (BD, MJGdlB, WH, KM, PJS), pp. 260–274.
ICLP-1997-PueblaBMS #logic programming #optimisation #scheduling #source code: Optimization of Logic Programs with Dynamic Scheduling (GP, MJGdlB, KM, PJS), pp. 93–107.
SAS-1997-Marriott #abstract interpretation #approximate #formal method: Abstract Interpretation: A Theory of Approximate Computation (KM), pp. 367–378.
ALP-1996-BandaHM #independence #logic: Independence in Dynamically Scheduled Logic Languages (MJGdlB, MVH, KM), pp. 47–61.
JICSLP-1996-KellyMMSY #compilation #effectiveness #optimisation: Effectiveness of Optimizing Compilation for CLP(R) (ADK, ADM, KM, PJS, RHCY), pp. 37–51.
SAS-1996-KellyMSS #analysis #constraints #incremental #logic programming #source code: Two Applications of an Incremental Analysis Engine for (Constraint) Logic Programs (ADK, KM, HS, PJS), pp. 385–386.
ICLP-1995-HermenegildoPMS #analysis #incremental #logic programming #source code: Incremental Analysis of Logic Programs (MVH, GP, KM, PJS), pp. 797–811.
ILPS-1995-BandaMS #analysis #logic programming #performance #scheduling #source code: Efficient Analysis of Logic Programs with Dynamic Scheduling (MJGdlB, KM, PJS), pp. 417–431.
PLILP-1995-Marriott #constraints #multi #parsing #visual notation: Parsing Visual Languages with Constraint Multiset Grammars (KM), pp. 24–25.
ILPS-1994-MarriottS #approximate #constraints #interactive #linear: Approximating Interaction between Linear Arithmetic Constraints (KM, PJS), pp. 571–585.
POPL-1994-MarriottBH #logic programming #scheduling #source code: Analyzing Logic Programs with Dynamic Scheduling (KM, MJGdlB, MVH), pp. 240–253.
SAS-1994-ArmstrongMSS #algebra #analysis #dependence #performance #representation: Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation (TA, KM, PS, HS), pp. 266–280.
ICALP-1993-CodishFMW #analysis #concurrent #constraints #logic programming #performance #source code: Efficient Analysis of Concurrent Constraint Logic Programs (MC, MF, KM, WHW), pp. 633–644.
ILPS-1993-BandaHM #constraints #independence #logic programming #source code: Independence in Constraint Logic Programs (MJGdlB, MVH, KM), pp. 130–146.
POPL-1993-MarriottS #constraints #logic programming #optimisation #order #refinement #source code: The 3 R’s of Optimizing Constraint Logic Programs: Refinement, Removal and Reordering (KM, PJS), pp. 334–344.
JICSLP-1992-BigotDM #abstract interpretation #analysis #comprehension #using: Understanding Finiteness Analysis Using Abstract Interpretation (PAB, SKD, KM), pp. 735–749.
WSA-1992-CodishFMW #analysis #concurrent #constraints #logic programming #performance #source code: Efficient Analysis of Reactive Properties of Concurrent Constraint Logic Programs (MC, MF, KM, WHW), pp. 35–42.
ICLP-1991-CodishFM #analysis #concurrent #logic programming #source code: Suspension Analysis for Concurrent Logic Programs (MC, MF, KM), pp. 331–345.
ISLP-1991-JorgensenMM #optimisation: Some Global Compile-Time Optimizations for CLP(R) (NJ, KM, SM), pp. 420–434.
PODS-1991-HelmMO #constraints #database #optimisation #query: Constraint-Based Query Optimization for Spatial Databases (RH, KM, MO), pp. 181–191.
NACLP-1990-MarriottS #analysis #constraints #logic programming #source code: Analysis of Constraint Logic Programs (KM, HS), pp. 531–547.
NACLP-1990-MarriottSD #logic programming #source code: A Characterization of Non-Floundering Logic Programs (KM, HS, PWD), pp. 661–680.
JICSCP-1988-MarriottNL88 #logic programming #source code: Most Specific Logic Programs (KM, LN, JLL), pp. 909–923.
JICSCP-1988-MarriottS88 #abstract interpretation #bottom-up #logic programming #source code: Bottom-up Abstract Interpretation of Logic Programs (KM, HS), pp. 733–748.
ICLP-1986-HelmM86 #declarative: Declarative Graphics (RH, KM), pp. 513–527.