Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Ruth Hoffmann

dblp:176/5552 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
1since 2021 · last 2022
0000-0002-1011-5894ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 3 first-author · 1 since 2021Software engineering, systems software and programming languages · 3 · 2 first-author · 1 since 2021Theory of computation · 2Systems, architecture and hardware · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory
graph algorithms		 0.312017
Between Subgraph Isomorphism and Maximum Common Subgraph · AAAI 2017
Graph algorithms and graph theory › graph theory › graph similarity
maximum common subgraph		 0.312017
Between Subgraph Isomorphism and Maximum Common Subgraph · AAAI 2017
Graph algorithms and graph theory
subgraph isomorphism		 0.312017
Between Subgraph Isomorphism and Maximum Common Subgraph · AAAI 2017
YearPublicationVenuePosition
2022 Understanding How People Approach Constraint Modelling and Solving
abstract
In this paper, we present Demystify, a general tool for creating human-interpretable step-by-step explanations of how to solve a wide range of pen and paper puzzles from a high-level logical description. Demystify is based on Minimal Unsatisfiable Subsets (MUSes), which allow Demystify to solve puzzles as a series of logical deductions by identifying which parts of the puzzle are required to progress. This paper makes three contributions over previous work. First, we provide a generic input language, based on the Essence constraint language, which allows us to easily use MUSes to solve a much wider range of pen and paper puzzles. Second, we demonstrate that the explanations that Demystify produces match those provided by humans by comparing our results with those provided independently by puzzle experts on a range of puzzles. We compare Demystify to published guides for solving a range of different pen and paper puzzles and show that by using MUSes, Demystify produces solving strategies which closely match human-produced guides to solving those same puzzles (on average 89% of the time). Finally, we introduce a new randomised algorithm to find MUSes for more difficult puzzles. This algorithm is focused on optimised search for individual small MUSes.
Ruth Hoffmann, Xu Zhu 0005, Özgür Akgün, Miguel A. Nacenta
 CP1
2020 Collaborative models for autonomous systems controller synthesis
abstract
Abstract We show how detailed simulation models and abstract Markov models can be developed collaboratively to generate and implement effective controllers for autonomous agent search and retrieve missions. We introduce a concrete simulation model of an Unmanned Aerial Vehicle (UAV). We then show how the probabilistic model checker PRISM is used for optimal strategy synthesis for a sequence of scenarios relevant to UAVs and potentially other autonomous agent systems. For each scenario we demonstrate how it can be modelled using PRISM, give model checking statistics and present the synthesised optimal strategies. We then show how our strategies can be returned to the controller for the simulation model and provide experimental results to demonstrate the effectiveness of one such strategy. Finally we explain how our models can be adapted, using symmetry, for use on larger search areas, and demonstrate the feasibility of this approach.
Douglas Fraser, Ruben Giaquinta, Ruth Hoffmann, Murray Ireland, Alice Miller 0001, Gethin Norman
 Formal Aspects Comput.3
2019 Sequential and Parallel Solution-Biased Search for Subgraph Algorithms
Blair Archibald, Fraser Dunlop, Ruth Hoffmann, Ciaran McCreesh, Patrick Prosser, James Trimble 0001
 CPAIOR3
2018 Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms
Ruth Hoffmann, Ciaran McCreesh, Samba Ndiaye, Patrick Prosser, Craig Reilly, Christine Solnon, James Trimble 0001
 CPAIOR1
2017 Between Subgraph Isomorphism and Maximum Common Subgraph
abstract
When a small pattern graph does not occur inside a larger target graph, we can ask how to find "as much of the pattern as possible" inside the target graph. In general, this is known as the maximum common subgraph problem, which is much more computationally challenging in practice than subgraph isomorphism. We introduce a restricted alternative, where we ask if all but k vertices from the pattern can be found in the target graph. This allows for the development of slightly weakened forms of certain invariants from subgraph isomorphism which are based upon degree and number of paths. We show that when k is small, weakening the invariants still retains much of their effectiveness. We are then able to solve this problem on the standard problem instances used to benchmark subgraph isomorphism algorithms, despite these instances being too large for current maximum common subgraph algorithms to handle. Finally, by iteratively increasing k, we obtain an algorithm which is also competitive for the maximum common subgraph
Ruth Hoffmann, Ciaran McCreesh, Craig Reilly
 AAAI1
2017 Verification of a lazy cache coherence protocol against a weak memory model
abstract
In this paper, we verify a modern lazy cache coherence protocol, TSO-CC, against the memory consistency model it was designed for, TSO. We achieve this by first showing a weak simulation relation between TSO-CC (with a fixed number of processors) and a novel finite-state operational model which exhibits the laziness of TSO-CC and satisfies TSO. We then extend this by an existing parameterisation technique, allowing verification for an unbounded number of processors. The approach is executed entirely within a model checker, no external tool is required and very little in-depth knowledge of formal verification methods is required of the verifier.
Christopher J. Banks, Marco Elver, Ruth Hoffmann, Susmit Sarkar, Paul B. Jackson, Vijay Nagarajan
 FMCAD3
2016 Autonomous Agent Behaviour Modelled in PRISM - A Case Study
abstract
Abstract Formal verification of agents representing robot behaviour is a growing area due to the demand that autonomous systems have to be proven safe. In this paper we present an abstract definition of autonomy which can be used to model autonomous scenarios and propose the use of small-scale simulation models representing abstract actions to infer quantitative data. To demonstrate the applicability of the approach we build and verify a model of an unmanned aerial vehicle (UAV) in an exemplary autonomous scenario, utilising this approach.
Ruth Hoffmann, Murray L. Ireland, Alice Miller 0001, Gethin Norman, Sandor M. Veres
 SPIN1
2015 The IceProd framework: Distributed data processing for the IceCube neutrino observatory
Mark G. Aartsen, Rasha U. Abbasi, Markus Ackermann 0003, Jenni Adams, Juan Antonio Aguilar Sánchez, Markus Ahlers, David Altmann, Carlos A. Argüelles Delgado, Jan Auffenberg, Xinhua Bai, Michael F. Baker, Steven W. Barwick, Volker Baum, Ryan Bay, James J. Beatty, Julia K. Becker Tjus, Karl-Heinz Becker, Segev BenZvi, Patrick Berghaus, David Berley, Elisa Bernardini, Anna Bernhard, David Z. Besson, G. Binder, Daniel Bindig, Martin Bissok, Erik Blaufuss, Jan Blumenthal, David J. Boersma, Christian Bohm, Debanjan Bose, Sebastian Böser, Olga Botner, Lionel Brayeur, Hans-Peter Bretz, Anthony M. Brown, Ronald Bruijn, James Casey, Martin Casier, Dmitry Chirkin, Asen Christov, Brian John Christy, Ken Clark, Lew Classen, Fabian Clevermann, Stefan Coenders, Shirit Cohen, Doug F. Cowen, Angel H. Cruz Silva, Matthias Danninger, Jacob Daughhetee, James C. Davis 0002, Melanie Day, Catherine De Clercq, Sam De Ridder, Paolo Desiati, Krijn D. de Vries, Meike de With, Tyce DeYoung, Juan Carlos Díaz-Vélez, Matthew Dunkman, Ryan Eagan, Benjamin Eberhardt, Björn Eichmann, Jonathan Eisch, Sebastian Euler, Paul A. Evenson, Oladipo O. Fadiran, Ali R. Fazely, Anatoli Fedynitch, Jacob Feintzeig, Tom Feusels, Kirill Filimonov, Chad Finley, Tobias Fischer-Wasels, Samuel Flis, Anna Franckowiak, Katharina Frantzen, Tomasz Fuchs, Thomas K. Gaisser, Joseph S. Gallagher, Lisa Gerhardt, Laura E. Gladstone, Thorsten Glüsenkamp, Azriel Goldschmidt, Geraldina Golup, Javier G. González, Jordan A. Goodman, Dariusz Góra, Dylan T. Grandmont, Darren Grant, Pavel Gretskov, John C. Groh, Andreas Groß, Chang Hyon Ha, Abd Al Karim Haj Ismail, Patrick Hallen, Allan Hallgren, Francis Halzen, Kael D. Hanson, Dustin Hebecker, David Heereman, Dirk Heinen, Klaus Helbing, Robert Eugene Hellauer III, Stephanie Virginia Hickford, Gary C. Hill, Kara D. Hoffman, Ruth Hoffmann, Andreas Homeier, Kotoyo Hoshina, Feifei Huang, Warren Huelsnitz, Per Olof Hulth, Klas Hultqvist, Aya Ishihara, Emanuel Jacobi, John E. Jacobsen, Kai Jagielski, George S. Japaridze, Kyle Jero, Ola Jlelati, Basho Kaminsky, Alexander Kappes, Timo Karg, Albrecht Karle, Matthew Kauer, John Lawrence Kelley, Joanna Kiryluk, J. Kläs, Spencer R. Klein, Jan-Hendrik Köhne, Georges Kohnen, Hermann Kolanoski, Lutz Köpke, Claudio Kopper, Sandro Kopper, D. Jason Koskinen, Marek Kowalski, Mark Krasberg, Anna Kriesten, Kai Michael Krings, Gösta Kroll, Jan Kunnen, Naoko Kurahashi, Takao Kuwabara, Mathieu L. M. Labare, Hagar Landsman, Michael James Larson, Mariola Lesiak-Bzdak, Martin Leuermann, Julia Leute, Jan Lünemann, Oscar A. Macías-Ramírez, James Madsen, Giuliano Maggi, Reina Maruyama, Keiichi Mase, Howard S. Matis, Frank McNally, Kevin James Meagher, Martin Merck, Gonzalo Merino, Thomas Meures, Sandra Miarecki, Eike Middell, Natalie Milke, John Lester Miller, Lars Mohrmann, Teresa Montaruli, Robert M. Morse, Rolf Nahnhauer, Uwe Naumann, Hans Niederhausen, Sarah C. Nowicki, David R. Nygren, Anna Pollmann, Sirin Odrowski, Alex Olivas, Ahmad Omairat, Aongus Starbuck Ó Murchadha, Larissa Paul, Joshua A. Pepper, Carlos Pérez de los Heros, Carl Pfendner, Damian Pieloth, Elisa Pinat, Jonas Posselt, P. Buford Price, Gerald T. Przybylski, Melissa Quinnan, Leif Rädel, Ian Rae, Mohamed Rameez, Katherine Rawlins, Peter Christian Redl, René Reimann, Elisa Resconi, Wolfgang Rhode, Mathieu Ribordy, Michael Richman, Benedikt Riedel, J. P. Rodrigues, Carsten Rott, Tim Ruhe, Bakhtiyar Ruzybayev, Dirk Ryckbosch, Sabine M. Saba, Heinz-Georg Sander, Juan Marcos Santander, Subir Sarkar 0002, Kai Schatto, Florian Scheriau, Torsten Schmidt, Martin Schmitz 0004, Sebastian Schoenen, Sebastian Schöneberg, Arne Schönwald, Anne Schukraft, Lukas Schulte, David Schultz, Olaf Schulz, David Seckel, Yolanda Sestayo de la Cerra, Surujhdeo Seunarine, Rezo Shanidze, Chris Sheremata, Miles W. E. Smith, Dennis Soldin, Glenn M. Spiczak, Christian Spiering, Michael Stamatikos, Todor Stanev, Nick A. Stanisha, Alexander Stasik, Thorsten Stezelberger, Robert G. Stokstad, Achim Stößl, Erik A. Strahler, Rickard Ström, Nora Linn Strotjohann, Gregory W. Sullivan, Henric Taavola, Ignacio J. Taboada, Alessio Tamburro, Andreas Tepe, Samvel Ter-Antonyan, Gordana Tesic, Serap Tilav, Patrick A. Toale, Moriah Natasha Tobin, Simona Toscano, Maria Tselengidou, Elisabeth Unger, Marcel Usner, Sofia Vallecorsa, Nick van Eijndhoven, Arne Van Overloop, Jakob van Santen, Markus Vehring, Markus Voge, Matthias Vraeghe, Christian Walck, Tilo Waldenmaier, Marius Wallraff, Christopher Weaver 0001, Mark T. Wellons, Christopher H. Wendt, Stefan Westerhoff, Nathan Whitehorn, Klaus Wiebe, Christopher H. Wiebusch, Dawn R. Williams, Henrike Wissing, Martin Wolf 0007, Terri R. Wood, Kurt Woschnagg, Donglian Xu, Xianwu Xu, Juan Pablo Yáñez, Gaurang B. Yodh, Shigeru Yoshida, Pavel Zarzhitsky, Jan Ziemann, Simon Zierke, Marcel Zoll
 J. Parallel Distributed Comput.109