Lazy Abstraction for Higher-Order Program Verification
Abstract
References
Index Terms
- Lazy Abstraction for Higher-Order Program Verification
Recommendations
Tool-supported program abstraction for finite-state verification
ICSE '01: Proceedings of the 23rd International Conference on Software EngineeringNumerous researchers have reported success in reasoning about properties of small programs using finite-state verification techniques. We believe, as do most researchers in this area, that in order to scale those initial successes to realistic programs, ...
Lazy abstraction
One approach to model checking software is based on the abstract-check-refine paradigm: build an abstract model, then check the desired property, and if the check fails, refine the model and start over. We introduce the concept of lazy abstraction to ...
Comments
Information & Contributors
Information
Published In
In-Cooperation
- SIGPLAN: ACM Special Interest Group on Programming Languages
- Goethe University: Goethe University Frankfurt
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Research-article
- Research
- Refereed limited
Funding Sources
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 59Total Downloads
- Downloads (Last 12 months)6
- Downloads (Last 6 weeks)5
Other Metrics
Citations
Cited By
View allView Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in