Viper: A Verification Infrastructure for Permission-Based Reasoning

Müller, Péter; Schwerhoff, Malte; Summers, Alexander J.

doi:10.1007/978-3-662-49122-5_2

Cited by 195 publications

(168 citation statements)

References 35 publications

Supporting

Mentioning

168

Contrasting

Order By: Relevance

“…Viper [30,42] (and its related projects [31,39]) uses access annotations (expressed as permission predicates) to explicitly transfer access/mutation permis-sions for references between static program names. Like ConSORT, permissions may be fractionally transferred, allowing temporary shared, immutable access to a mutable memory cell.…”

Section: Related Workmentioning

confidence: 99%

ConSORT: Context- and Flow-Sensitive Ownership Refinement Types for Imperative Programs

Toman

Siqi

Suenaga

et al. 2020

Programming Languages and Systems

View full text Add to dashboard Cite

We present ConSORT, a type system for safety verification in the presence of mutability and aliasing. Mutability requires strong updates to model changing invariants during program execution, but aliasing between pointers makes it difficult to determine which invariants must be updated in response to mutation. Our type system addresses this difficulty with a novel combination of refinement types and fractional ownership types. Fractional ownership types provide flow-sensitive and precise aliasing information for reference variables. ConSORT interprets this ownership information to soundly handle strong updates of potentially aliased references. We have proved ConSORT sound and implemented a prototype, fully automated inference tool. We evaluated our tool and found it verifies non-trivial programs including data structure implementations.

show abstract

Section: Related Workmentioning

confidence: 99%

ConSORT: Context- and Flow-Sensitive Ownership Refinement Types for Imperative Programs

Toman

Siqi

Suenaga

et al. 2020

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

“…Chalice [36] has rational permissions to verify properties of multi-threaded, objected-based programs such as data races and dead-locks. Viper [37] has an expressive intermediate language that supports both rational and abstract permissions. However, a number of verification tools have chosen tree shares due to their better metatheoretical properties.…”

Section: Related Workmentioning

confidence: 99%

Logical Reasoning for Disjoint Permissions

Hobor

2018

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. Resource sharing is a fundamental phenomenon in concurrent programming where several threads have permissions to access a common resource. Logics for verification need to capture the notion of permission ownership and transfer. One typical practice is the use of rational numbers in (0, 1] as permissions in which 1 is the full permission and the rest are fractional permissions. Rational permissions are not a good fit for separation logic because they remove the essential "disjointness" feature of the logic itself. We propose a general logic framework that supports permission reasoning in separation logic while preserving disjointness. Our framework is applicable to sophisticated verification tasks such as doing induction over the finiteness of the heap within the object logic or carrying out biabductive inference. We can also prove precision of recursive predicates within the object logic. We developed the ShareInfer tool to benchmark our techniques. We introduce "scaling separation algebras," a compositional extension of separation algebras, to model our logic, and use them to construct a concrete model.

show abstract

“…The CPAchecker tool is able to migrate predicates across program versions [3]. Deductive verification tools such as Viper and Dafny offer modular verification [12] and cashing the intermediate verification results [10] respectively. In the context of software symbolic model checking, the closest body of work is CBMC -a bounded model-checker for C that to a limited extent exploits incremental capabilities of a SAT solver 4 , but does not use or output any reusable information like function summaries.…”

Section: Introductionmentioning

confidence: 99%

HiFrog: SMT-based Function Summarization for Software Verification

Alt

Asadi

Chockler

et al. 2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Function summarization can be used as a means of incremental verification based on the structure of the program. HiFrog is a fully featured function-summarization-based model checker that uses SMT as the modeling and summarization language. The tool supports three encoding precisions through SMT: uninterpreted functions, linear real arithmetics, and propositional logic. In addition the tool allows optimized traversal of reachability properties, counter-example-guided summary refinement, summary compression, and user-provided summaries. We describe the use of the tool through the description of its architecture and a rich set of features. The description is complemented by an experimental evaluation on the practical impact the different SMT precisions have on model-checking.

show abstract

Viper: A Verification Infrastructure for Permission-Based Reasoning

Cited by 195 publications

References 35 publications

ConSORT: Context- and Flow-Sensitive Ownership Refinement Types for Imperative Programs

ConSORT: Context- and Flow-Sensitive Ownership Refinement Types for Imperative Programs

Logical Reasoning for Disjoint Permissions

HiFrog: SMT-based Function Summarization for Software Verification

Contact Info

Product

Resources

About