Florian Zuleger

According to our database1, Florian Zuleger authored at least 52 papers between 2009 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Type-Based Analysis of Logarithmic Amortised Complexity.
CoRR, 2021

Eliminating Message Counters in Synchronous Threshold Automata.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2021

2020
Complete Entailment Checking for Separation Logic with Inductive Definitions.
CoRR, 2020

Strong-Separation Logic.
CoRR, 2020

Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

Beyond Symbolic Heaps: Deciding Separation Logic With Inductive Definitions.
Proceedings of the LPAR 2020: 23rd International Conference on Logic for Programming, 2020

The Polynomial Complexity of Vector Addition Systems with States.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

Thread-modular Counter Abstraction for Parameterized Program Safety.
Proceedings of the 2020 Formal Methods in Computer Aided Design, 2020

Eliminating Message Counters in Threshold Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2020

2019
Verifying Safety of Synchronous Fault-Tolerant Algorithms by Bounded Model Checking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019


Effective Entailment Checking for Separation Logic with Inductive Definitions.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

2018
Monadic refinements for relational cost analysis.
Proc. ACM Program. Lang., 2018

From Shapes to Amortized Complexity.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2018

Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2018

Inductive Termination Proofs with Transition Invariants and Their Relationship to the Size-Change Abstraction.
Proceedings of the Static Analysis - 25th International Symposium, 2018

Automated clustering and program repair for introductory programming assignments.
Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2018

Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Rely-Guarantee Reasoning for Automated Bound Analysis of Lock-Free Algorithms.
Proceedings of the 2018 Formal Methods in Computer Aided Design, 2018

Using Loop Bound Analysis For Invariant Generation.
Proceedings of the 2018 Formal Methods in Computer Aided Design, 2018

2017
Complexity and Resource Bound Analysis of Imperative Programs Using Difference Constraints.
J. Autom. Reason., 2017

Empirical software metrics for benchmarking of verification tools.
Formal Methods Syst. Des., 2017

Resource Bound Analysis (Dagstuhl Seminar 17291).
Dagstuhl Reports, 2017

Ranking Functions for Vector Addition Systems.
CoRR, 2017

Systematic Predicate Abstraction Using Variable Roles.
Proceedings of the NASA Formal Methods - 9th International Symposium, 2017

On the Automated Verification of Web Applications with Embedded SQL.
Proceedings of the 20th International Conference on Database Theory, 2017

Automata and Program Analysis.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic.
Proceedings of the Programming Languages and Systems, 2017

2016
Feedback generation for performance problems in introductory programming assignments.
Proceedings of the Software Engineering 2016, 2016

Prompt Alternating-Time Epistemic Logics.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

Monadic Second Order Finite Satisfiability and Unbounded Tree-Width.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

Automatic Verification of Multi-Agent Systems in Parameterised Grid-Environments.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015
Loop Patterns in C Programs.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2015

Verification of Asynchronous Mobile-Robots in Partially-Known Environments.
Proceedings of the PRIMA 2015: Principles and Practice of Multi-Agent Systems, 2015

On the Expressive Power of Communication Primitives in Parameterised Systems.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015

Extending ALCQIO with Trees.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Liveness of Parameterized Timed Networks.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Difference Constraints: An adequate Abstraction for Complexity Analysis of Imperative Programs.
Proceedings of the Formal Methods in Computer-Aided Design, 2015

Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems.
Proceedings of the Computer Science - Theory and Applications, 2015

2014
Extending ALCQIO with reachability.
CoRR, 2014

Size-Change Abstraction and Max-Plus Automata.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Shape and Content - A Database-Theoretic Perspective on the Analysis of Data Structures.
Proceedings of the Integrated Formal Methods - 11th International Conference, 2014

Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability.
Proceedings of the Informal Proceedings of the 27th International Workshop on Description Logics, 2014

Shape and Content: Incorporating Domain Knowledge into Shape Analysis.
Proceedings of the Informal Proceedings of the 27th International Workshop on Description Logics, 2014

A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

2013
Ramsey vs. Lexicographic Termination Proving.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

On the concept of variable roles and its use in software analysis.
Proceedings of the Formal Methods in Computer-Aided Design, 2013

2012
Bound Analysis of Imperative Programs with the Size-change Abstraction (extended version)
CoRR, 2012

2011
Bound Analysis of Imperative Programs with the Size-Change Abstraction.
Proceedings of the Static Analysis - 18th International Symposium, 2011

2010
The reachability-bound problem.
Proceedings of the 2010 ACM SIGPLAN Conference on Programming Language Design and Implementation, 2010

LOOPUS - A Tool for Computing Loop Bounds for C Programs.
Proceedings of the Second International Workshop on Invariant Generation, 2010

2009
An Abstract Interpretation-Based Framework for Control Flow Reconstruction from Binaries.
Proceedings of the Verification, 2009


  Loading...