Alvin Tang

I'm currently a scientific intern at the Institute of Science and Technology Austria (ISTA), working in the Programming Languages and Verification group. My current work involves theorem proving using separation logic and, in particular, Iris in Lean. Having completed my degree at the Australian National University (ANU) and recently a research internship at the Max Planck Institute for Informatics (MPI-INF), my recent projects have also involved subtyping, corecursion and automated reasoning.

Education

Feb 2022 – Dec 2025: Bachelor of Advanced Computing (Research and Development) (Honours) at the Australian National University (ANU)
- First Class Honours, GPA: 6.844 out of 7, University Medal
- Check out the list of courses completed
Jun 2021: International Advanced Levels (IAL)
- A*A*A* in Mathematics, Further Mathematics and Physics

Experience

May 2026 – Sep 2026: Scientific Intern at the Institute of Science and Technology Austria (ISTA)
- Project with Prof Michael Sammler in the Programming Languages and Verification group
- Software verification using separation logic and the Iris logical framework
Jan 2026 – Apr 2026: Research Intern at the Max Planck Institute for Informatics (MPI-INF)
- Project with Prof Christoph Weidenbach in the Automation of Logic group
- Further development of the Clause Learning from Simple Models (SCL) approach to first-order logic automated reasoning
- Implementing propositional abstraction features in SPASS-SCL-FOL
Jul 2021 – Aug 2021: Software Development Intern at Aura Labs
- Streamlining of internal DevOps pipeline with Jenkins, Docker, Webmin and nginx reverse proxy
- Automation of SSL certificate renewal with Ansible
- Creation of tools with Node.js and npm
- Revamping the company's website with Notion and Fruition

Publication

Alvin Tang and Dirk Pattinson. A Coinductive Representation of Computable Functions. In 11th Conference on Algebra and Coalgebra in Computer Science (CALCO 2025), volume 342 of Leibniz International Proceedings in Informatics (LIPIcs), pages 7:1–7:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025. doi: 10.4230/LIPIcs.CALCO.2025.7

Projects and Academic Writings

My projects at the ANU involve research in subtyping, corecursion and automated theorem proving.

Generalised Type Preprocessing for Integrated Subtyping

Supervisor: Dr Fabian Muehlboeck
Thesis available in the ANU Open Research Repository
Development of a framework for extending decidable subtyping systems in a modular and compositional manner through a normalisation scheme
Studies of framework instantiations for union types, intersection types and predicative higher-rank polymorphic types with reference to Scala 3's type system and alternatives

Computable Corecursive Functions: A Coalgebraic Approach to A Turing-Complete Model

Supervisor: Prof Dirk Pattinson
Paper published at CALCO 2025 (see below)
A functional model of computation operating on the coalgebraic data structure of finite/infinite binary sequences
Establishing the definition principle and proving representation theorems by building connections between general recursion and F-coalgebras

CEGAR-Tableaux for Non-Normal Modal Logics

Supervisor: Prof Rajeev Goré
Sponsored by the ANU Summer Research Scholarship program
Extending tableau calculi inspired by the Counterexample-Guided Abstraction Refinement technique for efficient automated theorem provers

Automated SELinux RBAC Policy Verification Using SMT

Supervisor: Dr Alwen Tiu
Co-authors: Divyam Pahuja, Klim Tsoutsman
Technical report available on arXiv
Formalising role-based access control policies in Security-Enhanced Linux using satisfiability modulo theories
Development of a parser and a translator in Rust and C

See my GitHub repository for other academic writings.