default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Zuleger
Person information
- affiliation: TU Wien
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c59]Mark Chimes, Radu Iosif, Florian Zuleger:
Tree-Verifiable Graph Grammars. LPAR 2024: 165-180- [c58]Tomás Dacík
, Adam Rogalewicz, Tomás Vojnar, Florian Zuleger:
Deciding Boolean Separation Logic via Small Models. TACAS (1) 2024: 188-206 - [i31]Lucas Bueri, Radu Iosif, Florian Zuleger:
Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations. CoRR abs/2402.16150 (2024) - [i30]Mark Chimes, Radu Iosif, Florian Zuleger:
Tree-Verifiable Graph Grammars. CoRR abs/2402.17015 (2024) - [i29]Tomás Dacík, Adam Rogalewicz, Tomás Vojnar, Florian Zuleger:
Deciding Boolean Separation Logic via Small Models (Technical Report). CoRR abs/2403.18999 (2024) - [i28]Marius Bozga, Radu Iosif, Florian Zuleger:
Regular Grammars for Graph Sets of Tree-Width ≤. CoRR abs/2408.01226 (2024) - 2023
- [j11]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): 1:1-1:76 (2023) - [c57]Florian Zuleger:
Algorithmenerkennung und Programmreparatur mittels Dynamischer Programmanalyse. ABP 2023: 1 - [c56]Radu Iosif, Florian Zuleger:
Expressiveness Results for an Inductive Logic of Separated Relations. CONCUR 2023: 20:1-20:20 - [c55]Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin, Florian Zuleger:
Stochastic Best-Effort Strategies for Borel Goals. LICS 2023: 1-13 - [c54]Alexander Pluska, Florian Zuleger:
Embedding Intuitionistic into Classical Logic. LPAR 2023: 329-349 - [c53]Sarah Sallinger, Georg Weissenbacher, Florian Zuleger:
A Formalization of Heisenbugs and Their Causes. SEFM 2023: 282-300 - [i27]Radu Iosif, Florian Zuleger:
Expressiveness Results for an Inductive Logic of Separated Relations. CoRR abs/2307.02381 (2023) - [i26]Florian Sextl, Adam Rogalewicz, Tomás Vojnar, Florian Zuleger:
Sound One-Phase Shape Analysis with Biabduction. CoRR abs/2307.06346 (2023) - [i25]Benjamin Aminof, Sasha Rubin, Francesco Spegni, Florian Zuleger:
Parameterized Model-checking of Discrete-Timed Networks and Symmetric-Broadcast Systems. CoRR abs/2310.02466 (2023) - [i24]Radu Iosif, Florian Zuleger:
Characterizations of Definable Context-Free Graphs. CoRR abs/2310.04764 (2023) - [i23]Marius Bozga, Lucas Bueri, Radu Iosif, Florian Zuleger:
The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations. CoRR abs/2310.09542 (2023) - 2022
- [j10]Benjamin Aminof, Aniello Murano, Sasha Rubin, Florian Zuleger:
Verification of agent navigation in partially-known environments. Artif. Intell. 308: 103724 (2022) - [j9]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): 11:1-11:6 (2022) - [j8]Martin Hofmann, Lorenz Leutgeb, David Obwaller, Georg Moser, Florian Zuleger:
Type-based analysis of logarithmic amortised complexity. Math. Struct. Comput. Sci. 32(6): 794-826 (2022) - [j7]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): 33-48 (2022) - [j6]Jens Pagel, Florian Zuleger:
Strong-separation Logic. ACM Trans. Program. Lang. Syst. 44(3): 16:1-16:40 (2022) - [c52]Lorenz Leutgeb, Georg Moser, Florian Zuleger:
Automated Expected Amortised Cost Analysis of Probabilistic Data Structures. CAV (2) 2022: 70-91 - [c51]Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger:
Low-Level Bi-Abduction. ECOOP 2022: 19:1-19:30 - [c50]Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin, Florian Zuleger:
Beyond Strong-Cyclic: Doing Your Best in Stochastic Environments. IJCAI 2022: 2525-2531 - [i22]Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger:
Low-Level Bi-Abduction. CoRR abs/2205.02590 (2022) - [i21]Lorenz Leutgeb, Georg Moser, Florian Zuleger:
Automated Expected Amortised Cost Analysis of Probabilistic Data Structures. CoRR abs/2206.03537 (2022) - [i20]Radu Iosif, Florian Zuleger:
On the Expressiveness of a Logic of Separated Relations. CoRR abs/2208.01520 (2022) - 2021
- [j5]Thomas Pani, Georg Weissenbacher, Florian Zuleger:
Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. Formal Methods Syst. Des. 57(2): 270-302 (2021) - [c49]Lorenz Leutgeb, Georg Moser, Florian Zuleger:
ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures. CAV (2) 2021: 99-122 - [c48]Jens Pagel, Florian Zuleger:
Strong-Separation Logic. ESOP 2021: 664-692 - [c47]Emmanuel Pescosta, Georg Weissenbacher, Florian Zuleger:
Bounded Model Checking of Speculative Non-Interference. ICCAD 2021: 1-9 - [c46]Ilina Stoilkovska, Igor Konnov, Josef Widder, Florian Zuleger:
Eliminating Message Counters in Synchronous Threshold Automata. VMCAI 2021: 196-218 - [i19]Martin Hofmann, Lorenz Leutgeb, Georg Moser, David Obwaller, Florian Zuleger:
Type-Based Analysis of Logarithmic Amortised Complexity. CoRR abs/2101.12029 (2021) - 2020
- [c45]Ilina Stoilkovska, Igor Konnov, Josef Widder, Florian Zuleger:
Eliminating Message Counters in Threshold Automata. ATVA 2020: 196-212 - [c44]Thomas Pani, Georg Weissenbacher, Florian Zuleger:
Thread-modular Counter Abstraction for Parameterized Program Safety. FMCAD 2020: 67-76 - [c43]Florian Zuleger:
The Polynomial Complexity of Vector Addition Systems with States. FoSSaCS 2020: 622-641 - [c42]Jens Katelaan, Florian Zuleger:
Beyond Symbolic Heaps: Deciding Separation Logic With Inductive Definitions. LPAR 2020: 390-408 - [c41]Matthias Schlaipfer, Friedrich Slivovsky, Georg Weissenbacher, Florian Zuleger:
Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness. SAT 2020: 429-446 - [i18]Jens Pagel, Florian Zuleger:
Strong-Separation Logic. CoRR abs/2001.06235 (2020) - [i17]Jens Pagel, Christoph Matheja, Florian Zuleger:
Complete Entailment Checking for Separation Logic with Inductive Definitions. CoRR abs/2002.01202 (2020)
2010 – 2019
- 2019
- [c40]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: 116-132 - [c39]Jens Katelaan, Christoph Matheja, Florian Zuleger:
Effective Entailment Checking for Separation Logic with Inductive Definitions. TACAS (2) 2019: 319-336 - [c38]Ilina Stoilkovska, Igor Konnov, Josef Widder, Florian Zuleger:
Verifying Safety of Synchronous Fault-Tolerant Algorithms by Bounded Model Checking. TACAS (2) 2019: 357-374 - [i16]Florian Zuleger:
The Polynomial Complexity of Vector Addition Systems with States. CoRR abs/1907.01076 (2019) - 2018
- [j4]Ivan Radicek, Gilles Barthe, Marco Gaboardi, Deepak Garg, Florian Zuleger:
Monadic refinements for relational cost analysis. Proc. ACM Program. Lang. 2(POPL): 36:1-36:32 (2018) - [c37]Pavel Cadek, Clemens Danninger, Moritz Sinn, Florian Zuleger:
Using Loop Bound Analysis For Invariant Generation. FMCAD 2018: 1-9 - [c36]Thomas Pani, Georg Weissenbacher, Florian Zuleger:
Rely-Guarantee Reasoning for Automated Bound Analysis of Lock-Free Algorithms. FMCAD 2018: 1-9 - [c35]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: 185-194 - [c34]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: 23-36 - [c33]Sumit Gulwani, Ivan Radicek, Florian Zuleger:
Automated clustering and program repair for introductory programming assignments. PLDI 2018: 465-480 - [c32]Florian Zuleger:
Inductive Termination Proofs with Transition Invariants and Their Relationship to the Size-Change Abstraction. SAS 2018: 423-444 - [c31]Benjamin Aminof, Sasha Rubin, Ilina Stoilkovska, Josef Widder, Florian Zuleger:
Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction. VMCAI 2018: 1-24 - [c30]Tomás Fiedor, Lukás Holík, Adam Rogalewicz, Moritz Sinn, Tomás Vojnar, Florian Zuleger:
From Shapes to Amortized Complexity. VMCAI 2018: 205-225 - [i15]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 abs/1804.10985 (2018) - 2017
- [j3]Yulia Demyanova, Thomas Pani, Helmut Veith, Florian Zuleger:
Empirical software metrics for benchmarking of verification tools. Formal Methods Syst. Des. 50(2-3): 289-316 (2017) - [j2]Moritz Sinn, Florian Zuleger, Helmut Veith:
Complexity and Resource Bound Analysis of Imperative Programs Using Difference Constraints. J. Autom. Reason. 59(1): 3-45 (2017) - [c29]Christina Jansen, Jens Katelaan, Christoph Matheja, Thomas Noll, Florian Zuleger:
Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic. ESOP 2017: 611-638 - [c28]Thomas Colcombet, Laure Daviaud, Florian Zuleger:
Automata and Program Analysis. FCT 2017: 3-10 - [c27]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: 16:1-16:18 - [c26]Yulia Demyanova, Philipp Rümmer, Florian Zuleger:
Systematic Predicate Abstraction Using Variable Roles. NFM 2017: 265-281 - [i14]Florian Zuleger:
Ranking Functions for Vector Addition Systems. CoRR abs/1710.10292 (2017) - [i13]Marco Gaboardi, Jan Hoffmann, Reinhard Wilhelm, Florian Zuleger:
Resource Bound Analysis (Dagstuhl Seminar 17291). Dagstuhl Reports 7(7): 72-87 (2017) - 2016
- [c25]Benjamin Aminof, Aniello Murano, Sasha Rubin, Florian Zuleger:
Automatic Verification of Multi-Agent Systems in Parameterised Grid-Environments. AAMAS 2016: 1190-1199 - [c24]Tomer Kotek, Helmut Veith, Florian Zuleger:
Monadic Second Order Finite Satisfiability and Unbounded Tree-Width. CSL 2016: 13:1-13:20 - [c23]Benjamin Aminof, Aniello Murano, Sasha Rubin, Florian Zuleger:
Prompt Alternating-Time Epistemic Logics. KR 2016: 258-267 - [c22]Florian Zuleger, Ivan Radicek, Sumit Gulwani:
Feedback generation for performance problems in introductory programming assignments. Software Engineering 2016: 49-50 - [c21]Yulia Demyanova, Thomas Pani, Helmut Veith, Florian Zuleger:
Empirical software metrics for benchmarking of verification tools. Software Engineering 2016: 67-68 - [c20]Moritz Sinn, Florian Zuleger, Helmut Veith:
A simple and scalable static analysis for bound analysis and amortized complexity analysis. Software Engineering 2016: 101-102 - [i12]Sumit Gulwani, Ivan Radicek, Florian Zuleger:
Automated Clustering and Program Repair for Introductory Programming Assignments. CoRR abs/1603.03165 (2016) - [i11]Benjamin Aminof, Sasha Rubin, Francesco Spegni, Florian Zuleger:
Liveness of Parameterized Timed Networks. CoRR abs/1609.04176 (2016) - [i10]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 abs/1610.02101 (2016) - [i9]Christina Jansen, Jens Katelaan, Christoph Matheja, Thomas Noll, Florian Zuleger:
Unified Reasoning about Robustness Properties of Symbolic-Heap Separation Logic. CoRR abs/1610.07041 (2016) - 2015
- [j1]Thomas Pani, Helmut Veith, Florian Zuleger:
Loop Patterns in C Programs. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 72 (2015) - [c19]Yulia Demyanova, Thomas Pani, Helmut Veith, Florian Zuleger:
Empirical Software Metrics for Benchmarking of Verification Tools. CAV (1) 2015: 561-579 - [c18]Florian Zuleger:
Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems. CSR 2015: 426-442 - [c17]Moritz Sinn, Florian Zuleger, Helmut Veith:
Difference Constraints: An adequate Abstraction for Complexity Analysis of Imperative Programs. FMCAD 2015: 144-151 - [c16]Benjamin Aminof, Sasha Rubin, Florian Zuleger, Francesco Spegni:
Liveness of Parameterized Timed Networks. ICALP (2) 2015: 375-387 - [c15]Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger:
Extending ALCQIO with Trees. LICS 2015: 511-522 - [c14]Benjamin Aminof, Sasha Rubin, Florian Zuleger:
On the Expressive Power of Communication Primitives in Parameterised Systems. LPAR 2015: 313-328 - [c13]Sasha Rubin, Florian Zuleger, Aniello Murano, Benjamin Aminof:
Verification of Asynchronous Mobile-Robots in Partially-Known Environments. PRIMA 2015: 185-200 - [i8]Tomer Kotek, Helmut Veith, Florian Zuleger:
Monadic second order finite satisfiability and unbounded tree-width. CoRR abs/1505.06622 (2015) - [i7]Moritz Sinn, Florian Zuleger, Helmut Veith:
Difference Constraints: An adequate Abstraction for Complexity Analysis of Imperative Programs. CoRR abs/1508.04958 (2015) - 2014
- [c12]Moritz Sinn, Florian Zuleger, Helmut Veith:
A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis. CAV 2014: 745-761 - [c11]Diego Calvanese, Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger:
Shape and Content: Incorporating Domain Knowledge into Shape Analysis. Description Logics 2014: 124-127 - [c10]Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger:
Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability. Description Logics 2014: 591-594 - [c9]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: 3-17 - [c8]Thomas Colcombet, Laure Daviaud, Florian Zuleger:
Size-Change Abstraction and Max-Plus Automata. MFCS (1) 2014: 208-219 - [c7]Sumit Gulwani, Ivan Radicek, Florian Zuleger:
Feedback generation for performance problems in introductory programming assignments. SIGSOFT FSE 2014: 41-51 - [i6]Moritz Sinn, Florian Zuleger, Helmut Veith:
A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis. CoRR abs/1401.5842 (2014) - [i5]Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger:
Extending ALCQIO with reachability. CoRR abs/1402.6804 (2014) - [i4]Sumit Gulwani, Ivan Radicek, Florian Zuleger:
Feedback Generation for Performance Problems in Introductory Programming Assignments. CoRR abs/1403.4064 (2014) - 2013
- [c6]Yulia Demyanova, Helmut Veith, Florian Zuleger:
On the concept of variable roles and its use in software analysis. FMCAD 2013: 226-230 - [c5]Byron Cook, Abigail See, Florian Zuleger:
Ramsey vs. Lexicographic Termination Proving. TACAS 2013: 47-61 - [i3]Yulia Demyanova, Helmut Veith, Florian Zuleger:
On the Concept of Variable Roles and its Use in Software Analysis. CoRR abs/1305.6745 (2013) - [i2]Diego Calvanese, Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger:
Shape and Content: Incorporating Domain Knowledge into Shape Analysis. CoRR abs/1312.6624 (2013) - 2012
- [i1]Florian Zuleger, Sumit Gulwani, Moritz Sinn, Helmut Veith:
Bound Analysis of Imperative Programs with the Size-change Abstraction (extended version). CoRR abs/1203.5303 (2012) - 2011
- [c4]Florian Zuleger, Sumit Gulwani, Moritz Sinn, Helmut Veith:
Bound Analysis of Imperative Programs with the Size-Change Abstraction. SAS 2011: 280-297 - 2010
- [c3]Moritz Sinn, Florian Zuleger:
LOOPUS - A Tool for Computing Loop Bounds for C Programs. WING@ETAPS/IJCAR 2010: 185-186 - [c2]Sumit Gulwani, Florian Zuleger:
The reachability-bound problem. PLDI 2010: 292-304
2000 – 2009
- 2009
- [c1]Johannes Kinder, Florian Zuleger, Helmut Veith:
An Abstract Interpretation-Based Framework for Control Flow Reconstruction from Binaries. VMCAI 2009: 214-228
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
