Florian Zuleger
About
In The Last Decade
Florian Zuleger
27 papers receiving 239 citations
Peers
Comparison fields: 5 of 27
- Artificial Intelligence 126
- Computational Theory and Mathematics 110
- Software 101
- Information Systems 81
- Hardware and Architecture 49
Countries citing papers authored by Florian Zuleger
This map shows the geographic impact of Florian Zuleger's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Florian Zuleger with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Florian Zuleger more than expected).
Fields of papers citing papers by Florian Zuleger
This network shows the impact of papers produced by Florian Zuleger. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Florian Zuleger. The network helps show where Florian Zuleger may publish in the future.
Co-authorship network of co-authors of Florian Zuleger
This figure shows the co-authorship network connecting the top 25 collaborators of Florian Zuleger. A scholar is included among the top collaborators of Florian Zuleger based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Florian Zuleger. Florian Zuleger is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Title | Journal | Authors | Indexed citations |
|---|---|---|---|---|
| 1 | Tree-Verifiable Graph Grammars | EPiC series in computing | Radu Iosif, Florian Zuleger et al. | 2 |
| 2 | Thread-modular counter abstraction: automated safety and termination proofs of parameterized software by reduction to sequential program verification | Formal Methods in System Design | Georg Weißenbacher, Florian Zuleger et al. | 1 |
| 3 | Stochastic Best-Effort Strategies for Borel Goals | IRIS Research product catalog (Sapienza University of Rome) | Benjamin Aminof, Giuseppe De Giacomo et al. | 0 |
| 4 | A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions | ACM Transactions on Computational Logic | Christoph Matheja, Florian Zuleger et al. | 2 |
| 5 | Strong-separation Logic | ACM Transactions on Programming Languages and Systems | Florian Zuleger et al. | 0 |
| 6 | Rely-guarantee bound analysis of parameterized concurrent shared-memory programs | Formal Methods in System Design | Georg Weißenbacher, Florian Zuleger et al. | 1 |
| 7 | Bounded Model Checking of Speculative Non-Interference | Georg Weißenbacher, Florian Zuleger et al. | 2 | |
| 8 | Monadic refinements for relational cost analysis | MPG.PuRe (Max Planck Society) | Gilles Barthe, Marco Gaboardi et al. | 7 |
| 9 | LOOPUS - A Tool for Computing Loop Bounds for C Programs | EPiC series in computing | Florian Zuleger et al. | 3 |
| 10 | Rely-Guarantee Reasoning for Automated Bound Analysis of Lock-Free Algorithms | Georg Weißenbacher, Florian Zuleger et al. | 3 | |
| 11 | Automated clustering and program repair for introductory programming assignments | Sumit Gulwani, Florian Zuleger et al. | 73 | |
| 12 | Complexity and Resource Bound Analysis of Imperative Programs Using Difference Constraints | Journal of Automated Reasoning | Florian Zuleger, Helmut Veith et al. | 18 |
| 13 | On the Automated Verification of Web Applications with Embedded SQL | DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) | Shachar Itzhaky, Noam Rinetzky et al. | 8 |
| 14 | Prompt alternating-time epistemic logics | Principles of Knowledge Representation and Reasoning | Benjamin Aminof, Aniello Murano et al. | 9 |
| 15 | Automatic Verification of Multi-Agent Systems in Parameterised Grid-Environments | Adaptive Agents and Multi-Agents Systems | Benjamin Aminof, Aniello Murano et al. | 5 |
| 16 | Difference constraints: an adequate abstraction for complexity analysis of imperative programs | Florian Zuleger, Helmut Veith et al. | 5 | |
| 17 | Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability | Mantas Šimkus, Helmut Veith et al. | 3 | |
| 18 | On the concept of variable roles and its use in software analysis | Helmut Veith, Florian Zuleger et al. | 2 | |
| 19 | The reachability-bound problem | ACM SIGPLAN Notices | Sumit Gulwani, Florian Zuleger | 6 |
| 20 | The reachability-bound problem | Sumit Gulwani, Florian Zuleger | 60 |
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.