Inferring Program Specifications in Polynomial-Time
No abstract available.
DOI 10.1007/3-540-61739-6_43
Related papers
- Maximum Causal Entropy Specification Inference from Demonstrations CAV 2020
- Static Posterior Inference of Bayesian Probabilistic Programming via Polynomial Solving PLDI 2024
- Inference of Polynomial Invariants for Imperative Programs: A Farewell to Gröbner Bases SAS 2012
- Lower Bounds on Type Inference with Subtypes POPL 1995
- Complexity and information in invariant inference POPL 2020
- Making Type Inference Practical ECOOP 1992
- Towards automatic resource bound analysis for OCaml POPL 2017
- Algorithmic Aspects of Type Inference with Subtypes POPL 1992