Programming by predicates: a formal model for interactive synthesis

DOI10.1007/s00236-019-00340-yzbMath1435.68067OpenAlexW2971064436MaRDI QIDQ2303879

Hila Peleg, Shachar Itzhaky, Sharon Shoham, Eran Yahav

Publication date: 6 March 2020

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-019-00340-y

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• Daikon
• Houdini
• SyPet
• CodeHint
• FlashExtract
• TRANSIT
• FlashMeta
• BlinkFill

Cites Work

• Unnamed Item
• Programming by demonstration using version space algebra
• A theory of formal synthesis via inductive learning
• Synthesis with abstract examples
• The Daikon system for dynamic detection of likely invariants
• $$D^3$$ : Data-Driven Disjunctive Abstraction
• Abstraction-Based Interaction Model for Synthesis
• Scaling Enumerative Program Synthesis via Divide and Conquer
• Component-based synthesis for complex APIs
• Automating string processing in spreadsheets using input-output examples
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: Programming by predicates: a formal model for interactive synthesis