KIT | KIT-Bibliothek | Impressum | Datenschutz

Scalability and Precision by Combining Expressive Type Systems and Deductive Verification

Lanzinger, Florian ORCID iD icon; Weigl, Alexander ORCID iD icon; Ulbrich, Mattias ORCID iD icon; Dietl, Werner


Type systems and modern type checkers can be used very successfully to obtain formal correctness guarantees with little specification overhead. However, type systems in practical scenarios have to trade precision for decidability and scalability. Tools for deductive verification, on the other hand, can prove general properties in more cases than a typical type checker can, but they do not scale well. We present a method to complement the scalability of expressive type systems with the precision of deductive program verification approaches. This is achieved by translating the type uses whose correctness the type checker cannot prove into assertions in a specification language, which can be dealt with by a deductive verification tool. Type uses whose correctness the type checker can prove are instead turned into assumptions to aid the verification tool in finding a proof.Our novel approach is introduced both conceptually for a simple imperative language, and practically by a concrete implementation for the Java programming language. The usefulness and power of our approach has been evaluated by discharging known false positives from a real-world program and by a small case study.

Verlagsausgabe §
DOI: 10.5445/IR/1000139256
Veröffentlicht am 22.10.2021
DOI: 10.1145/3485520
Zitationen: 2
Zitationen: 2
Cover der Publikation
Zugehörige Institution(en) am KIT Institut für Informationssicherheit und Verlässlichkeit (KASTEL)
Kompetenzzentrum für angewandte Sicherheitstechnologie (KASTEL)
Publikationstyp Zeitschriftenaufsatz
Publikationsjahr 2021
Sprache Englisch
Identifikator ISSN: 2475-1421
KITopen-ID: 1000139256
HGF-Programm 46.23.01 (POF IV, LK 01) Methods for Engineering Secure Systems
Erschienen in Proceedings of the ACM on programming languages
Verlag Association for Computing Machinery (ACM)
Band 5
Seiten Article no: 143
Vorab online veröffentlicht am 15.10.2021
Schlagwörter Pluggable type systems, Deductive verification, Refinement types
Nachgewiesen in Scopus
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page