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

Emmanuel Geay

dblp:15/529 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2019
—ORCID · none

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

Software engineering, systems software and programming languages · 5 · 2 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
4 papers
Program analysis · 92% Program synthesis and code generation · 6% Program verification · 1%
Network and information security
1 paper
Authentication and access control · 100%

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

TopicWeightPapersLastEvidence papers
Program analysis
static analysis
0.632019
From typestate verification to interpretable deep models (invited talk abstract) · ISSTA 2019
Modular string-sensitive permission analysis with demand-driven precision · ICSE 2009
Effective typestate verification in the presence of aliasing · ACM Trans. Softw. Eng. Methodol. 2008
Program analysis › type-based analysis
typestate analysis
0.532019
From typestate verification to interpretable deep models (invited talk abstract) · ISSTA 2019
Effective typestate verification in the presence of aliasing · ACM Trans. Softw. Eng. Methodol. 2008
Effective typestate verification in the presence of aliasing · ISSTA 2006
Program analysis › static analysis
pointer analysis
0.422019
From typestate verification to interpretable deep models (invited talk abstract) · ISSTA 2019
Effective typestate verification in the presence of aliasing · ISSTA 2006
Program synthesis and code generation
code completion
0.112019
From typestate verification to interpretable deep models (invited talk abstract) · ISSTA 2019
Authentication and access control › access control
permission analysis
0.112009
Modular string-sensitive permission analysis with demand-driven precision · ICSE 2009
Program analysis › data flow analysis › value analysis
string analysis
0.112009
Modular string-sensitive permission analysis with demand-driven precision · ICSE 2009
Program analysis › data flow analysis
context-sensitive dataflow analysis
0.112008
Effective typestate verification in the presence of aliasing · ACM Trans. Softw. Eng. Methodol. 2008

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

aliasing information · 0.4access paths · 0.4abstract domain · 0.4static analysis · 0.2program slicing · 0.2staged verification · 0.1parametric abstract domain · 0.1abstract interpretation · 0.1
YearPublicationVenuePosition
2019 From typestate verification to interpretable deep models (invited talk abstract)
abstract
The paper ``Effective Typestate Verification in the Presence of Aliasing'' was published in the International Symposium on Software Testing and Analysis (ISSTA) 2006 Proceedings, and has now been selected to receive the ISSTA 2019 Retrospective Impact Paper Award. The paper described a scalable framework for verification of typestate properties in real-world Java programs. The paper introduced several techniques that have been used widely in the static analysis of real-world programs. Specifically, it introduced an abstract domain combining access-paths, aliasing information, and typestate that turned out to be simple, powerful, and useful. We review the original paper and show the evolution of the ideas over the years. We show how some of these ideas have evolved into work on machine learning for code completion, and discuss recent general results in machine learning for programming.
Eran Yahav, Stephen J. Fink, Nurit Dor, G. Ramalingam, Emmanuel Geay
ISSTA5
2009 Modular string-sensitive permission analysis with demand-driven precision
abstract
In modern software systems, programs are obtained by dynamically assembling components. This has made it necessary to subject component providers to access-control restrictions. What permissions should be granted to each component? Too few permissions may cause run-time authorization failures, too many constitute a security hole. We have designed and implemented a composite algorithm for precise static permission analysis for Java and the CLR. Unlike previous work, the analysis is modular and fully integrated with a novel slicing-based string analysis that is used to statically compute the string values defining a permission and disambiguate permission propagation paths. The results of our research prototype on production-level Java code support the effectiveness, practicality, and precision of our techniques, and show outstanding improvement over previous work.
Emmanuel Geay, Marco Pistoia, Takaaki Tateishi, Barbara G. Ryder, Julian Dolby
ICSE1
2008 Effective typestate verification in the presence of aliasing
abstract
This article addresses the challenge of sound typestate verification, with acceptable precision, for real-world Java programs. We present a novel framework for verification of typestate properties, including several new techniques to precisely treat aliases without undue performance costs. In particular, we present a flow-sensitive, context-sensitive, integrated verifier that utilizes a parametric abstract domain combining typestate and aliasing information. To scale to real programs without compromising precision, we present a staged verification system in which faster verifiers run as early stages which reduce the workload for later, more precise, stages. We have evaluated our framework on a number of real Java programs, checking correct API usage for various Java standard libraries. The results show that our approach scales to hundreds of thousands of lines of code, and verifies correctness for 93% of the potential points of failure.
Stephen J. Fink, Eran Yahav, Nurit Dor, G. Ramalingam, Emmanuel Geay
ACM Trans. Softw. Eng. Methodol.5
2006 Effective typestate verification in the presence of aliasing
abstract
This paper addresses the challenge of sound typestate verification, with acceptable precision, for real-world Java programs. We present a novel framework for verification of typestate properties, including several new techniques to precisely treat aliases without undue performance costs. In particular, we present a flowsensitive, context-sensitive, integrated verifier that utilizes a parametric abstract domain combining typestate and aliasing information.To scale to real programs without compromising precision, we present a staged verification system in which faster verifiers run as early stages which reduce the workload for later, more precise, stages.We have evaluated our framework on a number of real Java programs, checking correct API usage for various Java standard libraries. The results show that our approach scales to hundreds of thousands of lines of code, and verifies correctness for 93% of the potential points of failure.
Stephen J. Fink, Eran Yahav, Nurit Dor, G. Ramalingam, Emmanuel Geay
ISSTA5
2006 Continuous code-quality assurance with SAFE
abstract
This paper presents the design of SAFE (Scalable and Flexible Error Detection), a static analysis tool targeting lightweight program verification and bug finding for Java. The tool utilizes two types of analysis: a simple "structural" checker based on pattern-matching, and an interprocedural flow-sensitive dataflow solver which integrates typestate checking and alias analysis. We describe how the tool integrates into a team development platform for analysis of batch builds, and user interface support built on the Eclipse platform.
Emmanuel Geay, Eran Yahav, Stephen J. Fink
PEPM1