Filters








5,093 Hits in 7.2 sec

Automated Verification of Reactive and Concurrent Programs by Calculation [article]

Simon Foster, Kangfeng Ye, Ana Cavalcanti, Jim Woodcock
2021 arXiv   pre-print
With this we can calculate a reactive program's denotational semantics, and thereby facilitate automated proof.  ...  Of note is our reasoning support for iterative programs with reactive invariants, based on Kleene algebra, and for parallel composition. We illustrate our strategy by verifying a reactive buffer.  ...  Acknowledgments This research is funded by the CyPhyAssure project 9 , EPSRC grant EP/S001190/1, the RoboCalc project 10 , EPSRC grant EP/M025756/1, and the Royal Academy of Engineering.  ... 
arXiv:2007.13529v2 fatcat:v2xwbwr7pvc3de5m7gp53gbv44

Calculational Verification of Reactive Programs with Reactive Relations and Kleene Algebra [article]

Simon Foster, Kangfeng Ye, Ana Cavalcanti, Jim Woodcock
2018 arXiv   pre-print
With this we can calculate a reactive program's denotational semantics, and thereby facilitate automated proof.  ...  Of note is our reasoning support for iterative programs with reactive invariants, which is supported by Kleene algebra. We illustrate our strategy by verifying a reactive buffer.  ...  Acknowledgments This research is funded by the RoboCalc project 3 , EPSRC grant EP/M025756/1.  ... 
arXiv:1806.02101v2 fatcat:nsxrfpwiqvh3lmothiqv4ga6wm

Calculational Verification of Reactive Programs with Reactive Relations and Kleene Algebra [chapter]

Simon Foster, Kangfeng Ye, Ana Cavalcanti, Jim Woodcock
2018 Lecture Notes in Computer Science  
With this we can calculate a reactive program's denotational semantics, and thereby facilitate automated proof.  ...  Of note is our reasoning support for iterative programs with reactive invariants, which is supported by Kleene algebra. We illustrate our strategy by verifying a reactive buffer.  ...  Acknowledgments This research is funded by the RoboCalc project 3 , EPSRC grant EP/M025756/1.  ... 
doi:10.1007/978-3-030-02149-8_13 fatcat:2mlcyy36qvgnjj5f4v54556g7q

Automating Verification of State Machines with Reactive Designs and Isabelle/UTP [article]

Simon Foster, James Baxter, Ana Cavalcanti, Alvaro Miyazawa, Jim Woodcock
2018 arXiv   pre-print
In this paper, we present a verification approach for a diagrammatic state machine language that utilises theorem proving and a denotational semantics based on Unifying Theories of Programming (UTP).  ...  To ensure these systems are safe and predictable, formal verification techniques are important, and can be cost-effective if they are both automated and scalable.  ...  This work is funded by the EPSRC projects RoboCalc 4 (Grant EP/M025756/1) and CyPhyAssure (Grant EP/S001190/1), and the Royal Academy of Engineering.  ... 
arXiv:1807.08588v1 fatcat:nboohuqn3rh7dmmax7cqud4taa

Unifying Theories of Reactive Design Contracts [article]

Simon Foster, Ana Cavalcanti, Samuel Canham, Jim Woodcock, Frank Zeyda
2019 arXiv   pre-print
We provide a language for expression and composition of contracts that is supported by a rich calculational theory.  ...  In this paper, we describe a unifying theory for reactive design contracts that provides the basis for modelling and verification of reactive systems.  ...  Acknowledgements This research is funded by the CyPhyAssure project 4 , EPSRC grant EP/S001190/1, the RoboCalc project 5 , EPSRC grant EP/M025756/1, and the EU Horizon 2020 project "INTO-CPS", grant agreement  ... 
arXiv:1712.10233v2 fatcat:nucijwgabvbx5e2takfqiubtou

A Repository for Tarski-Kleene Algebras

Walter Guttmann, Georg Struth, Tjark Weber
2011 Workshop on Automated Theory Engineering  
This paper describes the present state of the repository, illustrates its potential by a theory engineering and a program verification example, and discusses the most important directions for future work  ...  It covers variants of Kleene algebras and relation algebras with many of their models. Most theorems have been obtained by automated theorem proving within Isabelle.  ...  Walter Guttmann was supported by the Postdoc-Programme of the German Academic Exchange Service (DAAD). Georg Struth acknowledges funding from EPSRC grant EP/G031711/1.  ... 
dblp:conf/ate/GuttmannSW11 fatcat:gsxscqdtvfhtfkmx2ikwr6yfci

Formal Synthesis of Safe Stop Tactical Planners for an Automated Vehicle

Jonas Krook, Roozbeh Kianfar, Martin Fabian
2020 IFAC-PapersOnLine  
Formal verification has some drawbacks, so this paper investigates the applicability of using the tools Supremica and TuLiP to synthesize correct-by-construction tactical planners.  ...  Formal verification has some drawbacks, so this paper investigates the applicability of using the tools Supremica and TuLiP to synthesize correct-by-construction tactical planners.  ...  This work was partially supported by the Wallenberg AI, Autonomous Systems and Software Program (WASP) funded by the Knut and Alice Wallenberg Foundation.  ... 
doi:10.1016/j.ifacol.2021.04.059 fatcat:ou3iji3cvnbmblckmpbn7axg7a

Strategic directions in concurrency research

Rance Cleaveland, Scott A. Smolka
1996 ACM Computing Surveys  
ACKNOWLEDGMENTS This report has benefited from helpful comments from Chris Hankin, Michael Loui, Jack Stankovic, and Peter Wegner.  ...  By focusing on concurrency theory and its use in verification, we necessarily omit consideration of other concurrency-related topics such as concurrency control in database systems, concurrent program  ...  The remainder of Section 2 reviews some of the applications in the area of programming languages and system verification to which concurrency theory has been put. Concurrent programming languages.  ... 
doi:10.1145/242223.242252 fatcat:4gu2wurduveqdhqqrhr27yaqjq

UCLID5: Multi-Modal Formal Modeling, Verification, and Synthesis [article]

Elizabeth Polgreen, Kevin Cheang, Pranav Gaddamadugu, Adwait Godbole, Kevin Laeufer, Shaokai Lin, Yatin A. Manerkar, Federico Mora, Sanjit A. Seshia
2021 Zenodo  
A novel aspect of UCLID5 is an emphasis on the use of syntax-guided and inductive synthesis to automate steps in modeling and verification.  ...  UCLID5 is a tool for the multi-modal formal modeling, verification,and synthesis of systems.  ...  Acknowledgments: The UCLID5 project is grateful for the significant contributions by the late Pramod Subramanyan, one of the original creators of the tool.  ... 
doi:10.5281/zenodo.6557711 fatcat:si6njrzuorexhdskw4q4srzpeq

Formal Methods in Factory Automation [chapter]

Corina Popescu, Jose L. Martinez Lastr
2010 Factory Automation  
., 2008) , where overall system behavior is influenced by concurrent local decisions taken by networks of individual problem solvers that cooperate.  ...  These phenomena are caused by the inappropriate allocation of resources to concurrent executing processes.  ...  Factory Automation Edited by Javier Silvestre-Blanes Hard cover, 602 pages Factory automation has evolved significantly in the last few decades, and is today a complex, interdisciplinary, scientific area  ... 
doi:10.5772/9526 fatcat:47wmxx5dwjd7rdnc554rur3jou

Formal Specification and Verification of Communication in Network-On-Chip: An Overview

Fateh Boutekkouk
2018 International Journal of Recent Contributions from Engineering, Science & IT  
In this paper we try to giva an overview of the most famous formal methods applied to the verification of communication inside NOCs.  ...  Network-On-Chip (NOC) is an emerging paradigm to surmount traditional bus based Systems-On-Chip (SOC) limits especially scalability and communication performances.  ...  Comparatively to Z, Event B seems to be more appropriate for NOC verification since it supports many hardware aspects at higher level of abstraction like reactivity and concurrency.  ... 
doi:10.3991/ijes.v6i4.9416 fatcat:7fljmcayfvdgpd7v3d4vt7lkvu

Environment behavior models for scenario generation and testing automation

Mikhail Auguston, James Bret Michael, Man-Tak Shing
2005 Proceedings of the first international workshop on Advances in model-based testing - A-MOST '05  
This paper suggests an approach to automatic scenario generation from environment models for testing of real-time reactive systems.  ...  The behavior of the system is defined as a set of events (event trace) with two basic relations: precedence and inclusion.  ...  The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of the  ... 
doi:10.1145/1083274.1083284 dblp:conf/amost/AugustonMS05 fatcat:2rcqadzin5gmlhdhqjfwmwdkyy

Environment behavior models for scenario generation and testing automation

Mikhail Auguston, James Bret Michael, Man-Tak Shing
2005 Software engineering notes  
This paper suggests an approach to automatic scenario generation from environment models for testing of real-time reactive systems.  ...  the data needed, and completing and reviewing the collection of information.  ...  The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of the  ... 
doi:10.1145/1082983.1083284 fatcat:b5xq7uglufasrolcxkxieagovq

poST: A Process-Oriented Extension of the IEC 61131-3 Structured Text Language

Vladimir E. Zyubin, Andrei S. Rozov, Igor S. Anureev, Natalia O. Garanina, Valeriy Vyatkin
2022 IEEE Access  
The poST language assumes that a poST-program is a set of weakly connected concurrent processes, structurally and functionally corresponding to the technological description of the plant.  ...  The states are specified by a set of the ST constructs, extended by TIMEOUT operation, SET STATE operation, and START / STOP / check state operations to communicate with other processes.  ...  ACKNOWLEDGMENT The authors thank the JetBrains Foundation for the charitable support of our research activity.  ... 
doi:10.1109/access.2022.3157601 fatcat:5rsznu243zbgzmrenmhcnwa5fq

Applying Formal Methods to Networking: Theory, Techniques, and Applications

Junaid Qadir, Osman Hasan
2015 IEEE Communications Surveys and Tutorials  
This has also led to a great resurgence in interest of applying formal methods to specification, verification, and synthesis of networking protocols and applications.  ...  of architecture and abstractions.  ...  Although, there are various approaches that have been proposed to support verification of concurrent programs, more research needs to be 14 The electronic design automation (EDA) industry in hardware  ... 
doi:10.1109/comst.2014.2345792 fatcat:oc6l6pn4tnddjbbr5v4gbbuycq
« Previous Showing results 1 — 15 out of 5,093 results