Symbolic execution formally explained-Reference-Cited by-同舟云学术

Symbolic execution formally explained

Published:2021-08 Issue:4-5 Volume:33 Page:617-636
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

de Boer Frank S.¹²,Bonsangue Marcello²

Affiliation:

1. Centrum Wiskunde and Informatica (CWI), Leiden, The Netherlands

2. Leiden Institute Of Advanced Computer Science (LIACS), Leiden University, Leiden, The Netherlands

Abstract

Abstract In this paper, we provide a formal explanation of symbolic execution in terms of a symbolic transition system and prove its correctness and completeness with respect to an operational semantics which models the execution on concrete values.We first introduce a formalmodel for a basic programming languagewith a statically fixed number of programming variables. This model is extended to a programming language with recursive procedures which are called by a call-by-value parameter mechanism. Finally, we present a more general formal framework for proving the soundness and completeness of the symbolic execution of a basic object-oriented language which features dynamically allocated variables.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

https://link.springer.com/content/pdf/10.1007/s00165-020-00527-y.pdf

Reference26 articles.

1. Albert Elvira Arenas Puri Gómez-Zamalloa Miguel Rojas José Miguel (2014) Test case generation by symbolic execution: Basic concepts a clp-based instance and actor-based concurrency. In: Marco Bernardo Ferruccio Damiani Reiner Hähnle Einar Broch Johnsen Ina Schaefer (eds.) Formal Methods for Executable Software Models - 14th International School on Formal Methods for the Design of Computer Communication and Software Systems SFM 2014 Bertinoro Italy June 16-20 2014 Advanced Lectures volume 8483 of Lecture Notes in Computer Science. Springer pp 263–309

2. Ahrendt Wolfgang Beckert Bernhard Bubel Richard Hähnle Reiner Schmitt Peter H Ulbrich Mattias (eds.) (2016) Deductive Software Verification - The KeY Book - From Theory to Practice volume 10001 of Lecture Notes in Computer Science. Springer

3. Apt Krzysztof R de Boer Frank Olderog Ernst-Rdiger (2009)Verification of Sequential and Concurrent Programs 3rd edition. Springer

4. Baldoni Roberto Coppa Emilio D'elia Daniele Cono Demetrescu Camil Finocchi Irene (2018) A survey of symbolic execution techniques. ACM Computing Surveys 51(3)

5. Braione Pietro Denaro Giovanni Pezzè Mauro (2015) Symbolic execution of programs with heap inputs. In: Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering (ESEC/FSE 2015) pp 602–613

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Rampo: A CEGAR-based Integration of Binary Code Analysis and System Falsification for Cyber-Kinetic Vulnerability Detection;2024 ACM/IEEE 15th International Conference on Cyber-Physical Systems (ICCPS);2024-05-13

2. Proving Correctness of Parallel Implementations of Transition System Models;ACM Transactions on Programming Languages and Systems;2024-04-20

3. Denotational Semantics for Symbolic Execution;Theoretical Aspects of Computing – ICTAC 2023;2023

4. Symbolic Semantics for Probabilistic Programs;Quantitative Evaluation of Systems;2023

5. Scalable Path Search for Automated Test Case Generation;Electronics;2022-02-26