SOFSEM 2010: Theory and Practice of Computer Science

36th Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 23-29, 2010. Proceedings

  • Jan van Leeuwen
  • Anca Muscholl
  • David Peleg
  • Jaroslav Pokorný
  • Bernhard Rumpe
Conference proceedings SOFSEM 2010

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5901)

Table of contents

  1. Front Matter
    PDF

  2. Invited Talks

    1. Forcing Monotonicity in Parameterized Verification: From Multisets to Words
      Parosh Aziz Abdulla
      Pages 1-15
    2. Research Issues in the Automated Testing of Ajax Applications
      Arie van Deursen, Ali Mesbah
      Pages 16-28
    3. Essential Performance Drivers in Native XML DBMSs
      Theo Härder, Christian Mathis, Sebastian Bächle, Karsten Schmidt, Andreas M. Weiner
      Pages 29-46
    4. Continuous Processing of Preference Queries in Data Streams
      Maria Kontaki, Apostolos N. Papadopoulos, Yannis Manolopoulos
      Pages 47-60
    5. Clock Synchronization: Open Problems in Theory and Practice
      Christoph Lenzen, Thomas Locher, Philipp Sommer, Roger Wattenhofer
      Pages 61-70
    6. Regret Minimization and Job Scheduling
      Yishay Mansour
      Pages 71-76
    7. Lessons in Software Evolution Learned by Listening to Smalltalk
      Oscar Nierstrasz, Tudor Gîrba
      Pages 77-95
    8. The Web of Things: Extending the Web into the Real World
      Dave Raggett
      Pages 96-107
    9. Web Science: The Digital-Heritage Case
      Guus Schreiber
      Pages 108-111
    10. Model-Driven Software Product Line Testing: An Integrated Approach
      Andy Schürr, Sebastian Oster, Florian Markert
      Pages 112-131
    11. Taming the Complexity of Inductive Logic Programming
      Filip Železný, Ondřej Kuželka
      Pages 132-140

  3. Regular Papers

    1. A Rule Format for Unit Elements
      Luca Aceto, Anna Ingolfsdottir, MohammadReza Mousavi, Michel A. Reniers
      Pages 141-152
    2. Approximability of Edge Matching Puzzles
      Antonios Antoniadis, Andrzej Lingas
      Pages 153-164
    3. A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks
      Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn
      Pages 165-175
    4. R-Programs: A Framework for Distributing XML Structural Joins across Function Calls
      David Bednárek
      Pages 176-187
    5. Fast Arc-Annotated Subsequence Matching in Linear Space
      Philip Bille, Inge Li Gørtz
      Pages 188-199
    6. Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs
      Frank S. de Boer, Immo Grabe
      Pages 200-211
    7. A Kernel for Convex Recoloring of Weighted Forests
      Hans L. Bodlaender, Marc Comas
      Pages 212-223
    8. Symbolic OBDD-Based Reachability Analysis Needs Exponential Space
      Beate Bollig
      Pages 224-234

About these proceedings

Keywords

Code Graph classification data mining design graph theory linear optimization load balancing modeling optimization parametrized verification rules mining search trees software reuse verification

Editors and affiliations

  • Jan van Leeuwen
    • 1
  • Anca Muscholl
    • 2
  • David Peleg
    • 3
  • Jaroslav Pokorný
    • 4
  • Bernhard Rumpe
    • 5
  1. 1.Department of Information and Computing SciencesUtrecht UniversityUtrechtThe Netherlands
  2. 2.LaBRIUniversit BordeauxTalence CedexFrance
  3. 3.Department of Computer Science & Applied MathematicsWeizmann Institute, Faculty of Mathematics and Computer ScienceRehovotIsrael
  4. 4.Department of Software Engineering Faculty of Mathematics and Physics Malostranské námCharles UniversityPrague 1Czech Republic
  5. 5.Software Engineering, Department of Computer ScienceRWTH Aachen UniversityAachenGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-11266-9
  • Copyright Information Springer-Verlag Berlin Heidelberg 2010
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-11265-2
  • Online ISBN 978-3-642-11266-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book