Exploiting multiple abstract call patterns for optimizing run-time checks
From MaRDI portal
Cites work
- A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
- A practical framework for theabstract interpretation of logic programs
- Combining static and dynamic contract checking for Curry
- Compile-time derivation of variable dependency using abstract interpretation
- Contracts for higher-order functions
- Dafny: an automatic program verifier for functional correctness
- Dependent types and multi-monadic effects in \(\mathrm{F}^*\)
- scientific article; zbMATH DE number 1615263 (Why is no real title available?)
- scientific article; zbMATH DE number 1696873 (Why is no real title available?)
- scientific article; zbMATH DE number 1948391 (Why is no real title available?)
- scientific article; zbMATH DE number 1368925 (Why is no real title available?)
- Improving thread-modular abstract interpretation
- Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
- Practical run-time checking via unobtrusive property caching
- Programming Languages and Systems
- Safe \& efficient gradual typing for TypeScript
- Soft contract verification
- Specification and verification challenges for sequential object-oriented programs
- Static contract checking with abstract interpretation
- The design and implementation of Typed Scheme
- The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
- Three improvements to the top-down solver
- Why3 -- where programs meet provers
This page was built for publication: Exploiting multiple abstract call patterns for optimizing run-time checks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7406164)
