Finiteness Analysis in Polynomial Time
Abstract elided by the publisher.
Related papers
- Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable APLAS 2009
- On Learning Polynomial Recursive Programs POPL 2024
- On Polynomial-Size Programs Winning Finite-State Games CAV 1995
- Precise Interprocedural Dataflow Analysis via Graph Reachability POPL 1995
- Program Termination Analysis in Polynomial Time GPCE 2002
- Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time SAS 1995
- Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis ESOP 2001
- Automated Termination Analysis of Polynomial Probabilistic Programs ESOP 2021