Published in: TGDK, Volume 1, Issue 1 (2023): Special Issue on Trends in Graph Data and Knowledge. Transactions on Graph Data and Knowledge, Volume 1, Issue 1
Bradley P. Allen, Lise Stork, and Paul Groth. Knowledge Engineering Using Large Language Models. In Special Issue on Trends in Graph Data and Knowledge. Transactions on Graph Data and Knowledge (TGDK), Volume 1, Issue 1, pp. 3:1-3:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@Article{allen_et_al:TGDK.1.1.3,
author = {Allen, Bradley P. and Stork, Lise and Groth, Paul},
title = {{Knowledge Engineering Using Large Language Models}},
journal = {Transactions on Graph Data and Knowledge},
pages = {3:1--3:19},
ISSN = {2942-7517},
year = {2023},
volume = {1},
number = {1},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/TGDK.1.1.3},
URN = {urn:nbn:de:0030-drops-194777},
doi = {10.4230/TGDK.1.1.3},
annote = {Keywords: knowledge engineering, large language models}
}
Published in: OASIcs, Volume 6, 7th International Workshop on Worst-Case Execution Time Analysis (WCET'07) (2007)
Christoph A. Herrmann, Armelle Bonenfant, Kevin Hammond, Steffen Jost, Hans-Wolfgang Loidl, and Robert Pointon. Automatic Amortised Worst-Case Execution Time Analysis. In 7th International Workshop on Worst-Case Execution Time Analysis (WCET'07). Open Access Series in Informatics (OASIcs), Volume 6, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{herrmann_et_al:OASIcs.WCET.2007.1186,
author = {Herrmann, Christoph A. and Bonenfant, Armelle and Hammond, Kevin and Jost, Steffen and Loidl, Hans-Wolfgang and Pointon, Robert},
title = {{Automatic Amortised Worst-Case Execution Time Analysis}},
booktitle = {7th International Workshop on Worst-Case Execution Time Analysis (WCET'07)},
pages = {1--6},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-05-7},
ISSN = {2190-6807},
year = {2007},
volume = {6},
editor = {Rochange, Christine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2007.1186},
URN = {urn:nbn:de:0030-drops-11868},
doi = {10.4230/OASIcs.WCET.2007.1186},
annote = {Keywords: Amortisation, functional programming, performance measurement, static analysis, type and effect systems, worst-case execution time}
}
Published in: OASIcs, Volume 4, 6th International Workshop on Worst-Case Execution Time Analysis (WCET'06) (2006)
Kevin Hammond, Christian Ferdinand, Reinhold Heckmann, Roy Dyckhoff, Martin Hofman, Steffen Jost, Hans-Wolfgang Loidl, Greg Michaelson, Robert Pointon, Norman Scaife, Jocelyn Sérot, and Andy Wallace. Towards Formally Verifiable WCET Analysis for a Functional Programming Language. In 6th International Workshop on Worst-Case Execution Time Analysis (WCET'06). Open Access Series in Informatics (OASIcs), Volume 4, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{hammond_et_al:OASIcs.WCET.2006.677,
author = {Hammond, Kevin and Ferdinand, Christian and Heckmann, Reinhold and Dyckhoff, Roy and Hofman, Martin and Jost, Steffen and Loidl, Hans-Wolfgang and Michaelson, Greg and Pointon, Robert and Scaife, Norman and S\'{e}rot, Jocelyn and Wallace, Andy},
title = {{Towards Formally Verifiable WCET Analysis for a Functional Programming Language}},
booktitle = {6th International Workshop on Worst-Case Execution Time Analysis (WCET'06)},
pages = {1--6},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-03-3},
ISSN = {2190-6807},
year = {2006},
volume = {4},
editor = {Mueller, Frank},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2006.677},
URN = {urn:nbn:de:0030-drops-6773},
doi = {10.4230/OASIcs.WCET.2006.677},
annote = {Keywords: Worst-case execution time, functional programming, Hume, cost model, asynchronous, finite state machine}
}