2019
DOI: 10.48550/arxiv.1907.02872
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Anteater: Interactive Visualization of Program Execution Values in Context

Rebecca Faust,
Katherine Isaacs,
William Z. Bernstein
et al.

Abstract: Fig. 1. A programmer investigates a bug in their code. One common practice, shown in the top row, is to instrument the program manually to collect suspicious variables (in this case x), and print out their values. Manual instrumentation, however, is itself error-prone and leaves the programmer responsible for sifting through values. Another common practice, shown in the second row, is to use a debugger to stop the execution of the program automatically and view each assignment of x individually. However, break… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 27 publications
(35 reference statements)
0
2
0
Order By: Relevance
“…Let us now consider that our program is also constituted of a moded version of the concat/3 predicate introduced in Section 1: The predicate calls in the example above being recursive calls, we introduce the following example to illustrate the case where a predicate makes calls to other predicates. The analysis finds the following final interaction set for dapp: (5),ψ ⊥ (4),ψ a (11),⇒ cons (8),⇐ cons (10),ψ ⊥ (9),ψ a (12)} L4, L2 {:=(2),ψ ⊥ (4),⇐ cons (5),ψ a (11),⇒ cons (8),⇐ cons (10),ψ ⊥ (9),ψ a (12)} L4, L3 {:=(7),ψ ⊥ (9),⇐ cons (10),ψ a (12)…”
Section: Zs and Zsmentioning
confidence: 99%
“…Let us now consider that our program is also constituted of a moded version of the concat/3 predicate introduced in Section 1: The predicate calls in the example above being recursive calls, we introduce the following example to illustrate the case where a predicate makes calls to other predicates. The analysis finds the following final interaction set for dapp: (5),ψ ⊥ (4),ψ a (11),⇒ cons (8),⇐ cons (10),ψ ⊥ (9),ψ a (12)} L4, L2 {:=(2),ψ ⊥ (4),⇐ cons (5),ψ a (11),⇒ cons (8),⇐ cons (10),ψ ⊥ (9),ψ a (12)} L4, L3 {:=(7),ψ ⊥ (9),⇐ cons (10),ψ a (12)…”
Section: Zs and Zsmentioning
confidence: 99%
“…Existing tools for tracing Python code focus on performance profiling for time (cProfile) or memory consumption (memprofile). Anteater [12] is a Python tracer tool to debug Python applications. It performs source transformations at the AST level but only deals with native numeric Python types.…”
Section: Related Workmentioning
confidence: 99%