Synthesis modulo recursive functions

We describe techniques for synthesis and verification of recursive functional programs over unbounded domains. Our techniques build on top of an algorithm for satisfiability modulo recursive functions, a framework for deductive synthesis, and complete synthesis procedures for algebraic data types. W...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIGPLAN notices 2013-10, Vol.48 (10), p.407-426
Hauptverfasser:	Kneuss, Etienne, Kuraj, Ivan, Kuncak, Viktor, Suter, Philippe
Format:	Artikel
Sprache:	eng
Schlagworte:	Cross-computing tools and techniques Formal methods Formal software verification General and reference Logic Program reasoning Program verification Semantics and reasoning Software and its engineering Software creation and management Software development process management Software functional properties Software organization and properties Software verification Software verification and validation Theory of computation Verification
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!