Viper: A Verification Infrastructure for Permission-Based Reasoning
Open accessThe DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
de Moura, L., & Bjørner, N. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78800-3_24 · Cited by 6,595
Separation logic: a logic for shared mutable data structures
Reynolds, J. C. (2003) · Proceedings 17th Annual IEEE Symposium on Logic in Computer Science · doi:10.1109/lics.2002.1029817 · Cited by 2,156
Proof of correctness of data representations
Hoare, C. A. R. (1972) · Acta Informatica · doi:10.1007/bf00289507 · Cited by 966
Dafny: An Automatic Program Verifier for Functional Correctness
Leino, K. R. M. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17511-4_20 · Cited by 940
Local Reasoning about Programs that Alter Data Structures
O’Hearn, P., Reynolds, J., & Yang, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44802-0_1 · Cited by 705
Why3 — Where Programs Meet Provers
Filliâtre, J.-C., & Paskevich, A. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-37036-6_8 · Cited by 538
JML: A Notation for Detailed Design
Leavens, G. T., Baker, A. L., & Ruby, C. (1999) · Behavioral Specifications of Businesses and Systems · doi:10.1007/978-1-4615-5229-1_12 · Cited by 417
Frama-C: A software analysis perspective
Kirchner, F., Kosmatov, N., Prevosto, V., Signoles, J., & Yakobowski, B. (2015) · Formal Aspects of Computing · doi:10.1007/s00165-014-0326-7 · Cited by 416
Checking interference with fractional permissions
Boyland, J. (2003) · Cited by 382
VeriFast: A Powerful, Sound, Predictable, Fast Verifier for C and Java
Jacobs, B., Smans, J., Philippaerts, P., Vogels, F., Penninckx, W., & Piessens, F. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20398-5_4 · Cited by 362
The Why/Krakatoa/Caduceus Platform for Deductive Program Verification
Filliâtre, J.-C., & Marché, C. (2007) · Springer eBooks · doi:10.1007/978-3-540-73368-3_21 · Cited by 331
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
Berdine, J., Calcagno, C., & O’Hearn, P. W. (2006) · Lecture Notes in Computer Science · doi:10.1007/11804192_6 · Cited by 316
Separation logic and abstraction
Parkinson, M., & Bierman, G. (2005) · Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1040305.1040326 · Cited by 309
Checking Interference with Fractional Permissions
Boyland, J. (2003) · Lecture notes in computer science · doi:10.1007/3-540-44898-5_4 · Cited by 262
Specification and verification: the Spec# experience
Barnett, M., Fähndrich, M., Leino, K. R. M., Müller, P., Schulte, W., & Venter, H. (2011) · Communications of the ACM · doi:10.1145/1953122.1953145 · Cited by 191
Self-citationA Solver for Reachability Modulo Theories
Lal, A., Qadeer, S., & Lahiri, S. K. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31424-7_32 · Cited by 165
A Basis for Verifying Multi-threaded Programs
Leino, K. R. M., & Müller, P. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00590-9_27 · Cited by 142
Self-citationChin, W.-N., David, C., Nguyen, H. H., & Qin, S. (2010) · Science of Computer Programming · doi:10.1016/j.scico.2010.07.004 · Cited by 140
Leino, K. R. M. (2016) · Cited by 126
Implicit Dynamic Frames: Combining Dynamic Frames and Separation Logic
Smans, J., Jacobs, B., & Piessens, F. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03013-0_8 · Cited by 120
Verification of Concurrent Programs with Chalice
Leino, K. R. M., Müller, P., & Smans, J. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03829-7_7 · Cited by 99
Self-citationLocal Verification of Global Invariants in Concurrent Programs
Cohen, E., Moskal, M., Schulte, W., & Tobies, S. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14295-6_42 · Cited by 75
GRASShopper: Complete Heap Verification with Mixed Specifications
Piskač, R., Wies, T., & Damien Zufferey, A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-54862-8_9 · Cited by 68
The VerCors Tool for Verification of Concurrent Programs
Blom, S., & Huisman, M. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-06410-9_9 · Cited by 65
Specification and Verification of Object-Oriented Software
Leino, K. R. M. (2009) · NATO science for peace and security series. D, Information and communication security · doi:10.3233/978-1-58603-976-9-231 · Cited by 57
Separation Logic Modulo Theories
Navarro-Pérez, J. A., & Rybalchenko, A. (2013) · Lecture notes in computer science · doi:10.1007/978-3-319-03542-0_7 · Cited by 47
Moskal, M. (2009) · doi:10.1145/1670412.1670416 · Cited by 46
Using the Spec# Language, Methodology, and Tools to Write Bug-Free Programs
Leino, K. R. M., & Müller, P. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13010-6_4 · Cited by 40
Self-citationThe Relationship Between Separation Logic and Implicit Dynamic Frames
Parkinson, M., & Summers, A. J. (2012) · Logical Methods in Computer Science · doi:10.2168/lmcs-8(3:1)2012 · Cited by 33
Self-citationHeule, S., Kassios, I. T., Müller, P., & Summers, A. J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-39038-8_19 · Cited by 19
Self-citationGrigore, R. (2011) · Cited by 14
Brodowsky, B. F. (2013) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-009908589 · Cited by 1
Cited by
Iris from the ground up: A modular foundation for higher-order concurrent separation logic
JUNG, R., KREBBERS, R., JOURDAN, J.-H., BIZJAK, A., BIRKEDAL, L., & DREYER, D. (2018) · Journal of Functional Programming · doi:10.1017/s0956796818000151 · Cited by 372
Nagini: A Static Verifier for Python
Eilers, M., & Müller, P. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-96145-3_33 · Cited by 51
Self-citationEilers, M., Schwerhoff, M., Summers, A. J., & Müller, P. (2025) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-98668-0_5 · Cited by 2
Self-citationEvaluating the Ability of GPT-4o to Generate Verifiable Specifications in VeriFast
Rego, M., Fan, W., Hu, X., Dod, S., Ni, Z., Xie, D., DiVincenzo, J., & Tan, L. (2025) · 2025 IEEE/ACM Second International Conference on AI Foundation Models and Software Engineering (Forge) · doi:10.1109/forge66646.2025.00035 · Cited by 2
Metadata
- Authors
- Müller, P., Schwerhoff, M., & Summers, A. J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2015-12-25
- Pages
- 41-62
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2294722445
- Cited by
- 265
- References
- 32
- FWCI
- 8.33
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.