scholarly journals Compositional Verification using Model Checking and Theorem Proving

2020 ◽  
pp. 305-314
Author(s):  
Diego Marmsoler
Keyword(s):  
Distributed Systems ◽  
Model Checking ◽  
Embedded Systems ◽  
Theorem Proving ◽  
Formal Modeling ◽  
Compositional Verification ◽  
Modeling And Analysis ◽  
Simple Version ◽  
Evolving Systems ◽  
Alternative Approach

AbstractCollaborative embedded systems form groups in which individual systems collaborate to achieve an overall goal. To this end, new systems may join a group and participating systems can leave the group. Classical techniques for the formal modeling and analysis of distributed systems, however, are mainly based on a static notion of systems and thus are often not well suited for the modeling and analysis of collaborative embedded systems. In this chapter, we propose an alternative approach that allows for the verification of dynamically evolving systems and we demonstrate it in terms of a running example: a simple version of an adaptable and flexible factory.

scholarly journals Gobra: Modular Specification and Verification of Go Programs

2021 ◽  
pp. 367-379
Author(s):  
Felix A. Wolf ◽  
Linard Arquint ◽  
Martin Clochard ◽  
Wytse Oortwijn ◽  
João C. Pereira ◽  
...  
Keyword(s):  
Distributed Systems ◽  
Programming Language ◽  
Message Passing ◽  
Safety Data ◽  
Separation Logic ◽  
Data Race ◽  
Static Verification ◽  
Crash Safety ◽  
Concurrent And Distributed Systems ◽  
Systems Programming

AbstractGo is an increasingly-popular systems programming language targeting, especially, concurrent and distributed systems. Go differentiates itself from other imperative languages by offering structural subtyping and lightweight concurrency through goroutines with message-passing communication. This combination of features poses interesting challenges for static verification, most prominently the combination of a mutable heap and advanced concurrency primitives.We present Gobra, a modular, deductive program verifier for Go that proves memory safety, crash safety, data-race freedom, and user-provided specifications. Gobra is based on separation logic and supports a large subset of Go. Its implementation translates an annotated Go program into the Viper intermediate verification language and uses an existing SMT-based verification backend to compute and discharge proof obligations.

Sign in / Sign up

Export Citation Format

Share Document