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

Anthony Romano

dblp:14/6101 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2014
—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-authorHuman-computer interaction and ubiquitous computing · 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
1 paper
Program analysis · 50% Operating systems · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 100%

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

TopicWeightPapersLastEvidence papers
Operating systems › resource management › memory management › virtual memory
address translation
0.212014
symMMU: symbolically executed runtime libraries for symbolic memory access · ASE 2014
Program analysis
symbolic execution
0.212014
symMMU: symbolically executed runtime libraries for symbolic memory access · ASE 2014
Memory systems › memory management
memory management unit
0.112014
symMMU: symbolically executed runtime libraries for symbolic memory access · ASE 2014

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

theorem proving · 0.4symbolic execution · 0.4
YearPublicationVenuePosition
2014 symMMU: symbolically executed runtime libraries for symbolic memory access
abstract
Symbolic execution calls for specialized address translation. Unlike a pointer on a traditional machine model, which corresponds to a single address, a symbolic pointer may represent multiple feasible addresses. A symbolic pointer dereference manipulates symbolic state, potentially submitting many theorem prover requests in the process. Hence, design and management of symbolic accesses critically affects symbolic executor performance, complexity, and completeness.
Anthony Romano, Dawson R. Engler
ASE1
2014 Practical Floating-Point Tests with Integer Code
Anthony Romano
VMCAI1
2013 Expression Reduction from Programs in a Symbolic Binary Executor
Anthony Romano, Dawson R. Engler
SPIN1
2009 The pintos instructional operating system kernel
abstract
Pintos is an instructional operating system, complete with documentation and ready-made, modular projects that introduce students to the principles of multi-programming, scheduling, virtual memory, and filesystems. By allowing students to run their work product on actual hardware, while simultaneously benefiting from debugging and dynamic analysis tools provided in simulated and emulated environments, Pintos increases student engagement. Unlike tailored versions of commercial or open source OS such as Linux, Pintos is designed from the ground up from an educational perspective. It has been used by multiple institutions for a number of years and is available for wider use.
Ben Pfaff, Anthony Romano, Godmar Back
SIGCSE2