Demo Data from EDBT 2026 / reviewers in the wild / expert
Massimiliano Poletto
dblp:24/5162
· DBLP profile ↗
5ranked-venue papers
3as first author
0since 2021 · last 2003
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 3 · 3 first-authorSystems, architecture and hardware · 1Security and privacy · 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
3 papers |
Compilers and program optimization · 38% Runtime systems and virtual machines · 34% Programming languages and type systems · 28% | |
| Computer networks
1 paper |
Network measurement and analytics · 77% Network management and operations · 23% | |
| Network and information security
1 paper |
Network security · 100% |
Topics — the 7 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network security › attack resilience › attack mitigation › denial-of-service defense
denial-of-service attack detection |
0.0 | 1 | 2001 | MULTOPS: A Data-Structure for Bandwidth Attack Detection · USENIX Security Symposium 2001 |
Programming languages and type systems
language design |
0.0 | 2 | 1999 | 'C and tcc: A Language and Compiler for Dynamic Code Generation · ACM Trans. Program. Lang. Syst. 1999 tcc: A System for Fast, Flexible, and High-level Dynamic Code Generation · PLDI 1997 |
Runtime systems and virtual machines › dynamic compilation
just-in-time compilation |
0.0 | 1 | 1999 | 'C and tcc: A Language and Compiler for Dynamic Code Generation · ACM Trans. Program. Lang. Syst. 1999 |
Compilers and program optimization › register allocation
linear scan register allocation |
0.0 | 1 | 1999 | Linear scan register allocation · ACM Trans. Program. Lang. Syst. 1999 |
Compilers and program optimization
register allocation |
0.0 | 1 | 1999 | Linear scan register allocation · ACM Trans. Program. Lang. Syst. 1999 |
Runtime systems and virtual machines
dynamic compilation |
0.0 | 1 | 1997 | tcc: A System for Fast, Flexible, and High-level Dynamic Code Generation · PLDI 1997 |
Programming languages and type systems › language design
language extension |
0.0 | 1 | 1997 | tcc: A System for Fast, Flexible, and High-level Dynamic Code Generation · PLDI 1997 |
Methods — techniques the papers use, named apart from their topics
link-time analysis · 0.0fast register allocation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | Role Classification of Hosts Within Enterprise Networks Based on Connection Patterns
Godfrey Tan, Massimiliano Poletto, John V. Guttag, M. Frans Kaashoek |
USENIX ATC, General Track | 2 |
| 2001 | MULTOPS: A Data-Structure for Bandwidth Attack Detection
Thomer M. Gil, Massimiliano Poletto |
USENIX Security Symposium | 2 |
| 1999 | 'C and tcc: A Language and Compiler for Dynamic Code GenerationabstractDynamic code generation allows programmers to use run-time information in order to achieve performance and expressiveness superior to those of static code. The 'C(Tick C) language is a superset of ANSI C that supports efficient and high-level use of dynamic code generation. 'C provides dynamic code generation at the level of C expressions and statements and supports the composition of dynamic code at run time. These features enable programmers to add dynamic code generation to existing C code incrementally and to write important applications (such as “just-in-time” compilers) easily. The article presents many examples of how 'C can be used to solve practical problems. The tcc compiler is an efficient, portable, and freely available implementation of 'C. tcc allows programmers to trade dynamic compilation speed for dynamic code quality: in some aplications, it is most important to generate code quickly, while in others code quality matters more than compilation speed. The overhead of dynamic compilation is on the order of 100 to 600 cycles per generated instruction, depending on the level of dynamic optimizaton. Measurements show that the use of dynamic code generation can improve performance by almost an order of magnitude; two- to four-fold speedups are common. In most cases, the overhead of dynamic compilation is recovered in under 100 uses of the dynamic code; sometimes it can be recovered within one use. Massimiliano Poletto, Wilson C. Hsieh, Dawson R. Engler, M. Frans Kaashoek |
ACM Trans. Program. Lang. Syst. | 1 |
| 1999 | Linear scan register allocationabstractWe describe a new algorithm for fast global register allocation called linear scan . This algorithm is not based on graph coloring, but allocates registers to variables in a single linear-time scan of the variables' live ranges. The linear scan algorithm is considerably faster than algorithms based on graph coloring, is simple to implement, and results in code that is almost as efficient as that obtained using more complex and time-consuming register allocators based on graph coloring. The algorithm is of interest in applications where compile time is a concern, such as dynamic compilation systems, “just-in-time” compilers, and interactive development environments. Massimiliano Poletto, Vivek Sarkar |
ACM Trans. Program. Lang. Syst. | 1 |
| 1997 | tcc: A System for Fast, Flexible, and High-level Dynamic Code Generationabstracttcc is a compiler that provides efficient and high-level access to dynamic code generation. It implements the 'C ("Tick-C") programming language, an extension of ANSI C that supports dynamic code generation [15]. 'C gives power and flexibility in specifying dynamically generated code: whereas most other systems use annotations to denote run-time invariants. 'C allows the programmer to specify and compose arbitrary expressions and statements at run time. This degree of control is needed to efficiently implement some of the most important applications of dynamic code generation, such as "just in time" compilers [17] and efficient simulators [10, 48, 46].The paper focuses on the techniques that allow tcc to provide 'C's flexibility and expressiveness without sacrificing run-time code generation efficiency. These techniques include fast register allocation, efficient creation and composition of dynamic code specifications, and link-time analysis to reduce the size of dynamic code generators. tcc also implements two different dynamic code generation strategies, designed to address the tradeoff of dynamic compilation speed versus generated code quality. To characterize the effects of dynamic compilation, we present performance measurements for eleven programs compiled using tcc. On these applications, we measured performance improvements of up to one order of magnitude.To encourage further experimentation and use of dynamic code generation, we are making the tcc compiler available in the public domain. This is, to our knowledge, the first high-level dynamic compilation system to be made available. Massimiliano Poletto, Dawson R. Engler, M. Frans Kaashoek |
PLDI | 1 |