Satisfiability and synthesis modulo oracles (Q2152655): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4206458917 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2107.13477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated formal synthesis of provably safe digital controllers for continuous plants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexample guided inductive synthesis modulo theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling Enumerative Program Synthesis via Divide and Conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning regular sets from queries and counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-Based Model Checking without Unrolling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of formal synthesis via inductive learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Finding for Recursive Functions in SMT / rank
 
Normal rank

Latest revision as of 14:47, 29 July 2024

scientific article
Language Label Description Also known as
English
Satisfiability and synthesis modulo oracles
scientific article

    Statements