|
|
|
Tomáš Brázdil, Stefan Kiefer, and Antonín Kučera. Efficient analysis of probabilistic programs with an unbounded counter. Journal of the ACM, 61(6):41:1–41:35, December 2014. |
|
|
Vojtěch Forejt, Petr Jančar, Stefan Kiefer, and James Worrell. Language equivalence of probabilistic pushdown automata. Information and Computation, 237:1–11, October 2014. |
|
|
Rene Neumann. Using Promela in a fully verified executable LTL model checker. In Dimitra Giannakopoulou and Daniel Kroening, editors, Verified Software: Theories, Tools and Experiments, Lecture Notes in Computer Science, pages 105–114, July 2014. |
|
|
M. Schlund and M. Luttenberger. Regular Expressions for Provenance. In Proceedings of the 6th USENIX Workshop on the Theory and Practice of Provenance, June 2014. |
|
|
Stefan Kiefer and Björn Wachter. Stability and complexity of minimising probabilistic automata. Technical report, arXiv.org, May 2014. Available at http://arxiv.org/abs/1404.6673. |
|
|
Javier Esparza, Peter Lammich, Rene Neumann, Tobias Nipkow, Alexander Schimpf, and Jan-Georg Smaus. A fully verified executable LTL model checker. Archive of Formal Proofs, May 2014. Formal proof development. |
|
|
Rene Neumann. Promela formalization. Archive of Formal Proofs, May 2014. Formal proof development. |
|
|
M. Schlund, M. Luttenberger, and J. Esparza. Fast and Accurate Unlexicalized Parsing via Structural Annotations. In Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, volume 2: Short Papers, pages 164–168, Gothenburg, Sweden, April 2014. Association for Computational Linguistics. |
|
|
Javier Esparza, Michael Luttenberger, and Maximilian Schlund. A brief history of Strahler numbers. In LATA, pages 1–13, 2014. |
|
|
Javier Esparza and Philipp Hoffmann. Negotiation games. CoRR, abs/1405.6820, 2014. |
|
|
Javier Esparza, Michael Luttenberger, and Maximilian Schlund. FPsolve: A generic solver for fixpoint equations over semirings. In CIAA, pages 1–15, 2014. |
|
|
Javier Esparza. Keeping a crowd safe: On the complexity of parameterized verification. In STACS, pages 1–10, 2014. The paper published in the proceedings of STACS contained a mistake. This is the corrected version, which can also be found in arXiv. |
|
|
Javier Esparza and Jan Kretínský. From LTL to deterministic automata: A safraless compositional approach. Technical report, arxiv.org, 2014. |
|
|
Javier Esparza and Jan Kretínský. From LTL to deterministic automata: A safraless compositional approach. In CAV, pages 192–208, 2014. |
|
|
Javier Esparza, Ruslán Ledesma-Garza, Rupak Majumdar, Philipp Meyer, and Filip Niksic. An SMT-based approach to coverability analysis. In CAV, pages 603–619, 2014. |
|
|
Loïg Jezequel and Javier Esparza. Message-passing algorithms for the verification of distributed protocols. In VMCAI, pages 222–241, 2014. |
|
|
Javier Esparza and Jörg Desel. On negotiation as concurrency primitive ii: Deterministic cyclic negotiations. In FOSSACS, pages 258–273, 2014. |
|
|
Javier Esparza and Jörg Desel. On negotiation as concurrency primitive ii: Deterministic cyclic negotiations. Technical report, arXiv.org, 2014. |
|
|
Rémi Bonnet, Stefan Kiefer, and Anthony W. Lin. Analysis of probabilistic basic parallel processes. In Anca Muscholl, editor, Proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), volume 8412 of LNCS, pages 43–57, Grenoble, France, 2014. Springer. |
|
|
Rémi Bonnet, Stefan Kiefer, and Anthony W. Lin. Analysis of probabilistic basic parallel processes. Technical report, arXiv.org, January 2014. Available at http://arxiv.org/abs/1401.4130. |
|
|
Stefan Kiefer and Björn Wachter. Stability and complexity of minimising probabilistic automata. In J. Esparza et al., editor, Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP), part II, volume 8573 of LNCS, pages 268–279, Copenhagen, Denmark, 2014. Springer. |
|
|
Tomáš Brázdil, Stefan Kiefer, Antonín Kučera, Petr Novotný, and Joost-Pieter Katoen. Zero-reachability in probabilistic multi-counter automata. In Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 22:1–22:10, Vienna, Austria, 2014. |
|
|
Tomáš Brázdil, Stefan Kiefer, Antonín Kučera, Petr Novotný, and Joost-Pieter Katoen. Zero-reachability in probabilistic multi-counter automata. Technical report, arXiv.org, 2014. Available at http://arxiv.org/abs/1401.6840. |
|
|
Taolue Chen and Stefan Kiefer. On the total variation distance of labelled Markov chains. In Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 33:1–33:10, Vienna, Austria, 2014. |
|
|
Taolue Chen and Stefan Kiefer. On the total variation distance of labelled Markov chains. Technical report, arXiv.org, 2014. Available at http://arxiv.org/abs/1405.2852. |
|
|
Javier Esparza, Michael Luttenberger, and Maximilian Schlund. Fpsolve: A generic solver for fixpoint equations over semirings. In Implementation and Application of Automata - 19th International Conference, CIAA 2014, Giessen, Germany, July 30 - August 2, 2014. Proceedings, pages 1–15, 2014. |
|
|
Michael Luttenberger and Maximilian Schlund. Regular expressions for provenance. In 6th Workshop on the Theory and Practice of Provenance, TaPP'14, Cologne, Germany, June 12-13, 2014, 2014. |
|
|
Javier Esparza, Michael Luttenberger, and Maximilian Schlund. A brief history of strahler numbers. In Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Madrid, Spain, March 10-14, 2014. Proceedings, pages 1–13, 2014. |
|
|
Maximilian Schlund, Michael Luttenberger, and Javier Esparza. Fast and accurate unlexicalized parsing via structural annotations. In Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2014, April 26-30, 2014, Gothenburg, Sweden, pages 164–168, 2014. |
|
|
Tewodros A. Beyene, Swarat Chaudhuri, Corneliu Popeea, and Andrey Rybalchenko. A constraint-based approach to solving games on infinite graphs. In POPL, pages 221–234, January 2014. |
|
|
Corneliu Popeea, Andrey Rybalchenko, and Andreas Wilhelm. Reduction for compositional verification of multi-threaded programs. In Formal Methods in Computer-Aided Design, FMCAD 2014, 2014. |
|
|
|
Contact
