Marijana Lazic

Orcid: 0000-0002-9222-6191

Affiliations:
  • TU Munich, Department of Informatics, Germany
  • TU Vienna, LogiCS, Austria


According to our database1, Marijana Lazic authored at least 15 papers between 2017 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker.
Log. Methods Comput. Sci., 2023

2022
Holistic Verification of Blockchain Consensus.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Brief Announcement: Holistic Verification of Blockchain Consensus.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021
Correction to: Verification of randomized consensus algorithms under round-rigid adversaries.
Int. J. Softw. Tools Technol. Transf., 2021

Verification of randomized consensus algorithms under round-rigid adversaries.
Int. J. Softw. Tools Technol. Transf., 2021

A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks.
J. Log. Algebraic Methods Program., 2021

A Reduction Theorem for Randomized Distributed Algorithms Under Weak Adversaries.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2021

2020
Tutorial: Parameterized Verification with Byzantine Model Checker.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2020

Complexity of Verification and Synthesis of Threshold Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2020

2019
Wait-Free Solvability of Equality Negation Tasks.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

A Dynamic Epistemic Logic Analysis of the Equality Negation Task.
Proceedings of the Dynamic Logic. New Trends and Applications, 2019

Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics.
Proceedings of the Computer Aided Verification - 31st International Conference, 2019

2017
Para<sup>2</sup>: parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms.
Formal Methods Syst. Des., 2017

A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Synthesis of Distributed Algorithms with Parameterized Threshold Guards.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017


  Loading...