David Powell

dblp:84/5398 · DBLP profile ↗
← Back
24ranked-venue papers
2as first author
2since 2021 · last 2026
—ORCID · conflict

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

Systems, architecture and hardware · 8 · 2 first-authorSecurity and privacy · 7Software engineering, systems software and programming languages · 5 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 5 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021

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.

Computer architecture, parallel and distributed computing, and storage systems
8 papers
Distributed systems · 36% Hardware reliability and fault tolerance · 29% Performance modeling and evaluation · 15%
Network and information security
2 papers
Systems and software security · 94% Cryptographic primitives and cryptanalysis · 6%

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

TopicWeightPapersLastEvidence papers
Distributed systems
fault tolerance
0.132006
Internet Security: An Intrusion-Tolerance Approach · Proc. IEEE 2006
GUARDS: A Generic Upgradable Architecture for Real-Time Dependable Systems · IEEE Trans. Parallel Distributed Syst. 1999
Intrusion-Tolerance Using Fine-Grain Fragmentation-Scattering · S&P 1986
Systems and software security
intrusion tolerance
0.122006
Internet Security: An Intrusion-Tolerance Approach · Proc. IEEE 2006
Intrusion-Tolerance Using Fine-Grain Fragmentation-Scattering · S&P 1986
Distributed systems › fault tolerance
intrusion tolerance
0.122006
Internet Security: An Intrusion-Tolerance Approach · Proc. IEEE 2006
Intrusion-Tolerance Using Fine-Grain Fragmentation-Scattering · S&P 1986
Hardware reliability and fault tolerance
fault injection
0.141999
Coverage Estimation Methods for Stratified Fault Injection · IEEE Trans. Computers 1999
Estimators for Fault Tolerance Coverage Evaluation · IEEE Trans. Computers 1995
Fault Injection and Dependability Evaluation of Fault-Tolerant Systems · IEEE Trans. Computers 1993
Hardware reliability and fault tolerance
fault-tolerant architecture
0.021999
GUARDS: A Generic Upgradable Architecture for Real-Time Dependable Systems · IEEE Trans. Parallel Distributed Syst. 1999
Real-Time Scheduling in a Generic Fault-Tolerant Architecture · RTSS 1998
Electronic design automation › hardware verification and test
fault coverage
0.021999
Coverage Estimation Methods for Stratified Fault Injection · IEEE Trans. Computers 1999
Estimators for Fault Tolerance Coverage Evaluation · IEEE Trans. Computers 1995
Performance modeling and evaluation › statistical analysis
statistical estimation
0.021999
Coverage Estimation Methods for Stratified Fault Injection · IEEE Trans. Computers 1999
Estimators for Fault Tolerance Coverage Evaluation · IEEE Trans. Computers 1995
Performance modeling and evaluation › statistical analysis › statistical sampling
stratified sampling
0.011999
Coverage Estimation Methods for Stratified Fault Injection · IEEE Trans. Computers 1999
Embedded and real-time systems
real-time scheduling
0.011998
Real-Time Scheduling in a Generic Fault-Tolerant Architecture · RTSS 1998
Embedded and real-time systems › real-time scheduling › schedulability analysis
response time analysis
0.011998
Real-Time Scheduling in a Generic Fault-Tolerant Architecture · RTSS 1998
Hardware reliability and fault tolerance
dependability analysis
0.021993
Fault Injection and Dependability Evaluation of Fault-Tolerant Systems · IEEE Trans. Computers 1993
Fault Injection for Dependability Validation: A Methodology and Some Applications · IEEE Trans. Software Eng. 1990
Embedded and real-time systems
real-time operating systems
0.011999
GUARDS: A Generic Upgradable Architecture for Real-Time Dependable Systems · IEEE Trans. Parallel Distributed Syst. 1999

Methods — techniques the papers use, named apart from their topics

fault-tolerance techniques · 0.1fault tolerance techniques · 0.1prototype implementation · 0.0pearson distribution system · 0.0frequentist confidence limits · 0.0bayesian estimation · 0.0COTS component integration · 0.0extended response-time analysis · 0.0fault injection · 0.0statistical sampling · 0.0a posteriori stratification · 0.0file partitioning · 0.0distributed storage · 0.0cryptographic fragmentation · 0.0
YearPublicationVenuePosition
2026 Leveraging a Vintage Radio Interface to Explore Media Recommender Systems
abstract
Older adults often face significant barriers to engaging with and critically evaluating complex, AI-driven systems, leading to potential exclusion and marginalisation. This paper introduces a novel approach leveraging a nostalgic vintage radio platform as a familiar and accessible "bridge" to provoke and facilitate meaningful participatory design discussions about such a system. We present a multidisciplinary design project that utilises the tactile and accessible metaphor of an old-fashioned, table-top wood-cased radio to engage older adults in conversations about the ethical impact and accessibility of contemporary media systems. The platform is used as a discussion toolkit to explore the pros and cons of AI driven recommender systems for this demographic, including issues of personalisation, filter bubbles and data transparency. Our work demonstrates the efficacy of using a familiar, emotionally resonant, tangible interface to enable deeper engagement and critical reflection on the impact of AI generated media content. We detail the design and intended evaluation of this interactive radio to provide valuable insights and methodologies for Human Computer Interfaces (HCI) and media studies researchers aiming to design more inclusive and accessible interactive media systems and foster informed dialogue with older user populations.
Paula Kelly, David Powell, Frank Duignan, Emma Clarke, Damon Berry
IMX2
2025 Institutional Research Computing Capabilities in Australia: 2024
abstract
Institutional research computing infrastructure plays a vital role in Australia’s research ecosystem, complementing and extending national-level facilities. This paper presents an analysis of research computing capabilities across Australian universities and research organisations, examining how institutional infrastructure supports research excellence through localised compute resources, specialised hardware, and cluster solutions. Our study reveals that institutional computing resources of nearly 112,258 CPU cores and 2,241 GPUs serve as essential bridges between desktop computing and national facilities for over 6,000 researchers, enabling research workflows that span from development to large-scale computations. We estimate the total replacement value of this infrastructure to be approximately $144M AUD. Based on detailed infrastructure data provided by research computing facilities across multiple institutions, we identify key patterns in infrastructure deployment, utilisation metrics, and strategic alignment with research priorities. Our findings demonstrate that institutional computing resources not only provide critical support for data-intensive research but also facilitate training and higher-degree research student projects, enable prototyping and development, and ensure data sovereignty compliance when necessary. The analysis shows how these facilities leverage national infrastructure investments while addressing institution-specific needs that cannot be met by national facilities alone. We present evidence that strategic investment in institutional research computing capabilities yields significant returns through increased research productivity, enhanced graduate training, and improved research outcomes. This study provides valuable insights for research organisations planning their computing infrastructure strategies and highlights the importance of maintaining robust institutional computing capabilities alongside national facilities.
Slava Kitaeff, Luc Betbeder-Matibet, Jake Carroll, Stephen Giugni, David Abramson 0001, John Zaitseff, Sarah Walters, David Powell, Chris Bording, Angus Macoustra, Fabien Voisin, Jarrod Hurley
eScience8
2019 Establishing a distributed national research infrastructure providing bioinformatics support to life science researchers in Australia
abstract
EMBL Australia Bioinformatics Resource (EMBL-ABR) is a developing national research infrastructure, providing bioinformatics resources and support to life science and biomedical researchers in Australia. EMBL-ABR comprises 10 geographically distributed national nodes with one coordinating hub, with current funding provided through Bioplatforms Australia and the University of Melbourne for its initial 2-year development phase. The EMBL-ABR mission is to: (1) increase Australia's capacity in bioinformatics and data sciences; (2) contribute to the development of training in bioinformatics skills; (3) showcase Australian data sets at an international level and (4) enable engagement in international programs. The activities of EMBL-ABR are focussed in six key areas, aligning with comparable international initiatives such as ELIXIR, CyVerse and NIH Commons. These key areas-Tools, Data, Standards, Platforms, Compute and Training-are described in this article.
Maria Victoria Schneider, Philippa C. Griffin, Sonika Tyagi, Madison Flannery, Saravanan Dayalan, Simon Gladman, Nathan S. Watson-Haigh, Philipp E. Bayer, Michael A. Charleston, Ira Cooke, Rob Cook, Richard J. Edwards, David Edwards, Dominique Gorse, Malcolm J. McConville, David Powell, Marc R. Wilkins, Andrew Lonie
Briefings Bioinform.16
2014 Specifying Safety Monitors for Autonomous Systems Using Model-Checking
Mathilde Machin, Fanny Dufossé, Jean-Paul Blanquart, Jérémie Guiochet, David Powell, Hélène Waeselynck
SAFECOMP5
2012 Safety Trigger Conditions for Critical Autonomous Systems
abstract
A systematic process for eliciting safety trigger conditions is presented. Starting from a risk analysis of the monitored system, critical transitions to catastrophic system states are identified and handled in order to specify safety margins on them. The conditions for existence of such safety margins are given and an alternative solution is proposed if no safety margin can be defined. The proposed process is illustrated on a robotic rollator.
Amina Mekki-Mokhtar, Jean-Paul Blanquart, Jérémie Guiochet, David Powell, Matthieu Roy
PRDC4
2011 Intrusion-tolerant fine-grained authorization for Internet applications
Vincent Nicomette, David Powell, Yves Deswarte, Noureddine Abghour, Christophe Zanon
J. Syst. Archit.2
2008 Geo-registers: An Abstraction for Spatial-Based Distributed Computing
Matthieu Roy, François Bonnet 0001, Leonardo Querzoni, Silvia Bonomi, Marc-Olivier Killijian, David Powell
OPODIS6
2007 Fault Tolerant Planning for Critical Robots
abstract
Autonomous robots offer alluring perspectives in numerous application domains: space rovers, satellites, medical assistants, tour guides, etc. However, a severe lack of trust in their dependability greatly reduces their possible usage. In particular, autonomous systems make extensive use of decisional mechanisms that are able to take complex and adaptative decisions, but are very hard to validate. This paper proposes a fault tolerance approach for decisional planning components, which are almost mandatory in complex autonomous systems. The proposed mechanisms focus on development faults in planning models and heuristics, through the use of diversification. The paper presents an implementation of these mechanisms on an existing autonomous robot architecture, and evaluates their impact on performance and reliability through the use of fault injection.
Benjamin Lussier, Matthieu Gallien, Jérémie Guiochet, Félix Ingrand, Marc-Olivier Killijian, David Powell
DSN6
2007 Dependability Evaluation of Cooperative Backup Strategies for Mobile Devices
abstract
Mobile devices (e.g., laptops, PDAs, cell phones) are increasingly relied on but are used in contexts that put them at risk of physical damage, loss or theft. This paper discusses the dependability evaluation of a cooperative backup service for mobile devices. Participating devices leverage encounters with other devices to temporarily replicate critical data. Permanent backups are created when the participating devices are able to access the fixed infrastructure. Several data replication and scattering strategies are presented, including the use of erasure codes. A methodology to model and evaluate them using Petri nets and Markov chains is described. We demonstrate that our cooperative backup service decreases the probability of data loss by a factor up to the ad hoc to Internet connectivity ratio.
Ludovic Courtès, Ossama Hamouda, Mohamed Kaâniche, Marc-Olivier Killijian, David Powell
PRDC5
2006 Internet Security: An Intrusion-Tolerance Approach
abstract
The Internet has become essential to most enterprises and many private individuals. However, both the network and computer systems connected to it are still too vulnerable and attacks are becoming evermore frequent. To face this situation, traditional security techniques are insufficient and fault-tolerance techniques are becoming increasingly cost-effective. Nevertheless,intrusions are very special faults, and this has to be taken into account when selecting the fault-tolerance techniques.
Yves Deswarte, David Powell
Proc. IEEE2
2005 Solaris Service Management Facility: Modern System Startup and Administration
David Bustos, Stephen Hahn 0001, David Powell, Liane Praza
LISA4
2004 Intrusion Tolerance for Internet Applications
abstract
The Internet has become essential to most enterprises and many private individuals. However, both the network and computer systems connected to it are still too vulnerable and attacks are becoming evermore frequent. To face this situation, traditional security techniques are insufficient and fault tolerance techniques are becoming increasingly cost-effective. Nevertheless, intrusions are very special faults, and this has to be taken into account when selecting the fault tolerance techniques.
Yves Deswarte, David Powell
NCA2
2004 A Hybrid Approach for Building Eventually Accurate Failure Detectors
abstract
Unreliable failure detectors introduced by Chandra and Toueg are abstract mechanisms that provide information about process crashes. On the one hand, failure detectors allow a statement of the minimal requirements on process failures that allow solutions to problems that cannot otherwise be solved in purely asynchronous systems. However, on the other hand, they cannot be implemented in such systems: their implementation requires that the underlying distributed system be enriched with additional assumptions. Classic failure detector implementations rely on additional synchrony assumptions such as partial synchrony. More recently, a new approach for implementing failure detectors has been proposed: it relies on behavioral properties on the flow of messages exchanged. This shows that these approaches are not antagonistic and can be advantageously combined. A hybrid protocol (the first to our knowledge) implementing failure detectors with eventual accuracy properties is presented. Interestingly, this protocol benefits from the best of both worlds in the sense that it converges (i.e., provides the required failure detector) as soon as either the system behaves synchronously or the required message exchange pattern is satisfied. This shows that, to expedite convergence, it can be interesting to consider that the underlying system can satisfy several alternative assumptions.
Achour Mostéfaoui, David Powell, Michel Raynal
PRDC2
1999 Fault Avoidance and Fault Removal in Real-Time Systems & Fault-Tolerant Computing - Introduction
Gilles Motet, David Powell
Euro-Par2
1999 Land-vehicle navigation using GPS
abstract
The Global Positioning System (GPS) has made navigation systems practical for a number of land-vehicle navigation applications. Today, GPS-based navigation systems can be found in motor vehicles, farming and mining equipment, and a variety of other land-based vehicles (e.g., golf carts and mobile robots). Each of these applications is discussed and the reader is introduced to some of the issues involved with each one. One particular technical aspect of navigation for land vehicles is discussed. Specifically, the research discussed in this paper presents a quantitative examination of the impact that individual navigation sensors have on the perfomance of a land-vehicle navigation system. A range of navigation sensor performance levels and their influence on vehicle positioning accuracy are examined. Results show that, for a typical navigation system, positioning error is dominated by the accuracy of the position fixes provided by the GPS receiver when GPS position fixes are available and by the rate gyro's bias drift when GPS position fixes are not available. Furthermore, results show that the accuracy of the GPS position fixes has a significant impact on the relative contributions that each dead-reckoning navigation sensor error makes. The implications of these results for navigation system design and sensor design are discussed.
Eric Abbott, David Powell
Proc. IEEE2
1999 Coverage Estimation Methods for Stratified Fault Injection
abstract
This paper addresses the problem of estimating fault tolerance coverage through statistical processing of observations collected in fault-injection experiments. In an earlier paper, venous estimators based on simple sampling in the complete fault/activity input space and stratified sampling in a partitioned space were studied; frequentist confidence limits were derived based on a normal approximation. In this paper, the validity of this approximation is analyzed. The theory of confidence regions is introduced to estimate coverage without approximation when stratification is used. Three statistics are considered for defining confidence regions. It is shown that one-a vectorial statistic-is often more conservative than the other two. However, only the vectorial statistic is computationally tractable. We then consider Bayesian estimation methods for stratified sampling. Two methods are presented to obtain an approximation of the posterior distribution of the coverage by calculating its moments. The moments are then used to identify the type of the distribution in the Pearson distribution system, to estimate its parameters, and to obtain the coverage confidence limit. Three hypothetical example systems are used to compare the validity and the conservatism of the frequentist and Bayesian estimations.
Michel Cukier, David Powell, Jean Arlat
IEEE Trans. Computers2
1999 GUARDS: A Generic Upgradable Architecture for Real-Time Dependable Systems
abstract
The development and validation of fault-tolerant computers for critical real-time applications are currently both costly and time consuming. Often, the underlying technology is out-of-date by the time the computers are ready for deployment. Obsolescence can become a chronic problem when the systems in which they are embedded have lifetimes of several decades. This paper gives an overview of the work carried out in a project that is tackling the issues of cost and rapid obsolescence by defining a generic fault-tolerant computer architecture based essentially on commercial off-the-shelf (COTS) components (both processor hardware boards and real-time operating systems). The architecture uses a limited number of specific, but generic, hardware and software components to implement an architecture that can be configured along three dimensions: redundant channels, redundant lanes, and integrity levels. The two dimensions of physical redundancy allow the definition of a wide variety of instances with different fault tolerance strategies. The integrity level dimension allows application components of different levels of criticality to coexist in the same instance. The paper describes the main concepts of the architecture, the supporting environments for development and validation, and the prototypes currently being implemented.
David Powell, Jean Arlat, Ljerka Beus-Dukic, Andrea Bondavalli, P. Coppola, Alessandro Fantechi, Eric Jenn, Christophe Rabéjac, Andy J. Wellings
IEEE Trans. Parallel Distributed Syst.1
1998 State Restoration in a COTS-Based N-Modular Architecture
abstract
Mechanisms for restoring the state of a channel in an N-modular redundant architecture are necessary to prevent redundancy attrition due to transient faults and to allow failed channels to be brought back on line after repair. This paper considers software-implemented mechanisms for state restoration (SR) in a generic fault-tolerant architecture in which both the underlying hardware and operating system are commercial off-the-shelf (COTS) components. State restoration involves copying the values of state variables from the active channel(s) across to the joining channel. Concurrent updating of state variables by application tasks is considered. Two state restoration schemes are considered: Running SR and Recursive SR. In the former, each state variable is copied exactly once while concurrent updates are written through to the joining channel. In the latter state variables are copied once and then recopied recursively until no concurrent updates are detected.
Andrea Bondavalli, Felicita Di Giandomenico, Fabrizio Grandoni 0002, David Powell, Christophe Rabéjac
ISORC4
1998 Real-Time Scheduling in a Generic Fault-Tolerant Architecture
abstract
Previous ultra-dependable real-time computing architectures have been specialised to meet the requirements of a particular application domain. Over the last two years, a consortium of European companies and academic institutions has been investigating the design and development of a Generic Upgradable Architecture for Real-time Dependable Systems (GUARDS). The architecture aims to be tolerant of permanent and temporary, internal and external, physical faults and should provide confinement or tolerance of software design faults. GUARDS critical applications are intended to be replicated across the channels which provide the primary hardware fault containment regions. In this paper, we present our approach to real-time scheduling of the GUARDS architecture. We use an extended response-time analysis to predict the timing properties of replicated real-time transactions. Consideration is also given to the scheduling of the inter-channel communications network.
Andy J. Wellings, Ljerka Beus-Dukic, David Powell
RTSS3
1995 Estimators for Fault Tolerance Coverage Evaluation
abstract
This paper addresses the problem of estimating the coverage of a fault tolerance mechanism through statistical professing of observations collected in fault injection experiments. A formal definition of coverage is given in terms of the fault and system activity sets that characterize the input space. Two categories of sampling techniques are considered for coverage estimation: sampling in the whole space and sampling in a space partitioned into classes. The estimators for each technique are compared by means of hypothetical examples. Techniques for early estimations of coverage are then studied. These techniques allow unbiased estimations of coverage to be made before all classes of the sampling space have been tested. Then, the "no-reply" problem that hampers most practical fault-injection experiments is discussed and an a posteriori stratification technique is proposed that allows the scope of incomplete tests to be widened by accounting for available structural information about the target system.>
David Powell, Eliane Martins, Jean Arlat, Yves Crouzet
IEEE Trans. Computers1
1993 Fault Injection and Dependability Evaluation of Fault-Tolerant Systems
abstract
The authors describe a dependability evaluation method based on fault injection that establishes the link between the experimental evaluation of the fault tolerance process and the fault occurrence process. The main characteristics of a fault injection test sequence aimed at evaluating the coverage of the fault tolerance process are presented. Emphasis is given to the derivation of experimental measures. The various steps by which the fault occurrence and fault tolerance processes are combined to evaluate dependability measures are identified and their interactions are analyzed. The method is illustrated by an application to the dependability evaluation of the distributed fault-tolerant architecture of the Esprit Delta-4 Project.>
Jean Arlat, Alain Costes, Yves Crouzet, Jean-Claude Laprie, David Powell
IEEE Trans. Computers5
1991 Dependability Evaluation of Bus and Ring Communication Topologies for the Delta-4 Distributed Fault-Tolerant Architecture
abstract
The authors report a study of the dependability of the various communication topologies that can be used to construct a Delta-4 system. Single and dual bus and ring configurations are possible (based on 802.4, 802.5, and FDDI standards); the authors give closed-form expressions for the reliability and availability of each topology when repair is taken into account. It is shown that the dimensioning parameter in the dependability of the communication system is the coverage of the self-checking mechanisms built into the network attachment controllers.>
Karama Kanoun, David Powell
SRDS2
1990 Fault Injection for Dependability Validation: A Methodology and Some Applications
abstract
The authors address the problem of validating the dependability of fault-tolerant computing systems, in particular, the validation of the fault-tolerance mechanisms. The proposed approach is based on the use of fault injection at the physical level on a hardware/software prototype of the system considered. The place of this approach in a validation-directed design process and with respect to related work on fault injection is clearly identified. The major requirements and problems related to the development and application of a validation methodology based on fault injection are presented and discussed. Emphasis is put on the definition, analysis, and use of the experimental dependability measures that can be obtained. The proposed methodology has been implemented through the realization of a general pin-level fault injection tool (MESSALINE), and its usefulness is demonstrated by the application of MESSALINE to the experimental validation of two systems: a subsystem of a centralized computerized interlocking system for railway control applications and a distributed system corresponding to the current implementation of the dependable communication system of the ESPRIT Delta-4 Project.>
Jean Arlat, Martine Aguera, Louis Amat, Yves Crouzet, Jean-Charles Fabre, Jean-Claude Laprie, Eliane Martins, David Powell
IEEE Trans. Software Eng.8
1986 Intrusion-Tolerance Using Fine-Grain Fragmentation-Scattering
abstract
The consequences of faults and intrusions in computer networks are of ever-increasing importance; new efficient techniques are needed to deal with them. The SATURNE [DES 86] project aims at solutions for architectures based on the concept of fault- and intrusion-tolerance rather than avoidance techniques. The subject of the paper concerns the security of files. Files are partitioned and then fragmented before being stored in different, distributed archive sites in order to tolerate intrusions into some of these sites. The choice among different fragmentation cryptographic methods is discussed, related to different kinds of possible attacks. A simple and fast solution is proposed that nevertheless ensures a high level of file security and authenticity.
J.-M. Fray, Yves Deswarte, David Powell
S&P3