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

Jean-Francois Bergeretti

dblp:70/2329 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1985
—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
Program analysis · 100%

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

TopicWeightPapersLastEvidence papers
Program analysis
data flow analysis
0.011985
Information-Flow and Data-Flow Analysis of while-Programs · ACM Trans. Program. Lang. Syst. 1985
Program analysis › static analysis
information flow analysis
0.011985
Information-Flow and Data-Flow Analysis of while-Programs · ACM Trans. Program. Lang. Syst. 1985
Program analysis
static analysis
0.011985
Information-Flow and Data-Flow Analysis of while-Programs · ACM Trans. Program. Lang. Syst. 1985

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

denotational semantics · 0.0
YearPublicationVenuePosition
1985 Information-Flow and Data-Flow Analysis of while-Programs
abstract
Until recently, information-flow analysis has been used primarily to verify that information transmission between program variables cannot violate security requirements. Here, the notion of information flow is explored as an aid to program development and validation. Information-flow relations are presented for while-programs, which identify those program statements whose execution may cause information to be transmitted from or to particular input, internal, or output values. It is shown with examples how these flow relations can be helpful in writing, testing, and updating programs; they also usefully extend the class of errors which can be detected automatically in the “static analysis” of a program.
Jean-Francois Bergeretti, Bernard Carré
ACM Trans. Program. Lang. Syst.1