Beta Ziliani

Orcid: 0000-0001-7071-6010

Affiliations:
  • Max Planck Institute for Software Systems


According to our database1, Beta Ziliani authored at least 15 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Redex -> Coq: towards a theory of decidability of Redex's reduction semantics.
CoRR, 2024

2022
From Specification to Testing: Semantics Engineering for Lua 5.2.
J. Autom. Reason., 2022

2021
Verification of dynamic bisimulation theorems in Coq.
J. Log. Algebraic Methods Program., 2021

2020
Understanding Lua's Garbage Collection: Towards a Formalized Static Analyzer.
Proceedings of the PPDP '20: 22nd International Symposium on Principles and Practice of Declarative Programming, 2020

2019
Mechanizing Bisimulation Theorems for Relation-Changing Logics in Coq.
Proceedings of the Dynamic Logic. New Trends and Applications, 2019

2018
Mtac2: typed tactics for backward reasoning in Coq.
Proc. ACM Program. Lang., 2018

2017
A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading.
J. Funct. Program., 2017

Decoding Lua: formal semantics for the developer and the semanticist.
Proceedings of the 13th ACM SIGPLAN International Symposium on on Dynamic Languages, Vancouver, BC, Canada, October 23, 2017

2015
Interactive typed tactic programming in the Coq proof assistant.
PhD thesis, 2015

Mtac: A monad for typed tactic programming in Coq.
J. Funct. Program., 2015

A unification algorithm for Coq featuring universe polymorphism and overloading.
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 2015

2014
Towards a better-behaved unification algorithm for Coq.
Proceedings of the 28th International Workshop on Unification, 2014

2013
How to make ad hoc proof automation less ad hoc.
J. Funct. Program., 2013

Lightweight Proof by Reflection Using a Posteriori Simulation of Effectful Computation.
Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013

2010
Swapping: a natural bridge between named and indexed explicit substitution calculi
Proceedings of the Proceedings 5th International Workshop on Higher-Order Rewriting, 2010


  Loading...