Abstract is missing.
- A New Analysis of Expected RevenueArne Andersson, Jim Wilenius. 1-2 [doi]
- Can Component/Service-Based Systems Be Proved Correct?Christian Attiogbé. 3-18 [doi]
- Probabilistic Acceptors for Languages over Infinite WordsChristel Baier, Nathalie Bertrand, Marcus Größer. 19-33 [doi]
- Automatic Verification of Heap Manipulation Using Separation LogicJosh Berdine. 34 [doi]
- Technology Diffusion in Social NetworksNicole Immorlica. 35-36 [doi]
- Service Oriented Architecture PitfallsRadovan Janecek. 37-45 [doi]
- Algorithms for Solving Infinite GamesMarcin Jurdzinski. 46-48 [doi]
- Randomness and Determination, from Physics and Computing towards BiologyGiuseppe Longo. 49-61 [doi]
- When Analysis Fails: Heuristic Mechanism Design via Self-correcting ProceduresDavid C. Parkes. 62-66 [doi]
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic SystemsSuzana Andova, Sonja Georgievska. 67-78 [doi]
- Framed Versus Unframed Two-Dimensional LanguagesMarcella Anselmo, Natasha Jonoska, Maria Madonia. 79-92 [doi]
- Approximating Tree Edit Distance through String Edit Distance for Binary Tree CodesTaku Aratsu, Kouichi Hirata, Tetsuji Kuboyama. 93-104 [doi]
- The Shortcut Problem - Complexity and ApproximationReinhard Bauer, Gianlorenzo D Angelo, Daniel Delling, Dorothea Wagner. 105-116 [doi]
- Green Computing: Energy Consumption Optimized Service HostingWalter Binder, Niranjan Suri. 117-128 [doi]
- On the OBDD Complexity of Threshold Functions and the Variable Ordering ProblemBeate Bollig. 129-140 [doi]
- Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous SystemsThomas Chatain, Paul Gastin, Nathalie Sznajder. 141-152 [doi]
- Epistemic Strategies and Games on Concurrent ProcessesKonstantinos Chatzikokolakis, Sophia Knight, Prakash Panangaden. 153-166 [doi]
- On Finite Bases for Weak Semantics: Failures Versus Impossible FuturesTaolue Chen, Wan Fokkink, Rob J. van Glabbeek. 167-180 [doi]
- On Generating All Maximal Acyclic Subhypergraphs with Polynomial DelayTaishin Daigo, Kouichi Hirata. 181-192 [doi]
- Time and Fairness in a Process Algebra with Non-blocking ReadingFlavio Corradini, Maria Rita Di Berardini, Walter Vogler. 193-204 [doi]
- Expressiveness of Multiple Heads in CHRCinzia Di Giusto, Maurizio Gabbrielli, Maria Chiara Meo. 205-216 [doi]
- Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large UniversesMartin Dietzfelbinger, Ulf Schellbach. 217-228 [doi]
- A Framework for Mutant Genetic Generation for WS-BPELJuan José Domínguez-Jiménez, Antonia Estero-Botaro, Inmaculada Medina-Bulo. 229-240 [doi]
- Implementing Services by Partial State MachinesWalter Dosch, Annette Stümpel. 241-254 [doi]
- Pattern Matching with Swaps for Short Patterns in Linear TimeDomenico Cantone, Simone Faro. 255-266 [doi]
- Automatic Bug Detection in Microcontroller Software by Static Program AnalysisAnsgar Fehnker, Ralf Huuck, Bastian Schlich, Michael Tapp. 267-278 [doi]
- On the Unification of Process Semantics: Observational SemanticsDavid de Frutos-Escrig, Carlos Gregorio-Rodríguez, Miguel Palomino. 279-290 [doi]
- Factoring and Testing Primes in Small SpaceViliam Geffert, Dana Pardubská. 291-302 [doi]
- Adaptive Incentive-Compatible Sponsored Search AuctionRica Gonen, Elan Pavlov. 303-316 [doi]
- Semantically-Aided Data-Aware Service Workflow CompositionOndrej Habala, Marek Paralic, Viera Rozinajová, Peter Bartalos. 317-328 [doi]
- Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted TimeJan Jezabek. 329-340 [doi]
- Abstract Storage DevicesRobert König, Ueli M. Maurer, Stefano Tessaro. 341-352 [doi]
- On Stateless Deterministic Restarting AutomataMartin Kutrib, Hartmut Messerschmidt, Friedrich Otto. 353-364 [doi]
- User Care Preference-Based Semantic Service Discovery in a Ubiquitous EnvironmentDongpil Kwak, Joongsoo Lee, Dohyun Kim, Younghee Lee. 365-375 [doi]
- Safe Reasoning with Logic LTSGerald Lüttgen, Walter Vogler. 376-387 [doi]
- Partial Order Semantics of Types of NetsRobert Lorenz, Gabriel Juhás, Sebastian Mauser. 388-400 [doi]
- A Problem Kernelization for Graph PackingHannes Moser. 401-412 [doi]
- -Hardness of Pure Nash Equilibrium in Scheduling and Connection GamesNguyen Kim Thang. 413-424 [doi]
- Conjunctive Grammars with Restricted DisjunctionAlexander Okhotin, Christian Reitwießner. 425-436 [doi]
- Modelling and Verifying Mobile Systems Using pi-GraphsFrédéric Peschanski, Joël-Alexis Bialkiewicz. 437-448 [doi]
- On Some SAT-Variants over Linear FormulasStefan Porschen, Tatjana Schmidt. 449-460 [doi]
- The Simple Reachability Problem in Switch GraphsKlaus Reinhardt. 461-472 [doi]
- Unambiguous Erasing Morphisms in Free MonoidsJohannes C. Schneider. 473-484 [doi]
- An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPAJens Bachmann, Martin Riedl, Johann Schuster, Markus Siegle. 485-496 [doi]
- Asynchronous Deterministic Rendezvous on the LineGrzegorz Stachowiak. 497-508 [doi]
- Design Validation by Symbolic Simulation and Equivalence Checking: A Case Study in Memory Optimization for Image ManipulationKong Woei Susanto, Tim Todman, José Gabriel F. Coutinho, Wayne Luk. 509-520 [doi]
- Group Input MachineRuslans Tarasovs, Rusins Freivalds. 521-532 [doi]
- From Outermost Termination to Innermost TerminationRené Thiemann. 533-545 [doi]
- Improved Algorithms for the 2-Vertex Disjoint Paths ProblemTorsten Tholey. 546-557 [doi]
- Event-Clock Visibly Pushdown AutomataNguyen Van Tang, Mizuhito Ogawa. 558-569 [doi]
- A Machine Checked Soundness Proof for an Intermediate Verification LanguageFrédéric Vogels, Bart Jacobs 0002, Frank Piessens. 570-581 [doi]
- Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision DiagramsMin Wan, Gianfranco Ciardo. 582-594 [doi]
- Symbolic Reachability Analysis of Integer Timed Petri NetsMin Wan, Gianfranco Ciardo. 595-608 [doi]
- On Toda s Theorem in Structural Communication ComplexityHenning Wunderlich. 609-620 [doi]
- The Minimum Reload s-tPath/Trail/Walk ProblemsLaurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot. 621-632 [doi]
- Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown CompressionElvira Mayordomo, Philippe Moser. 633-644 [doi]
- A New Family of Regular Operators Fitting with the Position Automaton ComputationPascal Caron, Jean-Marc Champarnaud, Ludovic Mignot. 645-655 [doi]
- A Formal Model of Business Application Integration from Web Services (Position Paper)Kaiyu Wan, Mubarak Mohammad, Vasu S. Alagar. 656-667 [doi]