No article text was recorded for this version.
symbolic size induction
Version 1 of 112 papers22 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Verifying Array Manipulating Programs with Full-Program Induction
- Blog: Full-Program Induction: Verifying Array Programs sans Loop Invariants
- Blog: Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
- Blog: Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions
- Blog: Parameter Synthesis for Probabilistic Hyperproperties
- Blog: VeriAbs : Verification by Abstraction and Test Generation (Competition Contribution)
- Blog: An Efficient Synthesis Algorithm for Parametric Markov Chains Against Linear Time Properties
- Blog: Accelerating Parametric Probabilistic Verification
- Blog: Constraint-Based Synthesis of Coupling Proofs
- Blog: DeGAS: Gradient-Based Optimization of Probabilistic Programs without Sampling
- Blog: On the Complexity of Reachability in Parametric Markov Decision Processes
- Blog: The complexity of reachability in parametric Markov decision processes
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_symbolic_size_induction_ce085370,
title = {symbolic size induction},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/symbolic-size-induction/rdr_ce085370427d45ee8fec39c71d93924a},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_symbolic_size_induction_ce085370_v1,
title = {symbolic size induction},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/symbolic-size-induction/rdr_ce085370427d45ee8fec39c71d93924a/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}