Lecture Notes in 7147 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen

Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, Bernhard Steffen TU Dortmund University, Madhu Sudan Microsoft Research, Cambridge, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbruecken, Germany Mária Bieliková Gerhard Friedrich Georg Gottlob Stefan Katzenbeisser György Turán (Eds.)

SOFSEM 2012: Theory and Practice of Computer Science

38th Conference on Current Trends in Theory and Practice of Computer Science Špindler˚uvMlýn, , January 21-27, 2012 Proceedings

13 Volume Editors

Mária Bieliková Slovak University of Technology in Bratislava, Slovakia E-mail: bielik@fiit.stuba.sk

Gerhard Friedrich Alpen-Adria-Universität Klagenfurt, Austria E-mail: [email protected]

Georg Gottlob University of Oxford, UK E-mail: [email protected]

Stefan Katzenbeisser Technische Universität Darmstadt, Germany E-mail: [email protected]

György Turán University of Illinois at Chicago, IL, USA and University of Szeged, Hungary E-mail: [email protected]

ISSN 0302-9743 e-ISSN 1611-3349 ISBN 978-3-642-27659-0 e-ISBN 978-3-642-27660-6 DOI 10.1007/978-3-642-27660-6 Springer Heidelberg Dordrecht London New York

Library of Congress Control Number: 2011944431

CR Subject Classification (1998): F.2, F.1, D.2, H.2-3, C.2, H.4, D.4, G.2

LNCS Sublibrary: SL 1 – Theoretical Computer Science and General Issues

© Springer-Verlag Berlin Heidelberg 2012 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com) Preface

This volume contains the invited and contributed papers selected for presentation at SOFSEM 2012, the 38th Conference on Current Trends in Theory and Practice of Computer Science, held January 21–27, 2012 in OREA Hotel Horal, Spindler˚ˇ uv Ml´yn, in the Krkonoˇse Mountains of the Czech Republic. SOFSEM (originally: SOFtware SEMinar) is devoted to leading research, and fosters the cooperation among researchers and professionals from academia and industry, in all areas of computer science. As a well-established and fully inter- national conference, SOFSEM maintains the best of its original Winter School aspects, like a high number of invited talks (this year again 11) and an in-depth coverage of novel research results in selected areas within computer science. SOFSEM 2012 was organized around the following four tracks: – Foundations of Computer Science (Chair: Gy¨orgy Tur´an - University of Illi- nois at Chicago, USA, and University of Szeged, Hungary) – Software and Web Engineering (Chair: M´aria Bielikov´a-SlovakUniversity of Technology in Bratislava, Slovakia) – , Security, and Verification (Chair: Stefan Katzenbeisser - Tech- nical University of Darmstadt, Germany) – Artificial Intelligence (Chair: Gerhard Friedrich - Alpen-Adria-University Klagenfurt, Austria) In memory of , whose 100th anniversary is celebrated in 2012, SOFSEM 2012 hosted a session on Turing machines. The session consisted of in- vited and contributed talks on Turing machines as the basic model of computabil- ity and complexity. SOFSEM 2012 was among the official Centenary Events of The Alan Turing Year. With its four tracks, SOFSEM 2012 covered the latest advances in research, both theoretical and applied, in leading areas of computer science. The SOFSEM 2012 Program Committee consisted of 105 international experts from 25 different countries, representing the 4 track areas with outstanding expertise. An integral part of SOFSEM 2012 was the traditional SOFSEM Student Research Forum (Chair: Roman Sp´ˇ anek - Institute of Computer Science of the Academy of Sciences of the Czech Republic in Prague - ICS ASCR), organized with the aim to present student projects in the theory and practice of computer science and to give students feedback on both the originality of their scientific results and on their work in progress. The papers presented at the Student Research Forum were published in a local proceedings volume. In response to the calls for papers, SOFSEM 2012 received 140 submissions by 297 authors, coming from 38 different countries of 5 continents (Americas, Asia, Australia and Europe): full papers were provided for 121 (87 %) of them. From these, there were 66 submissions in the Foundations of Computer Science Track (55 %) and 55 submissions (45 %) in the remaining three tracks: 26 in VI Preface the Software and Web Engineering Track (21 %), 18 in the Artificial Intelligence Track (15 %) and finaly 11 in the Cryptography, Security, and Verification Track (9 %). After a detailed review process (using the EasyChair Conference System) with at least three reviewers per paper, a careful electronic selection procedure was carried out within each track between August 29 and September 20, 2011. In total 43 papers were selected for presentation at SOFSEM 2012, following strict criteria of quality and originality. From these, there were 24 submissions in the Foundations of Computer Science Track (56 %) and 19 (44 %) in the other 3 tracks: 9 in the Software and Web Engineering Track (21 %), 6 in the Artificial Intelligence Track (14 %) and finally 4 in the Cryptography, Security, and Verification Track (9 %). Of the 43 accepted papers, 12 papers were submitted as student papers. In fact, two student papers, namely, the paper by Peter Damaschke and Azam Sheikh Muhammad and the one by Jiˇr´ıIsa,ZuzanaReitermanov´aandOndˇrej S´ykora, received the highest evaluations of all submissions in their respective tracks, the first one even the highest of all accepted papers. Furthermore, 12 student papers were selected for the SOFSEM 2012 Student Research Forum, based on the recommendations of the Chair of the SRF, and with the approval of the Track Chairs. As editors of these proceedings, we are grateful to everyone who contributed to the scientific program of the conference, especially the invited speakers and all authors of contributed papers. We thank all authors for their prompt responses to our editorial requests. SOFSEM 2012 was the result of a considerable effort by many people. We would like to express our special thanks to: – The SOFSEM 2012 Program Committees of the four tracks and all additional referees for their precise and detailed reviewing of the submissions – Roman Sp´ˇ anek, of the ICS ASCR, for his preparation and handling of the Student Research Forum – The SOFSEM Steering Committee headed by J´ulius Stullerˇ (ICS ASCR), for guidance and support throughout the preparation of the conference – Springer’s LNCS series, for its great support of the SOFSEM conferences We are also greatly indebted to: – The SOFSEM 2012 Organizing Committee consisting of J´ulius Stullerˇ (Chair), Pavel Tyl, Martin Rimn´ˇ aˇc, and Dana Kuˇzelov´a (all from the ICS ASCR) for the support and preparation of all aspects of the conference – The Action M Agency, in particular Milena Zeithamlov´aand Pavl´ına Bˇrezinov´a, for the local arrangements of SOFSEM 2012 We especially thank J´ulius Stuller,ˇ for his assistance in all duties and respon- sibilities of the Track Chairs and the PC/General Chair. Preface VII

Finally, we are very grateful for the financial support of our sponsors, which enabled us to compose a high-quality program of invited speakers and helped us to keep the student fees low. We thank the Institute of Computer Science of the Academy of Sciences of the Czech Republic in Prague, for its invaluable support of all aspects of SOFSEM 2012.

October 2011 M´aria Bielikov´a Gerhard Friedrich Georg Gottlob Stefan Katzenbeisser Gy¨orgy Tur´an Organization

Steering Committee

M´aria Bielikov´a Slovak University of Technology in Bratislava, Slovakia Bernadette Charron-Bost Ecole Polytechnique, Keith Jeffery STFC Rutherford Appleton Laboratory, UK Anton´ın Kuˇcera Masaryk University, Brno, Czech Republic Jan van Leeuwen Utrecht University, The Branislav Rovan Comenius University, Bratislava, Slovakia J´ulius Stuller,ˇ Chair Institute of Computer Science, Academy of Sciences, Czech Republic Petr T˚uma Charles University in Prague, Czech Republic

Program Committee

PC Chair Georg Gottlob University of Oxford, UK

Track Chairs M´aria Bielikov´a Slovak University of Technology in Bratislava, Slovakia Gerhard Friedrich Alpen Adria University Klagenfurt, Austria Stefan Katzenbeisser Technische Universit¨at Darmstadt, Germany Gy¨orgy Tur´an University of Illinois at Chicago, USA, and University of Szeged, Hungary

Student Research Forum Chair Roman Sp´ˇ anek Institute of Computer Science, Academy of Sciences, Czech Republic

PC Members Isolde Adler Goethe University Frankfurt am Main, Germany Andris Ambainis University of Latvia, Latvia Ioannis Anagnostopoulos University of Central Greece, Greece Frederik Armknecht University of Mannheim, Germany Roman Bart´ak Charles University in Prague, Czech Republic Petr Berka University of Economics, Prague, Czech Republic Miklos Biro Corvinus University of Budapest, Hungary X Organization

Roderick Bloem Graz University of Technology, Austria Pˇremek Brada University of West Bohemia, Czech Republic Ivan Bratko University of Ljubljana, Slovenia Gerd Brewka Leipzig University, Germany Levente Buttyan Budapest University of Technology and Economics, Hungary Sven Casteleyn Polytechnic University of Valencia, Sourav Chakraborty Chennai Mathematical Institute, India Ferdinando Cicalese University of Salerno, Ondˇrej Cepekˇ Charles University in Prague, Czech Republic Ivana Cern´ˇ a Masaryk University, Brno, Czech Republic Florian Daniel University of Trento, Italy Bhaskar Dasgupta University of Illinois at Chicago, USA Peter Dolog Aalborg University, Denmark Agostino Dovier University of Udine, Italy Johann Eder University of Klagenfurt, Austria Uwe Egly Vienna University of Technology, Austria Michael Elkin Ben-Gurion University of the Negev, Israel Wolfgang Faber University of Calabria, Italy Andreas Falkner Siemens AG Osterreich,¨ Austria Johann Gamper Free University of Bolzano, Italy Martin Gebser University of Potsdam, Germany Martin Grohe Humboldt University Berlin, Germany Vince Grolmusz E¨otv¨os University, Budapest, Hungary Hele-Mai Haav Institute of Cybernetics at TUT, Estonia Kristoffer Hansen Aarhus University, Denmark Lisa Hellerstein Polytechnic Institute of NY, USA Eelco Herder L3S Research Center, Germany Pavel Herout University of West Bohemia, Czech Republic Jan Hidders Delft University of Technology, The Netherlands Martin Homola Comenius University, Bratislava, Slovakia Juraj Hromkoviˇc ETH Zurich, Switzerland Dietmar Jannach Dortmund University of Technology, Germany Marina Jirotka University of Oxford, UK Dimitris Karagiannis University of Vienna, Austria Przemyslaw Kazienko Wroclaw University of Technology, Poland Johannes Kinder EPFL, Switzerland Petr Kosina Brno University of Technology, Czech Republic Daniel Kr´al Czech Republic Rastislav Kr´aloviˇc Comenius University, Bratislava, Slovakia Milos Kravcik RWTH Aachen University, Germany Petr Kroha Chemnitz University of Technology, Germany Klaus Kursawe University of Nijmegen, The Netherlands Miroslaw Kutylowski Wroclaw University of Technology, Poland Organization XI

Michal Laclav´ık Institute of Informatics, Slovak Academy of Sciences, Slovakia Viliam Lis´y Czech Technical University in Prague, Czech Republic Martin Lopez-Nores University of Vigo, Spain Shachar Lovett The Weizmann Institute of Science, Israel Leszek Maciaszek Wroclaw University of Economics, Poland Frederic Magniez LIAFA, University of Paris 7, CNRS, France V´aclav Maty´aˇs Masaryk University, Brno, Czech Republic Marius Minea Politechnic University of Timisoara, Romania Victor Mitrana Rovira i Virgili University, Tarragona, Romania Tadeusz Morzy Poznan University of Technology, Poland Jerzy Nawrocki Poznan University of Technology, Poland Pavol N´avrat Slovak University of Technology in Bratislava, Slovakia Ronald Ortner University of Leoben, Austria Jan Paraliˇc Technical University of Kosice, Slovakia Michal Pˇechouˇcek Czech Technical University in Prague, Czech Republic Reinhard Pichler Vienna University of Technology, Austria Jaroslav Pokorn´y Charles University in Prague, Czech Republic Axel Polleres Siemens AG Osterreich,¨ Austria Bart Preneel Catholic University, Leuven, Belgium Daniel Reidenbach Loughborough University, UK Karel Richta Charles University in Prague, Czech Republic Branislav Rovan Comenius University, Bratislava, Slovakia Ahmad-Reza Sadeghi Technische Universit¨at Darmstadt, Germany Davide Sangiorgi University of Bologna, Italy Ulrich Sch¨opp LMU Munich, Germany Radu Sion Stony Brook University, USA Boris Skoric Eindhoven Technical University, The Netherlands Markus Stumptner University of South Australia, Australia Vo jtˇech Sv´atek University of Economics, Prague, Czech Republic Bal´azs Sz¨or´enyi University of Szeged, Hungary Petr Salounˇ Technical University Ostrava, Czech Republic Daniel Stefankoviˇˇ c University of Rochester, USA Olga Stˇˇ ep´ankov´a Czech Technical University in Prague, Czech Republic J´ulius Stullerˇ Institute of Computer Science, Academy of Science, Czech Republic Massimo Tisi Polytechnical University of Milan, Italy Sophie Tison University of Lille 1, LIFL, France XII Organization

Hans Tompits Vienna University of Technology, Austria Helmut Veith Vienna University of Technology, Austria Elad Verbin University of Aarhus, Denmark Heribert Vollmer Hannover University, Germany Valentino Vrani´c Slovak University of Technology in Bratislava, Slovakia Vincent Wade Trinity College Dublin, Ireland Manuel Wimmer Vienna University of Technology, Austria Franz Wotawa Graz Technical University, Austria Marek Zaionc Jagiellonian University, Poland Jaroslav Zendulka Brno University of Technology, Czech Republic Wieslaw Zielonka LIAFA, University of Paris 7, France Stanislav Zivn´ˇ y University of Oxford, UK

Organization

38th SOFSEM 2012 was organized by:

Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague Action M Agency, Prague

Organizing Committee J´ulius Stuller,ˇ Chair Institute of Computer Science, Prague, Czech Republic Pavel Tyl Institute of Computer Science, Prague, Czech Republic Martin Rimn´ˇ aˇc Institute of Computer Science, Prague, Czech Republic Dana Kuˇzelov´a Institute of Computer Science, Prague, Czech Republic Milena Zeithamlov´a Action M Agency, Prague, Czech Republic Pavl´ına Bˇrezinov´a Action M Agency, Prague, Czech Republic

Supported by

CSKIˇ – Czech Society for Cybernetics and Informatics

SSCS – Slovak Society for Computer Science Table of Contents

Invited Talks

Foundations of Computer Science The Legacy of Turing in Numerical Analysis ...... 1 Felipe Cucker Turing Machines for Dummies: Why Representations Do Matter ...... 14 Peter van Emde Boas What Is an Algorithm? ...... 31 Yuri Gurevich Strong Bridges and Strong Articulation Points of Directed Graphs (Abstract) ...... 43 Giuseppe F. Italiano Towards Computational Models of Artificial Cognitive Systems That Can, in Principle, Pass the ...... 44 Jiˇr´ı Wiedermann

Software and Web Engineering A Fully Generic Approach for Realizing the Adaptive Web ...... 64 Paul De Bra and David Smits Multi Feature Indexing Network MUFIN for Similarity Search Applications ...... 77 Pavel Zezula

Cryptography, Security, and Verification Recent Challenges and Ideas in Temporal Synthesis ...... 88 Orna Kupferman Cryptography from Learning Parity with Noise ...... 99 Krzysztof Pietrzak

Artificial Intelligence A Quick Tour of Word Sense Disambiguation, Induction and Related Approaches ...... 115 Roberto Navigli XIV Table of Contents

Not Another Look at the Turing Test! ...... 130

Regular Papers

Foundations of Computer Science

The Equational Theory of Weak Complete Simulation Semantics over BCCSP ...... 141 Luca Aceto, David de Frutos-Escrig, Carlos Gregorio-Rodr´ıguez, and Anna Ing´olfsd´ottir

Complexity Insights of the Minimum Duplication Problem ...... 153 Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, and Florian Sikora

A Turing Machine Resisting Isolated Bursts of Faults ...... 165 IlirCapuni ¸ and Peter G´acs

Properties of SLUR Formulae ...... 177 Ondˇrej Cepek,ˇ Petr Kuˇcera, and V´aclav Vlˇcek

Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs ...... 190 Panagiotis Cheilaris, Bal´azs Keszegh, and D¨om¨ot¨or P´alv¨olgyi

Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration ...... 202 Jean-Fran¸cois Couturier, Pinar Heggernes, Pim van’t Hof, and Dieter Kratsch

Randomized Group Testing Both Query-Optimal and Minimal Adaptive ...... 214 Peter Damaschke and Azam Sheikh Muhammad

Complexity of Model Checking for Modal Dependence Logic ...... 226 Johannes Ebbing and Peter Lohmann

Multitape NFA: Weak Synchronization of the Input Heads ...... 238 Omer¨ E˘gecio˘glu, Oscar H. Ibarra, and Nicholas Q. Tran

Visibly Pushdown Transducers with Look-Ahead ...... 251 Emmanuel Filiot and Fr´ed´eric Servais

A Generalization of Spira’s Theorem and Circuits with Small Segregators or Separators ...... 264 Anna G´al and Jing-Tang Jang Table of Contents XV

Consistent Consequence for Boolean Equation Systems ...... 277 Maciej W. Gazda and Tim A.C. Willemse

4-Coloring H-Free Graphs When H Is Small ...... 289 Petr A. Golovach, Dani¨el Paulusma, and Jian Song

Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts ...... 301 Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda

A Fast Approximation Scheme for the Multiple Knapsack Problem ..... 313 Klaus Jansen

Counting Maximal Independent Sets in Subcubic Graphs ...... 325 Konstanty Junosza-Szaniawski and MichalTuczy´nski

Iterated Hairpin Completions of Non-crossing Words ...... 337 Lila Kari, Steffen Kopecki, and Shinnosuke Seki

On the Approximation Ratio of the Path Matching Christofides Algorithm...... 349 Sacha Krug

Parikh’s Theorem and Descriptional Complexity ...... 361 Giovanna J. Lavado and Giovanni Pighizzini

A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs ...... 373 Andrzej Lingas and Dzmitry Sledneu

The Complexity of Small Universal Turing Machines: A Survey ...... 385 Turlough Neary and Damien Woods

A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 (Extended Abstract)...... 406 Jiˇr´ı S´ˇıma and Stanislav Z´ˇak

Complete Problem for Perfect Zero-Knowledge Quantum Proof ...... 419 Jun Yan

An Algorithm for Probabilistic Alternating Simulation ...... 431 Chenyi Zhang and Jun Pang

Software and Web Engineering

Towards a Smart, Self-scaling Cooperative Web Cache ...... 443 Tom´aˇs Cern´ˇ y, Petr Praus, Sl´avka Jaromˇeˇrsk´a, Luboˇs Matl, and Michael J. Donahoo XVI Table of Contents

Named Entity Disambiguation Based on Explicit Semantics ...... 456 Martin Jaˇcala and Jozef Tvaroˇzek Design Pattern Support Based on the Source Code Annotations and Feature Models ...... 467 Peter Kajsa and Pavol N´avrat On the Formalization of UML Activities for Component-Based Protocol Design Specifications ...... 479 Prabhu Shankar Kaliappan and Hartmut K¨onig Tree Based Domain-Specific Mapping Languages ...... 492 Elina Kalnina, Audris Kalnins, Agris Sostaks, Edgars Celms, and Janis Iraids RESTGroups for Resilient Web Services ...... 505 Tadeusz Kobus and Pawel T. Wojciechowski Leveraging Microblogs for Resource Ranking ...... 518 Tom´aˇs Majer and Mari´an Simkoˇ Inner Architecture of a Social Networking System ...... 530 Jaroslav Skrab´ˇ alek, Petr Kunc, and Tom´aˇsPitner State Coverage: Software Validation Metrics beyond Code Coverage .... 542 Dries Vanoverberghe, Jonathan de Halleux, Nikolai Tillmann, and Frank Piessens

Cryptography, Security, and Verification Factorization for Component-Interaction Automata ...... 554 Nikola Beneˇs, Ivana Cern´ˇ a, and Filip Stefaˇˇ n´ak Optimizing Segment Based Document Protection ...... 566 Miroslaw Kutylowski and Maciej G¸ebala

Securing the Future — An Information Flow Analysis of a Distributed OO Language ...... 576 Martin Pettai and Peeter Laud Improving Watermark Resistance against Removal Attacks Using Orthogonal Wavelet Adaptation ...... 588 Jan Stolarek and Piotr Lipi´nski

Artificial Intelligence MAKe – A System for Modelling, Optimising, and Analyzing Production in Small and Medium Enterprises ...... 600 Roman Bart´ak, Con Sheahan, and Ann Sheahan Table of Contents XVII

Knowledge Compilation with Empowerment ...... 612 Lucas Bordeaux and Joao Marques-Silva

Cost-Sensitive Classification with Unconstrained Influence Diagrams .... 625 Jiˇr´ıIˇsa, Zuzana Reitermanov´a, and Ondˇrej S´ykora

Modeling and Predicting Students Problem Solving Times ...... 637 Petr Jaruˇsek and Radek Pel´anek

Generic Heuristic Approach to General Game Playing ...... 649 Jacek Ma´ndziuk and Maciej Swiechowski´

The SiMoL Modeling Language for Simulation and (Re-)Configuration ...... 661 Iulia Nica and Franz Wotawa

Author Index ...... 673