default search action
8th Ershov Memorial Conference 2011: Novosibirsk, Russia
- Edmund M. Clarke, Irina B. Virbitskaite, Andrei Voronkov:
Perspectives of Systems Informatics - 8th International Andrei Ershov Memorial Conference, PSI 2011, Novosibirsk, Russia, June 27-July 1, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7162, Springer 2012, ISBN 978-3-642-29708-3 - Eike Best, Philippe Darondeau:
Petri Net Distributability. 1-18 - Roberto Bruni
, Hernán C. Melgratti, Ugo Montanari:
Connector Algebras, Petri Nets, and BIP. 19-38 - Peter Buneman:
Models of Provenance - (Abstract). 39 - Rupak Majumdar:
End-to-End Guarantees in Embedded Control Systems - (Abstract). 40 - Andreas Zeller:
Mining Precise Specifications - (Abstract). 41 - Thomas Baar, Philipp Kumar:
Detecting Entry Points in Java Libraries. 42-54 - Michael Beyer, Sabine Glesner:
Static Analysis of Run-Time Modes in Synchronous Process Network. 55-67 - Elena N. Bozhenkova:
Compositional Methods in Characterization of Timed Event Structures. 68-76 - Rafael Caballero
Algorithmic Debugging of SQL Views. 77-85 - Roman S. Dubtsov:
Timed Transition Systems with Independence and Marked Scott Domains: An Adjunction. 86-94 - Michael A. H. Fried, Anna Fensel
An Extensible System for Enhancing Social Conference Experience. 95-110 - Natalya Olegovna Garanina:
Exponential Acceleration of Model Checking for Perfect Recall Systems. 111-124 - Robert Glück
Bootstrapping Compiler Generators from Partial Evaluators. 125-141 - Natalya Gribovskaya
A Logic Characteristic for Timed Extensions of Partial Order Based Equivalences. 142-152 - Geoff W. Hamilton
Proving the Correctness of Unfold/Fold Program Transformations Using Bisimulation. 153-169 - Mauro Jaskelioff, Alejandro Russo
Secure Multi-execution in Haskell. 170-178 - Alexey V. Khoroshilov
Towards an Open Framework for C Verification Tools Benchmarking. 179-192 - Andrei V. Klimov
Solving Coverability Problem for Monotonic Counter Systems by Supercompilation. 193-209 - Ilya G. Klyuchnikov, Sergei A. Romanenko
Multi-result Supercompilation as Branching Growth of the Penultimate Level in Metasystem Transitions. 210-226 - Jens Knoop, Laura Kovács
Symbolic Loop Bound Computation for WCET Analysis. 227-242 - Konstantin Korovin
GoRRiLA and Hard Reality. 243-250 - Margarita V. Korovina, Nicolai N. Vorobjov Jr.:
Reachability in One-Dimensional Controlled Polynomial Dynamical Systems. 251-261 - Alexander A. Letichevsky, Olexander A. Letychevskyi, Vladimir S. Peschanenko
Insertion Modeling System. 262-273 - Radu Mardare:
Decidability of Modular Logics for Concurrency. 274-288 - Torben Æ. Mogensen:
Partial Evaluation of Janus Part 2: Assertions and Procedures. 289-301 - Evgueni Petrov:
Scalable Parallel Interval Propagation for Sparse Constraint Satisfaction Problems. 302-312 - Andrey V. Ponomarenko, Vladimir V. Rubanov:
A Combined Technique for Automatic Detection of Backward Binary Compatibility Problems. 313-321 - Arpit Sharma, Joost-Pieter Katoen
Weighted Lumpability on Markov Chains. 322-339 - Nikolay V. Shilov
Development of the Computer Language Classification Knowledge Portal. 340-348 - Thomas Studer
Justified Terminological Reasoning. 349-361 - Konstantin Korovin
Implementing Conflict Resolution. 362-376 - Margus Veanes, Nikolaj S. Bjørner:
Symbolic Tree Transducers. 377-393 - Alexander V. Demin
Probabilistic Concepts in Formal Contexts. 394-410
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-07-17 01:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: