Proving Consistency and Completeness of Model Classes Using Theory Interpretation

Darvas, Ádám; Müller, Péter

doi:10.1007/978-3-642-12029-9_16

Cited by 2 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For deductive verification purposes, the classes may be translated to elements of theories of the underlying theorem provers. In this case, the faithfulness of the mapping may be checked [3].…”

Section: Discussionmentioning

confidence: 99%

Ghosts for Lists: From Axiomatic to Executable Specifications

2018

View full text Add to dashboard Cite

Internet of Things (IoT) applications are becoming increasingly critical and require formal verification. Our recent work presented formal verification of the linked list module of Contiki, an OS for IoT. It relies on a parallel view of a linked list via a companion ghost array and uses an inductive predicate to link both views. In this work, a few interactively proved lemmas allow for the automatic verification of the list functions specifications, expressed in the acsl specification language and proved with the Frama-C/Wp tool. In a broader verification context, especially as long as the whole system is not yet formally verified, it would be very useful to use runtime verification, in particular, to test client modules that use the list module. It is not possible with the current specifications, which include an inductive predicate and axiomatically defined functions. In this early-idea paper we show how to define a provably equivalent non-inductive predicate and a provably equivalent non-axiomatic function that belong to the executable subset e-acsl of acsl and can be transformed into executable C code. Finally, we propose an extension of Frama-C to handle both axiomatic specifications for deductive verification and executable specifications for runtime verification.

show abstract

Section: Discussionmentioning

confidence: 99%

Ghosts for Lists: From Axiomatic to Executable Specifications

2018

View full text Add to dashboard Cite

show abstract

“…sets or sequences) that can be translated into elements of theories of provers: they can therefore also be used in deductive verification tasks. It is possible to verify the faithfulness of the translation [8].…”

Section: Related Workmentioning

confidence: 99%

Logic against ghosts

Blanchard

Kosmatov²,

Loulergue

2019

Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing

View full text Add to dashboard Cite

Modern verification projects continue to offer new challenges for formal verification. One of them is the linked list module of Contiki, a popular open-source operating system for the Internet of Things. It has a rich API and uses a particular list representation that make it different from the classical linked list implementations. Being widely used in the OS, the list module is critical for reliability and security. A recent work verified the list module using ghost arrays.This article reports on a new verification effort for this module. Realized in the Frama-C/Wp tool, the new approach relies on logic lists. A logic list provides a convenient high-level view of the linked list. The specifications of all functions are now proved faster and almost all automatically, only a small number of auxiliary lemmas and a couple of assertions being proved interactively in Coq. The proposed specifications are validated by proving a few client functions manipulating lists. During the verification, a more efficient implementation for one function was found and verified. We compare the new approach with the previous effort based on ghost arrays, and discuss the benefits and drawbacks of both techniques.

show abstract

Proving Consistency and Completeness of Model Classes Using Theory Interpretation

Cited by 2 publications

References 16 publications

Ghosts for Lists: From Axiomatic to Executable Specifications

Ghosts for Lists: From Axiomatic to Executable Specifications

Logic against ghosts

Contact Info

Product

Resources

About