Results 1 - 10 of 355

RegViz: Visual Debugging of Regular Expressions

by Fabian Beck, Stefan Gulan, Benjamin Biegel, Sebastian Baltes, Daniel Weiskopf
"... Regular expressions are a widely used programming tech-nique, but seem to be neglected by software engineering research. Encoding complex string parsing in a very com-pact notation, their complexity and compactness, however, introduce particular challenges with respect to program com-prehension. In ..."
Abstract - Add to MetaCart
-prehension. In this paper, we present RegViz, an approach to visually augment regular expressions without changing their original textual notation. The visual encoding clarifies the structure of the regular expressions and clearly discerns included tokens by function. The approach also provides advanced visual highlighting

Temporal Model for Debugging and Visualizations

by Demian Lessa, Bharat Jayaraman
"... This paper discusses the benefits of a temporal data model for debugging and run-time visualization of object-oriented software. Current debugging models generally only provide access to the current program state and support manual exploration of the state to uncover the cause of program errors. How ..."
Abstract - Add to MetaCart
, for nested calls and also a sequence of calls; and filtering operations, to remove unnecessary or irrelevant calls relative to a debugging task. We introduce a refinement of the sequence diagram to account for missing calls, and regular-expression labels for compacted execution sequences. Together

GraphLog: a Visual Formalism for Real Life Recursion

by Mariano Consens, Alberto O. Mendelzon - In Proceedings of the Ninth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems , 1990
"... We present a query language called GraphLog, based on a graph representation of both data and queries. Queries are graph patterns. Edges in queries represent edges or paths in the database. Regular expressions are used to qualify these paths. We characterize the expressive power of the language a ..."
Abstract - Cited by 193 (18 self) - Add to MetaCart
We present a query language called GraphLog, based on a graph representation of both data and queries. Queries are graph patterns. Edges in queries represent edges or paths in the database. Regular expressions are used to qualify these paths. We characterize the expressive power of the language

D³: data-driven documents

by Michael Bostock, Vadim Ogievetsky, Jeffrey Heer - IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS , 2011
"... Data-Driven Documents (D3) is a novel representation-transparent approach to visualization for the web. Rather than hide the underlying scenegraph within a toolkit-specific abstraction, D³ enables direct inspection and manipulation of a native represen-tation: the standard document object model (DO ..."
Abstract - Cited by 209 (11 self) - Add to MetaCart
Data-Driven Documents (D3) is a novel representation-transparent approach to visualization for the web. Rather than hide the underlying scenegraph within a toolkit-specific abstraction, D³ enables direct inspection and manipulation of a native represen-tation: the standard document object model

Scalable Visualizations and Query-Based Debugging

by Demian Lessa, Bharat Jayaraman, Jeffrey K. Czyz
"... Interactive run-time visualization of object-oriented software requires views of the current state as well as the execution history. However, as software complexity grows, runtime visualizations become unwieldy and their effectiveness quickly degrades, necessitating techniques to scale the them grac ..."
Abstract - Add to MetaCart
introduce a refinement of the sequence diagram to account for missing calls, and regular-expression labels for compacted execution sequences. Together, these techniques have proven to be effective, and they have been implemented and tested as part of the dynamic analysis tool,

Visual Programming and Debugging for Parallel Computing

by James C. Browne, Syed I, Jack Dongarra, Keith Moore, Peter Newton - IEEE Parallel and Distributed Technology , 1995
"... representations ofparallel programs simplify pi-ogra mming and debugging by providing a single, consistent fra mework that separates a program’s sequential computations from its parallel structure. arallel architectures have clearly emerged as the future environments for high-performance computation ..."
Abstract - Cited by 47 (1 self) - Add to MetaCart
representations ofparallel programs simplify pi-ogra mming and debugging by providing a single, consistent fra mework that separates a program’s sequential computations from its parallel structure. arallel architectures have clearly emerged as the future environments for high

Proof-Directed Debugging

by Robert Harper , 2000
"... The close relationship between writing programs and proving theorems has frequently been cited as an advantage of functional programming languages. We illustrate the interplay between programming and proving in the development of a program for regular expression matching. The presentation is inspire ..."
Abstract - Cited by 23 (1 self) - Add to MetaCart
The close relationship between writing programs and proving theorems has frequently been cited as an advantage of functional programming languages. We illustrate the interplay between programming and proving in the development of a program for regular expression matching. The presentation

detecting the unexpected in distributed systems

by Patrick Reynolds, Charles Killian, Janet L. Wiener, Jeffrey C. Mogul, Mehul A. Shah, Amin Vahdat - In NSDI’06: Proceedings of the 3rd conference on 3rd Symposium on Networked Systems Design & Implementation
"... Bugs in distributed systems are often hard to find. Many bugs reflect discrepancies between a system’s behavior and the programmer’s assumptions about that behavior. We present Pip 1, an infrastructure for comparing actual behavior and expected behavior to expose structural errors and performance pr ..."
Abstract - Cited by 141 (7 self) - Add to MetaCart
problems in distributed systems. Pip allows programmers to express, in a declarative language, expectations about the system’s communications structure, timing, and resource consumption. Pip includes system instrumentation and annotation tools to log actual system behavior, and visualization and query

SWYN: A Visual Representation for Regular Expressions

by Alan F. Blackwell, Morgan Kauffman , 2001
"... People find it difficult to create and maintain abstractions. We often deal with abstract tasks by using notations that make the structure of the abstraction visible. PBE systems sometimes make it more difficult to create abstractions. The user has to second-guess the results of the inference algori ..."
Abstract - Cited by 36 (2 self) - Add to MetaCart
algorithm, and sometimes cannot see any visual representation of the inferred result, let alone manipulate it easily. SWYN (See What You Need) addresses these issues in the context of constructing regular expressions from examples. It provides a visual representation that has been evaluated in empirical

(s|qu)eries: Visual Regular Expressions for Querying and Exploring Event Sequences

by Emanuel Zgraggen, Steven M. Drucker, Danyel Fisher, Robert Deline
"... Figure 1. Two queries on a fictional shopping website web log. Left: Query to explore checkout behaviors of users depending on direct referral versus users that were referred from a specific website. Right: Query to view geographical location of customers that used the search feature. Many different ..."
Abstract - Add to MetaCart
well to large and multi-faceted data sets. In this pa-per we present (s|qu)eries (pronounced “Squeries”), a visual query interface for creating queries on sequences (series) of data, based on regular expressions. (s|qu)eries is a touch-based system that exposes the full expressive power of regu-lar
Results 1 - 10 of 355