Recent years have seen an increasing interest in the application of constraint solving techniques to the testing and analysis of software systems. A significant body of constraint-based techniques have been proposed and investigated in model-based testing, code-based testing, property-oriented testing, statistical testing, etc.

The central idea behind these techniques is designing or using existing constraint solvers such as SMT solvers to deal with boolean, integer, real, floating-point data types, enumerated types, control structures, complex data structures, method calls and so on. The constraint systems that result from these analyses usually share some common features such as being heterogeneous and highly dynamic. This also led to the design of domain-specific heuristics able to exploit the structure of programs or specification models.

Following a first meeting held with the CP 2012 conference in Nantes in 2006, and two subsequent meetings at ICST 2010 and ICST 2011, the aim of this workshop is to bring together researchers and practitioners working in constraint-based software testing, verification and analysis, as well as in the more general field of program testing, to investigate future developments in this research field.

The workshop will focus on a broad range of topics in constrained-based testing, verification and analysis including, but not limited to, the following:

• Constraint-based analysis of programs and models
• Constraint-based test input generation
• Constraint-based exploration of programs and models
• Heuristics guided by the structure of programs and models
• Constraint solvers over specific domains
• SMT solvers used in program testing
• Combination of dedicated constraint solvers