Jim Woodcock
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Jim Woodcock has a total of 145 co-authors. Here are the top co-authors by number of shared publications:
- Simon Foster
University of York, York, UK
15 shared publications Ana Cavalcanti
University of York
12 shared publications- Peter Gorm Larsen
Aarhus University
11 shared publications - Ana Cavalcanti
University of York, York, UK
10 shared publications - Cláudio Gomes
Aarhus University
8 shared publications - John Fitzgerald
School of Computing, Newcastle University
7 shared publications
Latest Publications
- Open Access
- 16 October 2026
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 38 (4) , 1-73
Formal Methods in Industry: A Critical Evaluation of Their Use at Amazon Web Services
Formal methods have long promised enhanced software reliability through rigorous mathematical reasoning, yet concerns over scalability, cost, and accessibility have historically limited their industrial adoption. This article critically evaluates the public record on the use of formal methods in engineering at Amazon Web Services (AWS). Drawing on publicly available case studies, engineering reports, and technical documentation, we examine reported applications of model checking, SMT solving, and lightweight formal methods across domains such as distributed systems, cloud networking, cryptography, and security policy verification. We organise the analysis around 16 targeted questions across five themes: (1) technical impact, (2) organisational adoption, (3) scalability in complex and heterogeneous systems, (4) long-term strategic value, and (5) future directions. By placing these AWS case studies alongside historical precedents at companies such as IBM, Microsoft, and Google, we highlight both continuity and innovation in industrial practice. Across the published case studies, authors report benefits such as early bug detection, performance optimisation, and strengthened security assurance, including integration with CI/CD workflows in some settings. However, the evidence base is selective and does not support organisation-wide claims about prevalence, cost-effectiveness, or ROI; quantitative baselines are sparse, and survivorship bias is plausible. We discuss the resulting methodological limits, highlight challenges such as maintaining specifications under continuous evolution, and outline a research agenda to improve empirical validation, methodological refinement, and the preservation of industrial verification artefacts.
- 16 October 2026
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 38 (4) , 1-73
Open AccessFormal Methods in Industry: A Critical Evaluation of Their Use at Amazon Web Services
Formal methods have long promised enhanced software reliability through rigorous mathematical reasoning, yet concerns over scalability, cost, and accessibility have historically limited their industrial adoption. This article critically evaluates the public record on the use of formal methods in engineering at Amazon Web Services (AWS). Drawing on publicly available case studies, engineering reports, and technical documentation, we examine reported applications of model checking, SMT solving, and lightweight formal methods across domains such as distributed systems, cloud networking, cryptography, and security policy verification. We organise the analysis around 16 targeted questions across five themes: (1) technical impact, (2) organisational adoption, (3) scalability in complex and heterogeneous systems, (4) long-term strategic value, and (5) future directions. By placing these AWS case studies alongside historical precedents at companies such as IBM, Microsoft, and Google, we highlight both continuity and innovation in industrial practice. Across the published case studies, authors report benefits such as early bug detection, performance optimisation, and strengthened security assurance, including integration with CI/CD workflows in some settings. However, the evidence base is selective and does not support organisation-wide claims about prevalence, cost-effectiveness, or ROI; quantitative baselines are sparse, and survivorship bias is plausible. We discuss the resulting methodological limits, highlight challenges such as maintaining specifications under continuous evolution, and outline a research agenda to improve empirical validation, methodological refinement, and the preservation of industrial verification artefacts.
- Open Access
- 4 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 480-484
BRIC-DT: Building Reliable Interfaces for Composable Digital Twins
Digital twins (DTs) increasingly combine models, simulators, estimators, optimizers, and knowledge-management services to monitor and steer adaptive cyber-physical systems. Yet most DTs are still engineered as custom assemblies whose interfaces capture data exchange but not the assumptions and guarantees needed for safe reuse. This vision paper argues that DT engineering should move toward contract-aware interfaces: explicit contracts that state not only what data a component exchanges, but also the validity, timing, fidelity, robustness, and uncertainty assumptions governing its trustworthy use. We position BRIC-DT as a contract layer for recurring DT services, outline the gap between current interoperability mechanisms and correctness-preserving composition, and set out a research agenda around explicit correctness properties, reusable composition operators, and correctness-preserving evolution.
- 4 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 480-484
Open AccessBRIC-DT: Building Reliable Interfaces for Composable Digital Twins
Digital twins (DTs) increasingly combine models, simulators, estimators, optimizers, and knowledge-management services to monitor and steer adaptive cyber-physical systems. Yet most DTs are still engineered as custom assemblies whose interfaces capture data exchange but not the assumptions and guarantees needed for safe reuse. This vision paper argues that DT engineering should move toward contract-aware interfaces: explicit contracts that state not only what data a component exchanges, but also the validity, timing, fidelity, robustness, and uncertainty assumptions governing its trustworthy use. We position BRIC-DT as a contract layer for recurring DT services, outline the gap between current interoperability mechanisms and correctness-preserving composition, and set out a research agenda around explicit correctness properties, reusable composition operators, and correctness-preserving evolution.
- Open Access
- 19 August 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
Software Engineering for Self-Adaptive Robotics: A Research Agenda
Self-adaptive robotic systems operate autonomously in dynamic and uncertain environments, requiring robust real-time monitoring and adaptive behaviour. Unlike traditional robotic software with predefined logic, self-adaptive robots leverage artificial intelligence (AI), machine learning, and model-driven engineering to adapt to changing conditions continuously, ensuring reliability, safety, and optimal performance. This paper presents a research agenda for software engineering in self-adaptive robotics, structured along two dimensions. The first concerns the software engineering lifecycle—requirements, design, development, testing, and operations—tailored to the challenges of self-adaptive robotics. The second focuses on enabling technologies, i.e., digital twins and AI-driven adaptation, which support runtime monitoring, fault detection, and automated decision-making. We identify open challenges, including verifying adaptive behaviours under uncertainty, balancing trade-offs among adaptability, performance, and safety, and integrating self-adaptation frameworks such as MAPE-K/MAPLE-K. By consolidating these challenges into a roadmap toward 2030, this work contributes to the foundations of trustworthy and efficient self-adaptive robotic systems capable of meeting the complexities of real-world deployment.
- 19 August 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
Open AccessSoftware Engineering for Self-Adaptive Robotics: A Research Agenda
Self-adaptive robotic systems operate autonomously in dynamic and uncertain environments, requiring robust real-time monitoring and adaptive behaviour. Unlike traditional robotic software with predefined logic, self-adaptive robots leverage artificial intelligence (AI), machine learning, and model-driven engineering to adapt to changing conditions continuously, ensuring reliability, safety, and optimal performance. This paper presents a research agenda for software engineering in self-adaptive robotics, structured along two dimensions. The first concerns the software engineering lifecycle—requirements, design, development, testing, and operations—tailored to the challenges of self-adaptive robotics. The second focuses on enabling technologies, i.e., digital twins and AI-driven adaptation, which support runtime monitoring, fault detection, and automated decision-making. We identify open challenges, including verifying adaptive behaviours under uncertainty, balancing trade-offs among adaptability, performance, and safety, and integrating self-adaptation frameworks such as MAPE-K/MAPLE-K. By consolidating these challenges into a roadmap toward 2030, this work contributes to the foundations of trustworthy and efficient self-adaptive robotic systems capable of meeting the complexities of real-world deployment.
- Open Access
- 21 July 2026
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 38 (3) , 1-2
Introduction to the Special Collection on the History of Formal Methods
- 21 July 2026
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 38 (3) , 1-2
Open AccessIntroduction to the Special Collection on the History of Formal Methods
- 19 May 2026
- Published by Springer Nature
- p. 12-28
Teaching Unifying Theories of Programming
- Open Access
- 12 February 2026
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 38 (1) , 1-2
Jean-Raymond Abrial (1938 – 2025) Pioneer of Formal Methods and Inventor of the B Method. An Obituary
Jean-Raymond Abrial (6 November 1938 – 26 May 2025), one of the founding figures of modern formal methods in computer science, passed away at the age of 86. His contributions laid the groundwork for mathematically rigorous software development, and his influence spans generations of researchers, engineers, and educators worldwide.
- 12 February 2026
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 38 (1) , 1-2
Open AccessJean-Raymond Abrial (1938 – 2025) Pioneer of Formal Methods and Inventor of the B Method. An Obituary
Jean-Raymond Abrial (6 November 1938 – 26 May 2025), one of the founding figures of modern formal methods in computer science, passed away at the age of 86. His contributions laid the groundwork for mathematically rigorous software development, and his influence spans generations of researchers, engineers, and educators worldwide.
- Open Access
- 18 December 2025
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 38 (3) , 1-43
A Brief History of Formal Methods in China
The development of formal methods (FM) in China dates back to the early 1950s, when several logicians shifted their research focus from mathematics to theoretical computer science and began advocating the application of mathematical logic to enhance the rigor of computing systems. A significant expansion of FM in China emerged in the 1980s, pioneered by a new generation of talented computer scientists who had visited, studied, and/or worked in Western countries, such as the United Kingdom and the United States, closely tied to China’s reform and opening-up policy. A notable milestone was the establishment of the United Nations University International Institute for Software Technology (UNU/IIST) in Macau in the early 1990s, which played a crucial role in advancing FM research and collaboration in China. In recent years, the return of an increasing number of talented young scholars has further strengthened China’s FM community, elevating its influence and contribution within the global FM landscape.
- 18 December 2025
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 38 (3) , 1-43
Open AccessA Brief History of Formal Methods in China
The development of formal methods (FM) in China dates back to the early 1950s, when several logicians shifted their research focus from mathematics to theoretical computer science and began advocating the application of mathematical logic to enhance the rigor of computing systems. A significant expansion of FM in China emerged in the 1980s, pioneered by a new generation of talented computer scientists who had visited, studied, and/or worked in Western countries, such as the United Kingdom and the United States, closely tied to China’s reform and opening-up policy. A notable milestone was the establishment of the United Nations University International Institute for Software Technology (UNU/IIST) in Macau in the early 1990s, which played a crucial role in advancing FM research and collaboration in China. In recent years, the return of an increasing number of talented young scholars has further strengthened China’s FM community, elevating its influence and contribution within the global FM landscape.
- Open Access
- 3 December 2025
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 37 (4) , 1-2
Farewell Editorial
- 3 December 2025
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 37 (4) , 1-2
Open AccessFarewell Editorial
- 11 November 2025
- Published by Springer Nature
- p. 1-21
Formal Verification of Physical Layer Security Protocols for Next-Generation Communication Networks
- 11 November 2025
- Published by Springer Nature
- p. 1-21
Formal Verification of Physical Layer Security Protocols for Next-Generation Communication Networks
- Open Access
Formal Verification of Physical Layer Security Protocols for Next-Generation Communication Networks (extended version)
Formal verification is crucial for ensuring the robustness of security protocols against adversarial attacks. The Needham-Schroeder protocol, a foundational authentication mechanism, has been extensively studied, including its integration with Physical Layer Security (PLS) techniques such as watermarking and jamming. Recent research has used ProVerif to verify these mechanisms in terms of secrecy. However, the ProVerif-based approach limits the ability to improve understanding of security beyond verification results. To overcome these limitations, we re-model the same protocol using an Isabelle formalism that generates sound animation, enabling interactive and automated formal verification of security protocols. Our modelling and verification framework is generic and highly configurable, supporting both cryptography and PLS. For the same protocol, we have conducted a comprehensive analysis (secrecy and authenticity in four different eavesdropper locations under both passive and active attacks) using our new web interface. Our findings not only successfully reproduce and reinforce previous results on secrecy but also reveal an uncommon but expected outcome: authenticity is preserved across all examined scenarios, even in cases where secrecy is compromised. We have proposed a PLS-based Diffie-Hellman protocol that integrates watermarking and jamming, and our analysis shows that it is secure for deriving a session key with required authentication. These highlight the advantages of our novel approach, demonstrating its robustness in formally verifying security properties beyond conventional methods.
Open AccessFormal Verification of Physical Layer Security Protocols for Next-Generation Communication Networks (extended version)
Formal verification is crucial for ensuring the robustness of security protocols against adversarial attacks. The Needham-Schroeder protocol, a foundational authentication mechanism, has been extensively studied, including its integration with Physical Layer Security (PLS) techniques such as watermarking and jamming. Recent research has used ProVerif to verify these mechanisms in terms of secrecy. However, the ProVerif-based approach limits the ability to improve understanding of security beyond verification results. To overcome these limitations, we re-model the same protocol using an Isabelle formalism that generates sound animation, enabling interactive and automated formal verification of security protocols. Our modelling and verification framework is generic and highly configurable, supporting both cryptography and PLS. For the same protocol, we have conducted a comprehensive analysis (secrecy and authenticity in four different eavesdropper locations under both passive and active attacks) using our new web interface. Our findings not only successfully reproduce and reinforce previous results on secrecy but also reveal an uncommon but expected outcome: authenticity is preserved across all examined scenarios, even in cases where secrecy is compromised. We have proposed a PLS-based Diffie-Hellman protocol that integrates watermarking and jamming, and our analysis shows that it is secure for deriving a session key with required authentication. These highlight the advantages of our novel approach, demonstrating its robustness in formally verifying security properties beyond conventional methods.