当前期刊: Formal Aspects of Computing Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
  • Runtime enforcement of timed properties using games
    Form. Asp. Comput. (IF 0.516) Pub Date : 2020-07-28
    Matthieu Renard, Antoine Rollet, Yliès Falcone

    This paper deals with runtime enforcement of timed properties with uncontrollable events. Runtime enforcement consists in defining and using an enforcement mechanism that modifies the executions of a running system to ensure their correctness with respect to the desired property. Uncontrollable events cannot be modified by the enforcement mechanisms and thus have to be released immediately. We present

  • Formal Verification of Robotic Cell Injection systems up to 4-DOF using HOL Light
    Form. Asp. Comput. (IF 0.516) Pub Date : 2020-06-22
    Adnan Rashid, Osman Hasan

    Cell injection is an approach used for the delivery of small sample substances into a biological cell and is widely used in drug development, gene injection, intracytoplasmic sperm injection and in-vitro fertilization. Robotic cell injection systems provide the automation of the process as opposed to the manual and semi-automated cell injection systems, which require expert operators and involve time

  • Theoretical and Practical Approaches to the Denotational Semantics for MDESL based on UTP
    Form. Asp. Comput. (IF 0.516) Pub Date : 2020-06-15
    Feng Sheng, Huibiao Zhu, Jifeng He, Zongyuan Yang, Jonathan P. Bowen

    The hardware description language Verilog has been standardized and widely used in industry. Multithreaded Discrete Event Simulation Language (MDESL) is a Verilog-like language and it contains a rich variety of interesting features such as the event-driven computation and shared-variable concurrency as well as the realtime feature. In this paper, we present the denotational semantics for MDESL based

  • Modeling and Verification of A Timing Protection Mechanism in the OSEK/VDX OS using CSP
    Form. Asp. Comput. (IF 0.516) Pub Date : 2020-05-25
    Yanhong Huang, Haiping Pang, Jianqi Shi

    The functions of automobiles are becoming increasingly intelligent, which leads to the increasing number of electrical control units for one automobile. Hence, it makes software migration and extension more complicated. In order to avoid these problems, the standard OSEK/VDX has been proposed jointly by a German automotive company consortium and the University of Karlsruhe. This standard provides specifications

  • Legislation-driven development of a Gift Aid system using Event-B
    Form. Asp. Comput. (IF 0.516) Pub Date : 2020-05-25
    David M. Williams, Salaheddin Darwish, Steve Schneider, David R. Michael

    This work presents our approach to formally model the Swiftaid system design, a digital platform that enables donors to automatically add Gift Aid to donations made via card payments. Following principles of Behaviour-Driven Development, we use Gherkin to capture requirements specified in legislation, specifically the UK Charity (Gift Aid Declarations) Regulations 2016. The Gherkin scenarios provide

  • Collaborative models for autonomous systems controller synthesis
    Form. Asp. Comput. (IF 0.516) Pub Date : 2020-04-16
    Douglas Fraser, Ruben Giaquinta, Ruth Hoffmann, Murray Ireland, Alice Miller, Gethin Norman

    We show how detailed simulation models and abstract Markov models can be developed collaboratively to generate and implement effective controllers for autonomous agent search and retrieve missions. We introduce a concrete simulation model of an Unmanned Aerial Vehicle (UAV). We then show how the probabilistic model checker PRISM is used for optimal strategy synthesis for a sequence of scenarios relevant

  • PuRSUE -from specification of robotic environments to synthesis of controllers
    Form. Asp. Comput. (IF 0.516) Pub Date : 2020-03-23
    Marcello M. Bersani, Matteo Soldo, Claudio Menghi, Patrizio Pelliccione, Matteo Rossi

    Developing robotic applications is a complex task, which requires skills that are usually only possessed by highly-qualified robotic developers. While formal methods that help developers in the creation and design of robotic applications exist, they must be explicitly customized to be impactful in the robotics domain and to support effectively the growth of the robotic market. Specifically, the robotic

  • Stepwise development and model checking of a distributed interlocking system using RAISE
    Form. Asp. Comput. (IF 0.516) Pub Date : 2020-02-21
    S. Geisler, A. E. Haxthausen

    This paper considers the challenge of designing and verifying control protocols for geographically distributed railway interlocking systems. It describes how this challenge can be tackled by stepwise development and model checking of state transition system models in a new extension of the RAISE Specification Language. Railway interlocking systems are reconfigurable systems which can be configured

  • Formal analysis of the compact position reporting algorithm
    Form. Asp. Comput. (IF 0.516) Pub Date : 2020-02-11
    Aaron Dutle, Mariano Moscato, Laura Titolo, César Muñoz, Gregory Anderson, François Bobot

    The Automatic Dependent Surveillance-Broadcast (ADS-B) system allows aircraft to communicate current state information, including position and velocity messages, to other aircraft in their vicinity and to ground stations. The Compact Position Reporting (CPR) algorithm is the ADS-B protocol responsible for the encoding and decoding of aircraft positions. CPR is sensitive to computer arithmetic since

  • Using formal verification to evaluate the execution time of Spark applications
    Form. Asp. Comput. (IF 0.516) Pub Date : 2020-02-05
    L. Baresi, M. M. Bersani, F. Marconi, G. Quattrocchi, M. Rossi

    Apache Spark is probably the most widely adopted framework for developing big-data batch applications and for executing them on a cluster of (virtual) machines. In general, the more resources (machines) one uses, the faster applications execute, but there is currently no adequate means to determine the proper size of a Spark cluster given time constraints, or to foresee execution times given the number

  • Formal reliability and failure analysis of ethernet based communication networks in a smart grid substation
    Form. Asp. Comput. (IF 0.516) Pub Date : 2020-01-27
    Waqar Ahmad, Osman Hasan, Sofiène Tahar

    Secure and continuous operation of a smart grid substation mainly depends upon the reliable functioning of its communication network. The communication system of a smart substation is typically based on a high performance Ethernet communication network that connects various intelligent embedded devices, such as Intelligent Electronic Devices (IED) andMerging Units (MU), to ensure continuous monitoring

  • Correction to: Multiple model synchronization with multiary delta lenses with amendment and K-Putput
    Form. Asp. Comput. (IF 0.516) Pub Date : 2020-01-15
    Zinovy Diskin, Harald König, Mark Lawford

    Owing to a production error, the reference in footnote

  • Fifty years of Hoare’s logic
    Form. Asp. Comput. (IF 0.516) Pub Date : 2019-11-27
    Krzysztof R. Apt, Ernst-Rüdiger Olderog

    We present a history of Hoare’s logic.

  • Linearizability on hardware weak memory models
    Form. Asp. Comput. (IF 0.516) Pub Date : 2019-11-15
    Graeme Smith, Kirsten Winter, Robert J. Colvin

    Linearizability is a widely accepted notion of correctness for concurrent objects. Recent research has investigated redefining linearizability for particular hardware weak memory models, in particular for TSO. In this paper, we provide an overview of this research and show that such redefinitions of linearizability are not required: under an interpretation of specification behaviour which abstracts

  • Bisimulation and Coinduction Enhancements: A Historical Perspective
    Form. Asp. Comput. (IF 0.516) Pub Date : 2019-11-08
    Damien Pous, Davide Sangiorgi

    Bisimulation is an instance of coinduction. Both bisimulation and coinduction are today widely used, in many areas of Computer Science, as well as outside Computer Science. Over, roughly, the last 25 years, enhancements of the principles and methods related to bisimulation and coinduction (i.e., techniques to make proofs shorter and simpler) have become a research topic on its own. In the paper the

  • Assembling a prehistory for formal methods: a personal view
    Form. Asp. Comput. (IF 0.516) Pub Date : 2019-09-25
    Thomas Haigh

    The history of formal methods has barely been written. Haigh recapitulates his own exposure to relevant material during three phases of his development as a scholar: as a student of computer science, as a graduate student in history, and as a professor researching the history of computing. Triangulating these perspectives suggests that formal methods is one of several strands emerging from a community

  • From LCF to Isabelle/HOL
    Form. Asp. Comput. (IF 0.516) Pub Date : 2019-09-02
    Lawrence C. Paulson, Tobias Nipkow, Makarius Wenzel

    Interactive theorem provers have developed dramatically over the past four decades, from primitive beginnings to today’s powerful systems. Here, we focus on Isabelle/HOL and its distinctive strengths. They include automatic proof search, borrowing techniques from the world of first order theorem proving, but also the automatic search for counterexamples. They include a highly readable structured language

  • Interactive verification of architectural design patterns in FACTum
    Form. Asp. Comput. (IF 0.516) Pub Date : 2019-07-30
    Diego Marmsoler, Habtom Kashay Gidey

    Architectural design patterns (ADPs) are architectural solutions to common architectural design problems. They are an important concept in software architectures used for the design and analysis of architectures. An ADP usually constrains the design of an architecture and, in turn, guarantees some desired properties for architectures implementing it. Sometimes, however, the constraints imposed by an

  • Milestones from the Pure Lisp theorem prover to ACL2
    Form. Asp. Comput. (IF 0.516) Pub Date : 2019-07-30
    J. Strother Moore

    We discuss the evolutionary path from the Edinburgh Pure Lisp Theorem Prover of the early 1970s to its modern counterpart, AComputational Logic for Applicative Common Lisp, aka ACL2, which is in regular industrial use. Among the milestones in this evolution are the adoption of a first-order subset of a programming language as a logic; the analysis of recursive definitions to guess appropriate mathematical

Contents have been reproduced by permission of the publishers.