scispace - formally typeset
Open Access

Toward a methodology for unified verication of hardware/software co-designs

Reads0
Chats0
TLDR
In this paper, an ideal security verification solution for mixed hardware/software systems is presented, relying on ProVerif, and applied to a remote at-testation system (SMART).
Abstract
Critical and private applications of smart and connected objects such as health-related objects are now common, thus raising the need to design these objects with strong security guarantees. Many re- cent works offer practical hardware-assisted security solutions that take advantage of a tight cooperation between hardware and software to provide system-level security guarantees. Formally and consistently proving the efficiency of these solutions raises challenges since software and hardware verifications approaches generally rely on different representations. The paper first sketches an ideal security verification solution naturally handling both hardware and software components. Next, it proposes an evaluation of formal verification methods that have already been pro- posed for mixed hardware/software systems, with regards to the ideal method. At last, the paper presents a conceptual approach to this ideal method relying on ProVerif, and applies this approach to a remote at- testation system (SMART).

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Formal Techniques for Effective Co-verification of Hardware/Software Co-designs

TL;DR: An approach that uses a bounded co-verification tool, HW-CBMC, for formally validating hardware/software co-designs written in Verilog and C and proving bounded safety properties as well as discovering critical co- design bugs on a large and complex text analytics FPGA accelerator from IBM®.
Posted Content

Formally Verified Hardware/Software Co-Design for Remote Attestation

TL;DR: This work designs and verifies an architecture called VRASED: Verifiable Remote Attestation for Simple Embedded Devices, which it is believed is the first formally verified RA scheme and also the first formal verification of a HW/SW implementation of any security service.
References
More filters
Journal ArticleDOI

On the security of public key protocols

TL;DR: Several models are formulated in which the security of protocols can be discussed precisely, and algorithms and characterizations that can be used to determine protocol security in these models are given.
Journal ArticleDOI

Symbolic execution and program testing

TL;DR: A particular system called EFFIGY which provides symbolic execution for program testing and debugging is described, which interpretively executes programs written in a simple PL/I style programming language.
Book ChapterDOI

Symbolic Model Checking without BDDs

TL;DR: This paper shows how boolean decision procedures, like Stalmarck's Method or the Davis & Putnam Procedure, can replace BDDs, and introduces a bounded model checking procedure for LTL which reduces model checking to propositional satisfiability.
Book ChapterDOI

Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

TL;DR: It is shown that it is possible to automatically synthesize the synchronization skeleton of a concurrent program from a Temporal Logic specification and it is believed that this approach may in the long run turn out to be quite practical.
Book ChapterDOI

Counterexample-guided abstraction refinement

TL;DR: Counterexample-guided abstraction refinement is an automatic abstraction method where the key step is to extract information from false negatives ("spurious counterexamples") due to over-approximation.