|
|
|
Javier Esparza and Andreas Gaiser. Probabilistic abstractions with arbitrary domains. Technical report, Technische Universität München, Institut für Informatik, December 2010. |
|
|
Javier Esparza and Andreas Gaiser. Probabilistic abstractions with arbitrary domains. Technical report, Technische Universität München, Institut für Informatik, December 2010. |
|
|
Stefan Kiefer and Dominik Wojtczak. On probabilistic parallel programs with process creation and synchronisation. Technical report, arXiv.org, December 2010. Available at http://arxiv.org/abs/1012.2998. |
|
|
Javier Esparza, Stefan Kiefer, and Michael Luttenberger. Newtonian program analysis. Journal of the ACM, 57(6):33:1–33:47, October 2010. |
|
|
Wolfgang Haberl, Markus Herrmannsdoerfer, Stefan Kugele, Michael Tautschnig, and Martin Wechs. Seamless model-driven development put into practice. In Tiziana Margaria and Bernhard Steffen, editors, Leveraging Applications of Formal Methods, Verification, and Validation, volume 6415 of Lecture Notes in Computer Science, pages 18–32. Springer, October 2010. |
|
|
Andreas Holzer, Visar Januzaj, Stefan Kugele, and Michael Tautschnig. Timely time estimates. In Tiziana Margaria and Bernhard Steffen, editors, Leveraging Applications of Formal Methods, Verification, and Validation, volume 6415 of Lecture Notes in Computer Science, pages 33–46. Springer, October 2010. |
|
|
Rene Neumann. Functional binomial queues. Archive of Formal Proofs, October 2010. Formal proof development. |
|
|
Javier Esparza, Stefan Kiefer, and Michael Luttenberger. Newtonian program analysis. Technical report, Technische Universität München, Institut für Informatik, September 2010. This is a late draft of the article in the Journal of the ACM. |
|
|
Ashutosh Gupta, Corneliu Popeea, and Andrey Rybalchenko. Non-monotonic refinement of control abstraction for concurrent programs. In ATVA, pages 188–202, September 2010. |
|
|
Wolfgang Haberl, Stefan Kugele, and Uwe Baumgarten. Model-Based Generation of Fault-Tolerant Embedded Systems. In Hamid R. Arabnia and Ashu M. G. Solo, editors, Proceedings of the 2010 International Conference on Embedded Systems and Applications, ESA 2010, pages 136–142, Las Vegas, Nevada, USA, July 2010. CSREA Press. |
|
|
Tomáš Brázdil, Javier Esparza, Stefan Kiefer, and Michael Luttenberger. Space-efficient scheduling of stochastically generated tasks. Technical report, arXiv.org, April 2010. Available at http://arxiv.org/abs/1004.4286. |
|
|
Corneliu Popeea and Wei-Ngan Chin. Dual analysis for proving safety and finding bugs. In SAC, pages 2137–2143, March 2010. |
|
|
B König and J. Esparza. Verification of graph transformation systems with context-free specifications. In Proc. of the 5th International Conference on Graph Transformations, 2010. |
|
|
J. Esparza, M. Leucker, and M. Schlund. Learning workflow Petri nets. In Proc. of the 31st International Conference on Applications and Theory of Petri Nets, 2010. |
|
|
J. Esparza. A false history of true concurrency: from Petri to tools. In Proc. of the 17th International SPIN Workshop, 2010. |
|
|
Javier Esparza, Andreas Gaiser, and Stefan Kiefer. Computing least fixed points of probabilistic systems of polynomials. In Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS), Nancy, France, 2010. |
|
|
Javier Esparza, Andreas Gaiser, and Stefan Kiefer. Computing least fixed points of probabilistic systems of polynomials. In Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS), Nancy, France, 2010. |
|
|
Christian Kern. Automatic error correction of java programs. In AlgoSyn, page 155, 2010. |
|
|
Christian Kern and Javier Esparza. Automatic error correction of java programs. In FMICS, pages 67–81, 2010. |
|
|
Javier Esparza, Stefan Kiefer, and Michael Luttenberger. Computing the least fixed point of positive polynomial systems. Technical report, arXiv.org, January 2010. Available at http://arxiv.org/abs/1001.0340. |
|
|
Javier Esparza, Stefan Kiefer, and Michael Luttenberger. Computing the least fixed point of positive polynomial systems. SIAM Journal on Computing, 39(6):2282–2335, 2010. |
|
|
Tomáš Brázdil, Javier Esparza, Stefan Kiefer, and Michael Luttenberger. Space-efficient scheduling of stochastically generated tasks. In Samson Abramsky et al., editor, Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP), part II, volume 6199 of LNCS, ARCoSS, pages 539–550, Bordeaux, France, 2010. Springer. |
|
|
Jan Kretinsky. Modal transition systems. Master's thesis, Masaryk University, Brno, Dept. of Mathematics, 2010. |
|
|
Tomas Brazdil, Jan Krcal, Jan Kretinsky, Antonin Kucera, and Vojtech Rehak. Stochastic real-time games with qualitative timed automata objectives. In CONCUR, pages 207–221, 2010. |
|
|
Tomas Brazdil, Jan Krcal, Jan Kretinsky, Antonin Kucera, and Vojtech Rehak. Stochastic real-time games with qualitative timed automata objectives. Technical report FIMU-RS-2010-05, Faculty of Informatics, Masaryk University, Brno, 2010. |
|
|
Nikola Benes and Jan Kretinsky. Process algebra for modal transition systemses. In MEMICS, pages 9–18, 2010. |
|
|
Nikola Benes and Jan Kretinsky. Process algebra for modal transition systemses. Technical report FIMU-RS-2010-11, Faculty of Informatics, Masaryk University, Brno, 2010. |
|
|
Nikola Benes, Ivana Cerna, and Jan Kretinsky. Disjunctive modal transition systems and generalized LTL model checking. Technical report FIMU-RS-2010-12, Faculty of Informatics, Masaryk University, Brno, 2010. |
|
|
Michael Luttenberger. Solving systems of polynomial equations: A generalization of newton's method. PhD thesis, Technische Universität München, 2010. |
|
|
Chih-Hong Cheng, Christian Buckl, Michael Luttenberger, and Alois Knoll. Gavs: Game arena visualization and synthesis. In ATVA, pages 347–352, 2010. |
|
|
Javier Esparza, Pierre Ganty, Stefan Kiefer, and Michael Luttenberger. Parikh's theorem: A simple and direct construction. CoRR, abs/1006.3825, 2010. |
|
|
Andrey Rybalchenko. Constraint solving for program verification: Theory and practice by example. In Touili et al., pages 57–71. |
|
|
Boris Köpf and Andrey Rybalchenko. Approximation and randomization for quantitative information-flow analysis. In CSF, pages 3–14. |
|
|
Andrey Rybalchenko. Constraint solving for program verification: Theory and practice by example. In Dawar and Veith, page 51. |
|
|
Thomas A. Henzinger, Thibaud Hottelier, Laura Kovács, and Andrey Rybalchenko. Aligators for arrays (tool paper). In Fermüller and Voronkov, pages 348–356. |
|
|
Alexander Malkis, Andreas Podelski, and Andrey Rybalchenko. Thread-modular counterexample-guided abstraction refinement. In Cousot and Martel, pages 356–372. |
|
|
Andrey Rybalchenko and Viorica Sofronie-Stokkermans. Constraint solving for interpolation. J. Symb. Comput., 45(11):1212–1233, 2010. |
|
|
Nuno P. Lopes, Juan Antonio Navarro Pérez, Andrey Rybalchenko, and Atul Singh. Applying prolog to develop distributed systems. TPLP, 10(4-6):691–707, 2010. |
|
|
|
Contact
