Demo Data from EDBT 2026 / reviewers in the wild / expert
Dzintars Avots
dblp:17/3297
· DBLP profile ↗
4ranked-venue papers
2as first author
0since 2021 · last 2005
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 2 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 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.
| Software engineering, system software, and programming languages
2 papers |
Program analysis · 100% | |
| Network and information security
1 paper |
Blockchain and cryptocurrency security · 50% Systems and software security · 50% | |
| Databases, data mining, and information retrieval
1 paper |
Query processing and optimization · 100% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program analysis › static analysis
pointer analysis |
0.1 | 2 | 2005 | Context-sensitive program analysis as database queries · PODS 2005 Improving software security with a C pointer analysis · ICSE 2005 |
Systems and software security › memory safety › memory error detection
buffer overflow detection |
0.1 | 1 | 2005 | Improving software security with a C pointer analysis · ICSE 2005 |
Blockchain and cryptocurrency security › smart contract security
vulnerability detection |
0.1 | 1 | 2005 | Improving software security with a C pointer analysis · ICSE 2005 |
Program analysis › static analysis › interprocedural analysis
context-sensitive analysis |
0.1 | 1 | 2005 | Context-sensitive program analysis as database queries · PODS 2005 |
Program analysis
static analysis |
0.1 | 1 | 2005 | Improving software security with a C pointer analysis · ICSE 2005 |
Methods — techniques the papers use, named apart from their topics
inclusion-based analysis · 0.1field-sensitive analysis · 0.1datalog · 0.1context-sensitive analysis · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2005 | Using Datalog with Binary Decision Diagrams for Program Analysis
John Whaley, Dzintars Avots, Michael Carbin, Monica S. Lam |
APLAS | 2 |
| 2005 | Improving software security with a C pointer analysisabstractThis paper presents a context-sensitive, inclusion-based, field-sensitive points-to analysis for C and uses the analysis to detect and prevent security vulnerabilities in programs. In addition to a conservative analysis, we propose an optimistic analysis that assumes a more restricted C semantics that reflects common C usage to increase the precision of the analysis.This paper uses the proposed pointer alias analyses to infer the types of variables in C programs and shows that most C variables are used in a manner consistent with their declared types. We show that pointer analysis can be used to reduce the overhead of a dynamic string-buffer overflow detector by 30% to 100% among applications with significant overheads. Finally, using pointer analysis, we statically found six format string vulnerabilities in two of the 12 programs we analyzed. Dzintars Avots, Michael Dalton, Benjamin Livshits, Monica S. Lam |
ICSE | 1 |
| 2005 | Context-sensitive program analysis as database queriesabstractProgram analysis has been increasingly used in software engineering tasks such as auditing programs for security vulnerabilities and finding errors in general. Such tools often require analyses much more sophisticated than those traditionally used in compiler optimizations. In particular, context-sensitive pointer alias information is a prerequisite for any sound and precise analysis that reasons about uses of heap objects in a program. Context-sensitive analysis is challenging because there are over 1014 contexts in a typical large program, even after recursive cycles are collapsed. Moreover, pointers cannot be resolved in general without analyzing the entire program. Monica S. Lam, John Whaley, Benjamin Livshits, Michael C. Martin, Dzintars Avots, Michael Carbin, Christopher Unkel |
PODS | 5 |
| 2002 | A probabilistic technique for simultaneous localization and door state estimation with mobile robots in dynamic environmentsabstractVirtually all existing mobile robot localization techniques operate on a static map of the environment. When the environment changes (e.g., doors are opened or closed), there is an opportunity to simultaneously estimate the robot's pose and the state of the environment. The resulting estimation problem is high-dimensional, rendering current localization techniques inapplicable. This paper proposes an efficient, factored estimation algorithm for mixed discrete-continuous state estimation. Our algorithm integrates particle filters for robot localization, and conditional binary Bayes filters for estimating the dynamic state of the environment. Experimental results illustrate that our algorithm is highly effective in estimating the status of doors, and outperforms a state-of-the-art localizer in dynamic environments. Dzintars Avots, Edward Lim, Romain Thibaux, Sebastian Thrun |
IROS | 1 |