Simple Linear Loops: Algebraic Invariants and Applications
R Ait El Manssour, G Kenison… - Proceedings of the …, 2025 - dl.acm.org
The automatic generation of loop invariants is a fundamental challenge in software
verification. While this task is undecidable in general, it is decidable for certain restricted …
verification. While this task is undecidable in general, it is decidable for certain restricted …
Simple Linear Loops: Algebraic Invariants and Applications
RAE Manssour, G Kenison, M Shirmohammadi… - arXiv preprint arXiv …, 2024 - arxiv.org
Automatic generation of loop invariants is a fundamental challenge in software verification.
While this task is undecidable in general, it is decidable for certain restricted classes of …
While this task is undecidable in general, it is decidable for certain restricted classes of …
Probabilistic loop synthesis from sequences of moments
M Stankovič, E Bartocci - … on Quantitative Evaluation of Systems and …, 2024 - Springer
Probabilistic program synthesis consists in automatically creating programs generating
random values adhering to specified distributions. We consider here the family of …
random values adhering to specified distributions. We consider here the family of …
Determination Problems for Orbit Closures and Matrix Groups
RAE Manssour, G Kenison, M Shirmohammadi… - arXiv preprint arXiv …, 2024 - arxiv.org
Computational problems concerning the orbit of a point under the action of a matrix group
occur in numerous subfields of computer science, including complexity theory, program …
occur in numerous subfields of computer science, including complexity theory, program …
Reachability in Linear Recurrence Automata
M Hirvensalo, A Kawamura, I Potapov… - … on Reachability Problems, 2024 - Springer
This paper studies the linear recurrence automata model in which multiple linear
recurrences can be used to generate sequences of numbers. We parameterised the model …
recurrences can be used to generate sequences of numbers. We parameterised the model …