2012 |
8 | Keijo Heljanko, Misa Keinänen, Martin Lange, and Ilkka Niemelä. Solving parity games by a reduction to SAT. Journal of Computer and System Sciences, 78(2):430–440, 2012. |
|
7 | Roland Kindermann, Tommi Junttila, and Ilkka Niemelä. Beyond lassos: Complete SMT-based bounded model checking for timed automata. In Holger Giese and Grigore Rosu, editors, Formal Techniques for Distributed Systems, volume 7273 of Lecture Notes in Computer Science, pages 84–100. Springer, 2012. |
|
6 | Roland Kindermann, Tommi Junttila, and Ilkka Niemelä. SMT-based induction methods for timed systems. In Marcin Jurdzinski and Dejan Nickovic, editors, Formal Modeling and Analysis of Timed Systems, volume 7595 of Lecture Notes in Computer Science, pages 171–187. Springer, 2012. |
|
2011 |
5 | Tuomas Launiainen, Keijo Heljanko, and Tommi Junttila. Efficient model checking of PSL safety properties. IET Computers & Digital Techniques, 5(6):479–492, November 2011. |
|
4 | Roland Kindermann, Tommi Junttila, and Ilkka Niemelä. Modeling for Symbolic Analysis of Safety Instrumented Systems with Clocks. In Proceedings of the 11th International Conference on Application of Concurrency to System Designg, ACSD 2011, pages 185–194. IEEE Computer Society, June 2011. |
|
3 | Kari Kähkönen, Tuomas Launiainen, Olli Saarikivi, Janne Kauttio, Keijo Heljanko, and Ilkka Niemelä. LCT: An open source concolic testing tool for Java programs. In Proceedings of the 6th Workshop on Bytecode Semantics, Verification, Analysis and Transformation (BYTECODE'2011), pages 75–80, Saarbrücken, Germany, Mar 2011. |
|
2010 |
2 | Jori Dubrovin. Checking bounded reachability in asynchronous systems by symbolic event tracing. In Gilles Barthe and Manuel Hermenegildo, editors, Proceedings of the 11th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2010), volume 5944 of Lecture Notes in Computer Science, pages 146–162. Springer, 2010. |
|
1 | Kari Kähkönen, Roland Kindermann, Keijo Heljanko, and Ilkka Niemelä. Experimental comparison of concolic and random testing for Java Card applets. In SPIN, volume 6349 of Lecture Notes in Computer Science, pages 22–39, 2010. |
|