Communications of the ACM
The Z notation: a reference manual
The Z notation: a reference manual
Complexity of Makanin's algorithm
Journal of the ACM (JACM)
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
The expressibility of languages and relations by word equations
Journal of the ACM (JACM)
Studying Algorithmic Problems for Free Semi-groups and Groups
LFCS '97 Proceedings of the 4th International Symposium on Logical Foundations of Computer Science
CLPS–B – A constraint solver to animate a B specification
International Journal on Software Tools for Technology Transfer (STTT) - Special section on tools and algorithms for the construction and analysis of systems
Boundary Coverage Criteria for Test Generation from Formal Models
ISSRE '04 Proceedings of the 15th International Symposium on Software Reliability Engineering
| Hi-index | 0.00 |
Constraint programming techniques are successfully used in various areas of software engineering for industry, commerce, transport, finance etc. Constraint solvers for different data types are applied in validation and verification of programs containing data elements of these types. A general constraint solver for sequences is necessary to take into account this data type in the existing validation and verification tools. In this work, we present an original constraint solver for sequences implemented in CHR and based on T. Frühwirth's solver for lists with the propagation of two constraints: generalized concatenation and size. Experimental results show its better efficiency compared to the intuitive propagation algorithm based on subsequences. The applications of the solver (with the validation and verification tool BZTT) to different software engineering problems are illustrated by the example of a waiting room model.