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

Charles P. Pfleeger

dblp:41/1786 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 1989
—ORCID · none

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

Security and privacy · 3 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1Human-computer interaction and ubiquitous computing · 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.

Theoretical computer science
1 paper
Automata and formal languages · 91% Logic in computer science · 9%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages
finite automata
0.011973
State Reduction in Incompletely Specified Finite-State Machines · IEEE Trans. Computers 1973
Automata and formal languages › finite automata › sequential machines
partial FSM
0.011973
State Reduction in Incompletely Specified Finite-State Machines · IEEE Trans. Computers 1973
Automata and formal languages › automata algorithms
state minimization
0.011973
State Reduction in Incompletely Specified Finite-State Machines · IEEE Trans. Computers 1973
Performance modeling and evaluation › simulation › processor simulation
instruction set simulation
0.011978
ASSIST-V: An Environment Simulator for IBM 360 Systems Software Development · IEEE Trans. Software Eng. 1978
Logic in computer science › completeness
polynomial completeness
0.011973
State Reduction in Incompletely Specified Finite-State Machines · IEEE Trans. Computers 1973

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

environment simulation · 0.0debugging aids · 0.0state splitting · 0.0state assignment · 0.0complexity analysis · 0.0
YearPublicationVenuePosition
1989 Tea and I: An Allergy
abstract
Problems associated with the application of the connectivity approach to computer system security are addressed. The failure of trusted connectivity to protect computer systems is indicated. The work is presented in the form of a humorous allegory.
M. Schaefer, W. C. Barker, Charles P. Pfleeger
S&P3
1989 A methodology for penetration testing
Charles P. Pfleeger, Shari Lawrence Pfleeger, Mary Frances Theofanos
Comput. Secur.1
1988 A transaction flow approach to software security certification for document handling systems
Charles P. Pfleeger, Shari Lawrence Pfleeger
Comput. Secur.1
1978 ASSIST-V: An Environment Simulator for IBM 360 Systems Software Development
abstract
This paper describes ASSIST-V, a software tool designed for use in the teaching of operating systems, fie management, and machine architecture courses. ASSIST-V is a program that provides an environment for the implementation, testing, and evaluation of systems software for the IBM 360 series machines. This capability is achieved by simulating all relevant aspects of the machine's architecture. In particular, ASSIST-V simulates interrupts, I/O channels, and I/O devices, as well as all IBM 360 machine instructions. In addition, ASSIST-V provides extensive debugging and statistics-gathering aids.
Charles E. Hughes, Charles P. Pfleeger
IEEE Trans. Software Eng.2
1977 ORACLE a tool for learning compiler writing
abstract
This paper describes a compiler called ORACLE which allows a student to examine the actions performed by a simple compiler. Two features are provided to assist the student. The first called replacement mode, provides the necessary conditions to simulate the replacement of three compiler components: symbol table management, lexical analysis, and syntax analysis. Each replacement module is monitored by ORACLE in order to detect errors and to verify correct operation. The second, a trace option, permits source statements to initiate or terminate a selective monitoring of the actions of the compiler.
William R. Haynes, Charles E. Hughes, Charles P. Pfleeger
SIGCSE-13
1973 State Reduction in Incompletely Specified Finite-State Machines
abstract
The problem of reducing the number of states in an arbitrary incompletely specified deterministic finite-state machine to k states (for a given k) has proven intractible to solution within "reasonable" time; most techniques seem to require exponential time. Two reduction techniques–state assignment to the DON'T CARE entries, and so-called "state splitting"–are investigated. For both of the techniques, the question, "Can I achieve an equivalent k state machine?" is shown to be polynomial complete, with the resulting conjecture that neither is solvable in time bounded by a polynomial function of the size of the machine.
Charles P. Pfleeger
IEEE Trans. Computers1