Prototyping Games Using Formal Methods

We present an overview of our observations and experiences of applying formal methods in industry. Our approach combines two existing and complimentary formal methods, namely the Cleanroom method [H. D. Mills et al., (1987), S. J. Prowell et al. (1998)] and the CSP framework [C. A. R. Hoare (1985), A. W. Roscoe (1998)] together with its model checker FDR. The problem we are interested in is the use of formal methods to develop software systems of a business-critical and untestable nature, where the software forms an essential part of some core product or service offered by a business. We argue that the successful implementation of such systems needs a more formal approach and reflect on why formal methods are rarely used in practice. We discuss the combination of Cleanroom and CSP, and show how they can be applied to develop the control software that is embedded in a complex manufacturing machine.

There is certainly no doubt that formal methods should be used, as far as possible, in the specification and design of real-time systems [2]. The number and quality of articles published on formal methods grow significantly from year to year. Their use, however, is still not very effective. In this note, I am trying to give a brief summary of such applications, followed by some suggestions which may contribute to a more widespread use of formal methods in practice.

In this paper, we outline a possible formalization of the semantics of the XML-based ODX language. ODX is a substantial part of the emerging automotive ASAM MCD standard, which describes a middleware layer between offboard diagnosis applications and onboard diagnosis services of electronic control units (ECUs) of cars. The contribution of our work is threefold: Firstly, a consequent application of our results can contribute to a well-structured development process in the automotive diagnosis domain. We are currently showing this in practice as part of our ongoing cooperation with the diagnosis department of AUDI AG. Secondly, our proposition is the first step towards guaranteed standard-conformity of implementations of the MCD run-time system, also specified by the standard and strongly depending on ODX and its semantics. Last but not least, the paper can serve as an encouraging example of the application of formal methods in practice.

The creation of artificial intelligence in video games is mostly dependent on heuristic pathfinding algorithms. The ability to move of the agent is one of the biggest obstacles in the construction of accurate artificial intelligence (AI) in video games. Before the A* algorithm emerged as a provably optimum solution for pathfinding, several search algorithms, including Dijkstra’s algorithm, the bread first search algorithm, and depth first search algorithm, were developed to tackle the shortest route issue. Since its inception, it has drawn the interest of several scholars who have decided to work on it. This paper provides an in-depth analysis of these algorithms, focusing on their development, evolution, and performance. Beginning with an overview of classical algorithms like A*, the paper explores recent advancements and optimizations. Performance metrics and practical applications are discussed, with case studies from contemporary video games. This analysis highlights the balance between computational efficiency and path optimality, guiding future developments in game AI.

On Using Large Language Models Pre-trained on Digital Twins as Oracles to Foster the Use of Formal Methods in Practice

Considering diverse scenarios in urban traffic, the safety assessment of the decision-making process in automated driving is of great concern for years. And the difficulties of assessing safety lies in the computation of massive spatio-temporal data, the classification of scenarios, and the representation of the uncertainty in the environment with mixed traffic of manned and automated driving. Formal methods are often advocated as the way of increasing confidence in the safety-critical systems via its rigorous mathematical logic. Thus, we propose an assessment scheme which involves: i) the abstract model for decision-making, ii) characterization of composable scenarios, and iii) a corresponding formal verification method to assess safety. The abstract model captures features from the real-time observation and the estimation of the feasible driving alternatives of the surrounding vehicles, as the scenario is regarded as the dynamic evolution of the spatio-temporal data in the static road geometry over time. These features enable the specification and reasoning of the spatial guard conditions and safety properties, and also contribute to the connection and composability of the scenarios. Due to our scenario-based model verification method, we can assess the safety of decisions in scenario transitions by quantitative verification on the probability of the satisfaction of safety property through mapping from our approach to UPPAAL SMC. For illustration, case studies in the fundamental scene structures and the multi-lane roundabout are introduced.

RTCA DO-333, Formal Methods Supplement to DO-178C and DO-278A, provides guidance for software developers wishing to use formal methods in the certification of airborne systems and air traffic management systems. This paper presents three case studies describing the use of different classes of formal methods to satisfy DO-178C certification objectives. The case studies examine different aspects of a common avionics example, a dual-channel Flight Guidance System (FGS), which is representative of the issues encountered in actual developments. The three case studies illustrate the use of theorem proving, model checking, and abstract interpretation. Each of these techniques has strengths and weaknesses and each could be applied to different life cycle data items and different objectives than those described here. Our purpose is to illustrate a reasonable application of each of these techniques to produce the evidence needed to satisfy certification objectives in a realistic avionics application. We hope that these case studies will be useful to industry and government personnel in understanding formal methods and the benefits they can provide.

A sound theory of real-time scheduling is necessary to support the engineering of real-time software applications. Developing scheduling results using formal methods helps provide the high level of assurance required in safety-critical domains. We propose a formalization methodology relying on state-machine models and on a library of commonly applicable properties. A case study has shown that rigorous and a detailed verification of nontrivial scheduling results can be performed within reasonable time limits, using modern theorem-proving tools such as PVS. It is still necessary to develop and extend such verification efforts to the increasingly complex scheduling algorithms that may one day be used in safety-critical applications. Other aspects relevant to the avionics domain remain insufficiently explored by the formal methods community. For example, little has been done in the analysis of distributed real-time systems, where difficult problems mixing communication, processing, fault tolerance must be addressed. Formal methods are especially valuable in such complex settings, where informal proofs guided by intuition are insufficient and where other validation approaches such as testing are incomplete. Formal methods should become an essential tool for validating the most critical aspects of real-time systems, such as the partitioning mechanisms required for fault isolation in integrated avionics. Real-time scheduling problems are an ideal application area for formal methods since they are subtle and complex, must be certified to the highest degrees of assurance for supporting critical applications, and thus require very precise, detailed, and rigorous verification.

Formal methods should be taught as part of any degree in computing science or software engineering. We believe that discrete mathematics is the foundation upon which software development can be lifted up to the heights of a true engineering discipline. The transfer of formal methods to industry cannot be expected to occur without first transferring, from academia to industry, graduates who are well grounded in suchmathematical techniques. These graduatesmust bring a positive, yet realistic, view on the application of formal methods. Our goal is to produce software engineers who will go out into industry understanding the principles of specification, design and implementation. As these graduates develop their engineering skills, in an industrial setting, they should have the means, and the motivation, to integrate formality and rigour into any environment in which they are found. In this way, the formal methods should start to 'sell themselves'. This paper reports on our first attempt to teach a formal methods course as part of a degree in software engineering. Rather than concentrating on one particular method, we worked on a set of small case studies, using the mathematics in a flexible and intuitive manner, where the students could appreciate the need for formality. Each case study was intended to illustrate, in turn, the need for some fundamental formalism. An unexpected result was that we also identified weaknesses in our understanding of formal methods: students' naive questioning helped us to identify how the methods, and the teaching of these methods, could be improved. In brief, it was not just the students who were learning!

We report on a case study in applying different formal methods to model and verify an architecture for administrating digital signatures. The architecture comprises several concurrently executing systems that authenticate users and generate and store digital signatures by passing security relevant data through a tightly controlled interface. The architecture is interesting from a formal-methods perspective as it involves complex operations on data as well as process coordination and hence is a candidate for both data-oriented and process-oriented formal methods.We have built and verified two models of the signature architecture using two representative formal methods. In the first, we specify a data model of the architecture in Z that we extend to a trace model and interactively verify by theorem proving. In the second, we model the architecture as a system of communicating processes that we verify by finite-state model checking. We provide a detailed comparison of these two different approaches to formalization (infinite state with rich data types versus finite state) and verification (theorem proving versus model checking). Contrary to common belief, our case study suggests that Z is well suited for temporal reasoning about process models with complex operations on data. Moreover, our comparison highlights the advantages of proving theorems about such models and provides evidence that, in the hands of an experienced user, theorem proving may be neither substantially more time-consuming nor more complex than model checking.

The article will discuss how artificial intelligence, increasingly used in the video game industry, has enhanced the process of game design and given players different ways to find entertainment. This is done in an effort to analyze the improvement AI has brought to this field in terms of realism, immersion, and personalization, but also discussing some ethical concerns regarding its implementation. Based on a literature review, case studies, and survey data from gamers, the research discusses how AI applications enable innovative game mechanics, character behaviors, and narrative generation. Main arguments, developed in the article, demonstrate how AI can change players’ interactions by making game environments constantly changeable and adaptive. The article points out the various criticisms associated with AI: the presence of biases in algorithms and the over-reliance on automated systems. It identifies the possible future trends, with further explorations that emphasize the need for ethical consideration in the development of games using AI. This article contributes to an understanding of the role and contribution of AI in shaping the future of video games by providing an insight into a number of key issues which developers and researchers ought to consider.

The increasing complexity and connectivity of automotive systems have raised concerns about their vulnerability to security breaches. As a result, the integration of formal methods and validation techniques has become crucial in ensuring the security of automotive systems. This survey research paper aims to provide a comprehensive overview of the current state-of-the-art formal methods and validation techniques employed in the automotive industry for system security. The paper begins by discussing the challenges associated with automotive system security and the potential consequences of security breaches. Then, it explores various formal methods, such as model checking, theorem proving, and abstract interpretation, which have been widely used to analyze and verify the security properties of automotive systems. Additionally, the survey highlights the validation techniques employed to ensure the effectiveness of security measures, including penetration testing, fault injection, and fuzz testing. Furthermore, the paper examines the integration of formal methods and validation techniques within the automotive development lifecycle, including requirements engineering, design, implementation, and testing phases. It discusses the benefits and limitations of these approaches, considering factors such as scalability, efficiency, and applicability to real-world automotive systems. Through an extensive review of relevant literature and case studies, this survey provides insights into the current research trends, challenges, and open research questions in the field of formal methods and validation techniques for automotive system security. The findings of this survey can serve as a valuable resource for researchers, practitioners, and policymakers involved in the design, development, and evaluation of secure automotive systems.

NASA is researching advanced technologies for future exploration missions using intelligent swarms of robotic vehicles. One of these missions is the Autonomous Nano-Technology Swarm (ANTS) mission that will explore the asteroid belt using 1,000 cooperative autonomous spacecraft. The emergent properties of intelligent swarms make it a potentially powerful concept, but at the same time more difficult to design and ensure that the proper behaviors will emerge. NASA is investigating formal methods and techniques for verification of such missions. The advantage of using formal methods is the ability to mathematically verify the behavior of a swarm, emergent or otherwise. Using the ANTS mission as a case study, we have evaluated multiple formal methods to determine their effectiveness in modeling and ensuring desired swarm behavior. This paper discusses the results of this evaluation and proposes an integrated formal method for ensuring correct behavior of future NASA intelligent swarms.

Designing dependable logic controllers using algebraic specifications

Formal method is an effective way for modeling and verifying concurrent system. An important research field is to describe and verify Web services by formal method. Guaranteeing the validity of Web services composition is necessary for enhancing the value of this composite service. CCS is a kind of process algebra which can be used to model concurrent systems. Web services and their composition are described and modeled based on CCS in this paper. Rules about applying CCS to Web services are explained. Finally, a case study is carried and the validity of composition model is verified. Some important points in verification are discussed