Maximal specification synthesis
From MaRDI portal
Recommendations
Cited in
(17)- Scalable algorithms for abduction via enumerative syntax-guided synthesis
- Unbounded procedure summaries from bounded environments
- Symbolic abstract contract synthesis in a rewriting framework
- Automated inference of library specifications for source-sink property verification
- Protocol Inference Using Static Path Profiles
- Structural Synthesis for GXW Specifications
- Abstract contract synthesis and verification in the symbolic \(\mathbb{K}\) framework
- Assume, guarantee or repair
- A weakness measure for GR(1) formulae
- A weakness measure for GR(1) formulae
- Automated program repair using formal verification techniques
- Principles of staged static+dynamic partial analysis
- OptiRica: towards an efficient optimizing Horn solver
- When are software verification results valid for approximate hardware?
- Partial program analysis for staged compilation systems
- An interactive SMT tactic in Coq using abductive reasoning
- Theory exploration powered by deductive 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)