TCS / Research / Publications / 2009
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Publications in 2009

44Kimmo Järvinen, Vladimir Kolesnikov, Ahmad-Reza Sadeghi, and Thomas Schneider. Embedded SFE: Offloading server and network using hardware tokens. Report 2009/591, Cryptology ePrint Archive, December 2009. Extended version of the paper appearing in FC'10.
Info
See eprint.iacr.org ...
43Kari Kähkönen. Automated test generation for software components. Technical Report TKK-ICS-R26, Helsinki University of Technology, Department of Information and Computer Science, Espoo, Finland, December 2009.
Info
42Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Partitioning search spaces of a randomized search. Technical Report TKK-ICS-R22, Helsinki University of Technology, Department of Information and Computer Science, Espoo, Finland, November 2009.
Info
41María Naya-Plasencia, Andrea Röck, Jean-Philippe Aumasson, Yann Laigle-Chapuy, Gaëtan Leurent, Willi Meier, and Thomas Peyrin. Cryptanalysis of ESSENCE. Report 2009/302, Cryptology ePrint Archive, September 2009.
Info
See eprint.iacr.org ...
40Tomi Janhunen, Ilkka Niemelä, and Mark Sevalnev. Computing stable models via reductions to difference logic. In Esra Erdem, Fangzhen Lin, and Torsten Schaub, editors, Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning, volume 5753 of Lecture Notes in Computer Science, pages 142–154, Potsdam, Germany, September 2009. Springer-Verlag.
Info
See dx.doi.org ...
39Tomi Janhunen, Emilia Oikarinen, Hans Tompits, and Stefan Woltran. Modularity aspects of disjunctive stable models. Journal of Artificial Intelligence Research, 35:813–857, August 2009.
Info
See dx.doi.org ...
38Kim Björkman, Juho Frits, Janne Valkonen, Jussi Lahtinen, Keijo Heljanko, Ilkka Niemelä, and Jari J. Hämäläinen. Verification of safety logic designs by model checking. In Proceedings of the Sixth American Nuclear Society International Topical Meeting on Nuclear Plant Instrumentation, Control, and Human-Machine Interface Technologies NPIC&HMIT 2009, Knoxville, Tennessee, April 2009.
Info
37Jori Dubrovin. Checking bounded reachability in asynchronous systems by symbolic event tracing. Technical Report TKK-ICS-R14, Helsinki University of Technology, Department of Information and Computer Science, Espoo, Finland, April 2009.
PDF (432 kB)
Info
36Kim Björkman, Juho Frits, Janne Valkonen, Jussi Lahtinen, Keijo Heljanko, Ilkka Niemelä, and Jari J. Hämäläinen. Verification of safety logic designs by model checking. In Proceedings of the Sixth American Nuclear Society International Topical Meeting on Nuclear Plant Instrumentation, Control, and Human-Machine Interface Technologies NPIC&HMIT 2009, Knoxville, Tennessee, April 2009.
Info
35Rolf Drechsler, Tommi Junttila, and Ilkka Niemelä. Non-clausal SAT and ATPG. In Armin Biere, Marijn J. H. Heule, Hans van Maaren, and Toby Walsh, editors, Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications, chapter 21, pages 655–693. IOS Press, February 2009.
Info
34Rolf Drechsler, Tommi Junttila, and Ilkka Niemelä. Non-clausal SAT and ATPG. In Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh, editors, Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications, chapter 21, pages 655–693. IOS Press, February 2009.
Info
See www.iospress.nl ...
33Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Incorporating clause learning in grid-based randomized SAT solving. Journal on Satisfiability, Boolean Modeling and Computation, 6:223–244, 2009.
Info
32Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Partitioning search spaces of a randomized search. In AI*IA 2009, volume 5883 of Lecture Notes in Artificial Intelligence, pages 243–252. Springer, 2009.
Info
31Andrea Röck and Cédric Lauradoux. Parallel generation of l-sequences (extended abstract). In Helena Handschuh, Stefan Lucks, Bart Preneel, and Phillip Rogaway, editors, Symmetric Cryptography, number 09031 in Dagstuhl Seminar Proceedings, Dagstuhl, Germany, 2009. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany.
PDF (260 kB)
Info
See drops.dagstuhl.de ...
30Billy Bob Brumley and Kaisa Nyberg. On modular decomposition of integers. In Progress in Cryptology—AFRICACRYPT 2009, volume 5580 of Lecture Notes in Computer Science, pages 386–402. Springer-Verlag, 2009.
Info
See dx.doi.org ...
29Billy Bob Brumley and Risto M. Hakala. Cache-timing template attacks. In Advances in Cryptology—ASIACRYPT 2009, volume 5912 of Lecture Notes in Computer Science, pages 667–684. Springer-Verlag, 2009.
Info
See dx.doi.org ...
28Tommi Syrjänen. Logic Programs and Cardinality Constraints: Theory and Practice. Doctoral dissertation, TKK Dissertations in Information and Computer Science TKK-ICS-D12, Helsinki University of Technology, Faculty of Information and Natural Sciences, Department of Information and Computer Science, Espoo, Finland, 2009.
Info
See lib.tkk.fi ...
27Antti E.J. Hyvärinen. Approaches to Grid-Based SAT Solving. Licentiate's thesis, Helsinki University of Technology, Department of Information and Computer Science, 2009.
Info
26Emilia Oikarinen and Tomi Janhunen. A translation-based approach to the verification of modular equivalence. Journal of Logic and Computation, 19(4):591–613, 2009.
Info
25Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, and Ilkka Niemelä. A module-based framework for multi-language constraint modeling. In Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2009), 2009.
Info
24Emilia Oikarinen and Matti Järvisalo. Max-ASP: Maximum satisfiability of answer set programs. In Esra Erdem, Fangzhen Lin, and Torsten Schaub, editors, Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2009), volume 5753 of Lecture Notes in Artificial Intelligence, pages 236–249. Springer, 2009.
Info
See dx.doi.org ...
23Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, and Ilkka Niemelä. A module-based framework for multi-language constraint modeling. In Esra Erdem, Fangzhen Lin, and Torsten Schaub, editors, Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2009), volume 5753 of Lecture Notes in Artificial Intelligence, pages 155–169. Springer, 2009.
Info
See dx.doi.org ...
22Harri Haanpää, André Schumacher, and Pekka Orponen. Distributed algorithms for lifetime maximization in sensor networks via min-max spanning subgraphs. Wireless Networks, 2009. To appear.
Info
21Kim Björkmann, Juho Frits, Janne Valkonen, Keijo Heljanko, and Ilkka Niemelä. Model-based analysis of a stepwise shutdown logic. VTT Working Papers 115, VTT Technical Research Centre of Finland, Espoo, 2009.
Info
See www.vtt.fi ...
20Janne Valkonen, Matti Koskimies, Kim Björkman, Keijo Heljanko, Ilkka Niemelä, and Jari J. Hämäläinen. Formal verification of safety automation logic designs. In Automaatio XVIII 2009 Seminaari, 2009.
Info
See www.automaatioseura.fi ...
19Ilkka Niemelä. Integrating answer set programming and satisfiability modulo theories. In Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009, volume 5753 of Lecture Notes in Computer Science, page 3, 2009.
Info
18Jani Suomalainen, Jukka Valkonen, and N. Asokan. Standards for security associations in personal networks: a comparative analysis. International Journal of Security and Networks (IJSN), 4(1/2):87–100, 2009.
PDF (680 kB)
Info
See dx.doi.org ...
17Alessandro Cimatti, Jori Dubrovin, Tommi Junttila, and Marco Roveri. Structure-aware computation of predicate abstraction. In Armin Biere and Carl Pixley, editors, Proceedings of the 9th International Conference on Formal Methods in Computer Aided Design (FMCAD'09), pages 9–16. IEEE, 2009.
Info
See ieeexplore.ieee.org ...
16Kim Björkman, Juho Frits, Janne Valkonen, Keijo Heljanko, and Ilkka Niemelä. Model-based analysis of a stepwise shutdown logic. VTT Working Papers 115, VTT Technical Research Centre of Finland, Espoo, 2009.
Info
See www.vtt.fi ...
15Kimmo U. Järvinen. On repeated squarings in binary fields. In Proceedings of the 16th International Workshop on Selected Areas in Cryptography, SAC 2009, volume 5867 of Lecture Notes in Computer Science, pages 331–349. Springer-Verlag, 2009.
Info
See dx.doi.org ...
14Kaisa Nyberg. Methods for Symmetric Key Cryptography and Cryptanalysis. In EWM PhD Summer School, Turku, Finland, June 2009, 2009.
PDF (243 kB)
Info
13René Mayrhofer, Kaisa Nyberg, and Tim Kindberg. Secure Spontaneous Interaction, Special issue, International Journal of Security and Networks Volume 4 Nos. 1/2. Inderscience, 2009.
Info
12N. Asokan and Kaisa Nyberg. Security associations for wireless devices. In Stefanos Gritzalis, Tom Karygiannis, and Charalabos Skianis, editors, Security and Privacy in Mobile and Wireless Networking. Troubador Publishing Ltd, Leicester, UK, 2009.
Info
11Kari Kähkönen, Jani Lampinen, Keijo Heljanko, and Ilkka Niemelä. The LIME interface specification language and runtime monitoring tool. In Saddek Bensalem and Doron Peled, editors, RV, volume 5779 of Lecture Notes in Computer Science, pages 93–100, 2009.
Info
10Miia Hermelin, Joo Yeon Cho, and Kaisa Nyberg. Statistical Tests for Key Recovery Using Multidimensional Extension of Matsui's Algorithm 1. In Helena Handschuh, Stefan Lucks, Bart Preneel, and Phillip Rogaway, editors, Symmetric Cryptography, number 09031 in Dagstuhl Seminar Proceedings, Dagstuhl, Germany, 2009. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany.
PostScript (383 kB)
GZipped PostScript (163 kB)
PDF (180 kB)
Info
See drops.dagstuhl.de ...
9Miia Hermelin, Joo Yeon Cho, and Kaisa Nyberg. Multidimensional Extension of Matsui's Algorithm 2. In Orr Dunkelman, editor, Fast Software Encryption 2009, volume 5665 of Lecture Notes in Computer Science, pages 209–227. Springer, 2009.
Info
8Miia Hermelin, Joo Yeon Cho, and Kaisa Nyberg. Statistical Tests for Key Recovery Using Multidimensional Extension of Matsui's Algorithm 1. EUROCRYPT'09 POSTERSESSION, 2009.
PostScript (383 kB)
GZipped PostScript (163 kB)
PDF (180 kB)
Info
7Matti Järvisalo. Structure-based satisfiability checking: Analyzing and harnessing the potential. AI Communications, 22(2):117–119, 2009. Thesis summary.
Info
See www.tcs.tkk.fi ...
6Matti Järvisalo and Tommi Junttila. Limitations of restricted branching in clause learning. Constraints, 14(3):325–356, 2009.
Info
See www.tcs.tkk.fi ...
5Risto Hakala and Kaisa Nyberg. A multidimensional linear distinguishing attack on the Shannon cipher. International Journal of Applied Cryptography, 1(3):161–168, 2009.
Info
See dx.doi.org ...
4André Schumacher and Harri Haanpää. Distributed sleep scheduling in wireless sensor networks via fractional domatic partitioning. In R. Guerraoui and F. Petit, editors, Stabilization, Safety, and Security of Distributed Systems, volume 5873/2009 of Lecture Notes in Computer Science, pages 640–654. Springer-Verlag Berlin / Heidelberg, 2009.
Info
3Sven Laur and Sylvain Pasini. User-aided data authentication. International Journal of Security and Networks, 4(1/2):69–86, 2009.
Info
2Siert Wieringa, Matti Niemenmaa, and Keijo Heljanko. Tarmo: A framework for parallelized bounded model checking. In Lubos Brim and Jaco van der Pol, editors, Proceedings of the 8th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC'09), volume 14 of Electronic Proceedings in Theoretical Computer Science (EPTCS), pages 62–76, 2009.
Info
1Tomi Janhunen. lp2diff 1.23 — Translating logic programs into difference logic. http://www.tcs.hut.fi/Software/lp2diff/, 2009. Computer Program.
Info
See www.tcs.hut.fi ...

[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 19 January 2010.