Skip to main content
Conference ProceedingsOPEN ACCESS

JDart: Dynamic Symbolic Execution for Java Bytecode (Competition Contribution)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2020) 12079 LNCS 398-402
DOI: 10.1007/978-3-030-45237-7_28
4Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

JDart performs dynamic symbolic execution of Java programs: it executes programs with concrete inputs while recording symbolic constraints on executed program paths. A constraint solver is then used for generating new concrete values from recorded constraints that drive execution along previously unexplored paths. JDart is built on top of the Java PathFinder software model checker and uses the JConstraints library for the integration of constraint solvers.

Cite

CITATION STYLE

APA

Mues, M., & Howar, F. (2020). JDart: Dynamic Symbolic Execution for Java Bytecode (Competition Contribution). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12079 LNCS, pp. 398–402). Springer. https://doi.org/10.1007/978-3-030-45237-7_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free