A Polymorphic Intermediate Verification Language: Design and Logical Encoding-Reference-Cited by-同舟云学术

A Polymorphic Intermediate Verification Language: Design and Logical Encoding

Published:2010 Issue: Volume: Page:312-327
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Leino K. Rustan M.,Rümmer Philipp

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-12002-2_26.pdf

Reference23 articles.

1. Lecture Notes in Computer Science;M. Barnett,2006

2. Barrett, C., Ranise, S., Stump, A., Tinelli, C.: The Satisfiability Modulo Theories Library, SMT-LIB (2008), www.SMT-LIB.org

3. Bobot, F., Conchon, S., Contejean, E., Lescuyer, S.: Implementing polymorphism in SMT solvers. In: SMT 2008 (2008)

4. Lecture Notes in Computer Science;S. Chatterjee,2007

5. Cohen, E., Moskal, M., Schulte, W., Tobies, S.: A practical verification methodology for concurrent programs. MSR-TR 2009-15, Microsoft Research (2009)

Cited by 53 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Towards Trustworthy Automated Program Verifiers: Formally Validating Translations into an Intermediate Verification Language;Proceedings of the ACM on Programming Languages;2024-06-20

2. Verus: Verifying Rust Programs using Linear Ghost Types;Proceedings of the ACM on Programming Languages;2023-04-06

3. Grisette: Symbolic Compilation as a Functional Programming Library;Proceedings of the ACM on Programming Languages;2023-01-09

4. Kratos2: An SMT-Based Model Checker for Imperative Programs;Computer Aided Verification;2023

5. Identifying Overly Restrictive Matching Patterns in SMT-based Program Verifiers (extended version);Formal Aspects of Computing;2022-11-18