@inproceedings{10.1007/978-3-031-28083-2_11,
    Abstract = {We address algebraic aspects of invariant generation and proving termination, two central questions of program analysis, for non-deterministic loops with polynomial updates.},
    Address = {Cham},
    Author = {Kov{\'a}cs, Laura and Varonka, Anton},
    BookTitle = {Relational and Algebraic Methods in Computer Science},
    Editor = {Gl{\"u}ck, Roland and Santocanale, Luigi and Winter, Michael},
    File = {What Else is Undecidable About Loops? - slidesAnton.pdf},
    ISBN = {978-3-031-28083-2},
    Pages = {176--193},
    Publisher = {Springer International Publishing},
    Title = {What Else is Undecidable About Loops?},
    Year = {2023},
    date-added = {2023-07-22 06:48:42 +0200},
    date-modified = {2023-07-22 06:48:42 +0200},
    doi = {10.1007/978-3-031-28083-2_11}
}

@inproceedings{10.1007/978-3-031-28083-2_11, Abstract = {We address algebraic aspects of invariant generation and proving termination, two central questions of program analysis, for non-deterministic loops with polynomial updates.}, Address = {Cham}, Author = {Kov{\'a}cs, Laura and Varonka, Anton}, BookTitle = {Relational and Algebraic Methods in Computer Science}, Editor = {Gl{\"u}ck, Roland and Santocanale, Luigi and Winter, Michael}, File = {What Else is Undecidable About Loops? - slidesAnton.pdf}, ISBN = {978-3-031-28083-2}, Pages = {176--193}, Publisher = {Springer International Publishing}, Title = {What Else is Undecidable About Loops?}, Year = {2023}, date-added = {2023-07-22 06:48:42 +0200}, date-modified = {2023-07-22 06:48:42 +0200}, doi = {10.1007/978-3-031-28083-2_11} }