Zobrazeno 1 - 3
of 3
pro vyhledávání: '"SuterPhilippe"'
Publikováno v:
OOPSLA
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 complet
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b30ddfbfbcdc24914c6efaf0f2cbaec
https://doi.org/10.1145/2509136.2509555
https://doi.org/10.1145/2509136.2509555
Publikováno v:
PLDI
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algorithms should behave in a predictable way - they should succeed for a we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a30bc330c30ba57264aac1a43a52288
https://doi.org/10.1145/1806596.1806632
https://doi.org/10.1145/1806596.1806632
Publikováno v:
POPL
We describe a family of decision procedures that extend the decision procedure for quantifier-free constraints on recursive algebraic data types (term algebras) to support recursive abstraction functions. Our abstraction functions are catamorphisms (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a22cc84f87f0689bcbb23a1937b34922
https://doi.org/10.1145/1706299.1706325
https://doi.org/10.1145/1706299.1706325