Travelled to:1 × Austria
1 × Canada
1 × China
2 × Japan
2 × USA
3 × Italy
Collaborated with:H.Veith S.Gulwani I.Radicek T.Kotek M.Sinn M.Simkus B.Cook A.See J.Kinder Y.Demyanova T.Pani B.Aminof S.Rubin F.Spegni D.Calvanese C.Jansen J.Katelaan C.Matheja T.N.0001 G.Barthe M.Gaboardi D.G.0001
Talks about:analysi (6) program (4) bound (3) introductori (2) abstract (2) problem (2) assign (2) monad (2) tree (2) reconstruct (1)
Person: Florian Zuleger
DBLP: Zuleger:Florian
Contributed to:
2015
2015
20152014
2014
2014
2013
2011
2010
2009
2017
20162018
2018Wrote 14 papers:
- CAV-2015-DemyanovaPVZ #benchmark #empirical #metric #tool support #verification
- Empirical Software Metrics for Benchmarking of Verification Tools (YD, TP, HV, FZ), pp. 561–579.
- ICALP-v2-2015-AminofRZS #liveness #network
- Liveness of Parameterized Timed Networks (BA, SR, FZ, FS), pp. 375–387.
- LICS-2015-KotekSVZ
- Extending ALCQIO with Trees (TK, MS, HV, FZ), pp. 511–522.
- CAV-2014-SinnZV #bound #complexity #scalability #static analysis
- A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis (MS, FZ, HV), pp. 745–761.
- FSE-2014-GulwaniRZ #feedback #generative #performance #problem #programming
- Feedback generation for performance problems in introductory programming assignments (SG, IR, FZ), pp. 41–51.
- IFM-2014-CalvaneseKSVZ #analysis #data type
- Shape and Content — A Database-Theoretic Perspective on the Analysis of Data Structures (DC, TK, MS, HV, FZ), pp. 3–17.
- TACAS-2013-CookSZ #proving #termination
- Ramsey vs. Lexicographic Termination Proving (BC, AS, FZ), pp. 47–61.
- SAS-2011-ZulegerGSV #abstraction #analysis #bound #imperative #source code
- Bound Analysis of Imperative Programs with the Size-Change Abstraction (FZ, SG, MS, HV), pp. 280–297.
- PLDI-2010-GulwaniZ #bound #problem
- The reachability-bound problem (SG, FZ), pp. 292–304.
- VMCAI-2009-KinderZV #abstract interpretation #control flow #framework #re-engineering
- An Abstract Interpretation-Based Framework for Control Flow Reconstruction from Binaries (JK, FZ, HV), pp. 214–228.
- ESOP-2017-JansenKMNZ #logic #reasoning #robust
- Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic (CJ, JK, CM, TN0, FZ), pp. 611–638.
- CSL-2016-KotekVZ #bound #finite #higher-order #monad #satisfiability
- Monadic Second Order Finite Satisfiability and Unbounded Tree-Width (TK, HV, FZ), p. 20.
- PLDI-2018-GulwaniRZ #automation #clustering #program repair #programming
- Automated clustering and program repair for introductory programming assignments (SG, IR, FZ), pp. 465–480.
- POPL-2018-RadicekBG0Z #cost analysis #monad #relational
- Monadic refinements for relational cost analysis (IR, GB, MG, DG0, FZ), p. 32.