William Eiers

PhD Candidate
Department of Computer Science
University of California, Santa Barbara

Publications

William Eiers, Ganesh Sankaran Tevfik Bultan. "Quantitative Policy Repair for Access Control on the Cloud" To Appear in ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA) 2023
William Eiers, Ganesh Sankaran, Albert Li, Emily O'Mahony, Benjamin Prince, Tevfik Bultan. "Quacky: Quantitative Access Control Permissiveness Analyzer" Tool Paper. Proceedings of the 37th IEEE/ACM International Conference on Automated Software Engineering (ASE 2022).
William Eiers, Ganesh Sankaran, Albert Li, Emily O'Mahony, Benjamin Prince, Tevfik Bultan. "Quantifying Permissiveness of Access Control Policies." Proceedings of the 44th International Conference on Software Engineering (ICSE 2022).
William Eiers, Seemanta Saha, Tegan Brennan, Tevfik Bultan. "Subformula Caching for Model Counting and Quantitative Program Analysis." Proceedings of the 34th IEEE/ACM International Conference on Automated Software Engineering (ASE 2019)
Seemanta Saha, William Eiers, Ismet Burak Kadron, Lucas Bang, Tevfik Bultan. "Incremental Attack Synthesis." Java Pathfinder Workshop 2019.
Abdulbaki Aydin, William Eiers, Lucas Bang, Tegan Brennan, Miroslav Gavrilov, Tevfik Bultan, Fang Yu. "Parameterized Model Counting for String and Numeric Constraints." Proceedings of the 26th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE '18)
Seemanta Saha, Ismet Burak Kadron, William Eiers, Lucas Bang, Tevfik Bultan. "Attack Synthesis for Strings using Meta-Heuristics." Java Pathfinder Workshop 2018.

Projects

Automata-based model counter (ABC) is a constraint solver and model counter for both string and integer arithmetic theories. Given a combination of string and linear integer arithmetic constraints, ABC computes a model that characterizes the solution set in the form of a deterministic finite automaton.

Quacky

Quacky is a tool for quantifying permissiveness of access control policies in the cloud. Given a policy, Quacky translates it into a SMT formula and uses a model counting constraint solver to quantify permissiveness. When given multiple policies, Quacky can not only determine which policy is more permissive, but can also quantify the relative permissiveness between the policies. Quacky supports access control policies written in Amazon's AWS Identity and Access Management (IAM), Microsoft's Azure, and Google Cloud Platform (GCP) policy languages.

Awards

Computer Science Outstanding Graduate Student, Spring 2021 (University of California Santa Barbara)
College of Engineering Outstanding Teaching Assistant in Computer Science, Spring 2019 (University of California Santa Barbara)
Outstanding Teaching Assistant, Spring 2018 (University of California Santa Barbara)

Contact Information:

Address:

Department of Computer Science
University of California
Santa Barbara, CA 93106-5110

E-Mail: weiers at cs.ucsb.edu