Frohn, Florian

1. Termination of Triangular Polynomial Loops
   2019/10/25 by Marcel Hark, Hark, Marcel, Florian Frohn +3 · 2 citations
   Computer Science · Engineering · #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #graph theory and CDMA systems
2. Termination of Triangular Integer Loops is Decidable
   2019/05/21 by Frohn, Florian, Giesl, Jürgen · 1 citation
   #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)
3. Satisfiability Modulo Exponential Integer Arithmetic
   2024/02/02 by Frohn, Florian, Giesl, Jürgen · 1 citation
   #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)
4. Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
   2022/02/09 by Frohn, Florian, Giesl, Jürgen · 1 citation
   #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)