Claire Dross

dblp:07/9840 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 5 · 3 first-author · 2 since 2021Theory of computation · 2 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-author
YearPublicationVenuePosition
2025 Two-Way Collaboration Between Flow and Proof in SPARK
Claire Dross, Joffrey Huguet, Johannes Kanig
VMCAI (1)1
2021 VerifyThis 2019: a program verification competition
abstract
Abstract VerifyThis is a series of program verification competitions that emphasize the human aspect: participants tackle the verification of detailed behavioral properties—something that lies beyond the capabilities of fully automatic verification and requires instead human expertise to suitably encode programs, specifications, and invariants. This paper describes the 8th edition of VerifyThis, which took place at ETAPS 2019 in Prague. Thirteen teams entered the competition, which consisted of three verification challenges and spanned 2 days of work. This report analyzes how the participating teams fared on these challenges, reflects on what makes a verification challenge more or less suitable for the typical VerifyThis participants, and outlines the difficulties of comparing the work of teams using wildly different verification approaches in a competition focused on the human aspect.
Claire Dross, Carlo A. Furia, Marieke Huisman, Rosemary Monahan, Peter Müller 0001
Int. J. Softw. Tools Technol. Transf.1
2020 Recursive Data Structures in SPARK
abstract
SPARK is both a deductive verification tool for the Ada language and the subset of Ada on which it operates. In this paper, we present a recent extension of the SPARK language and toolset to support pointers. This extension is based on an ownership policy inspired by Rust to enforce non-aliasing through a move semantics of assignment. In particular, we consider pointer-based recursive data structures, and discuss how they are supported in SPARK. We explain how iteration over these structures can be handled using a restricted form of aliasing called local borrowing. To avoid introducing a memory model and to stay in the first-order logic background of SPARK, the relation between the iterator and the underlying structure is encoded as a predicate which is maintained throughout the program control flow. Special first-order contracts, called pledges, can be used to describe this relation. Finally, we give examples of programs that can be verified using this framework.
Claire Dross, Johannes Kanig
CAV (2)1
2020 Verification of Programs with Pointers in SPARK
Georges-Axel Jaloyan, Claire Dross, Maroua Maalej, Yannick Moy, Andrei Paskevich
ICFEM2
2019 Practical Application of SPARK to OpenUxAS
M. Anthony Aiello, Claire Dross, Patrick Rogers, Laura R. Humphrey, James Hamil
FM2
2016 Adding Decision Procedures to SMT Solvers Using Axioms with Triggers
Claire Dross, Sylvain Conchon, Johannes Kanig, Andrei Paskevich
J. Autom. Reason.1