EDBT 2026 Demo / reviewers in the wild / expert
Alf Smith
dblp:57/3660
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2000
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 3
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
2 papers |
Program verification · 73% Program synthesis and code generation · 27% |
Topics — the 2 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program verification › refinement
refinement calculus |
0.0 | 1 | 1998 | Don't Verify, Abstract! · ASE 1998 |
Program verification
safety verification |
0.0 | 1 | 1998 | Don't Verify, Abstract! · ASE 1998 |
Methods — techniques the papers use, named apart from their topics
formal verification · 0.0refinement calculus · 0.0literate programming · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2000 | ClawZ: Control Laws in ZabstractClawZ is a prototype tool whose objective is to link the Simulink(R) control engineering tool from MathWorks, with the ProofPower(R) dialect of Z. It provides a bridge between the use of Simulink to define control law diagrams and a tool to formally prove compliance between Ada and Z. The tool has been used as part of the formal proof of a nonlinear dynamic inversion flight control system comprising 37 pages of diagrams, 45 pages of Z and 1200 lines of non-comment Ada. Rob Arthan, P. Caseley, Colin O'Halloran, Alf Smith |
ICFEM | 4 |
| 1999 | Verification of Picture Generated CodeabstractTools such as Simulink(R) are being used by engineers around the world to model and solve real problems about dynamical systems. In particular control systems are modelled graphically, simulated and then code is generated automatically. Code generated from such a tool is being proposed for use in safety critical control systems. The problem for certifiers is why should they trust such generated code? This paper describes a particular approach to solving this problem which supports review by a certifier. A small case study is presented to illustrate the approach and the technical issues involved. Colin O'Halloran, Alf Smith |
ASE | 2 |
| 1998 | Don't Verify, Abstract!abstractDescribes a notation and tool for demonstrating to a third-party certifier that software written in a subset of Ada is safe, and gives some experience of using them on real projects. The thesis underlying the design is that people write adequate code, but that they make design and implementation decisions which can conflict with each other to introduce safety problems. The usual paradigm of formally specifying and then developing and verifying the code is less cost-effective than writing the code and then abstracting it to a level that is suitable for human judgements to be made. This is because there are more people who know how to write good code than those who can write effective formal specifications. The tool processes a formal, or informal, argument that code meets its safety requirements using literate programming and concepts from the refinement calculus developed at Oxford University. Colin O'Halloran, Alf Smith |
ASE | 2 |