scholarly journals Test Case Generation by OCL Mutation and Constraint Solving

Author(s):  
B.K. Aichernig ◽  
P.A. Pari Salas
10.29007/w5m5 ◽  
2018 ◽  
Author(s):  
Nikolaj Bjorner ◽  
Vijay Ganesh ◽  
Raphaël Michel ◽  
Margus Veanes

Strings are ubiquitous in software. Tools for specification,verification and test-case generation of software rely in various degrees onrepresenting and reasoning about strings. Reasoning about strings isparticularly important in several security critical applications, such asweb sanitizers. Besides a basic representation of strings, applicationsalso use string recognizers and transducers.This paper presents a proposal for an SMT-LIBization of strings and regularexpressions. It introduces a theory of sequences, generalizing strings,and builds a theory of regular experssions on top of sequences.The logic QF_BVRE is designed to capture a common substrate amongexisting tools for string constraint solving.


2021 ◽  
Vol 2 (1) ◽  
Author(s):  
Shreya Banerjee ◽  
Narayan C. Debnath ◽  
Anirban Sarkar

Sign in / Sign up

Export Citation Format

Share Document