Travelled to:1 × Austria
1 × Brazil
1 × Canada
1 × Estonia
1 × France
1 × Italy
1 × Serbia
1 × USA
2 × Germany
2 × United Kingdom
Collaborated with:D.Kapur C.Sinz F.Merz J.Giesl P.Schneider-Kamp C.Fuhs R.Thiemann M.Brockschmidt F.Emmes M.Plücker
Talks about:rewrit (5) program (4) termin (4) analysi (3) model (3) llbmc (3) bound (3) intermedi (2) contribut (2) competit (2)
Person: Stephan Falke
DBLP: Falke:Stephan
Contributed to:
2014
20132013
2012
20122012
2011
20092009200820072004Wrote 12 papers:
- 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.
- ASE-2013-FalkeMS #bound #model checking
- The bounded model checker LLBMC (SF, FM, CS), pp. 706–709.
- TACAS-2013-FalkeMS #bound #c #contest #model checking #named #source code #using
- LLBMC: Improved Bounded Model Checking of C Programs Using LLVM — (Competition Contribution) (SF, FM, CS), pp. 623–626.
- IJCAR-2012-FalkeK #induction #linear
- Rewriting Induction + Linear Arithmetic = Decision Procedure (SF, DK), pp. 241–255.
- SMT-2012-FalkeSM #array #formal method #set
- A Theory of Arrays with set and copy Operations (SF, CS, FM), pp. 98–108.
- TACAS-2012-SinzMF #bound #contest #model checking #named #representation
- LLBMC: A Bounded Model Checker for LLVM’s Intermediate Representation — (Competition Contribution) (CS, FM, SF), pp. 542–544.
- RTA-2011-FalkeKS #analysis #c #compilation #source code #termination #using
- Termination Analysis of C Programs Using Compiler Intermediate Languages (SF, DK, CS), pp. 41–50.
- CADE-2009-FalkeK #analysis #approach #automation #imperative #source code #term rewriting #termination
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (SF, DK), pp. 277–293.
- RTA-2009-FuhsGPSF #integer #proving #term rewriting #termination
- Proving Termination of Integer Term Rewriting (CF, JG, MP, PSK, SF), pp. 32–47.
- RTA-2008-FalkeK #data type #dependence #semantics
- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures (SF, DK), pp. 94–109.
- CADE-2007-FalkeK #dependence
- Dependency Pairs for Rewriting with Non-free Constructors (SF, DK), pp. 426–442.
- RTA-2004-GieslTSF #automation #proving #termination
- Automated Termination Proofs with AProVE (JG, RT, PSK, SF), pp. 210–220.