Volgen
Florian Zuleger
Florian Zuleger
Associate Professor, TU Wien
Geverifieerd e-mailadres voor forsyte.tuwien.ac.at - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
An Abstract Interpretation-Based Framework for Control Flow Reconstruction from Binaries.
J Kinder, F Zuleger, H Veith
VMCAI 9, 214-228, 2009
1512009
The reachability-bound problem
S Gulwani, F Zuleger
Proceedings of the 31st ACM SIGPLAN Conference on Programming Language …, 2010
1372010
Automated clustering and program repair for introductory programming assignments
S Gulwani, I Radiček, F Zuleger
ACM SIGPLAN Notices 53 (4), 465-480, 2018
1312018
A simple and scalable static analysis for bound analysis and amortized complexity analysis
M Sinn, F Zuleger, H Veith
Computer Aided Verification: 26th International Conference, CAV 2014, Held …, 2014
1302014
Bound analysis of imperative programs with the size-change abstraction
F Zuleger, S Gulwani, M Sinn, H Veith
Static Analysis: 18th International Symposium, SAS 2011, Venice, Italy …, 2011
1172011
Ramsey vs. lexicographic termination proving
B Cook, A See, F Zuleger
Tools and Algorithms for the Construction and Analysis of Systems: 19th …, 2013
1152013
Feedback generation for performance problems in introductory programming assignments
S Gulwani, I Radiček, F Zuleger
Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations …, 2014
812014
Complexity and resource bound analysis of imperative programs using difference constraints
M Sinn, F Zuleger, H Veith
Journal of automated reasoning 59, 3-45, 2017
602017
Empirical software metrics for benchmarking of verification tools
Y Demyanova, T Pani, H Veith, F Zuleger
Formal Methods in System Design 50, 289-316, 2017
422017
Verification of asynchronous mobile-robots in partially-known environments
B Aminof, A Murano, S Rubin, F Zuleger
PRIMA 2015: Principles and Practice of Multi-Agent Systems: 18th …, 2015
372015
Monadic refinements for relational cost analysis
I Radiček, G Barthe, M Gaboardi, D Garg, F Zuleger
Proceedings of the ACM on Programming Languages 2 (POPL), 1-32, 2017
302017
Size-change abstraction and max-plus automata
T Colcombet, L Daviaud, F Zuleger
Mathematical Foundations of Computer Science 2014: 39th International …, 2014
282014
Effective entailment checking for separation logic with inductive definitions
J Katelaan, C Matheja, F Zuleger
Tools and Algorithms for the Construction and Analysis of Systems: 25th …, 2019
272019
Parameterized model checking of synchronous distributed algorithms by abstraction
B Aminof, S Rubin, I Stoilkovska, J Widder, F Zuleger
Verification, Model Checking, and Abstract Interpretation: 19th …, 2018
272018
On the automated verification of web applications with embedded SQL
S Itzhaky, T Kotek, N Rinetzky, M Sagiv, O Tamir, H Veith, F Zuleger
arXiv preprint arXiv:1610.02101, 2016
252016
Difference constraints: An adequate abstraction for complexity analysis of imperative programs
M Sinn, F Zuleger, H Veith
2015 Formal Methods in Computer-Aided Design (FMCAD), 144-151, 2015
242015
Unified reasoning about robustness properties of symbolic-heap separation logic
C Jansen, J Katelaan, C Matheja, T Noll, F Zuleger
Programming Languages and Systems: 26th European Symposium on Programming …, 2017
232017
Verifying safety of synchronous fault-tolerant algorithms by bounded model checking
I Stoilkovska, I Konnov, J Widder, F Zuleger
International Journal on Software Tools for Technology Transfer 24 (1), 33-48, 2022
222022
Automatic verification of multi-agent systems in parameterised grid-environments
B Aminof, A Murano, S Rubin, F Zuleger
Proceedings of the 2016 international conference on autonomous agents …, 2016
212016
Liveness of parameterized timed networks
B Aminof, S Rubin, F Zuleger, F Spegni
Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015
212015
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20