Abstract is missing.
- Petri Net DistributabilityEike Best, Philippe Darondeau. 1-18 [doi]
- Connector Algebras, Petri Nets, and BIPRoberto Bruni, Hernán C. Melgratti, Ugo Montanari. 19-38 [doi]
- Models of Provenance - (Abstract)Peter Buneman. 39 [doi]
- End-to-End Guarantees in Embedded Control Systems - (Abstract)Rupak Majumdar. 40 [doi]
- Mining Precise Specifications - (Abstract)Andreas Zeller. 41 [doi]
- Detecting Entry Points in Java LibrariesThomas Baar, Philipp Kumar. 42-54 [doi]
- Static Analysis of Run-Time Modes in Synchronous Process NetworkMichael Beyer, Sabine Glesner. 55-67 [doi]
- Compositional Methods in Characterization of Timed Event StructuresElena N. Bozhenkova. 68-76 [doi]
- Algorithmic Debugging of SQL ViewsRafael Caballero, Yolanda García-Ruiz, Fernando Sáenz-Pérez. 77-85 [doi]
- Timed Transition Systems with Independence and Marked Scott Domains: An AdjunctionRoman S. Dubtsov. 86-94 [doi]
- An Extensible System for Enhancing Social Conference ExperienceMichael A. H. Fried, Anna Fensel, Federico Michele Facca, Dieter Fensel. 95-110 [doi]
- Exponential Acceleration of Model Checking for Perfect Recall SystemsNatalya Olegovna Garanina. 111-124 [doi]
- Bootstrapping Compiler Generators from Partial EvaluatorsRobert Glück. 125-141 [doi]
- A Logic Characteristic for Timed Extensions of Partial Order Based EquivalencesNatalya Gribovskaya. 142-152 [doi]
- Proving the Correctness of Unfold/Fold Program Transformations Using BisimulationGeoff W. Hamilton, Neil D. Jones. 153-169 [doi]
- Secure Multi-execution in HaskellMauro Jaskelioff, Alejandro Russo. 170-178 [doi]
- Towards an Open Framework for C Verification Tools BenchmarkingAlexey V. Khoroshilov, Vadim Mutilin, Eugene Novikov, Pavel Shved, Alexander Strakh. 179-192 [doi]
- Solving Coverability Problem for Monotonic Counter Systems by SupercompilationAndrei V. Klimov. 193-209 [doi]
- Multi-result Supercompilation as Branching Growth of the Penultimate Level in Metasystem TransitionsIlya Klyuchnikov, Sergei A. Romanenko. 210-226 [doi]
- Symbolic Loop Bound Computation for WCET AnalysisJens Knoop, Laura Kovács, Jakob Zwirchmayr. 227-242 [doi]
- GoRRiLA and Hard RealityKonstantin Korovin, Andrei Voronkov. 243-250 [doi]
- Reachability in One-Dimensional Controlled Polynomial Dynamical SystemsMargarita V. Korovina, Nicolai Vorobjov. 251-261 [doi]
- Insertion Modeling SystemAlexander A. Letichevsky, Olexander A. Letychevskyi, Vladimir S. Peschanenko. 262-273 [doi]
- Decidability of Modular Logics for ConcurrencyRadu Mardare. 274-288 [doi]
- Partial Evaluation of Janus Part 2: Assertions and ProceduresTorben Æ. Mogensen. 289-301 [doi]
- Scalable Parallel Interval Propagation for Sparse Constraint Satisfaction ProblemsEvgueni Petrov. 302-312 [doi]
- A Combined Technique for Automatic Detection of Backward Binary Compatibility ProblemsAndrey V. Ponomarenko, Vladimir V. Rubanov. 313-321 [doi]
- Weighted Lumpability on Markov ChainsArpit Sharma, Joost-Pieter Katoen. 322-339 [doi]
- Development of the Computer Language Classification Knowledge PortalNikolay V. Shilov, Alexander A. Akinin, Alexey V. Zubkov, Renat I. Idrisov. 340-348 [doi]
- Justified Terminological ReasoningThomas Studer. 349-361 [doi]
- Implementing Conflict ResolutionKonstantin Korovin, Nestan Tsiskaridze, Andrei Voronkov. 362-376 [doi]
- Symbolic Tree TransducersMargus Veanes, Nikolaj Bjørner. 377-393 [doi]
- Probabilistic Concepts in Formal ContextsAlexander V. Demin, Denis Ponomaryov, Evgenii Vityaev. 394-410 [doi]