An active learning approach to synthesizing program contracts

DOI10.1007/978-3-031-47115-5_8MaRDI QIDQ6550595FDOQ6550595

Authors: Sandip Ghosal, Bengt Jonsson, Philipp Rümmer 

Publication date: 5 June 2024

Recommendations

• Symbolic abstract contract synthesis in a rewriting framework
• Abstract contract synthesis and verification in the symbolic \(\mathbb{K}\) framework
• Modular inference of subprogram contracts for safety checking
• From program verification to program synthesis
• Contracts as Pairs of Projections

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• The Daikon system for dynamic detection of likely invariants
• Abstract contract synthesis and verification in the symbolic \(\mathbb{K}\) framework
• Learning regular sets from queries and counterexamples
• Symbolic execution and program testing
• A constructive approach to the problem of program correctness
• Active learning for extended finite state machines

This page was built for publication: An active learning approach to synthesizing program contracts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550595)