Approved for public release; distribution is unlimited / This work adds new functionality to an existing visual programming environment. It applies software maintenance techniques for use with the Java Language in a Microsoft Windows operating system environment. The previously undocumented application is intended to support programming with executable diagrams. This application has the potential to expand programming access to non-programmers, provide better software documentation and improve software maintainability. It is currently capable of supporting meta-programming tasks such as parsing and compiler building. The 11,184 legacy lines of code(LOC) were corrected, extended and documented to support future maintenance using an additional 957 LOC and changes to 45 LOC. / Major, United States Marine Corps

Spreadsheet languages are the most commonly used end-user programming paradigm, yet spreadsheets commonly contain errors. Research shows that a significant number of spreadsheets (20%-40%) created by end users contain errors. In an attempt to reduce this error rate, this work presents an assertion propagation system for an end-user spreadsheet programming language, along with proofs of correctness, and complexity analysis. In addition to the traditional benefits of assertions (dynamic error checking and the documentation of programmer assumptions) this system deductively propagates the implications of assertions. This propagation adds two benefits, the cross-checking of program logic, and additional immediate visual feedback about the range of behavior of the program code for the end-user. / Graduation date: 2002

Researchers in the Forms/3 group have previously developed the WYSIWYT methodology, exploring a way of systematically testing spreadsheet languages. The previous work presented the WYSIWYT methodology for individual spreadsheet cells, and later partially extended it to large grids in which some cells share the same formula. The Forms/3 spreadsheet language supports not only operations of individual cells but also some advanced programming features such as homogeneous grids, recursive programs, and user-defined abstract data types. Therefore, it is important for the testing methodology to support even these more powerful features of the language, not just the "easy parts". In this document, we present extensions to the WYSIWYT methodology for these advanced features. We optimized the visual aspects of testing spreadsheet grids and collected experimental information about scalability. We also developed two possible ways the WYSIWYT methodology could be extended to accommodate recursion in terms of their testing theoretic aspects, implementation strategies, algorithms and time complexities. Since the ultimate goal is to help the people using these languages, we also conducted an empirical study and used its results to inform our choice as to which of these two approaches to adopt. Finally, we developed an approach of testing user-defined abstract data types; here we present design, implementation issues, algorithms and time complexities. / Graduation date: 2002

E-commerce has begun to evolve beyond simple web pages to more sophisticated ways of conducting e-business transactions, such as through electronic advertising, negotiation, and delivery. However, to participate in these advances requires the skills of professional programmers, and end-user owners of small businesses often cannot justify this expense. In this thesis, we present FAR, an end-user language to offer and deliver e-services. The novel aspects of FAR are its support of small e-services and its multiparadigm approach to combining ideas from spreadsheets and rule-based programming with drag-and-drop web page layout devices. / Graduation date: 2002

How can rigorous forms of testing be supported in a way that is both compatible with the visual aspect of visual programming languages, and usable by the audiences using those languages - even when the audience has no background in software engineering? Visual programs are likely to contain at least some errors, and supporting a visual form of testing would give users a way to spot those errors early in the program's life. In previous work, we have developed a visual testing methodology known as WYSIWYT, for use in visual spreadsheet languages, and in this work, we show formally that this methodology can be generalized to screen transition diagrams. The algorithms and accompanying proof of the coverage equivalence that they ensure provide the mechanisms needed for the screen transition paradigm to incorporate WYSIWYT testing for both professional and end-user programming audiences. / Graduation date: 2004 / Best scan available for figures. Original is blurry.

How might capabilities for algorithm animation be seamlessly integrated into a programming language that is both visual and declarative? Until now, visual programming language researchers have not attempted to answer that question, making the fruits of algorithm animation available only to users of textual programming languages. Users of visual programming languages (VPLs) have been deprived of the unique semantic insights algorithm animation offers, insights that would foster the understanding and debugging of visual programs. We have answered the question by seamlessly integrating algorithm animation capabilities into Forms/3, a general-purpose, declarative VPL. Our results show that such a VPL can support algorithm animation without leaving the declarative, visual model, without adding new concepts to the language or how to program in it, and without deviating from the uniform representation established for the language. In addition, our research shows that the characteristics of declarative VPLs result in some interesting algorithm animation features not found in other systems. / Graduation date: 1995

Formal methods using text to specify abstract data types (ADTs) are powerful, but they require great effort and a high level of expertise. Visual programming languages present an alternative way of programming but are limited to building small programs. This research presents an approach for specifying ADTs using a combination of text and visual objects. Furthermore, it presents two algorithms to map those specifications into imperative code. DataLab, a computer program for the MacintoshTM computer, is an implementation model for this approach. DataLab consists of two major components: a graphical editor and a source code generator. The graphical editor allows the user to build a specification consisting of an interface part and an implementation part for each ADT. The interface of the ADT is specified textually in a window that is part of the graphical editor. The implementation part of the ADT includes the operations, which are specified in Data Lab as a set of "Condition/Action" transformations. These transformations describe the behavior of the operations and are built by selecting graphical objects from a palette and placing them on the screen. The source code generator takes the specification of the ADT as an input and generates an encapsulated Pascal code. It consists of two algorithms: the first maps the specification into its semantics, and the second maps the semantics into Pascal modules. / Graduation date: 1990

Thesis (M. Sc.)--University of Canterbury, 2009. / Typescript (photocopy). Includes bibliographical references (leaves 82-93). Also available via the World Wide Web.

No description available.

This study implemented an experimental introductory CS course for non-CS majors focusing on two pedagogic factors: 1) the use of a visual blocks programming language known as App Inventor for Android (AIA) and 2) the adoption of SBL as the main teaching methodology. Participants included 30 undergraduates enrolled in two introductory CS courses; the experimental course (CS116) and a traditional lecture oriented CS course. The Motivated Strategies for Learning Questionnaire (MSLQ) was implemented in both courses at several stages. Statistically significant differences were found in the Control of Learning Beliefs, Help Seeking, and Intrinsic Motivation scales, were CS116’s participants scored higher rates. In CS116, entry and exit interviews were conducted as well as a mind maps analysis. Their results showed a positive response to the pedagogic factors, positive attitudes towards CS, and an improvement in the understanding of CS. The majority of participants did very well and showed creativity with not one student failing the course. They found the experimental course to cultivate collaboration, creativity, and motivation to learn. The experimental approach was found have a positive effect on students’ motivation, achievement, and attitude towards CS. / Department of Computer Science