Modular verification of multipliers

1996 ◽  
pp. 49-63 ◽  
Author(s):  
Kavita Ravi ◽  
Abelardo Pardo ◽  
Gary D. Hachtel ◽  
Fabio Somenzi
Keyword(s):  
Modular Verification

scholarly journals Linear capabilities for fully abstract compilation of separation-logic-verified code

2021 ◽  
Vol 31 ◽  
Author(s):  
THOMAS VAN STRYDONCK ◽  
FRANK PIESSENS ◽  
DOMINIQUE DEVRIESE
Keyword(s):  
Spatial Separation ◽  
Separation Logic ◽  
Target Language ◽  
Fine Grained ◽  
Dynamic Contract ◽  
Modular Verification ◽  
Source Program ◽  
Memory Accesses ◽  
Memory Resources ◽  
Efficient Memory

Abstract Separation logic is a powerful program logic for the static modular verification of imperative programs. However, dynamic checking of separation logic contracts on the boundaries between verified and untrusted modules is hard because it requires one to enforce (among other things) that outcalls from a verified to an untrusted module do not access memory resources currently owned by the verified module. This paper proposes an approach to dynamic contract checking by relying on support for capabilities, a well-studied form of unforgeable memory pointers that enables fine-grained, efficient memory access control. More specifically, we rely on a form of capabilities called linear capabilities for which the hardware enforces that they cannot be copied. We formalize our approach as a fully abstract compiler from a statically verified source language to an unverified target language with support for linear capabilities. The key insight behind our compiler is that memory resources described by spatial separation logic predicates can be represented at run time by linear capabilities. The compiler is separation-logic-proof-directed: it uses the separation logic proof of the source program to determine how memory accesses in the source program should be compiled to linear capability accesses in the target program. The full abstraction property of the compiler essentially guarantees that compiled verified modules can interact with untrusted target language modules as if they were compiled from verified code as well. This article is an extended version of one that was presented at ICFP 2019 (Van Strydonck et al., 2019).

Modular verification of programs with effects and effects handlers

2020 ◽  
Author(s):  
Thomas Letan ◽  
Yann Régis-Gianas ◽  
Pierre Chifflier ◽  
Guillaume Hiet
Keyword(s):  
Modular Verification

scholarly journals Kami: a platform for high-level parametric hardware specification and its modular verification

2017 ◽  
Vol 1 (ICFP) ◽  
pp. 1-30 ◽  
Author(s):  
Joonwon Choi ◽  
Muralidaran Vijayaraghavan ◽  
Benjamin Sherman ◽  
Adam Chlipala ◽  
Arvind
Keyword(s):  
Modular Verification ◽  
High Level ◽  
Hardware Specification

scholarly journals Modular verification of chemical reaction network encodings via serializability analysis

2016 ◽  
Vol 632 ◽  
pp. 21-42 ◽  
Author(s):  
Matthew R. Lakin ◽  
Darko Stefanovic ◽  
Andrew Phillips
Keyword(s):  
Chemical Reaction ◽  
Reaction Network ◽  
Chemical Reaction Network ◽  
Modular Verification

Modular Verification of Dynamic Properties for Reactive Systems

IFM’99 ◽  
1999 ◽  
pp. 89-108 ◽  
Author(s):  
J. Julliand ◽  
P.-A. Masson ◽  
H. Mountassir
Keyword(s):  
Dynamic Properties ◽  
Reactive Systems ◽  
Modular Verification

scholarly journals An Abstract Contract Theory for Programs with Procedures

2021 ◽  
pp. 152-171
Author(s):  
Christian Lidström ◽  
Dilian Gurov
Keyword(s):  
Programming Languages ◽  
Contract Theory ◽  
Denotational Semantics ◽  
The Other ◽  
Hoare Logic ◽  
Basic Building Block ◽  
Sequential Programming ◽  
Modular Verification ◽  
The One ◽  
Meta Theory

AbstractWhen developing complex software and systems, contracts provide a means for controlling the complexity by dividing the responsibilities among the components of the system in a hierarchical fashion. In specific application areas, dedicated contract theories formalise the notion of contract and the operations on contracts in a manner that supports best the development of systems in that area. At the other end, contract meta-theories attempt to provide a systematic view on the various contract theories by axiomatising their desired properties. However, there exists a noticeable gap between the most well-known contract meta-theory of Benveniste et al. [5], which focuses on the design of embedded and cyber-physical systems, and the established way of using contracts when developing general software, following Meyer’s design-by-contract methodology [18]. At the core of this gap appears to be the notion of procedure: while it is a central unit of composition in software development, the meta-theory does not suggest an obvious way of treating procedures as components.In this paper, we provide a first step towards a contract theory that takes procedures as the basic building block, and is at the same time an instantiation of the meta-theory. To this end, we propose an abstract contract theory for sequential programming languages with procedures, based on denotational semantics. We show that, on the one hand, the specification of contracts of procedures in Hoare logic, and their procedure-modular verification, can be cast naturally in the framework of our abstract contract theory. On the other hand, we also show our contract theory to fulfil the axioms of the meta-theory. In this way, we give further evidence for the utility of the meta-theory, and prepare the ground for combining our instantiation with other, already existing instantiations.

scholarly journals Flashix: Modular Verification of a Concurrent and Crash-Safe Flash File System

2021 ◽  
pp. 239-265
Author(s):  
Stefan Bodenmüller ◽  
Gerhard Schellhorn ◽  
Martin Bitterlich ◽  
Wolfgang Reif
Keyword(s):  
File System ◽  
Modular Verification

scholarly journals Modular Verification of Concurrency-Aware Linearizability

2015 ◽  
pp. 371-387 ◽  
Author(s):  
Nir Hemed ◽  
Noam Rinetzky ◽  
Viktor Vafeiadis
Keyword(s):  
Modular Verification
Sign in / Sign up

Export Citation Format

Share Document