Theia: automatically generating correct program state visualizations

Pollock, Josh; Roesch, Jared; Woos, Doug; Tatlock, Zachary

doi:10.1145/3358711.3361625

Cited by 6 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the future, it might be interesting to design a visualization that compromises between physical realism and schematic presentation in order to more faithfully match the appearance of the final object while still maintaining readability. Prior works in program state visualizers also provide insights in choosing design principles [Pollock et al 2019].…”

Section: Discussionmentioning

confidence: 99%

Coupling Programs and Visualization for Machine Knitting

McCann

2020

Symposium on Computational Fabrication

View full text Add to dashboard Cite

show abstract

Section: Discussionmentioning

confidence: 99%

Coupling Programs and Visualization for Machine Knitting

McCann

2020

Symposium on Computational Fabrication

View full text Add to dashboard Cite

show abstract

“…The PLT Redex component in GraphRedex could be replaced by a K framework component to bring exploration to the K framework. An existing visualizer for this framework is Theia, 31 a tool for educators to visualize deterministic single-threaded reductions where the reduction graph is a line. GraphRedex focuses on exploration of non-deterministic reduction relations with complex reduction graphs and enables the user to query this graph.…”

Section: Semantics Engineering Toolsmentioning

confidence: 99%

GraphRedex: Look at your research

Singh

Scholliers

2021

Softw Pract Exp

View full text Add to dashboard Cite

A significant aspect of designing new programming languages is to define their operational semantics. Working with a pen and paper version of such a semantics is notoriously difficult. For this reason, tools for computer aided semantics engineering were created. Many of these tools allow programmers to execute their language's operational semantics. An executable semantics makes it easier to verify whether the execution of a program leads to the desired result. When a program exhibits unexpected behavior, the programmer can consult the reduction graph to see what went wrong. Unfortunately, visualization of these graphs is currently not well-supported by most tools. Consequently, the comprehension of errors remains challenging. In this article, we present GraphRedex an open-source tool that empowers language designers to interactively explore their reduction graphs, offering three main benefits. First, a global exploration mode allows users to obtain a bird's-eye overview of the reduction graph and learn its high level workings. Second, a local exploration mode lets the programmer closely interact with the individual reduction rules. Third, our query interface allows the programmer to filter out and highlight specific regions of the reduction graph. We evaluated our tool by carrying out a user study showing that participants comprehend programs on average twice as fast while being able to answer questions more accurately. Finally, we demonstrate how GraphRedex helps to understand the semantics of two published works. Exploration of the semantics with GraphRedex unveiled an issue in one of the implementations of these works, which the author confirmed.

show abstract

“…Although introduced in the 1980s by DuBoulay et al [12,13] it wasn't until around 2008 that work on notional machines started to appear in the literature with focus, for instance [8,28]. The work of Sorva was influential in this period [29][30][31] followed by other authors through 2019, including [3,4,6,7,10,14,17,21,26,34,35].…”

Section: Notional Machine Literaturementioning

confidence: 99%