Demo Data from EDBT 2026 / reviewers in the wild / expert
Vishwath Mohan
dblp:86/7620
· DBLP profile ↗
5ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 5 · 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.
| Network and information security
3 papers |
Systems and software security · 100% | |
| Software engineering, system software, and programming languages
2 papers |
Software testing · 87% Program analysis · 13% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Systems and software security › vulnerability discovery
fuzzing |
0.4 | 1 | 2020 | FuzzGen: Automatic Fuzzer Generation · USENIX Security Symposium 2020 |
Systems and software security › memory safety
control-flow integrity |
0.2 | 1 | 2015 | Opaque Control-Flow Integrity · NDSS 2015 |
Systems and software security
code randomization |
0.1 | 1 | 2012 | Binary stirring: self-randomizing instruction addresses of legacy x86 binary code · CCS 2012 |
Systems and software security
memory safety |
0.1 | 1 | 2012 | Binary stirring: self-randomizing instruction addresses of legacy x86 binary code · CCS 2012 |
Program analysis
dynamic analysis |
0.1 | 1 | 2015 | Opaque Control-Flow Integrity · NDSS 2015 |
Systems and software security › exploitation
code reuse attack |
0.0 | 1 | 2012 | Binary stirring: self-randomizing instruction addresses of legacy x86 binary code · CCS 2012 |
Systems and software security
exploitation |
0.0 | 1 | 2012 | Binary stirring: self-randomizing instruction addresses of legacy x86 binary code · CCS 2012 |
Methods — techniques the papers use, named apart from their topics
runtime enforcement · 0.4binary rewriting · 0.1address space layout randomization · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | FuzzGen: Automatic Fuzzer Generation
Kyriakos K. Ispoglou, Daniel Austin, Vishwath Mohan, Mathias Payer |
USENIX Security Symposium | 3 |
| 2016 | Searching for software diversity: attaining artificial diversity through program synthesisabstractA means of attaining richer, more comprehensive forms of software diversity on a mass scale is proposed through leveraging and repurposing a closely related, yet heretofore untapped, line of computer science research---automatic program synthesis. It is argued that the search-based methodologies presently used for obtaining implementations from specifications can be broadened relatively easily to a search for many candidate solutions, potentially diversifying the software monoculture. Small-scale experiments using the Rosette synthesis tool offer preliminary support for this proposed approach. But the possible rewards are not without danger: It is argued that the same approach can power a dangerous new level of sophistication for malware mutation and reactively adaptive software threats. Gilmore R. Lundquist, Vishwath Mohan, Kevin W. Hamlen |
NSPW | 2 |
| 2015 | Opaque Control-Flow Integrity
Vishwath Mohan, Per Larsen, Stefan Brunthaler 0001, Kevin W. Hamlen, Michael Franz |
NDSS | 1 |
| 2012 | Securing untrusted code via compiler-agnostic binary rewritingabstractBinary code from untrusted sources remains one of the primary vehicles for malicious software attacks. This paper presents Reins, a new, more general, and lighter-weight binary rewriting and in-lining system to tame and secure untrusted binary programs. Unlike traditional monitors, Reins requires no cooperation from code-producers in the form of source code or debugging symbols, requires no client-side support infrastructure (e.g., a virtual machine or hypervisor), and preserves the behavior of even complex, event-driven, x86 native COTS binaries generated by aggressively optimizing compilers. This makes it exceptionally easy to deploy. The safety of programs rewritten by Reins is independently machine-verifiable, allowing rewriting to be deployed as an untrusted third-party service. An implementation of Reins for Microsoft Windows demonstrates that it is effective and practical for a real-world OS and architecture, introducing only about 2.4% runtime overhead to rewritten binaries. Richard Wartell, Vishwath Mohan, Kevin W. Hamlen, Zhiqiang Lin 0001 |
ACSAC | 2 |
| 2012 | Binary stirring: self-randomizing instruction addresses of legacy x86 binary codeabstractUnlike library code, whose instruction addresses can be randomized by address space layout randomization (ASLR), application binary code often has static instruction addresses. Attackers can exploit this limitation to craft robust shell codes for such applications, as demonstrated by a recent attack that reuses instruction gadgets from the static binary code of victim applications. Richard Wartell, Vishwath Mohan, Kevin W. Hamlen, Zhiqiang Lin 0001 |
CCS | 2 |