Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Richard C. Linger

dblp:49/1435 · also Rick Linger · DBLP profile ↗
← Back
15ranked-venue papers
5as first author
2since 2021 · last 2024
0000-0003-1209-8829ORCID · corroborated

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

Software engineering, systems software and programming languages · 10 · 4 first-authorArtificial intelligence and machine learning · 2Security and privacy · 2 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorSystems, architecture and hardware · 1Theory of computation · 1 · 1 since 2021

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
3 papers
Programming languages and type systems · 51% Software testing · 30% Requirements engineering and software design · 20%

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

TopicWeightPapersLastEvidence papers
Software testing
software validation
0.011989
Mathematics-Based Software Engineering for Completely Validated Software · ICSE 1989
Programming languages and type systems
control structures
0.011986
Data Structured Programming: Program Design without Arrays and Pointers · IEEE Trans. Software Eng. 1986
Requirements engineering and software design › design process
program design
0.011986
Data Structured Programming: Program Design without Arrays and Pointers · IEEE Trans. Software Eng. 1986
Programming languages and type systems › programming paradigms
structured programming
0.011986
Data Structured Programming: Program Design without Arrays and Pointers · IEEE Trans. Software Eng. 1986
Programming languages and type systems
abstract data types
0.011986
Data Structured Programming: Program Design without Arrays and Pointers · IEEE Trans. Software Eng. 1986
Programming languages and type systems
data types
0.011986
Data Structured Programming: Program Design without Arrays and Pointers · IEEE Trans. Software Eng. 1986
YearPublicationVenuePosition
2024 "Function Extraction: A New Paradigm for Producing Secure Code"
Richard C. Linger, Mark G. Pleszkoch, Jack McGaughey, John McHugh, Wided Ghardallou, Ali Mili 0001
NSPW1
2024 Invariant relations for affine loops
abstract
Abstract Invariant relations are used to analyze while loops; while their primary application is to derive the function of a loop, they can also be used to derive loop invariants, weakest preconditions, strongest postconditions, sufficient conditions of correctness, necessary conditions of correctness, and termination conditions of loops. In this paper we present two generic invariant relations that capture the semantics of loops whose loop body applies affine transformations on numeric variables.
Wided Ghardallou, Hessamaldin Mohammadi, Richard C. Linger, Mark G. Pleszkoch, Ji Meng Loh, Ali Mili 0001
Acta Informatica3
2010 IEEE Reliability Society Technical Operations Annual Technical Report for 2010
abstract
The Annual Technical Report this year is focused on infrastructure reliability. Infrastructure constitutes those things that are apparent only in their absence. We take the infrastructure for granted, assuming it will always be there. We turn on our water facet, and drinkable water has always flowed out, for most of us, most of the time. Our infrastructure is subject to environment breakages (e.g., earthquakes), accidents (e.g., dig ups of cables), sabotage, intrusion, and compromise. Also everyday component, software or system failures can bring our infrastructure down. Our global connectivity and communications, as well as our world wide distributed development and maintenance systems, increase our productivity and efficiency, but can also increase our vulnerabilities. Our critical infrastructures can be found in many places.
Norman F. Schneidewind, Mark Montrose, Alec Feinberg, Arbi Ghazarian, Jim McLinn, Christian K. Hansen, Phillip A. Laplante, Nihal Sinnadurai, Enrico Zio, Richard C. Linger, W. Eric Wong, Shiuh-Pyng Shieh, Joseph Childs
IEEE Trans. Reliab.10
2008 The impacts of function extraction technology on program comprehension: A controlled experiment
Rosann Webb Collins, Alan R. Hevner, Gwendolyn H. Walton, Richard C. Linger
Inf. Softw. Technol.4
2005 A Study of Service Composition with QoS Management
abstract
Quality of service (QoS) management in compositions of services requires careful consideration of QoS characteristics of the services and effective QoS management in their execution. A Web service is a software system that supports interoperable application-to-application interaction over the Internet. Web services are based on a set of XML standards such as simple object access protocol (SOAP). The interactions of SOAP messages between Web services form the theoretical model of SOAP message exchange patterns (MEP). Web Services Business Process Execution Language (WSBPEL) defines an interoperable integration model that facilitates automated process integration in intra- and inter-corporate environments. A service-level agreement (SLA) is a formal contract between a Web services requestor and provider guaranteeing quantifiable issues at defined levels only through mutual concessions. Based on a prior research work on message detail record (MDR), this paper further proposes a SOAP message tracking model for supporting QoS end-to-end management in the context of WSBPEL and SLA. This paper motivates the study of QoS management in a Web service composition framework with the evolution of a distributed toolkit in an industrial setting.
Casey K. Fung, Patrick C. K. Hung, Guijun Wang, Richard C. Linger, Gwendolyn H. Walton
ICWS4
2000 Survivability Analysis of Network Specifications
abstract
Survivability is the ability of a system to maintain a set of essential services despite the presence of abnormal events, such as faults and intrusions. Ensuring system survivability has increased in importance as critical infrastructures have become heavily dependent on computers. In this paper, we present a systematic method for performing survivability analysis of networks. A system architect injects fault and intrusion events into a given specification of a network and then visualizes the effects of the injected events in the form of scenario graphs. In our method, we automatically generate scenario graphs using model checking. Out method enables further global analysis, such as reliability analysis, where mathematical techniques used in different domains are combined in a systematic manner. We illustrate our ideas on an abstract model of the United States Payment System.
Somesh Jha, Jeannette M. Wing, Richard C. Linger, Thomas A. Longstaff
DSN3
1996 The incremental development process in Cleanroom software engineering
Carmen J. Trammell, Mark G. Pleszkoch, Richard C. Linger, Alan R. Hevner
Decis. Support Syst.3
1994 From software craft to software engineering: the Cleanroom method
Philip A. Hausler, Richard C. Linger
SEKE2
1993 Cleanroom Software Engineering for Zero-Defect Software
Richard C. Linger
ICSE1
1992 Eliminating non-traversable paths from structured programs
abstract
A formal procedure is given based on the use of regular expressions, to identify and eliminate nontraversable paths in a structured program. By reducing the use of control variables, the program is transformed into an unstructured variant and then restructured into a semantic equivalent of the original program with nontraversable paths eliminated. The authors demonstrate this procedure with an example and discuss its maintenance advantages.>
Mark G. Pleszkoch, Richard C. Linger, Alan R. Hevner
ICSM2
1989 Mathematics-Based Software Engineering for Completely Validated Software
abstract
No abstract available.
Richard C. Linger
ICSE1
1988 A case study in cleanroom software engineering: the IBM COBOL Structuring Facility
abstract
The IBM COBOL Structuring Facility program product was developed using cleanroom software engineering technology in a pipeline of increments with very high quality and productivity. In the cleanroom approach, programs are developed under statistical quality control and mathematical verification is used in place of unit debugging. The formal methods of specification, design, functional verification, and testing are described, together with development and management practices required for maintaining intellectual control over the process.>
Richard C. Linger, Harlan D. Mills
COMPSAC1
1988 Software maintenance as an engineering discipline
abstract
Software maintenance can be transformed from the unmanageable, trial-and-error activity into a systematic engineering discipline through application of mathematics-based principles and practices that have wrought a similar transformation in software engineering. The mathematics provides rigorous techniques for converting unstructured programs into structured form, recovering program design documentation, and modifying and verifying programs. While these principles and practices are technical, the ultimate benefits are managerial, in a new level of predictability and control of maintenance operations to meet business needs.>
Richard C. Linger
ICSM1
1986 Data Structured Programming: Program Design without Arrays and Pointers
abstract
Structured programming introduced a new discipline for accessing the instructions of a program. In suitable programming languages, this discipline can be described in terms of program design without gotos. It can be shown, for example, that any functional result achievable in a programming language with gotos can be achieved in that same language without gotos if sequence, selection, and iteration control constructs are present. The gotos permit random access to the instructions while sequence, selection, and iteration provide much more limited and disciplined access. The authors introduce a new discipline for accessing the data of a program. Any functional result achievable in a programming language with arrays and pointers can be achieved in that same language without arrays and pointers if set, stack, and queue data types are present. The arrays and pointers permit random access to the data while sets, stacks, and queues provide much more limited and disciplined access.
Harlan D. Mills, Richard C. Linger
IEEE Trans. Software Eng.2
1981 Software specification using the SPECIAL language
C. Sekar Chandersekaran, Richard C. Linger
J. Syst. Softw.2