Florian Zuleger

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 72

Top Venues

Publications

Mark Chimes, Radu Iosif, Florian Zuleger
Tree-Verifiable Graph Grammars. CoRR (2024)
Mark Chimes, Radu Iosif, Florian Zuleger
Tree-Verifiable Graph Grammars. LPAR (2024)
Lucas Bueri, Radu Iosif, Florian Zuleger
Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations. CoRR (2024)
Tomás Dacík, Adam Rogalewicz, Tomás Vojnar, Florian Zuleger
Deciding Boolean Separation Logic via Small Models (Technical Report). CoRR (2024)
Tomás Dacík, Adam Rogalewicz, Tomás Vojnar, Florian Zuleger
Deciding Boolean Separation Logic via Small Models. TACAS (1) (2024)
Radu Iosif, Florian Zuleger
Expressiveness Results for an Inductive Logic of Separated Relations. CoRR (2023)
Alexander Pluska, Florian Zuleger
Embedding Intuitionistic into Classical Logic. LPAR (2023)
Sarah Sallinger, Georg Weissenbacher, Florian Zuleger
A Formalization of Heisenbugs and Their Causes. SEFM (2023)
Florian Zuleger
Algorithmenerkennung und Programmreparatur mittels Dynamischer Programmanalyse. ABP (2023)
Florian Sextl, Adam Rogalewicz, Tomás Vojnar, Florian Zuleger
Sound One-Phase Shape Analysis with Biabduction. CoRR (2023)
Radu Iosif, Florian Zuleger
Characterizations of Definable Context-Free Graphs. CoRR (2023)
Marius Bozga, Lucas Bueri, Radu Iosif, Florian Zuleger
The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations. CoRR (2023)
Christoph Matheja, Jens Pagel, Florian Zuleger
A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions. ACM Trans. Comput. Log. 24 (1) (2023)
Radu Iosif, Florian Zuleger
Expressiveness Results for an Inductive Logic of Separated Relations. CONCUR (2023)
Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin, Florian Zuleger
Stochastic Best-Effort Strategies for Borel Goals. LICS (2023)
Benjamin Aminof, Sasha Rubin, Francesco Spegni, Florian Zuleger
Parameterized Model-checking of Discrete-Timed Networks and Symmetric-Broadcast Systems. CoRR (2023)
Jens Pagel, Florian Zuleger
Strong-separation Logic. ACM Trans. Program. Lang. Syst. 44 (3) (2022)
Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger
Low-Level Bi-Abduction. ECOOP (2022)
Lorenz Leutgeb, Georg Moser, Florian Zuleger
Automated Expected Amortised Cost Analysis of Probabilistic Data Structures. CoRR (2022)
Ilina Stoilkovska, Igor Konnov, Josef Widder, Florian Zuleger
Verifying safety of synchronous fault-tolerant algorithms by bounded model checking. Int. J. Softw. Tools Technol. Transf. 24 (1) (2022)
Benjamin Aminof, Aniello Murano, Sasha Rubin, Florian Zuleger
Verification of agent navigation in partially-known environments. Artif. Intell. 308 (2022)
Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger
Low-Level Bi-Abduction. CoRR (2022)
Radu Iosif, Florian Zuleger
On the Expressiveness of a Logic of Separated Relations. CoRR (2022)
Lorenz Leutgeb, Georg Moser, Florian Zuleger
Automated Expected Amortised Cost Analysis of Probabilistic Data Structures. CAV (2) (2022)
Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin, Florian Zuleger
Beyond Strong-Cyclic: Doing Your Best in Stochastic Environments. IJCAI (2022)
Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger
Low-Level Bi-Abduction (Artifact). Dagstuhl Artifacts Ser. 8 (2) (2022)
Martin Hofmann, Lorenz Leutgeb, David Obwaller, Georg Moser, Florian Zuleger
Type-based analysis of logarithmic amortised complexity. Math. Struct. Comput. Sci. 32 (6) (2022)
Ilina Stoilkovska, Igor Konnov, Josef Widder, Florian Zuleger
Eliminating Message Counters in Synchronous Threshold Automata. VMCAI (2021)
Martin Hofmann, Lorenz Leutgeb, Georg Moser, David Obwaller, Florian Zuleger
Type-Based Analysis of Logarithmic Amortised Complexity. CoRR (2021)
Jens Pagel, Florian Zuleger
Strong-Separation Logic. ESOP (2021)
Thomas Pani, Georg Weissenbacher, Florian Zuleger
Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. Formal Methods Syst. Des. 57 (2) (2021)
Lorenz Leutgeb, Georg Moser, Florian Zuleger
ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures. CAV (2) (2021)
Emmanuel Pescosta, Georg Weissenbacher, Florian Zuleger
Bounded Model Checking of Speculative Non-Interference. ICCAD (2021)
Jens Pagel, Christoph Matheja, Florian Zuleger
Complete Entailment Checking for Separation Logic with Inductive Definitions. CoRR (2020)
Florian Zuleger
The Polynomial Complexity of Vector Addition Systems with States. FoSSaCS (2020)
Thomas Pani, Georg Weissenbacher, Florian Zuleger
Thread-modular Counter Abstraction for Parameterized Program Safety. FMCAD (2020)
Ilina Stoilkovska, Igor Konnov, Josef Widder, Florian Zuleger
Eliminating Message Counters in Threshold Automata. ATVA (2020)
Jens Katelaan, Florian Zuleger
Beyond Symbolic Heaps: Deciding Separation Logic With Inductive Definitions. LPAR (2020)
Jens Pagel, Florian Zuleger
Strong-Separation Logic. CoRR (2020)
Matthias Schlaipfer, Friedrich Slivovsky, Georg Weissenbacher, Florian Zuleger
Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness. SAT (2020)
Jens Katelaan, Christoph Matheja, Florian Zuleger
Effective Entailment Checking for Separation Logic with Inductive Definitions. TACAS (2) (2019)
Florian Zuleger
The Polynomial Complexity of Vector Addition Systems with States. CoRR (2019)
Ilina Stoilkovska, Igor Konnov, Josef Widder, Florian Zuleger
Verifying Safety of Synchronous Fault-Tolerant Algorithms by Bounded Model Checking. TACAS (2) (2019)
Mihaela Sighireanu, Juan Antonio Navarro Pérez, Andrey Rybalchenko, Nikos Gorogiannis, Radu Iosif, Andrew Reynolds, Cristina Serban, Jens Katelaan, Christoph Matheja, Thomas Noll, Florian Zuleger, Wei-Ngan Chin, Quang Loc Le, Quang-Trung Ta, Ton-Chanh Le, Thanh-Toan Nguyen, Siau-Cheng Khoo, Michal Cyprian, Adam Rogalewicz, Tomás Vojnar, Constantin Enea, Ondrej Lengál, Chong Gao, Zhilin Wu
SL-COMP: Competition of Solvers for Separation Logic. TACAS (3) (2019)
Jens Katelaan, Christoph Matheja, Thomas Noll, Florian Zuleger
Harrsh: A Tool for Unied Reasoning about Symbolic-Heap Separation Logic. LPAR (Workshop and Short Papers) (2018)
Thomas Pani, Georg Weissenbacher, Florian Zuleger
Rely-Guarantee Reasoning for Automated Bound Analysis of Lock-Free Algorithms. FMCAD (2018)
Sumit Gulwani, Ivan Radicek, Florian Zuleger
Automated clustering and program repair for introductory programming assignments. PLDI (2018)
Florian Zuleger
Inductive Termination Proofs with Transition Invariants and Their Relationship to the Size-Change Abstraction. SAS (2018)
Benjamin Aminof, Sasha Rubin, Ilina Stoilkovska, Josef Widder, Florian Zuleger
Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction. VMCAI (2018)
Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan, Florian Zuleger
Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. LICS (2018)
Tomás Fiedor, Lukás Holík, Adam Rogalewicz, Moritz Sinn, Tomás Vojnar, Florian Zuleger
From Shapes to Amortized Complexity. VMCAI (2018)
Ivan Radicek, Gilles Barthe, Marco Gaboardi, Deepak Garg, Florian Zuleger
Monadic refinements for relational cost analysis. Proc. ACM Program. Lang. 2 (POPL) (2018)
Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan, Florian Zuleger
Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. CoRR (2018)
Pavel Cadek, Clemens Danninger, Moritz Sinn, Florian Zuleger
Using Loop Bound Analysis For Invariant Generation. FMCAD (2018)
Moritz Sinn, Florian Zuleger, Helmut Veith
Complexity and Resource Bound Analysis of Imperative Programs Using Difference Constraints. J. Autom. Reason. 59 (1) (2017)
Florian Zuleger
Ranking Functions for Vector Addition Systems. CoRR (2017)
Thomas Colcombet, Laure Daviaud, Florian Zuleger
Automata and Program Analysis. FCT (2017)
Christina Jansen, Jens Katelaan, Christoph Matheja, Thomas Noll, Florian Zuleger
Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic. ESOP (2017)
Yulia Demyanova, Philipp Rümmer, Florian Zuleger
Systematic Predicate Abstraction Using Variable Roles. NFM (2017)
Yulia Demyanova, Thomas Pani, Helmut Veith, Florian Zuleger
Empirical software metrics for benchmarking of verification tools. Formal Methods Syst. Des. 50 (2-3) (2017)
Marco Gaboardi, Jan Hoffmann, Reinhard Wilhelm, Florian Zuleger
Resource Bound Analysis (Dagstuhl Seminar 17291). Dagstuhl Reports 7 (7) (2017)
Shachar Itzhaky, Tomer Kotek, Noam Rinetzky, Mooly Sagiv, Orr Tamir, Helmut Veith, Florian Zuleger
On the Automated Verification of Web Applications with Embedded SQL. ICDT (2017)
Benjamin Aminof, Aniello Murano, Sasha Rubin, Florian Zuleger
Prompt Alternating-Time Epistemic Logics. KR (2016)
Christina Jansen, Jens Katelaan, Christoph Matheja, Thomas Noll, Florian Zuleger
Unified Reasoning about Robustness Properties of Symbolic-Heap Separation Logic. CoRR (2016)
Benjamin Aminof, Aniello Murano, Sasha Rubin, Florian Zuleger
Automatic Verification of Multi-Agent Systems in Parameterised Grid-Environments. AAMAS (2016)
Benjamin Aminof, Sasha Rubin, Francesco Spegni, Florian Zuleger
Liveness of Parameterized Timed Networks. CoRR (2016)
Florian Zuleger, Ivan Radicek, Sumit Gulwani
Feedback generation for performance problems in introductory programming assignments. Software Engineering (2016)
Sumit Gulwani, Ivan Radicek, Florian Zuleger
Automated Clustering and Program Repair for Introductory Programming Assignments. CoRR (2016)
Yulia Demyanova, Thomas Pani, Helmut Veith, Florian Zuleger
Empirical software metrics for benchmarking of verification tools. Software Engineering (2016)
Shachar Itzhaky, Tomer Kotek, Noam Rinetzky, Mooly Sagiv, Orr Tamir, Helmut Veith, Florian Zuleger
On the automated verification of web applications with embedded SQL. CoRR (2016)
Moritz Sinn, Florian Zuleger, Helmut Veith
A simple and scalable static analysis for bound analysis and amortized complexity analysis. Software Engineering (2016)
Tomer Kotek, Helmut Veith, Florian Zuleger
Monadic Second Order Finite Satisfiability and Unbounded Tree-Width. CSL (2016)
Yulia Demyanova, Thomas Pani, Helmut Veith, Florian Zuleger
Empirical Software Metrics for Benchmarking of Verification Tools. CAV (1) (2015)
Florian Zuleger
Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems. CSR (2015)
Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger
Extending ALCQIO with Trees. LICS (2015)
Tomer Kotek, Helmut Veith, Florian Zuleger
Monadic second order finite satisfiability and unbounded tree-width. CoRR (2015)
Sasha Rubin, Florian Zuleger, Aniello Murano, Benjamin Aminof
Verification of Asynchronous Mobile-Robots in Partially-Known Environments. PRIMA (2015)
Thomas Pani, Helmut Veith, Florian Zuleger
Loop Patterns in C Programs. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 72 (2015)
Benjamin Aminof, Sasha Rubin, Florian Zuleger, Francesco Spegni
Liveness of Parameterized Timed Networks. ICALP (2) (2015)
Moritz Sinn, Florian Zuleger, Helmut Veith
Difference Constraints: An adequate Abstraction for Complexity Analysis of Imperative Programs. FMCAD (2015)
Moritz Sinn, Florian Zuleger, Helmut Veith
Difference Constraints: An adequate Abstraction for Complexity Analysis of Imperative Programs. CoRR (2015)
Benjamin Aminof, Sasha Rubin, Florian Zuleger
On the Expressive Power of Communication Primitives in Parameterised Systems. LPAR (2015)
Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger
Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability. Description Logics (2014)
Sumit Gulwani, Ivan Radicek, Florian Zuleger
Feedback generation for performance problems in introductory programming assignments. SIGSOFT FSE (2014)
Diego Calvanese, Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger
Shape and Content - A Database-Theoretic Perspective on the Analysis of Data Structures. IFM (2014)
Moritz Sinn, Florian Zuleger, Helmut Veith
A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis. CoRR (2014)
Moritz Sinn, Florian Zuleger, Helmut Veith
A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis. CAV (2014)
Thomas Colcombet, Laure Daviaud, Florian Zuleger
Size-Change Abstraction and Max-Plus Automata. MFCS (1) (2014)
Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger
Extending ALCQIO with reachability. CoRR (2014)
Sumit Gulwani, Ivan Radicek, Florian Zuleger
Feedback Generation for Performance Problems in Introductory Programming Assignments. CoRR (2014)
Diego Calvanese, Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger
Shape and Content: Incorporating Domain Knowledge into Shape Analysis. Description Logics (2014)
Diego Calvanese, Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger
Shape and Content: Incorporating Domain Knowledge into Shape Analysis. CoRR (2013)
Yulia Demyanova, Helmut Veith, Florian Zuleger
On the concept of variable roles and its use in software analysis. FMCAD (2013)
Byron Cook, Abigail See, Florian Zuleger
Ramsey vs. Lexicographic Termination Proving. TACAS (2013)
Yulia Demyanova, Helmut Veith, Florian Zuleger
On the Concept of Variable Roles and its Use in Software Analysis CoRR (2013)
Florian Zuleger, Sumit Gulwani, Moritz Sinn, Helmut Veith
Bound Analysis of Imperative Programs with the Size-change Abstraction (extended version) CoRR (2012)
Florian Zuleger, Sumit Gulwani, Moritz Sinn, Helmut Veith
Bound Analysis of Imperative Programs with the Size-Change Abstraction. SAS (2011)
Moritz Sinn, Florian Zuleger
LOOPUS - A Tool for Computing Loop Bounds for C Programs. WING@ETAPS/IJCAR (2010)
Sumit Gulwani, Florian Zuleger
The reachability-bound problem. PLDI (2010)
Johannes Kinder, Florian Zuleger, Helmut Veith
An Abstract Interpretation-Based Framework for Control Flow Reconstruction from Binaries. VMCAI (2009)

Florian Zuleger.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Florian Zuleger