Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Solving the search for source code
Programmers frequently search for source code to reuse using keyword searches. The
search effectiveness in facilitating reuse, however, depends on the programmer's ability to …
search effectiveness in facilitating reuse, however, depends on the programmer's ability to …
Advances in symbolic execution
Symbolic execution is a systematic technique for checking programs, which forms a basis for
various software testing and verification techniques. It provides a powerful analysis in …
various software testing and verification techniques. It provides a powerful analysis in …
Proteus: Computing disjunctive loop summary via path dependency analysis
Loops are challenging structures for program analysis, especially when loops contain
multiple paths with complex interleaving executions among these paths. In this paper, we …
multiple paths with complex interleaving executions among these paths. In this paper, we …
Cooperative software testing and analysis: Advances and challenges
In recent years, to maximize the value of software testing and analysis, we have proposed
the methodology of cooperative software testing and analysis (in short as cooperative testing …
the methodology of cooperative software testing and analysis (in short as cooperative testing …
Characteristic studies of loop problems for structural test generation via symbolic execution
Dynamic Symbolic Execution (DSE) is a state-of-the-art test-generation approach that
systematically explores program paths to generate high-covering tests. In DSE, the presence …
systematically explores program paths to generate high-covering tests. In DSE, the presence …
Extracting protocol format as state machine via controlled static loop analysis
Reverse engineering of protocol message formats is critical for many security applications.
Mainstream techniques use dynamic analysis and inherit its low-coverage problem—the …
Mainstream techniques use dynamic analysis and inherit its low-coverage problem—the …
A calculus for modular loop acceleration
F Frohn - International Conference on Tools and Algorithms for …, 2020 - Springer
Loop acceleration can be used to prove safety, reachability, runtime bounds, and (non-)
termination of programs operating on integers. To this end, a variety of acceleration …
termination of programs operating on integers. To this end, a variety of acceleration …
Automatic loop summarization via path dependency analysis
Analyzing loops is very important for various software engineering tasks such as bug
detection, test case generation and program optimization. However, loops are very …
detection, test case generation and program optimization. However, loops are very …
Transferring an automated test generation tool to practice: From Pex to Fakes and Code Digger
Producing industry impacts has been an important, yet challenging task for the research
community. In this paper, we report experiences on successful technology transfer of Pex …
community. In this paper, we report experiences on successful technology transfer of Pex …
S-looper: Automatic summarization for multipath string loops
Loops are important yet most challenging program constructs to analyze for various program
analysis tasks. Existing loop analysis techniques mainly handle well loops that contain only …
analysis tasks. Existing loop analysis techniques mainly handle well loops that contain only …