Published in: LIPIcs, Volume 246, 36th International Symposium on Distributed Computing (DISC 2022)
Gal Amram, Avi Hayoun, Lior Mizrahi, and Gera Weiss. Polynomial-Time Verification and Testing of Implementations of the Snapshot Data Structure. In 36th International Symposium on Distributed Computing (DISC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 246, pp. 5:1-5:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{amram_et_al:LIPIcs.DISC.2022.5, author = {Amram, Gal and Hayoun, Avi and Mizrahi, Lior and Weiss, Gera}, title = {{Polynomial-Time Verification and Testing of Implementations of the Snapshot Data Structure}}, booktitle = {36th International Symposium on Distributed Computing (DISC 2022)}, pages = {5:1--5:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-255-6}, ISSN = {1868-8969}, year = {2022}, volume = {246}, editor = {Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.5}, URN = {urn:nbn:de:0030-drops-171964}, doi = {10.4230/LIPIcs.DISC.2022.5}, annote = {Keywords: Snapshot, Linearizability, Verification, Formal Methods} }
Published in: LIPIcs, Volume 140, 30th International Conference on Concurrency Theory (CONCUR 2019)
Tobias Winkler, Sebastian Junges, Guillermo A. Pérez, and Joost-Pieter Katoen. On the Complexity of Reachability in Parametric Markov Decision Processes. In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, pp. 14:1-14:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{winkler_et_al:LIPIcs.CONCUR.2019.14, author = {Winkler, Tobias and Junges, Sebastian and P\'{e}rez, Guillermo A. and Katoen, Joost-Pieter}, title = {{On the Complexity of Reachability in Parametric Markov Decision Processes}}, booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, pages = {14:1--14:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-121-4}, ISSN = {1868-8969}, year = {2019}, volume = {140}, editor = {Fokkink, Wan and van Glabbeek, Rob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.14}, URN = {urn:nbn:de:0030-drops-109162}, doi = {10.4230/LIPIcs.CONCUR.2019.14}, annote = {Keywords: Parametric Markov decision processes, Formal verification, ETR, Complexity} }
Published in: LIPIcs, Volume 122, 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)
A. Prasad Sistla. Model Checking Randomized Security Protocols (Invited Paper). In 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 122, p. 2:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{sistla:LIPIcs.FSTTCS.2018.2, author = {Sistla, A. Prasad}, title = {{Model Checking Randomized Security Protocols}}, booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-093-4}, ISSN = {1868-8969}, year = {2018}, volume = {122}, editor = {Ganguly, Sumit and Pandya, Paritosh}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.2}, URN = {urn:nbn:de:0030-drops-99018}, doi = {10.4230/LIPIcs.FSTTCS.2018.2}, annote = {Keywords: Randomized Protocols, Verification} }
Published in: LIPIcs, Volume 118, 29th International Conference on Concurrency Theory (CONCUR 2018)
Nima Roohi, Pavithra Prabhakar, and Mahesh Viswanathan. Relating Syntactic and Semantic Perturbations of Hybrid Automata. In 29th International Conference on Concurrency Theory (CONCUR 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 118, pp. 26:1-26:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{roohi_et_al:LIPIcs.CONCUR.2018.26, author = {Roohi, Nima and Prabhakar, Pavithra and Viswanathan, Mahesh}, title = {{Relating Syntactic and Semantic Perturbations of Hybrid Automata}}, booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)}, pages = {26:1--26:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-087-3}, ISSN = {1868-8969}, year = {2018}, volume = {118}, editor = {Schewe, Sven and Zhang, Lijun}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.26}, URN = {urn:nbn:de:0030-drops-95644}, doi = {10.4230/LIPIcs.CONCUR.2018.26}, annote = {Keywords: Model Checking, Hybrid Automata, Approximation, Perturbation} }
Published in: LIPIcs, Volume 119, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
Rohit Chadha, A. Prasad Sistla, and Mahesh Viswanathan. Approximating Probabilistic Automata by Regular Languages. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 14:1-14:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{chadha_et_al:LIPIcs.CSL.2018.14, author = {Chadha, Rohit and Sistla, A. Prasad and Viswanathan, Mahesh}, title = {{Approximating Probabilistic Automata by Regular Languages}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {14:1--14:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-088-0}, ISSN = {1868-8969}, year = {2018}, volume = {119}, editor = {Ghica, Dan R. and Jung, Achim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.14}, URN = {urn:nbn:de:0030-drops-96815}, doi = {10.4230/LIPIcs.CSL.2018.14}, annote = {Keywords: Probabilistic Finite Automata, Regular Languages, Ambiguity} }
Published in: LIPIcs, Volume 119, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
P. Madhusudan, Umang Mathur, Shambwaditya Saha, and Mahesh Viswanathan. A Decidable Fragment of Second Order Logic With Applications to Synthesis. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 31:1-31:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{madhusudan_et_al:LIPIcs.CSL.2018.31, author = {Madhusudan, P. and Mathur, Umang and Saha, Shambwaditya and Viswanathan, Mahesh}, title = {{A Decidable Fragment of Second Order Logic With Applications to Synthesis}}, booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)}, pages = {31:1--31:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-088-0}, ISSN = {1868-8969}, year = {2018}, volume = {119}, editor = {Ghica, Dan R. and Jung, Achim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.31}, URN = {urn:nbn:de:0030-drops-96987}, doi = {10.4230/LIPIcs.CSL.2018.31}, annote = {Keywords: second order logic, synthesis, decidable fragment} }
Published in: LIPIcs, Volume 93, 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)
Dileep Kini and Mahesh Viswanathan. Complexity of Model Checking MDPs against LTL Specifications. In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 93, pp. 35:1-35:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{kini_et_al:LIPIcs.FSTTCS.2017.35, author = {Kini, Dileep and Viswanathan, Mahesh}, title = {{Complexity of Model Checking MDPs against LTL Specifications}}, booktitle = {37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)}, pages = {35:1--35:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-055-2}, ISSN = {1868-8969}, year = {2018}, volume = {93}, editor = {Lokam, Satya and Ramanujam, R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2017.35}, URN = {urn:nbn:de:0030-drops-83928}, doi = {10.4230/LIPIcs.FSTTCS.2017.35}, annote = {Keywords: Markov Decision Processes, Linear Temporal Logic, model checking, complexity} }
Published in: LIPIcs, Volume 42, 26th International Conference on Concurrency Theory (CONCUR 2015)
Fu Song, Weikai Miao, Geguang Pu, and Min Zhang. On Reachability Analysis of Pushdown Systems with Transductions: Application to Boolean Programs with Call-by-Reference. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 383-397, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{song_et_al:LIPIcs.CONCUR.2015.383, author = {Song, Fu and Miao, Weikai and Pu, Geguang and Zhang, Min}, title = {{On Reachability Analysis of Pushdown Systems with Transductions: Application to Boolean Programs with Call-by-Reference}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {383--397}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.383}, URN = {urn:nbn:de:0030-drops-53624}, doi = {10.4230/LIPIcs.CONCUR.2015.383}, annote = {Keywords: Verification, Reachability problem, Pushdown system with transductions, Boolean programs with call-by-reference} }
Published in: LIPIcs, Volume 37, 29th European Conference on Object-Oriented Programming (ECOOP 2015)
Johannes Kloos, Rupak Majumdar, and Viktor Vafeiadis. Asynchronous Liquid Separation Types. In 29th European Conference on Object-Oriented Programming (ECOOP 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 37, pp. 396-420, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{kloos_et_al:LIPIcs.ECOOP.2015.396, author = {Kloos, Johannes and Majumdar, Rupak and Vafeiadis, Viktor}, title = {{Asynchronous Liquid Separation Types}}, booktitle = {29th European Conference on Object-Oriented Programming (ECOOP 2015)}, pages = {396--420}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-86-6}, ISSN = {1868-8969}, year = {2015}, volume = {37}, editor = {Boyland, John Tang}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2015.396}, URN = {urn:nbn:de:0030-drops-52233}, doi = {10.4230/LIPIcs.ECOOP.2015.396}, annote = {Keywords: Liquid Types, Asynchronous Parallelism, Separation Logic, Type Systems} }
Published in: LIPIcs, Volume 29, 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)
Taolue Chen and Tingting Han. On the Complexity of Computing Maximum Entropy for Markovian Models. In 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 29, pp. 571-583, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{chen_et_al:LIPIcs.FSTTCS.2014.571, author = {Chen, Taolue and Han, Tingting}, title = {{On the Complexity of Computing Maximum Entropy for Markovian Models}}, booktitle = {34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)}, pages = {571--583}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-77-4}, ISSN = {1868-8969}, year = {2014}, volume = {29}, editor = {Raman, Venkatesh and Suresh, S. P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2014.571}, URN = {urn:nbn:de:0030-drops-48725}, doi = {10.4230/LIPIcs.FSTTCS.2014.571}, annote = {Keywords: Markovian Models, Entropy, Complexity, Probabilistic Verification} }
Published in: LIPIcs, Volume 8, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)
Rohit Chadha, A. Prasad Sistla, and Mahesh Viswanathan. Model Checking Concurrent Programs with Nondeterminism and Randomization. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). Leibniz International Proceedings in Informatics (LIPIcs), Volume 8, pp. 364-375, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
@InProceedings{chadha_et_al:LIPIcs.FSTTCS.2010.364, author = {Chadha, Rohit and Sistla, A. Prasad and Viswanathan, Mahesh}, title = {{Model Checking Concurrent Programs with Nondeterminism and Randomization}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)}, pages = {364--375}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-23-1}, ISSN = {1868-8969}, year = {2010}, volume = {8}, editor = {Lodaya, Kamal and Mahajan, Meena}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.364}, URN = {urn:nbn:de:0030-drops-28788}, doi = {10.4230/LIPIcs.FSTTCS.2010.364}, annote = {Keywords: view consistent scheduler, locally Markovian scheduler, model-checking, probabilistic program} }
Feedback for Dagstuhl Publishing