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

Johnson M. Hart

dblp:88/837 · DBLP profile ↗
← Back
13ranked-venue papers
12as first author
0since 2021 · last 1996
—ORCID · none

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

Theory of computation · 9 · 9 first-authorSoftware engineering, systems software and programming languages · 3 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

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
1 paper
Software maintenance and evolution · 77% Compilers and program optimization · 23%
Theoretical computer science
6 papers
Automata and formal languages · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
program transformation
0.011996
A Scalable, Automated Process for Year 2000 System Correction · ICSE 1996
Automata and formal languages
formal grammars
0.041976
Right and Left Parses in Phrase-Structure Grammars · Inf. Control. 1976
Derivation Languages and Syntactical Categories · Inf. Control. 1975
Acceptors for the Derivation Languages of Phrase-Structure Grammars · Inf. Control. 1974
Automata and formal languages › formal grammars › chomsky hierarchy
context-sensitive grammars
0.011980
Derivation Structures for Strictly Context-Sensitive Grammars · Inf. Control. 1980
Automata and formal languages
parsing
0.011976
Right and Left Parses in Phrase-Structure Grammars · Inf. Control. 1976
Automata and formal languages
grammar formalisms
0.011974
A Class of Push-Down Acceptors for Adjunct Languages · IEEE Trans. Computers 1974
Automata and formal languages › formal language classes
formal language hierarchy
0.011973
An Infinite Hierarchy of Linear Local Adjunct Languages · Inf. Control. 1973
Automata and formal languages
pushdown automata
0.011974
A Class of Push-Down Acceptors for Adjunct Languages · IEEE Trans. Computers 1974

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

acceptor construction · 0.0
YearPublicationVenuePosition
1996 A Scalable, Automated Process for Year 2000 System Correction
Johnson M. Hart, Antonio Pizzarello
ICSE1
1995 Experience with Logical Code Analysis in Software Maintenance
abstract
Abstract Formal program specification and logical analysis are often used for program derivation and proofs of correctness. The basic tools include the logic of predicate calculus and Dijkstra's weakest precondition calculations. Recent work has shown that these tools are also very useful in the maintenance phase of the software life‐cycle. This paper reports experience working with software maintenance teams to apply formal methods. Formal logical analysis is invaluable for isolating defects, determining code corrections, eliminating side‐effects, and code re‐engineering. Logical analysis works well in software maintenance because many defects can be isolated to small segments of code. These small segments can then be analyzed manually or with code analysis tools. The result is lowered software maintenance costs due to the benefits of defect prevention, reduction of code complexity metrics, productivity improvements, and better specifications and documentation. It would be beneficial to use logical code analysis in the earlier phases of the software life‐cycle, such as quality assurance and inspection.
Johnson M. Hart
Softw. Pract. Exp.1
1982 Permutation Inversions and Multidimensional Cumulative Distribution Functions
Johnson M. Hart
Inf. Process. Lett.1
1982 Software Segmented Virtual Memory
abstract
Abstract The techniques of paged virtual memory, commonly employed only in large operating systems, can be provided at the software level by a small collection of primitive procedures. This paper defines the primitives and their implementation. The techniques of applying software virtual memory are also discussed, and these techniques are useful for compilers, database systems, and other applications in which large amounts of random access memory are required. Other benefits of using software virtual memory are transportability, modularity in program design, implementation on mini and microcomputers, and improved speed performance over alternative approaches.
Anthony Q. Baxter, Johnson M. Hart
Softw. Pract. Exp.2
1980 Derivation Structures for Strictly Context-Sensitive Grammars
Johnson M. Hart
Inf. Control.1
1976 Right and Left Parses in Phrase-Structure Grammars
Johnson M. Hart
Inf. Control.1
1976 The Derivation Language of a Phrase Structure Grammar
Johnson M. Hart
J. Comput. Syst. Sci.1
1976 Recursive Generation of Local Adjunct Languages
Johnson M. Hart
Math. Syst. Theory1
1975 Derivation Languages and Syntactical Categories
Johnson M. Hart
Inf. Control.1
1974 Acceptors for the Derivation Languages of Phrase-Structure Grammars
Johnson M. Hart
Inf. Control.1
1974 Ambiguity and Decision Problems for Local Adjunct Languages
Johnson M. Hart
J. Comput. Syst. Sci.1
1974 A Class of Push-Down Acceptors for Adjunct Languages
abstract
The local adjunct languages (LAL's) and grammars have been defined so as to characterize many aspects of natural and programming languages.
Johnson M. Hart
IEEE Trans. Computers1
1973 An Infinite Hierarchy of Linear Local Adjunct Languages
Johnson M. Hart
Inf. Control.1