Travelled to:1 × Austria
1 × Denmark
1 × France
1 × Poland
1 × United Kingdom
2 × Belgium
Collaborated with:J.Giesl C.Fuhs P.Schneider-Kamp T.Ströder T.Enger L.Noschinski M.Brockschmidt S.Falke F.Frohn C.Otto M.Plücker S.Swiderski R.Thiemann
Talks about:program (4) complex (3) analysi (3) termin (3) rewrit (3) term (3) methodolog (2) general (2) automat (2) symbol (2)
Person: Fabian Emmes
DBLP: Emmes:Fabian
Contributed to:
2014
20142012
2012
2012
20112011Wrote 7 papers:
- 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.
- TACAS-2014-BrockschmidtEFFG #analysis #complexity #integer #runtime #source code
- Alternating Runtime and Size Complexity Analysis of Integer Programs (MB, FE, SF, CF, JG), pp. 140–155.
- IJCAR-2012-EmmesEG #automation #proving
- Proving Non-looping Non-termination Automatically (FE, TE, JG), pp. 225–240.
- LOPSTR-2012-GieslSSEF #evaluation #graph #logic programming #source code #symbolic computation #term rewriting
- Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs (JG, TS, PSK, FE, CF), p. 1.
- PPDP-2012-GieslSSEF #evaluation #graph #logic programming #source code #symbolic computation #term rewriting
- Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs (JG, TS, PSK, FE, CF), pp. 1–12.
- CADE-2011-NoschinskiEG #analysis #complexity #dependence #framework #term rewriting
- A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems (LN, FE, JG), pp. 422–438.
- LOPSTR-2011-StroderESGF #analysis #complexity #linear #prolog #semantics #termination
- A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog (TS, FE, PSK, JG, CF), pp. 237–252.