Publications by Jure Kukovec

2020
[5] Extracting symbolic transitions from TLA+ specifications
Jure Kukovec, Thanh-Hai Tran, Igor Konnov
Science of Computer Programming, volume 187, pages 102361, 2020.
[bibtex] [pdf] [doi]
2019
[4] TLA+ model checking made symbolic
Igor Konnov, Jure Kukovec, Thanh-Hai Tran
PACMPL, volume 3, number OOPSLA, pages 123:1–123:30, 2019.
[bibtex] [pdf]
[3] Reachability Analysis for AWS-Based Networks
John Backes, Sam Bayless, Byron Cook, Catherine Dodge, Andrew Gacek, Alan J. Hu, Temesghen Kahsai, Bill Kocik, Evgenii Kotelnikov, Jure Kukovec, Sean McLaughlin, Jason Reed, Neha Rungta, John Sizemore, Mark A. Stalzer, Preethi Srinivasan, Pavle Subotic, Carsten Varming, Blake Whaley
Computer Aided Verification - 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part II, pages 231–241, 2019.
[bibtex] [pdf] [doi]
2018
[2] Extracting Symbolic Transitions from TLA+ Specifications
Jure Kukovec, Thanh-Hai Tran, Igor Konnov
Abstract State Machines, Alloy, B, TLA, VDM, and Z, pages 89–104, 2018.
[bibtex] [pdf] [doi]
[1] Reachability in Parameterized Systems: All Flavors of Threshold Automata
Jure Kukovec, Igor Konnov, Josef Widder
29th International Conference on Concurrency Theory, CONCUR 2018, September 4-7, 2018, Beijing, China, pages 19:1–19:17, 2018.
[bibtex] [pdf] [doi]

 

Technical report (2018): Extracting Symbolic Transitions from TLA+ Specifications [full]

Latest News

Jens Pagel wins Bill McCune PhD Award

We congratulate Jens Pagel for receiving the 2021 Bill McCune PhD Award in Automated Reasoning! Jens graduated in 2020; his thesis on Decision procedures for separation logic: beyond symbolic heaps (supervised by Florian Zuleger) presents his substantial contributions to the theory of formal verification and automated reasoning, and to verifying heap-manipulating programs in particular.

Continue reading

Full news archive