Correct Code Containing Containers

Claire Dross (1, 2) , Jean-Christophe Filliâtre (1, 2) , Yannick Moy (3)

1 LRI - Laboratoire de Recherche en Informatique
2 PROVAL - Proof of Programs
3 AdaCore (FRANCE)

For critical software development, containers such as lists, vectors, sets or maps are an attractive alternative to ad-hoc data structures based on pointers. As standards like DO-178C put formal verification and testing on an equal footing, it is important to give users the ability to apply both to the verification of code using containers. In this paper, we present a definition of containers whose aim is to facilitate their use in certified software, using modern proof technology and novel specification languages. Correct usage of containers and user-provided correctness properties can be checked either by execution during testing or by formal proof with an automatic prover. We present a formal semantics for containers and an axiomatization of this semantics targeted at automatic provers. We have proved in Coq that the formal semantics is consistent and that the axiomatization thereof is correct.

Domaines: Logique en informatique [cs.LO]

Claire Dross, Jean-Christophe Filliâtre, Yannick Moy. Correct Code Containing Containers. TAP - 5th International Conference on Tests and Proofs, 2011, Zurich, Switzerland. ⟨hal-00777683⟩