Topics, scope and aims<br>Recent years have seen an increasing usage and consequent impact of<br>Boolean SAT, SMT and Constraint Programming (CP or CSP) solvers in<br>testing, verification and analysis of software systems. The primary<br>reason for this is the dramatic improvement in the efficiency and<br>expressive power of solvers. As newer and more powerful solvers are<br>built, software–engineering (SE) & programming–languages (PL)<br>researchers dramatically scale existing applications such as<br>symbolic–execution methods, or find unexpected applications for them,<br>e.g., software product lines or fault localization methods.<br>This workshop will bring together researchers in solvers, software test<br>and analysis, and other PL/SE areas, in order to raise the awareness of<br>constraint solving in the broader PL/SE research community, and<br>encourage development of new applications based on tunable, extensible,<br>and programmable solvers. The workshop will focus on a broad range of<br>topics where solvers have already made an impact, e.g.,<br>symbolic–execution–based testing, verification and analysis, as well as<br>newer applications whose use is still nascent, e.g., synthesis, software<br>product lines and fault localization. Submission topics include, but<br>are not limited to, the following:<br>* Constraint–based analysis of programs and models<br>* Constraint–based test input generation and fault localization<br>* Solvers and computer security<br>* SMT and CP solvers for testing, verification, analysis, and synthesis<br>* Programmable SMT and CP solvers<br>* Combinations of constraint solvers<br>* Solvers for software product lines<br>* Solvers and fault–localization<br>
Abbrevation
CSTVA
City
Saarbruecken
Country
Germany
Deadline Paper
Start Date
End Date
Abstract