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

Publications in 2007

62Henrik Petander. A network mobility management architecture for a heterogeneous network environment. Research Report A108, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2007. Doctoral dissertation. ISBN 978-951-22-9098-7.
PDF (707 kB)
Info
See lib.tkk.fi ...
61Maarit Hietalahti, Mikko Särelä, Antti Tuominen, and Pekka Orponen. Security topics and mobility management in hierarchical ad hoc networks (Samoyed): Final report. Technical Report B22, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2007.
Info
60Jori Dubrovin and Tommi Junttila. Symbolic model checking of hierarchical UML state machines. Technical Report B23, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2007.
PostScript (879 kB)
GZipped PostScript (449 kB)
PDF (223 kB)
Info
59Jori Dubrovin, Tommi Junttila, and Keijo Heljanko. Symbolic step encodings for object based communicating state machines. Technical Report B24, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2007.
PostScript (984 kB)
GZipped PostScript (462 kB)
PDF (265 kB)
Info
58Vesa Ojala. A slicer for UML state machines. Technical Report B25, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2007.
PostScript (830 kB)
GZipped PostScript (265 kB)
PDF (307 kB)
Info
57Mikko Alava, John Ardelius, Erik Aurell, Petteri Kaski, Supriya Krishnamurthy, Pekka Orponen, and Sakari Seitz. Circumspect descent prevails in solving random constraint satisfaction problems. Technical Report 0711.4902, arXiv.org, November 2007.
Info
See arxiv.org ...
56Tomi Janhunen and Emilia Oikarinen. Automated verification of weak equivalence within the smodels system. Theory and Practice of Logic Programming, 7(6):697–744, November 2007.
Info
See dx.doi.org ...
55Dmitrij Lagutin and Hannu H. Kari. Controlling incoming connections using certificates and distributed hash tables. In Proceedins of The 7th International Conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking (NEW2AN 2007), volume 4712 of Lecture Notes in Computer Science, pages 455–467, St. Petersburg, Russia, Sep 2007. Springer-Verlag.
Info
See www.springerlink.com ...
54Emilia Oikarinen and Tomi Janhunen. A linear transformation from prioritized circumscription to disjunctive logic programming. In Verónica Dahl and Ilkka Niemelä, editors, Proceedings of the 23rd International Conference on Logic Programming (ICLP 2007), volume 4670 of Lecture Notes in Computer Science, pages 440–441, Porto, Portugal, September 2007. Springer. Poster.
Info
See www.springerlink.com ...
53Emilia Oikarinen. Modular answer set programming. In Verónica Dahl and Ilkka Niemelä, editors, Proceedings of the 23rd International Conference on Logic Programming (ICLP 2007), volume 4670 of Lecture Notes in Computer Science, pages 462–463, Porto, Portugal, September 2007. Springer. Doctoral Consortium research summary.
Info
See www.springerlink.com ...
52Emilia Oikarinen and Tomi Janhunen. A translation-based approach to the verification of modular equivalence. In Stefania Costantini and Richard Watson, editors, Proceedings of the 4th Workshop on Answer Set Programming; Advances in Theory and Implementation (ASP 2007), pages 255–269, Porto, Portugal, September 2007.
Info
See www.tcs.hut.fi ...
51Matti Järvisalo. Impact of restricted branching on clause learning SAT solving. Research Report A107, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, August 2007. ISBN 978-951-22-8907-3.
NOTE: Reprint of Licentiate's thesis; see URL below.
PostScript (2 MB)
GZipped PostScript (527 kB)
PDF (726 kB)
Info
See www.tcs.hut.fi ...
50Emilia Oikarinen. Modularity in smodels programs. In Chitta Baral, Gerhard Brewka, and John Schlipf, editors, Logic Programming and Nonmonotonic Reasoning, 9th International Conference on Logic Programming and Nonmonotonic Reasoning LPNMR 2007, Tempe, AZ, USA, May 2007, Proceedings, volume 4483 of Lecture Notes in Artificial Intelligence, pages 321–326, Tempe, Arizona, USA, May 2007. Springer-Verlag. Poster.
Info
See www.springerlink.com ...
49Emilia Oikarinen. Modular answer set programming. In Veli Mäkinen, Greger Lindén, and Hannu Toivonen, editors, Summer School on Algorithmic Data Analysis (SADA 2007) and Annual Hecse Poster Session. Poster Abstracts, Series of Publications B, Report B-2007-4, page 62. Helsinki University Printing House, May 2007.
Info
48Tomi Janhunen, Emilia Oikarinen, Hans Tompits, and Stefan Woltran. Modularity aspects of disjunctive stable models. In Chitta Baral, Gerhard Brewka, and John Schlipf, editors, Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 175–187, Tempe, Arizona, USA, May 2007. Springer-Verlag.
Info
See dx.doi.org ...
47Tomi Janhunen. Intermediate languages of ASP systems and tools. In Marina De Vos and Torsten Schaub, editors, Proceedings of the 1st International Workshop on Software Engineering for Answer Set Programming, number CSBU-2007-05 in Deparment of Computer Science, University of Bath, Technical Report Series, pages 12–25, Tempe, Arizona, USA, May 2007.
Info
See ftp.informatik.rwth-aachen.de ...
46Emilia Oikarinen. circ2dlp 2.1 — a linear translation from prioritized circumscription to disjunctive logic programming, April 2007. Computer Program.
Info
See www.tcs.hut.fi ...
45Billy Bob Brumley and Kaisa Nyberg. Differential properties of elliptic curves and blind signatures. In Information Security, 10th International Conference—ISC '07, volume 4779 of Lecture Notes in Computer Science, pages 376–389. Springer-Verlag, 2007.
Info
See dx.doi.org ...
44Billy Bob Brumley and Kimmo Järvinen. Koblitz curves and integer equivalents of Frobenius expansions. In Selected Areas in Cryptography, 14th International Workshop—SAC '07, volume 4876 of Lecture Notes in Computer Science, pages 126–137. Springer-Verlag, 2007.
Info
See dx.doi.org ...
43Harri Haanpää, editor. Annual report for the year 2006. Technical report, Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, 2007.
PostScript (827 kB)
GZipped PostScript (269 kB)
PDF (256 kB)
Info
42Matti Järvisalo. Impact of Restricted Branching on Clause Learning SAT Solving. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2007.
Info
See www.tcs.hut.fi ...
41Maarit Hietalahti. Requirements for a security architecture for clustered ad-hoc networks. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2007.
Info
40Sami Kauppinen. Trust evaluation in component-based software architecture. Master's thesis, Helsinki University of Technology, Department of Computer Scienceand Engineering, Laboratory for Theoretical Computer Science, 2007.
Info
39Risto Hakala. Linear cryptanalysis of two stream ciphers. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2007.
Info
38Samuli Larvala. Differential compression for efficient software updating. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2007.
Info
37Antti J. Tuominen. Managing global connectivity with IPv6 in heterogeneous mobility scenarios. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2007.
Info
36Janne Lundberg. A proof of concept PLA implementation, 2007. Computer program.
Info
See www.tcs.hut.fi ...
35Sven Laur and Helger Lipmaa. A new protocol for conditional disclosure of secrets and its applications. In Jonathan Katz and Moti Yung, editors, Applied Cryptography and Network Security, 5th International Conference, ACNS 2007, Zhuhai, China, June 5-8, 2007, Proceedings, volume 4521 of Lecture Notes in Computer Science, pages 207–225. Springer, 2007.
Info
34Ahto Buldas and Sven Laur. Knowledge-binding commitments with applications in time-stamping. In Tatsuaki Okamoto and Xiaoyun Wang, editors, Public Key Cryptography - PKC 2007, 10th International Conference on Practice and Theory in Public-Key Cryptography, Beijing, China, April 16-20, 2007, Proceedings, volume 4450 of Lecture Notes in Computer Science, pages 150–165. Springer, 2007.
Info
33Maarit Hietalahti. A clustering-based group key agreement protocol for ad-hoc networks. In 3rd Workshop on Cryptography for Ad hoc Networks (WCAN 2007), July 8th, 2007, Wroclaw, Poland, 2007.
Info
32Philippe Dumas, Helger Lipmaa, and Johan Wallén. Asymptotic behaviour of a non-commutative rational series with a nonnegative linear representation. Discrete Mathematics and Theoretical Computer Science, 9(1):247–274, 2007.
Info
31Jukka Honkola, Sari Leppänen, Pasi Rinne-Rahkola, Martti Söderlund, Markku Turunen, and Kimmo Varpaaniemi. Applying Lyra in modeling S60 camera functionality. In John Leaney, Jerzy W. Rozenblit, and Jianfeng Peng, editors, Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems, ECBS 2007, Raising Expectations of Computer-Based Systems, pages 25–36. IEEE Computer Society Press, 2007.
Info
See doi.ieeecomputersociety.org ...
30Harri Haanpää and Patric R. J. Östergård. Sets in Abelian groups with distinct sums of pairs. Journal of Number Theory, 123:144–153, 2007.
PDF (140 kB)
Info
29Harri Haanpää, André Schumacher, Thorn Thaler, and Pekka Orponen. Distributed computation of maximum lifetime spanning subgraphs in sensor networks. In Hongke Zhang, Stephan Olariu, Jiannong Cao, and David B. Johnson, editors, Proceedings of The 3rd International Conference on Mobile Ad-hoc and Sensor Networks (MSN 2007), volume 4864 of Lecture Notes in Computer Science, pages 445–456, Berlin / Heidelberg, 2007. Springer.
PDF (518 kB)
Info
28Verónica Dahl and Ilkka Niemelä, editors. Logic Programming, 23rd International Conference, ICLP 2007, Porto, Portugal, September 8-13, 2007, Proceedings, volume 4670 of Lecture Notes in Computer Science. Springer, 2007.
Info
27Jani Suomalainen, Jukka Valkonen, and N. Asokan. Security Associations in Personal Networks: A Comparative Analysis. In Frank Stajano, Catherine Meadows, Srdjan Capkun, and Tyler Moore, editors, Security and Privacy in Ad-hoc and Sensor Networks 4th European Workshop, ESAS 2007, Cambridge, UK, July 2-3, 2007, number 4572 in Lecture Notes in Computer Science, pages 43–57, 2007.
PDF (577 kB)
Info
See dx.doi.org ...
26Kaisa Nyberg and Jukka Valkonen. Wireless Group Security Using MAC Layer Multicast. In World of Wireless, Mobile and Multimedia Networks, 2007. WoWMoM 2007. IEEE International Symposium on a, pages 1–8, 2007.
Info
See dx.doi.org ...
25Jukka Valkonen, Aleksi Toivonen, and Kristiina Karvonen. Usability Testing for Secure Device Pairing in Home Networks. In Anne Bajart, Henrik Muller, and Thomas Strang, editors, UbiComp 2007 Workshop Proceedings, September 2007, Innsbruck, Austria, 2007.
Info
24Jori Dubrovin. SMUML/Suboco 1.10 — an SMT-based UML bounded model checker, 2007. Computer program.
Info
See www.tcs.hut.fi ...
23Jori Dubrovin. SMUML/Uboco 1.10 — a translator from UML models to NuSMV programs, 2007. Computer program.
Info
See www.tcs.hut.fi ...
22Kaisa Nyberg and Risto Hakala. A key-recovery attack on SOBER-128. In Eli Biham, Helena Handschuh, Stefan Lucks, and Vincent Rijmen, editors, Symmetric Cryptography, number 07021 in Dagstuhl Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2007.
Info
See drops.dagstuhl.de ...
21Kaisa Nyberg and Miia Hermelin. Multidimensional Walsh transform and a characterization of bent functions. In Tor Helleseth, P. Vijay Kumar, and Oyvind Ytrehus, editors, Proceedings of the 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks, pages 83–86. IEEE, 2007.
PDF (86 kB)
Info
20Matti Järvisalo. Restricted branching in clause learning DPLL. In Brahim Hnich and Kostas Stergiou, editors, Proceedings of the CP 2007 Doctoral Program, pages 55–60, 2007.
Info
See willow.engr.uconn.edu ...
19Matti Järvisalo and Tommi Junttila. Limitations of restricted branching in clause learning. In Christian Bessiere, editor, Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP 2007), volume 4741 of Lecture Notes in Computer Science, pages 348–363. Springer, 2007.
Info
See www.tcs.hut.fi ...
18Matti Järvisalo. Equivalence checking hardware multiplier designs, 2007. SAT Competition 2007 benchmark description. Available at http://www.satcompetition.org/2007/contestants.html.
PostScript (262 kB)
GZipped PostScript (101 kB)
PDF (123 kB)
Info
See www.tcs.hut.fi ...
17Matti Järvisalo. The effect of structural branching on the efficiency of clause learning SAT solving. In 14th RCRA Workshop: Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2007. See http://pst.istc.cnr.it/RCRA07/program.html.
PostScript (2 MB)
GZipped PostScript (326 kB)
PDF (354 kB)
Info
16Matti Järvisalo. Industrial-strength SAT solving and restricted branching. In Veli Mäkinen, Greger Lindén, and Hannu Toivonen, editors, Summer School on Algorithmic Data Analysis (SADA 2007) and Annual Hecse Poster Session. Abstract proceedings, Series of Publications B, Report B-2007-4, page 39. Helsinki University Printing House, 2007.
Info
15Matti Järvisalo and Emilia Oikarinen. Extended ASP tableaux and rule redundancy in normal logic programs. In Verónica Dahl and Ilkka Niemelä, editors, Proceedings of the 23rd International Conference on Logic Programming (ICLP 2007), volume 4670 of Lecture Notes in Computer Science, pages 134–148. Springer, 2007.
Info
See www.tcs.hut.fi ...
14Pekka Orponen. "P = NP" -ongelma ja laskennan vaativuusteoria. Tietojenkäsittelytiede, 26:54–67, 2007.
Info
See www.tcs.hut.fi ...
13Satu Elisa Schaeffer. Graph clustering. Computer Science Review, 1(1):27–64, 2007.
Info
12Ahto Buldas and Sven Laur. Knowledge-binding commitments with applications in time-stamping. In Public Key Cryptography - PKC 2007, 10th International Conferenc on Practice and Theory in Public-Key Cryptography, Beijing, China, April 16-20, 2007, volume 4450 of Lecture Notes in Computer Science, pages 150–165. Springer, 2007.
Info
11Sven Laur and Helger Lipmaa. A new protocol for conditional disclosure of secrets and its applications. In Applied Cryptography and Network Security, 5th International Conference, ACNS 2007, Zhuhai, China, June 5-8, 2007, volume 4521 of Lecture Notes in Computer Science, pages 207–225. Springer, 2007.
Info
10Yaniv Eytani and Timo Latvala. Explaining intermittent concurrent bugs by minimizing scheduling noise. In Eyal Bin, Avi Ziv, and Shmuel Ur, editors, Proceedings of the Second Haifa Verification Conference (HVC 2006), volume 4383 of Lecture Notes in Computer Science, pages 183–197, Haifa, Israel, 2007. Springer-Verlag.
Info
9Tommi Junttila and Petteri Kaski. Engineering an efficient canonical labeling tool for large and sparse graphs. In David Applegate, Gerth Stølting Brodat, Daniel Panario, and Robert Sedgewick, editors, Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics. SIAM, 2007.
Info
See www.siam.org ...
8Matti Järvisalo and Tommi Junttila. Limitations of restricted branching in clause learning. In Christian Bessiere, editor, Principles and Practice of Constraint Programming – CP 2007, volume 4741 of Lecture Notes in Computer Science, pages 348–363. Springer, 2007.
Info
See dx.doi.org ...
7Tommi Junttila. SMUML/proco version 2.00 — a translator from UML models to Promela, 2007. Computer program.
Info
See www.tcs.hut.fi ...
6Tommi Junttila. PySMT version 0.50 — a Python front-end for satisfiability modulo theories solvers, 2007. Computer program.
Info
See www.tcs.hut.fi ...
5Tomi Janhunen. asptools 1.0 — A tool collection for answer set programming. http://www.tcs.hut.fi/Software/asptools/, 2007. Computer Program.
Info
See www.tcs.hut.fi ...
4Tomi Janhunen. lpeq 1.19 — A tool for testing the modular equivalence of logic programs. http://www.tcs.hut.fi/Software/lpeq/, 2007. Computer Program.
Info
See www.tcs.hut.fi ...
3Vesa Ojala. SMUML/slicer 1.0.0 — a slicer for slicing UML state machines, 2007. Computer program.
Info
See www.tcs.hut.fi ...
2Vesa Ojala. SMUML/canal 1.0.0 — a counterexample analysator for analyzing abstract counterexamples from data abstracted UML models, 2007. Computer program.
Info
See www.tcs.hut.fi ...
1Kaisa Nyberg. Kryptologia – tiedon turvaamisen tiede. Tietojenkäsittelytiede, 26:32–53, Heinäkuu 2007.
Info

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