Demo Data from EDBT 2026 / reviewers in the wild / expert
Darin McAdams
dblp:371/9874
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 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.
| Network and information security
1 paper |
Authentication and access control · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Program verification · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Authentication and access control
access control |
0.8 | 1 | 2024 | Cedar: A New Language for Expressive, Fast, Safe, and Analyzable Authorization · Proc. ACM Program. Lang. 2024 |
Authentication and access control › access control models
attribute-based access control |
0.8 | 1 | 2024 | Cedar: A New Language for Expressive, Fast, Safe, and Analyzable Authorization · Proc. ACM Program. Lang. 2024 |
Authentication and access control
authorization |
0.8 | 1 | 2024 | Cedar: A New Language for Expressive, Fast, Safe, and Analyzable Authorization · Proc. ACM Program. Lang. 2024 |
Authentication and access control › access control
role-based access control |
0.8 | 1 | 2024 | Cedar: A New Language for Expressive, Fast, Safe, and Analyzable Authorization · Proc. ACM Program. Lang. 2024 |
Methods — techniques the papers use, named apart from their topics
proof assistant · 1.5logical encoding · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Cedar: A New Language for Expressive, Fast, Safe, and Analyzable AuthorizationabstractCedar is a new authorization policy language designed to be ergonomic, fast, safe, and analyzable. Rather than embed authorization logic in an application’s code, developers can write that logic as Cedar policies and delegate access decisions to Cedar’s evaluation engine. Cedar’s simple and intuitive syntax supports common authorization use-cases with readable policies, naturally leveraging concepts from role-based, attribute-based, and relation-based access control models. Cedar’s policy structure enables access requests to be decided quickly. Cedar’s policy validator leverages optional typing to help policy writers avoid mistakes, but not get in their way. Cedar’s design has been finely balanced to allow for a sound and complete logical encoding, which enables precise policy analysis, e.g., to ensure that when refactoring a set of policies, the authorized permissions do not change. We have modeled Cedar in the Lean programming language, and used Lean’s proof assistant to prove important properties of Cedar’s design. We have implemented Cedar in Rust, and released it open-source. Comparing Cedar to two open-source languages, OpenFGA and Rego, we find (subjectively) that Cedar has equally or more readable policies, but (objectively) performs far better. Joseph W. Cutler, Craig Disselkoen, Aaron Eline, Shaobo He 0002, Kyle Headley, Michael Hicks 0001, Kesha Hietala, Eleftherios Ioannidis, John H. Kastner, Anwar Mamat, Darin McAdams, Matt McCutchen, Neha Rungta, Emina Torlak, Andrew Wells |
Proc. ACM Program. Lang. | 11 |