EDBT 2026 Demo / reviewers in the wild / expert

Alexander Holt

dblp:28/2303 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2006
—ORCID · none

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

Systems, architecture and hardware · 2Artificial intelligence and machine learning · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 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.

Software engineering, system software, and programming languages
1 paper
Program verification · 100%
Theoretical computer science
1 paper
Logic in computer science · 100%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%

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

TopicWeightPapersLastEvidence papers
Program verification
hardware verification		 0.011999
A semantically-derived subset of English for hardware verification · ACL 1999
Program verification
model checking		 0.011999
A semantically-derived subset of English for hardware verification · ACL 1999
Natural language and speech › Information extraction and text analysis
semantic analysis		 0.011999
A semantically-derived subset of English for hardware verification · ACL 1999
Logic in computer science › temporal logic › branching-time temporal logic
CTL		 0.011999
A semantically-derived subset of English for hardware verification · ACL 1999
Logic in computer science
temporal logic		 0.011999
A semantically-derived subset of English for hardware verification · ACL 1999
YearPublicationVenuePosition
2006 Introducing python into the first year curriculum at wits
abstract
Since 1999 the School of Computer Science (CS) at the University of Witwatersrand (Wits) has been using Scheme as the first programming language our students encounter [2]. We chose Scheme because it is a language unfamiliar to most of the first year students, so that the students with imperative programming experience from school would not have an advantage over those who did not. Also, it has a simple syntax which we felt that students without prior programming experience could easily learn. Finally, the functional paradigm allows a more direct mapping of mathematical concepts to programs, which fits with the mathematical emphasis in our curriculum.
Alexander Holt, Sarah Rauchas, Ian Douglas Sanders
 ITiCSE1
2004 Quattor: Tools and Techniques for the Configuration, Installation and Management of Large-Scale Grid Computing Fabrics
Rafael A. García Leiva, Maite Barroso Lopez, Germán Cancio Meliá, B. Chardi Marco, Lionel Cons, Piotr Poznanski, Andrew Washbrook, Enrico Ferro, Alexander Holt
 J. Grid Comput.9
2004 Autonomic Management of Large Clusters and Their Integration into the Grid
Thomas Röblitz, Florian Schintke, Alexander Reinefeld, Olof Bärring, Maite Barroso Lopez, Germán Cancio Meliá, Sylvain Chapeland, Karim Chouikh, Lionel Cons, Piotr Poznanski, Philippe Defert, Jan Iven, Thorsten Kleinwort, Bernd Panzer-Steindel, Jaroslaw Polok, Catherine Rafflin, Alan Silverman, Tim J. Smith, Jan van Eldik, David Front, Massimo Biasotto, Cristina Aiftimiei, Enrico Ferro, Gaetano Maron, Andrea Chierici, Luca dell'Agnello, Marco Serra, Michele Michelotto, Lord Hess, Volker Lindenstruth, Frank Pister, Timm M. Steinbeck, David L. Groep, Martijn Steenbakkers, Oscar Koeroo, Wim Som de Cerff, Gerben Venekamp, Paul Anderson 0003, Tim Colles, Alexander Holt, Alastair Scobie, Michael George, Andrew Washbrook, Rafael A. García Leiva
 J. Grid Comput.40
1999 A semantically-derived subset of English for hardware verification
abstract
To verify hardware designs by model checking, circuit specifications are commonly expressed in the temporal logic CTL. Automatic conversion of English to CTL requires the definition of an appropriately restricted subset of English. We show how the limited semantic expressibility of CTL can be exploited to derive a hierarchy of subsets. Our strategy avoids potential difficulties with approaches that take existing computational semantic analyses of English as their starting point---such as the need to ensure that all sentences in the subset possess a CTL translation.
Alexander Holt, Ewan Klein
 ACL1