Bethel Hall

Bethel Hall (ቤቴል ሆል)

Ph.D. student in Computer Science · Stevens Institute of Technology
I build neurosymbolic systems that make LLM outputs more reliable and verifiable.

My research explores neurosymbolic approaches to AI safety, combining formal methods with LLMs to uncover exploitable gaps, verify model outputs, and guide targeted repairs. I am interested in how these techniques can strengthen safety during pre-training and post-training, as well as through post-hoc verification. I am grateful to be advised by Prof. William Eiers.

Outside of research, I enjoy biking, hiking, and running.

Publications

Preprint 2026

VeriFin: A Neurosymbolic Framework for Verifying LLM-Generated Financial Claims

Bethel Hall, Sachi Shome, William Eiers
arXiv preprint arXiv:2608.10213, 2026
Preprint 2026

Neurosymbolic Auditing of Natural-Language Software Requirements

Bethel Hall, William Eiers
arXiv preprint arXiv:2605.13817, 2026
SANER 2026

CloudFix: Automated Policy Repair for Cloud Access Control Policies Using Large Language Models

Bethel Hall, Owen Ungaro, William Eiers
SANER (Research Track), 2026
ISSRE 2026

Neurosymbolic Characterization for Reliable Access Control Policy Analysis

Adarsh Vatsa, Bethel Hall, William Eiers
ISSRE, 2026

Projects

VERIMED

Audits software requirements using independent LLM formalizations and SMT counterexamples to identify ambiguity and guide clarification.

55.4% to 98.5% verified QA accuracy with SMT feedback across 65 hemodialysis safety questions.

SMT counterexamples expose disagreements between independent formalizations and guide requirement clarification.
Method and supporting results

Generates formal encodings of natural-language requirements, checks for disagreements, and uses counterexamples to refine the requirements and answer safety questions.

  • Formalized all 64 requirements in the ABZ hemodialysis benchmark.
  • Clarification brought 12 flagged requirements into agreement across the sampled encodings.
  • Verification is relative to the generated formal model; it does not prove complete faithfulness to human intent.

CloudFix

Repairs AWS access-control policies by combining SMT fault localization, targeted LLM edits, and checks against supplied request specifications.

84.0% full repair versus 48.2% for the baseline across 282 AWS policies with 10 request specifications per policy.

Fault localization narrows the edit scope before the LLM proposes a repair. The chart shows complete repair rates from Table III.
Method and supporting results

Uses Quacky and Z3 to identify candidate faulty policy statements, asks an LLM for targeted edits, and checks each repaired policy against the request specifications.

  • With 30 request specifications, full repair was 54.3% versus 22.3% for the baseline, more than twice the baseline rate.
  • Full repair means satisfying every supplied request specification, not every possible request.

PolicySummarizer

Builds compact descriptions of cloud-policy permissions using automata, LLM-assisted regex simplification, and model-counting checks.

0.93 mean Jaccard similarity for resource characterizations across 746 AWS, Azure, and Google Cloud policies.

The workflow checks resource regex characterizations. The plots compare characterization size and processing cost across cloud providers.
Method and supporting results

Converts policy permissions to automata-derived regular expressions, then uses an LLM to simplify the resource characterization. Model counting compares the original and simplified regexes within a chosen string-length bound.

  • A configured similarity threshold determines whether to accept the simplified regex or fall back to the automata-derived characterization.
  • The checks apply to resource regexes within that bound; they do not prove unrestricted equivalence or the correctness of freeform prose.
  • The overall mean similarity is 0.926, rounded to 0.93. See the July 2026 paper revision for the evaluation.

News

  • 2026
  • July 2026Gave a virtual talk on Neurosymbolic Auditing of Natural-Language Software Requirements at AIMACS in Lisbon, Portugal (arXiv).
  • Mar 2026Presented CloudFix virtually at SANER 2026 in Limassol, Cyprus.
  • Mar 2026Passed Ph.D. oral qualifying exam.
  • 2025
  • Dec 2025Paper accepted to SANER 2026 (Research Track).
  • 2024
  • May 2024Passed Ph.D. written qualifying exam.
  • 2021
  • Aug 2021Selected as a Global UGRAD Scholar by the U.S. Department of State.

Teaching

  • [Fall 2025]: Teaching Assistant for CS 559: Machine Learning: Fundamentals and Applications
  • [Spring 2025]: Teaching Assistant for CS 501: Introduction to JAVA Programming

Professional Service

  • NeurIPS 2026 · Reviewer
  • ICAIF 2026 · Reviewer