VLDB 2026 Research / reviewers in the wild / expert
Nandita Mathews
dblp:358/7440
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1 · 1 since 2021Theory of computation · 1 · 1 since 2021
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.
| Computer networks
1 paper |
Network management and operations · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Cloud and datacenter computing · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network management and operations
network verification |
0.5 | 1 | 2021 | Debugging Network Reachability with Blocked Paths · CAV (2) 2021 |
Network management and operations › network verification
reachability analysis |
0.5 | 1 | 2021 | Debugging Network Reachability with Blocked Paths · CAV (2) 2021 |
Cloud and datacenter computing › cloud networking
virtual private cloud |
0.1 | 1 | 2021 | Debugging Network Reachability with Blocked Paths · CAV (2) 2021 |
Methods — techniques the papers use, named apart from their topics
formal modeling · 1.0SMT solving · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Debugging Network Reachability with Blocked PathsabstractAbstract In this industrial case study we describe a new network troubleshooting analysis used by VPC Reachability Analyzer , an SMT-based network reachability analysis and debugging tool. Our troubleshooting analysis uses a formal model of AWS Virtual Private Cloud (VPC) semantics to identify whether a destination is reachable from a source in a given VPC configuration. In the case where there is no feasible path, our analysis derives a blocked path : an infeasible but otherwise complete path that would be feasible if a corresponding set of VPC configuration settings were adjusted. Our blocked path analysis differs from other academic and commercial offerings that either rely on packet probing (e.g., tcptrace ) or provide only partial paths terminating at the first component that rejects the packet. By providing a complete (but infeasible) path from the source to destination, we identify for a user all the configuration settings they will need to alter to admit that path (instead of requiring them to repeatedly re-run the analysis after making partial changes). This allows users to refine their query so that the blocked path is aligned with their intended network behavior before making any changes to their VPC configuration. Sam Bayless, John D. Backes, Dan DaCosta, Benjamin F. Jones 0002, Nate Launchbury, Patrick Trentin, Kelsey Jewell, Sagar Joshi, Michael Q. Zeng, Nandita Mathews |
CAV (2) | 10 |