Stephen McCamant
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Stephen McCamant has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Michael W. Whalen
Amazon Web Services
2 shared publications - Soha Hussein
University of Minnesota
2 shared publications - Vaibhav Sharma
University of Minnesota
2 shared publications - Qiuchen Yan
University of Minnesota
1 shared publication - Willem Visser
Amazon Web Services, Seattle, USA
1 shared publication
Latest Publications
- Open Access
- 20 April 2023
- Published by Springer Nature
- p. 553-558
Java Ranger: Supporting String and Array Operations in Java Ranger (Competition Contribution)
Java Ranger is a path-merging tool for Java Programs. It identifies branching regions of code and summarizes them by generating a disjunctive logical constraint that describes the behavior of the code region. Previously, Java Ranger showed that a reduction of 70% of execution paths is possible when used to merge branching regions of code that support numeric constraints.In this paper, we describe the support of two additional features since participation in SV-COMP 2020: symbolic array and symbolic string operations. Finally, we present a preliminary evaluation of the effect of the structure of the disjunctive constraint on the solver’s performance. Results suggest that certain constraint structures can speed up the performance of Java Ranger.
- 20 April 2023
- Published by Springer Nature
- p. 553-558
Open AccessJava Ranger: Supporting String and Array Operations in Java Ranger (Competition Contribution)
Java Ranger is a path-merging tool for Java Programs. It identifies branching regions of code and summarizes them by generating a disjunctive logical constraint that describes the behavior of the code region. Previously, Java Ranger showed that a reduction of 70% of execution paths is possible when used to merge branching regions of code that support numeric constraints.In this paper, we describe the support of two additional features since participation in SV-COMP 2020: symbolic array and symbolic string operations. Finally, we present a preliminary evaluation of the effect of the structure of the disjunctive constraint on the solver’s performance. Results suggest that certain constraint structures can speed up the performance of Java Ranger.
- Open Access
- 17 April 2020
- Published by Springer Nature
- Vol. 12079, 393-397
Java Ranger at SV-COMP 2020 (Competition Contribution)
Path-merging is a known technique for accelerating symbolic execution. One technique, named “veritesting” by Avgerinos et al. uses summaries of bounded control-flow regions and has been shown to accelerate symbolic execution of binary code. But, when applied to symbolic execution of Java code, veritesting needs to be extended to summarize dynamically dispatched methods and exceptional control-flow. Such an extension of veritesting has been implemented in Java Ranger by implementing as an extension of Symbolic PathFinder, a symbolic executor for Java bytecode. In this paper, we briefly describe the architecture of Java Ranger and describe its setup for SV-COMP 2020.
- 17 April 2020
- Published by Springer Nature
- Vol. 12079, 393-397
Open AccessJava Ranger at SV-COMP 2020 (Competition Contribution)
Path-merging is a known technique for accelerating symbolic execution. One technique, named “veritesting” by Avgerinos et al. uses summaries of bounded control-flow regions and has been shown to accelerate symbolic execution of binary code. But, when applied to symbolic execution of Java code, veritesting needs to be extended to summarize dynamically dispatched methods and exceptional control-flow. Such an extension of veritesting has been implemented in Java Ranger by implementing as an extension of Symbolic PathFinder, a symbolic executor for Java bytecode. In this paper, we briefly describe the architecture of Java Ranger and describe its setup for SV-COMP 2020.