Florian Zuleger

1.3k total citations
29 papers, 243 citations indexed

About

Florian Zuleger is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Software. According to data from OpenAlex, Florian Zuleger has authored 29 papers receiving a total of 243 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computational Theory and Mathematics, 23 papers in Artificial Intelligence and 7 papers in Software. Recurrent topics in Florian Zuleger's work include Formal Methods in Verification (23 papers), Logic, programming, and type systems (20 papers) and Logic, Reasoning, and Knowledge (6 papers). Florian Zuleger is often cited by papers focused on Formal Methods in Verification (23 papers), Logic, programming, and type systems (20 papers) and Logic, Reasoning, and Knowledge (6 papers). Florian Zuleger collaborates with scholars based in Austria, United States and Italy. Florian Zuleger's co-authors include Sumit Gulwani, Helmut Veith, Marco Gaboardi, Gilles Barthe, Deepak Garg, Sasha Rubin, Aniello Murano, Benjamin Aminof, Georg Weißenbacher and Mooly Sagiv and has published in prestigious journals such as Artificial Intelligence, ACM SIGPLAN Notices and ACM Transactions on Programming Languages and Systems.

In The Last Decade

Florian Zuleger

27 papers receiving 239 citations

Peers

Florian Zuleger

AI

CTM

SOFTW

IS

HA

Sjaak Smetsers Netherlands

Mark Hills United States

Vincent St-Amour United States

Ryan Culpepper United States

Varmo Vene Estonia

Diego Garbervetsky Argentina

Aseem Rastogi United Kingdom

Yitzhak Mandelbaum United States

Bernd Kolb Germany

Paul A. Bailes Australia

Sjaak Smetsers Netherlands

Florian Zuleger

109 ×0.9

AI

52 ×0.5

CTM

66 ×0.7

SOFTW

67 ×0.8

IS

42 ×0.9

HA

Citations per year, relative to Florian Zuleger Florian Zuleger (= 1×) peers Sjaak Smetsers

Countries citing papers authored by Florian Zuleger

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Iosif, Radu, et al.. (2024). Tree-Verifiable Graph Grammars. EPiC series in computing. 100. 165–148. 2 indexed citations

2.

Weißenbacher, Georg, et al.. (2023). Thread-modular counter abstraction: automated safety and termination proofs of parameterized software by reduction to sequential program verification. Formal Methods in System Design. 64(1-3). 108–145. 1 indexed citations

3.

Aminof, Benjamin, Giuseppe De Giacomo, Sasha Rubin, & Florian Zuleger. (2023). Stochastic Best-Effort Strategies for Borel Goals. IRIS Research product catalog (Sapienza University of Rome). 1–13.

4.

Matheja, Christoph, et al.. (2022). A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions. ACM Transactions on Computational Logic. 24(1). 1–76. 2 indexed citations

5.

Zuleger, Florian, et al.. (2022). Strong-separation Logic. ACM Transactions on Programming Languages and Systems. 44(3). 1–40.

6.

Weißenbacher, Georg, et al.. (2021). Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. Formal Methods in System Design. 57(2). 270–302. 1 indexed citations

7.

Weißenbacher, Georg, et al.. (2021). Bounded Model Checking of Speculative Non-Interference. 1–9. 2 indexed citations

8.

Barthe, Gilles, et al.. (2018). Monadic refinements for relational cost analysis. MPG.PuRe (Max Planck Society). 7 indexed citations

9.

Zuleger, Florian, et al.. (2018). LOOPUS - A Tool for Computing Loop Bounds for C Programs. EPiC series in computing. 1. 185–182. 3 indexed citations

10.

Weißenbacher, Georg, et al.. (2018). Rely-Guarantee Reasoning for Automated Bound Analysis of Lock-Free Algorithms. 1–9. 3 indexed citations

11.

Gulwani, Sumit, et al.. (2018). Automated clustering and program repair for introductory programming assignments. 465–480. 73 indexed citations

12.

Zuleger, Florian, et al.. (2017). Complexity and Resource Bound Analysis of Imperative Programs Using Difference Constraints. Journal of Automated Reasoning. 59(1). 3–45. 18 indexed citations

13.

Itzhaky, Shachar, et al.. (2017). On the Automated Verification of Web Applications with Embedded SQL. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 8 indexed citations

14.

Aminof, Benjamin, Aniello Murano, Sasha Rubin, & Florian Zuleger. (2016). Prompt alternating-time epistemic logics. Principles of Knowledge Representation and Reasoning. 258–267. 9 indexed citations

15.

Aminof, Benjamin, Aniello Murano, Sasha Rubin, & Florian Zuleger. (2016). Automatic Verification of Multi-Agent Systems in Parameterised Grid-Environments. Adaptive Agents and Multi-Agents Systems. 1190–1199. 5 indexed citations

16.

Zuleger, Florian, et al.. (2015). Difference constraints: an adequate abstraction for complexity analysis of imperative programs. 144–151. 5 indexed citations

17.

Šimkus, Mantas, et al.. (2014). Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability. 591–594. 3 indexed citations

18.

Veith, Helmut, et al.. (2013). On the concept of variable roles and its use in software analysis. 226–230. 2 indexed citations

19.

Gulwani, Sumit & Florian Zuleger. (2010). The reachability-bound problem. ACM SIGPLAN Notices. 45(6). 292–304. 6 indexed citations

20.

Gulwani, Sumit & Florian Zuleger. (2010). The reachability-bound problem. 292–304. 60 indexed citations

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.

Explore authors with similar magnitude of impact