Counterexample-guided focus
From MaRDI portal
Publication:5255078
DOI10.1145/1706299.1706330zbMath1312.68067OpenAlexW2110233633MaRDI QIDQ5255078
Publication date: 11 June 2015
Published in: Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1706299.1706330
Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data, How testing helps to diagnose proof failures, Verification of heap manipulating programs with ordered data by extended forest automata, Predicate Abstraction for Program Verification, Lazy slicing for state-space exploration, Counterexample Validation and Interpolation-Based Refinement for Forest Automata, Complete instantiation-based interpolation, An Efficient Decision Procedure for Imperative Tree Data Structures, Towards Complete Reasoning about Axiomatic Specifications, A shape graph logic and a shape system
