Tampere University of Technology

TUTCRIS Research Portal

Publications

  1. Published

    The Asymptotic Behaviour of the Proportion of Hard Instances of the Halting Problem

    Valmari, A., 2013, SPLST '13, 13th Symposium on Programming Languages and Software Tools, August 26-27, 2013, Szeged, Hungary. Kiss, A. (ed.). Szeged, Hungary: University of Szeged, p. 170-184 15 p. (Symposium on Programming Languages and Software Tools).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  2. Published

    Ovatko kaikki lottorivit satunnaisia?

    Valmari, A., 2012, In : Liaani. 5, p. 6-7

    Research output: Contribution to journalArticleGeneral public

  3. Published

    A Simple Character String Proof of the "True but Unprovable'' Version of Gödel's First Incompleteness Theorem

    Valmari, A., 2014, In : Electronic Proceedings in Theoretical Computer Science. 151, p. 355-369 15 p., 25.

    Research output: Contribution to journalArticleScientificpeer-review

  4. Published

    Can Stubborn Sets be Optimal?

    Valmari, A. & Hansen, H., 2011, In : Fundamenta Informaticae. 113, 3-4, p. 377-397

    Research output: Contribution to journalArticleScientificpeer-review

  5. Published

    External Behaviour of Systems of State Machines with Variables

    Valmari, A., 2013, The 5th Advanced Course on Petri Nets, September 2010, Rostock, Germany, Transactions on Petri Nets and Other Models of Concurrency VII.. Jensen, K., van der Aalst, W. M. P., Balbo, G., Koutny, M. & Wolf, K. (eds.). Berlin, Heidelberg: Springer, p. 255-299 45 p. (Lecture Notes in Computer Science; vol. 7480).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  6. Published

    Stop It, and Be Stubborn!

    Valmari, A., 21 Jun 2015, Application of Concurrency to System Design (ACSD): 2015 15th International Conference on . Haar, S. & Meyer, R. (eds.). IEEE Computer Society, p. 10-19 10 p. 2

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  7. Published

    A State Space Tool for Concurrent System Models Expressed In C++

    Valmari, A., 14 Dec 2015, SPLST 2015 Symposium on Programming Languages and Software Tools: Proceedings of the 14th Symposium on Programming Languages and Software Tools (SPLST'15) Tampere, Finland, Oct 9-10, 2015. Nummenmaa, J., Sievi-Korte, O. & Mäkinen, E. (eds.). CEUR-WS.org, Vol. 1525. p. 91-105 15 p. 7. (CEUR Workshop Proceedings; vol. 1525).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  8. Published

    Fair testing and stubborn sets

    Valmari, A. & Vogler, W., 2016, Model Checking Software: 23rd International Symposium, SPIN 2016, Co-located with ETAPS 2016, Eindhoven, The Netherlands, April 7-8, 2016, Proceedings. Springer Verlag, p. 225-243 19 p. (Lecture Notes in Computer Science; vol. 9641).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  9. Published

    Stubborn Set Intuition Explained

    Valmari, A. & Hansen, H., 2016, Petri Nets and Software Engineering 2016: Proceedings of the International Workshop on Petri Nets and Software Engineering 2016, including the International Workshop on Biological Processes & Petri Nets 2016. Cabac, L., Kristensen, L. M. & Rölke, H. (eds.). CEUR-WS, p. 213-232 20 p. (CEUR Workshop Proceedings; vol. 1591).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  10. Published

    MathCheck: a tool for checking math solutions in detail

    Valmari, A. & Kaarakka, T., Sep 2016, SEFI 2016 Annual Conference Proceedings: Engineering Education on Top of the World: Industry University Cooperation. European Society for Engineering Education SEFI

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Download list To download, please limit the number of search results to 1,000 or less.