The 7th Workshop on Constraint Solvers in Testing, Verification, and Analysis<\/p>\n
Co-located with ISSTA 2016 (opens in new tab)<\/span><\/a><\/p>\n Proceedings: CEUR-WS Vol. 1639 (opens in new tab)<\/span><\/a>.Opens in a new tab<\/span><\/p>\n > The workshop proceedings of the workshop are now available as CEUR-WS Volume 1639 (opens in new tab)<\/span><\/a>.<\/p>\n In the last decade there has been a revolutionary improvement in the efficiency and expressive power of constraint solvers (e.g., SAT, SMT and CP solvers), with a consequent impact on all manner of software engineering applications and research programs. A prime example of this impact is the rapid development and adoption of solver-based symbolic-execution techniques in myriad applications such as test generation, equivalence checking, security, automated exploit construction and fault localization. Black-box use of Boolean SAT solvers for proof-of-concept has been followed by the use of Satisfiability Modulo Theories (SMT) solvers integrating rich theories to treat these applications more thoroughly. An increasing amount of work is focussing on how best to use, tune, or extend solvers to meet the needs of particular applications. A similar theme of deeper integration of solver and application can be seen with ongoing research on Constraint Programming (CP) techniques and their use in software engineering.<\/p>\n The workshop will focus on a broad range of topics where solvers have already made an impact, e.g., symbolic-execution based testing, as well as newer ones where their use is still nascent, e.g., testing of software product lines. The topics include, but are not limited to, the following:<\/p>\n Organization<\/strong><\/p>\n Opens in a new tab<\/span><\/p>\n Opens in a new tab<\/span><\/p>\n The workshop will take place in Room 0.06 in the CISPA building (opens in new tab)<\/span><\/a> of Saarland University.<\/p>\n
\n\n
\n
\n