bibliographer a curated TCS bibliography
  • obsidian
  • tags
  • authors
  • no doi
  • no pdf
  • bad author
  • add item
  • librarian

Automata-Based Verification of Relational Properties of Functions over Algebraic Data Structures Théo Losekoot Thomas Genet Thomas Jensen [github]
Regular Language Type Inference with Term Rewriting Timothée Haudebourg Thomas Genet Thomas Jensen [github]
Regular Language Type Inference with Term Rewriting - extended version Thomas Haudebourg Thomas Genet Thomas Jensen [github]
Verifying Higher-Order Functions with Tree Automata Thomas Genet Timothée Haudebourg Thomas Jensen [github]
Verifying Higher-Order Functions with Tree Automata: Extended Version Thomas Genet Timothée Haudebourg Thomas Jensen [github]
Towards Static Analysis of Functional Programs using Tree Automata Completion Thomas Genet [github]
Proving Reachability Properties on Term Rewriting Systems with Strategies Thomas Genet [github]
Reachability analysis of rewriting for software verification Thomas Genet [github]
Decidable approximations of sets of descendants and sets of normal forms Thomas Genet [github]
Reachability Analysis over Term Rewriting Systems Guillaume Feuillade Thomas Genet Valérie Viet Triem Tong [github]
Termination criteria for tree automata completion Thomas Genet [github]
Equational approximations for tree automata completion Thomas Genet Vlad Rusu [github]

Library Size: 13G (12 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A badge
[show logs] [hide logs]