Maximal specification synthesis
DOI10.1145/2837614.2837628zbMATH Open1347.68067OpenAlexW2267830770MaRDI QIDQ2828322FDOQ2828322
Authors: Aws Albarghouthi, Isil Dillig, Arie Gurfinkel 
Publication date: 24 October 2016
Published in: Proceedings of the 43rd 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/2837614.2837628
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (15)
- Abstract contract synthesis and verification in the symbolic \(\mathbb{K}\) framework
- Assume, guarantee or repair
- Symbolic abstract contract synthesis in a rewriting framework
- Structural Synthesis for GXW Specifications
- Unbounded procedure summaries from bounded environments
- Protocol Inference Using Static Path Profiles
- Principles of staged static+dynamic partial analysis
- A weakness measure for GR(1) formulae
- A weakness measure for GR(1) formulae
- Automated program repair using formal verification techniques
- Theory exploration powered by deductive synthesis
- OptiRica: towards an efficient optimizing Horn solver
- When are software verification results valid for approximate hardware?
- Automated inference of library specifications for source-sink property verification
- Scalable algorithms for abduction via enumerative syntax-guided synthesis
This page was built for publication: Maximal specification synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828322)
