James F. Leathrum Jr.

dblp:00/10129 · also James F. Leathrum, James Leathrum · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
1since 2021 · last 2025
0009-0009-5620-2860ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 5 · 1 first-authorSystems, architecture and hardware · 2 · 2 first-authorTheory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Software testing · 93% Operating systems · 7%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software testing
automated testing
0.011996
Issues in the Full Scale Use of Formal Methods for Automated Testing · ISSTA 1996
Software testing
specification-based testing
0.011996
Issues in the Full Scale Use of Formal Methods for Automated Testing · ISSTA 1996
Software testing › test generation
test suite generation
0.011996
Issues in the Full Scale Use of Formal Methods for Automated Testing · ISSTA 1996
Operating systems › operating system interface
POSIX
0.011994
The Role of Testing Methodologies in Open Systems Standards: A POSIX Experience Report · ICSE 1994

Methods — techniques the papers use, named apart from their topics

formal specification · 0.0executable test translation · 0.0
YearPublicationVenuePosition
2025 Out of Order and Causally Correct: Ready-Event Discovery through Data-Dependence Analysis
abstract
Data-dependence analysis can identify causally-unordered events in a pending event set. The execution of these events is independent from all other scheduled events, making them ready for execution. These events can be executed out of order or in parallel. This approach may find and utilize more parallelism than spatial-decomposition parallelization methods, which are limited by the number of subdomains and by synchronization methods. This work provides formal definitions that use data-dependence analysis to find causally-unordered events and uses these definitions to measure parallelism in several discrete-event simulation models. A variant of the event-graph formalism is proposed, which assists with identifying ready events, by more clearly visualizing data dependencies between event types. Data dependencies between two event types may be direct or indirect, where the latter case considers the scheduling of intermediate events. Data dependencies and scheduling dependencies in a discrete-event simulation model are used to define time-interval limits that support the identification of events that are ready for execution. Experimental results from serial simulation testing demonstrate the availability of numerous events that are ready for execution, depending on model characteristics. The mean size of the ready-event set varies from about 1.5 to 110 for the tested models, depending on the model type, the size of the model, and delay distribution parameters. These findings support future work to develop a parallel capability to dynamically identify and execute ready events in a multi-threaded environment.
Erik J. Jensen, James F. Leathrum Jr., Christopher J. Lynch, Katherine Smith, Ross Gore
SIGSIM-PADS2
1996 Verification of IEEE Compliant Subtractive Division Algorithms
Paul S. Miner, James F. Leathrum Jr.
FMCAD2
1996 Issues in the Full Scale Use of Formal Methods for Automated Testing
abstract
Experience from a full scale effort to apply formal methods to automated testing in the open systems software arena is described. The formal method applied in this work is based upon the Clemson Automated Testing System (CATS) which includes a formal specification language, a set of guidelines describing how to use the method effectively, and tool support capable of translating formal specifications into executable tests. This method is currently being used to develop a full scale test suite for IEEE's Ada Language Binding to POSIX. Following an overview of CATS, an experience report consisting of results, lessons learned and future directions is presented.
James L. Crowley, James F. Leathrum Jr., K. A. Liburdy
ISSTA2
1994 The Role of Testing Methodologies in Open Systems Standards: A POSIX Experience Report
G. Deshmukh, R. Deshpande, James F. Leathrum Jr., K. A. Liburdy
ICSE3
1993 The Evolving Role of Testing in Open Systems Standards
abstract
Open systems standards are developed through a consensus building process for the purpose of promoting portability and interoperability of software and hardware. Clearly, the ability to achieve such goals is directly related to the ability to enforce adherence to a standard. Perhaps less obvious is the impact of developing test specifications concurrently with the development of the standards. As the standards development process matures, lessons learned through experience will likely demonstrate that both these roles of testing are crucial to the success of a standard.>
James F. Leathrum Jr., K. A. Liburdy
ITC1
1993 Automated Testing of Open Software Standards
abstract
This paper illustrates the power and flexibility of a new approach to creating conformance test suites for open systems software standards such as POSIX. The approach incorporates an automated process for the generation and validation of conformance tests. The automated process has been implemented and comprises key components of the Clemson Automated Testing System (CATS). CATS is a testing facility designed to provide a life-cycle support environment for the development of conformance tests. This paper introduces the CATS facility and presents examples of its use.>
James F. Leathrum Jr., K. A. Liburdy
ITC1
1985 Orthogonality of Concerns in Module Closure
abstract
Abstract Information hiding in software design leads to the concept of module closure. The function of modularization in a design is to hide a design decision, facilitating the design of programs which employ that module. This produces a module which may be used elsewhere regardless of its implementation details. Module closure has two components—access closure, wherein the module and user share no data objects, but only the values of formal parameters, and computation closure, wherein the model which the module emulates is as simple as possible, and implementation independent.
Geoffrey George, James F. Leathrum Jr.
Softw. Pract. Exp.2
1982 A Design Medium for Software
abstract
Abstract A design medium for software is proposed and illustrated. The medium, which employs rectangular, embedded contours, provides a high level of scale independence. Module specifications, logic design and program elements are easily intermixed in a design. The proposed module formalization includes interface specification, exceptions, logic design and effects in an order which will ultimately be exhibited by the program code as well.
James F. Leathrum Jr.
Softw. Pract. Exp.1