LEADER 07612nam 22008175 450 001 996465903103316 005 20230406060812.0 010 $a3-540-95891-6 024 7 $a10.1007/978-3-540-95891-8 035 $a(CKB)1000000000575768 035 $a(SSID)ssj0000320081 035 $a(PQKBManifestationID)11258707 035 $a(PQKBTitleCode)TC0000320081 035 $a(PQKBWorkID)10343621 035 $a(PQKB)10984008 035 $a(DE-He213)978-3-540-95891-8 035 $a(MiAaPQ)EBC3063893 035 $a(PPN)132870754 035 $a(EXLCZ)991000000000575768 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aSOFSEM 2009: Theory and Practice of Computer Science$b[electronic resource] $e35th Conference on Current Trends in Theory and Practice of Computer Science, ?pindleruv Mlın, Czech Republic, January 24-30, 2009. Proceedings /$fedited by Mogens Nielsen, Antonin Kucera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tuma, Frank Valencia 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XVII, 670 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5404 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-95890-8 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- A New Analysis of Expected Revenue -- Can Component/Service-Based Systems Be Proved Correct? -- Probabilistic Acceptors for Languages over Infinite Words -- Automatic Verification of Heap Manipulation Using Separation Logic -- Technology Diffusion in Social Networks -- Service Oriented Architecture Pitfalls -- Algorithms for Solving Infinite Games -- Randomness and Determination, from Physics and Computing towards Biology -- When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures -- Regular Papers -- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems -- Framed Versus Unframed Two-Dimensional Languages -- Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes -- The Shortcut Problem ? Complexity and Approximation -- Green Computing: Energy Consumption Optimized Service Hosting -- On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem -- Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems -- Epistemic Strategies and Games on Concurrent Processes -- On Finite Bases for Weak Semantics: Failures Versus Impossible Futures -- On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay -- Time and Fairness in a Process Algebra with Non-blocking Reading -- Expressiveness of Multiple Heads in CHR -- Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes -- A Framework for Mutant Genetic Generation for WS-BPEL -- Implementing Services by Partial State Machines -- Pattern Matching with Swaps for Short Patterns in Linear Time -- Automatic Bug Detection in Microcontroller Software by Static Program Analysis -- On the Unification of Process Semantics: Observational Semantics -- Factoring and Testing Primes in Small Space -- Adaptive Incentive-Compatible Sponsored Search Auction -- Semantically-Aided Data-Aware Service Workflow Composition -- Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time -- Abstract Storage Devices -- On Stateless Deterministic Restarting Automata -- User Care Preference-Based Semantic Service Discovery in a Ubiquitous Environment -- Safe Reasoning with Logic LTS -- Partial Order Semantics of Types of Nets -- A Problem Kernelization for Graph Packing -- -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games -- Conjunctive Grammars with Restricted Disjunction -- Modelling and Verifying Mobile Systems Using ?-Graphs -- On Some SAT-Variants over Linear Formulas -- The Simple Reachability Problem in Switch Graphs -- Unambiguous Erasing Morphisms in Free Monoids -- An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA -- Asynchronous Deterministic Rendezvous on the Line -- Design Validation by Symbolic Simulation and Equivalence Checking: A Case Study in Memory Optimization for Image Manipulation -- Group Input Machine -- From Outermost Termination to Innermost Termination -- Improved Algorithms for the 2-Vertex Disjoint Paths Problem -- Event-Clock Visibly Pushdown Automata -- A Machine Checked Soundness Proof for an Intermediate Verification Language -- Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams -- Symbolic Reachability Analysis of Integer Timed Petri Nets -- On Toda?s Theorem in Structural Communication Complexity -- The Minimum Reload s-t Path/Trail/Walk Problems -- Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression -- A New Family of Regular Operators Fitting with the Position Automaton Computation -- A Formal Model of Business Application Integration from Web Services (Position Paper). 330 $aThis book constitutes the refereed proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2009, held in ?pindleruv Mlın, Czech Republic, in January 2009. The 49 revised full papers, presented together with 9 invited contributions, were carefully reviewed and selected from 132 submissions. SOFSEM 2009 was organized around the following four tracks: Foundations of Computer Science; Theory and Practice of Software Services; Game Theoretic Aspects of E-commerce; and Techniques and Tools for Formal Verification. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5404 606 $aComputer science 606 $aDatabase management 606 $aComputer programming 606 $aElectronic digital computers?Evaluation 606 $aData mining 606 $aInformation storage and retrieval systems 606 $aTheory of Computation 606 $aDatabase Management 606 $aProgramming Techniques 606 $aSystem Performance and Evaluation 606 $aData Mining and Knowledge Discovery 606 $aInformation Storage and Retrieval 615 0$aComputer science. 615 0$aDatabase management. 615 0$aComputer programming. 615 0$aElectronic digital computers?Evaluation. 615 0$aData mining. 615 0$aInformation storage and retrieval systems. 615 14$aTheory of Computation. 615 24$aDatabase Management. 615 24$aProgramming Techniques. 615 24$aSystem Performance and Evaluation. 615 24$aData Mining and Knowledge Discovery. 615 24$aInformation Storage and Retrieval. 676 $a004.0151 702 $aNielsen$b Mogens$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKucera$b Antonin$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aBro Miltersen$b Peter$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPalamidessi$b Catuscia$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aTuma$b Petr$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aValencia$b Frank$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465903103316 996 $aSOFSEM 2009: Theory and Practice of Computer Science$9774150 997 $aUNISA