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.

Gary L. Luckenbaugh

dblp:99/6785 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 1987
—ORCID · none

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

Security and privacy · 2Software engineering, systems software and programming languages · 2

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
4 papers
Operating systems · 52% Software testing · 48%
Network and information security
2 papers
Systems and software security · 82% Authentication and access control · 18%

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

TopicWeightPapersLastEvidence papers
Software testing › non-functional testing
security testing
0.021987
A New Security Testing Method and Its Application to the Secure Xenix Kernel · IEEE Trans. Software Eng. 1987
A New Security Testing Method and Its Application to the Secure Xenix Kernel · S&P 1986
Operating systems › system security
operating system security
0.021986
A New Security Testing Method and Its Application to the Secure Xenix Kernel · S&P 1986
On the Design and the Implementation of Secure Xenix Workstations · S&P 1986
Software testing › system software testing
kernel testing
0.021987
A New Security Testing Method and Its Application to the Secure Xenix Kernel · S&P 1986
A New Security Testing Method and Its Application to the Secure Xenix Kernel · IEEE Trans. Software Eng. 1987
Operating systems › system security › operating system security
secure operating system
0.011987
Design and Implementation of Secure Xenix · IEEE Trans. Software Eng. 1987
Systems and software security › operating system security
security kernel
0.011986
On the Design and the Implementation of Secure Xenix Workstations · S&P 1986
Operating systems › system security › operating system security › secure operating system
security kernel
0.011986
A New Security Testing Method and Its Application to the Secure Xenix Kernel · S&P 1986
Systems and software security › operating system security
UNIX security
0.011987
Design and Implementation of Secure Xenix · IEEE Trans. Software Eng. 1987
Authentication and access control
security policy
0.011986
On the Design and the Implementation of Secure Xenix Workstations · S&P 1986
Software testing
test coverage
0.011986
A New Security Testing Method and Its Application to the Secure Xenix Kernel · S&P 1986

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

control synthesis graphs · 0.0white-box testing · 0.0black-box testing · 0.0access check separability · 0.0
YearPublicationVenuePosition
1987 Design and Implementation of Secure Xenix
abstract
Secure Xenix™ is an experimental system designed to run on IBM PC/AT workstations. Like Xenix, it is a Unix™ System V implementation on the PC/AT workstation; unlike Xenix, it eliminates the Unix security deficiencies and it enhances security policies. In this paper, we present the design features of Secure Xenix, their integration within Xenix, and some of the lessons learned from this experiment to date.
Virgil D. Gligor, C. Sekar Chandersekaran, Robert S. Chapman, Leslie J. Dotterer, Matthew S. Hecht, Wen-Der Jiang, Abhai Johri, Gary L. Luckenbaugh, N. Vasudevan
IEEE Trans. Software Eng.8
1987 A New Security Testing Method and Its Application to the Secure Xenix Kernel
abstract
A new security testing method is proposed that combines the advantages of both traditional "black box" (monolithic functional) testing and "white box" (functional-synthesis-based) testing. The new method allows significant coverage both for security model-based tests and for individual kernel-call tests. It eliminates redundant kernel test cases 1) by using a variant of control synthesis graphs, 2) by analyzing dependencies between descriptive kernel-call specifications, and 3) by exploiting access check separability. A higher degree of test assurance is achieved than that of other security testing methods because the new method helps eliminate cyclic dependencies among test programs for different kernel calls. The application of this method to the testing of the Secure Xenix™ kernel is illustrated.
Virgil D. Gligor, C. Sekar Chandersekaran, Wen-Der Jiang, Abhai Johri, Gary L. Luckenbaugh, L. Edward Reich
IEEE Trans. Software Eng.5
1986 On the Design and the Implementation of Secure Xenix Workstations
abstract
Secure Xenix * is an experimental system designed to run on IBM PC/AT workstations. Like Xenix, it is a Unix implementation on the PC/AT workstation; unlike Xenix, it eliminates the Unix security deficiencies and it enhances security policies. In this paper, we present the design features of Secure Xenix, their integration within Xenix, and some of the lessons learned from this experiment to date. In addition, we address some of the problems specific to workstations in the security management area. The major design differences between Secure Xenix and other experiments with Unix security enhancements, such as LINUS IV, are also presented. In a companion paper, we present the important problems that arise in the testing of Secure Xenix and their solutions.
Virgil D. Gligor, E. L. Burch, C. Sekar Chandersekaran, Robert S. Chapman, Leslie J. Dotterer, Matthew S. Hecht, Wen-Der Jiang, Gary L. Luckenbaugh, N. Vasudevan
S&P8
1986 A New Security Testing Method and Its Application to the Secure Xenix Kernel
abstract
A new security testing method is proposed that combines the advantages of both traditional "black box" (monolithic functional) testing and "white box" (functional-synthesis- based) testing. The new method allows significant coverage both for security model-based tests and for individual kernel-call tests. It eliminates redundant kernel test cases (1) by using a variant of control synthesis graphs, (2) by analyzing dependencies between descriptive kernel-call specifications, and (3) by exploiting access check separability. A higher degree of test assurance is achieved than that of other security testing methods because the new method helps eliminate cyclic dependencies among test programs for different kernel calls. The application of this method to the testing of the Secure Xenix* kernel is illustrated. The design and the implementation of Secure Xenix are presented in a companion paper.
Virgil D. Gligor, C. Sekar Chandersekaran, W. Cheng, Wen-Der Jiang, Abhai Johri, Gary L. Luckenbaugh, L. Edward Reich
S&P6