SYNT 2018 - 7th Workshop on Synthesis (SYNT 2018)
Topics/Call fo Papers
The workshop aims to bring together researchers interested in the broad area of synthesis of computing systems. It aims to foster the development of frontier techniques in automating the development of computing systems and is inclusive in its interpretation of the term synthesis:
Contributions of interest include: algorithms, complexity and decidability analysis, as well as reproducible heuristics, implemented tools, benchmark descriptions, and experimental evaluation. Computation models include functional, reactive, hybrid and timed systems. Application domains include software, hardware, embedded, and cyberphysical systems. Identifying, formalizing, and evaluating synthesis in particular domains is encouraged. Of interest are approaches that explore alternative development methods, as well as approaches that improve upon the automation of design, compilation, and optimization techniques currently in widespread use. All appropriate underlying methods are of interest, including above formal methods and techniques that build upon computer-aided verification, but also machine learning and data mining techniques. All formalizable forms of specifications of potential practical interest are considered, including contracts, temporal logic specifications, quantitative objectives, partial systems, and (possibly symbolic) input/output examples.
Contributions of interest include: algorithms, complexity and decidability analysis, as well as reproducible heuristics, implemented tools, benchmark descriptions, and experimental evaluation. Computation models include functional, reactive, hybrid and timed systems. Application domains include software, hardware, embedded, and cyberphysical systems. Identifying, formalizing, and evaluating synthesis in particular domains is encouraged. Of interest are approaches that explore alternative development methods, as well as approaches that improve upon the automation of design, compilation, and optimization techniques currently in widespread use. All appropriate underlying methods are of interest, including above formal methods and techniques that build upon computer-aided verification, but also machine learning and data mining techniques. All formalizable forms of specifications of potential practical interest are considered, including contracts, temporal logic specifications, quantitative objectives, partial systems, and (possibly symbolic) input/output examples.
Other CFPs
- Summit on Machine Learning Meets Formal Methods
- Third International Workshop on Satisfiability Checking and Symbolic Computation
- IFAC Conference on Analysis and Design of Hybrid Systems (ADHS 2018)
- 2018 16th International Workshop on Satisfiability Modulo Theories
- 7th Workshop on Logic and Systems Biology
Last modified: 2017-12-13 10:24:02