BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Poland
1 × United Kingdom
Collaborated with:
J.Giesl J.Hensel T.Ströder M.Brockschmidt C.Aschermann C.Fuhs P.Schneider-Kamp M.Naaf F.Emmes C.Otto M.Plücker S.Swiderski R.Thiemann
Talks about:
program (4) termin (4) safeti (2) runtim (2) memori (2) prove (2) lower (2) integ (2) bound (2) aprov (2)

Person: Florian Frohn

DBLP DBLP: Frohn:Florian

Contributed to:

RTA 20152015
TACAS 20152015
IJCAR 20142014
IJCAR 20162016
CAV (2) 20192019

Wrote 6 papers:

RTA-2015-FrohnGHAS #bound #complexity #runtime
Inferring Lower Bounds for Runtime Complexity (FF, JG, JH, CA, TS), pp. 334–349.
TACAS-2015-StroderAFHG #c #contest #memory management #named #safety #source code #termination
AProVE: Termination and Memory Safety of C Programs — (Competition Contribution) (TS, CA, FF, JH, JG), pp. 417–419.
IJCAR-2014-GieslBEFFOPSSST #automation #proving #source code #termination
Proving Termination of Programs Automatically with AProVE (JG, MB, FE, FF, CF, CO, MP, PSK, TS, SS, RT), pp. 184–191.
IJCAR-2014-StroderGBFFHS #memory management #pointer #proving #safety #source code #termination
Proving Termination and Memory Safety for Programs with Pointer Arithmetic (TS, JG, MB, FF, CF, JH, PSK), pp. 208–223.
IJCAR-2016-FrohnNHBG #bound #integer #runtime #source code
Lower Runtime Bounds for Integer Programs (FF, MN, JH, MB, JG), pp. 550–567.
CAV-2019-FrohnG #decidability #integer #termination
Termination of Triangular Integer Loops is Decidable (FF, JG), pp. 426–444.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.