Brian A. Malloy
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Brian A. Malloy has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- James F. Power
Maynooth University
4 shared publications - Nicholas A. Kraft
Department of Computer Science, Clemson University, Clemson, SC, USA
2 shared publications - Errol L. Lloyd
University of Delaware
1 shared publication J.D. McGregor
Department of Computer Science, Clemson University, Clemson, SC 29634 USA; {
1 shared publication- Joel E. Denny
School of Computing, Clemson University, Clemson, SC 29634, USA
1 shared publication - Peter J. Clarke
School of Computer Science, Florida International University, Miami, FL 33199, United States
1 shared publication
Latest Publications
- 10 September 2009
- Published by Elsevier in Science of Computer Programming
- Vol. 75 (11) , 943-979
The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution
- 10 September 2009
- Published by Elsevier in Science of Computer Programming
- Vol. 75 (11) , 943-979
The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution
- 4 January 2007
- Published by Elsevier in Information and Software Technology
- Vol. 49 (3) , 292-307
An infrastructure to support interoperability in reverse engineering
- 4 January 2007
- Published by Elsevier in Information and Software Technology
- Vol. 49 (3) , 292-307
An infrastructure to support interoperability in reverse engineering
- 1 August 2006
- Published by Elsevier in Journal of Systems and Software
- Vol. 79 (8) , 1092-1109
The implementation of an extensible system for comparison and visualization of class ordering methodologies
- 1 August 2006
- Published by Elsevier in Journal of Systems and Software
- Vol. 79 (8) , 1092-1109
The implementation of an extensible system for comparison and visualization of class ordering methodologies
- 6 October 2005
- Published by Wiley in Software Testing, Verification and Reliability
- Vol. 16 (2) , 71-95
Exploiting design patterns to automate validation of class invariants
- 6 October 2005
- Published by Wiley in Software Testing, Verification and Reliability
- Vol. 16 (2) , 71-95
Exploiting design patterns to automate validation of class invariants
- 18 November 2004
- Published by Wiley in Journal of Software Maintenance and Evolution: Research and Practice
- Vol. 16 (6) , 405-426
A metrics suite for grammar‐based software
One approach to measuring and managing the complexity of software, as it evolves over time, is to exploit software metrics. Metrics have been used to estimate the complexity of the maintenance effort, to facilitate change impact analysis, and as an indicator for automatic detection of a transformation that can improve the quality of a system. However, there has been little effort directed at applying software metrics to the maintenance of grammar‐based software applications, such as compilers, editors, program comprehension tools and embedded systems. In this paper, we adapt the software metrics that are commonly used to measure program complexity and apply them to the measurement of the complexity of grammar‐based software applications. Since the behaviour of a grammar‐based application is typically choreographed by the grammar rules, the measure of complexity that our metrics provide can guide maintainers in locating problematic areas in grammar‐based applications. Copyright © 2004 John Wiley & Sons, Ltd.
- 18 November 2004
- Published by Wiley in Journal of Software Maintenance and Evolution: Research and Practice
- Vol. 16 (6) , 405-426
A metrics suite for grammar‐based software
One approach to measuring and managing the complexity of software, as it evolves over time, is to exploit software metrics. Metrics have been used to estimate the complexity of the maintenance effort, to facilitate change impact analysis, and as an indicator for automatic detection of a transformation that can improve the quality of a system. However, there has been little effort directed at applying software metrics to the maintenance of grammar‐based software applications, such as compilers, editors, program comprehension tools and embedded systems. In this paper, we adapt the software metrics that are commonly used to measure program complexity and apply them to the measurement of the complexity of grammar‐based software applications. Since the behaviour of a grammar‐based application is typically choreographed by the grammar rules, the measure of complexity that our metrics provide can guide maintainers in locating problematic areas in grammar‐based applications. Copyright © 2004 John Wiley & Sons, Ltd.
- 12 November 2002
- Published by Wiley in Software: Practice and Experience
- Vol. 33 (1) , 19-39
Decorating tokens to facilitate recognition of ambiguous language constructs
Software tools are fundamental to the comprehension, analysis, testing and debugging of application systems. A necessary first step in the development of many tools is the construction of a parser front‐end that can recognize the implementation language of the system under development. In this paper, we describe our use of token decoration to facilitate recognition of ambiguous language constructs. We apply our approach to the C++ language since its grammar is replete with ambiguous derivations such as the declaration/expression and template‐declaration/expression ambiguity. We describe our implementation of a parser front‐end for C++, keystone, and we describe our results in decorating tokens for our test suite including the examples from Clause Three of the C++ standard. We are currently exploiting the keystone front‐end to develop a taxonomy for implementation‐based class testing and to reverse‐engineer Unified Modeling Language (UML) class diagrams. Copyright © 2002 John Wiley & Sons, Ltd.
- 12 November 2002
- Published by Wiley in Software: Practice and Experience
- Vol. 33 (1) , 19-39
Decorating tokens to facilitate recognition of ambiguous language constructs
Software tools are fundamental to the comprehension, analysis, testing and debugging of application systems. A necessary first step in the development of many tools is the construction of a parser front‐end that can recognize the implementation language of the system under development. In this paper, we describe our use of token decoration to facilitate recognition of ambiguous language constructs. We apply our approach to the C++ language since its grammar is replete with ambiguous derivations such as the declaration/expression and template‐declaration/expression ambiguity. We describe our implementation of a parser front‐end for C++, keystone, and we describe our results in decorating tokens for our test suite including the examples from Clause Three of the C++ standard. We are currently exploiting the keystone front‐end to develop a taxonomy for implementation‐based class testing and to reverse‐engineer Unified Modeling Language (UML) class diagrams. Copyright © 2002 John Wiley & Sons, Ltd.
- 1 January 2001
- Published by Taylor & Francis in International Journal of Computers and Applications
- Vol. 23 (3) , 152-158
Exploiting Iostreams to Integrate a GUI Into a Command Driven Application
There are many applications in use today, that are driven by a command line interface, rather than a graphical interface. Most of these applications are robust, popular and proven in general usage. The convenience and ease of use that a graphical interface provides might make these applications available to a wider range of users. Previous approaches for integrating a graphical interface into command driven software have focused on using a pipe variation to negotiate communication between two processes. The advantage of using a pipe is that communication can be established without knowledge of the source code for the command driven application; the disadvantages are that, the linkage can be slow and for some large applications, the system may stall. In this work, we describe a technique that exploits ostreams and subtyping to integrate a graphical interface into a command driven application. The technique we propose does not create a new process to construct the communication linkage nor does it require a sentinel to terminate the linkage. We use this technique to integrate a graphical interface into legacy code and a grader program that maintains a list of student grades. The grader program is coded in C++ , exploits the Command and Envelope-Letter patterns, and uses the standard library containers, algorithms, and iterators to implement much of its functionality.
- 1 January 2001
- Published by Taylor & Francis in International Journal of Computers and Applications
- Vol. 23 (3) , 152-158
Exploiting Iostreams to Integrate a GUI Into a Command Driven Application
There are many applications in use today, that are driven by a command line interface, rather than a graphical interface. Most of these applications are robust, popular and proven in general usage. The convenience and ease of use that a graphical interface provides might make these applications available to a wider range of users. Previous approaches for integrating a graphical interface into command driven software have focused on using a pipe variation to negotiate communication between two processes. The advantage of using a pipe is that communication can be established without knowledge of the source code for the command driven application; the disadvantages are that, the linkage can be slow and for some large applications, the system may stall. In this work, we describe a technique that exploits ostreams and subtyping to integrate a graphical interface into a command driven application. The technique we propose does not create a new process to construct the communication linkage nor does it require a sentinel to terminate the linkage. We use this technique to integrate a graphical interface into legacy code and a grader program that maintains a list of student grades. The grader program is coded in C++ , exploits the Command and Envelope-Letter patterns, and uses the standard library containers, algorithms, and iterators to implement much of its functionality.