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

Allan L. Mennie

dblp:76/1773 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1981
—ORCID · none

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

Software engineering, systems software and programming languages · 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
Compilers and program optimization · 50% Programming languages and type systems · 50%
Network and information security
1 paper
Systems and software security · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
compiler analysis
0.011981
Information Flow Certification Using an Intermediate Code Program Representation · IEEE Trans. Software Eng. 1981
Programming languages and type systems
information flow control
0.011981
Information Flow Certification Using an Intermediate Code Program Representation · IEEE Trans. Software Eng. 1981
Systems and software security
information flow control
0.011981
Information Flow Certification Using an Intermediate Code Program Representation · IEEE Trans. Software Eng. 1981

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

lattice model · 0.0intermediate code representation · 0.0certification · 0.0
YearPublicationVenuePosition
1981 Information Flow Certification Using an Intermediate Code Program Representation
abstract
This paper describes a compile-time information flow control (IFC) mechanism that certifies secure information flow within the collection of objects accessed by a program. The IFC mechanism is based on the lattice model and certification mechanism of Denning, who proposes the use of the mechanism during the analysis phase of compilation. However, IFC is placed after semantic analysis and before code optimization by ufilizing an intermediate code representation. This reduces the complexity of IFC and allows a degree of language independence. An implentation has been developed for Pascal.
Allan L. Mennie, Glenn H. MacEwen
IEEE Trans. Software Eng.1