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

Helmut Veith Stipend

The first recipient of the Helmut Veith Stipend for excellent female master’s students in computer science will be presented on March 14 at the following event: "More female students in computer science. Who cares?" Panel discussion with renowned scientists about diversity in STEM Studies March 14, 5:30pm, TU Wien The Helmut Veith Stipend is dedicated […]

Continue reading

WAIT 2016 in Vienna

The third WAIT workshop on induction is held between 17-18 November at the TU Wien. Details are available on the workshop page.

Continue reading

Two papers at POPL’17

Two papers co-authored by researchers from our group have been accepted for POPL’17: “Coming to Terms with Quantified Reasoning” by Simon Robillard, Andrei Voronkov, and Laura Kovacs; and “A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms” by Igor Konnov, Marijana Lazic, Helmut Veith, and Josef Widder

Continue reading

Helmut Veith Stipend

Outstanding female students in the field of computer science who pursue (or plan to pursue) one of the master‘s programs in Computer Science at TU Wien taught in English are invited to apply for the Helmut Veith Stipend

Continue reading

Full news archive