default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th FoSSaCS 2008: Budapest, Hungary
- Roberto M. Amadio:
Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings. Lecture Notes in Computer Science 4962, Springer 2008, ISBN 978-3-540-78497-5 - Igor Walukiewicz:
Finding Your Way in a Forest: On Different Types of Trees and Their Properties. 1-4 - Hugo Gimbert, Florian Horn:
Simple Stochastic Games with Few Random Vertices Are Easy to Solve. 5-19 - Michael Ummels:
The Complexity of Nash Equilibria in Infinite Multiplayer Games. 20-34 - Parosh Aziz Abdulla, Noomene Ben Henda, Luca de Alfaro, Richard Mayr, Sven Sandberg:
Stochastic Games with Lossy Channels. 35-49 - Jean Goubault-Larrecq:
Simulation Hemi-metrics between Infinite-State Stochastic Games. 50-65 - Dirk Pattinson, Lutz Schröder
:
Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics. 66-80 - Peter Selinger, Benoît Valiron:
A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract). 81-96 - Pierre Chambart, Philippe Schnoebelen:
The omega-Regular Post Embedding Problem. 97-111 - Adam Antonik, Michael Huth, Kim Guldstrand Larsen, Ulrik Nyman, Andrzej Wasowski:
Complexity of Decision Problems for Mixed and Modal Specifications. 112-126 - Guillem Godoy, Sebastian Maneth, Sophie Tison:
Classes of Tree Homomorphisms with Decidable Preservation of Regularity. 127-141 - Manfred Droste, Karin Quaas:
A Kleene-Schützenberger Theorem for Weighted Timed Automata. 142-156 - Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier:
Robust Analysis of Timed Automata via Channel Machines. 157-171 - Mikolaj Bojanczyk:
The Common Fragment of ACTL and LTL. 172-185 - Laura Bozzelli:
The Complexity of CTL* + Linear Past. 186-200 - Mohammad Raza, Philippa Gardner:
Footprints in Local Reasoning. 201-215 - Deepak Garg, Martín Abadi:
A Modal Deconstruction of Access Control Logics. 216-230 - Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva:
Coalgebraic Logic and Synthesis of Mealy Machines. 231-245 - Ichiro Hasuo, Bart Jacobs, Ana Sokolova:
The Microcosm Principle and Concurrency in Coalgebra. 246-260 - Pawel Parys:
Systems of Equations Satisfied in All Commutative Finite Semigroups. 261-272 - Hermann Gruber, Jan Johannsen:
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity. 273-286 - Christel Baier, Nathalie Bertrand, Marcus Größer:
On Decision Problems for Probabilistic Büchi Automata. 287-301 - Krishnendu Chatterjee, Koushik Sen, Thomas A. Henzinger:
Model-Checking omega-Regular Properties of Interval Markov Chains. 302-317 - Jean Goubault-Larrecq:
Prevision Domains and Convex Powercones. 318-333 - Pietro Di Gianantonio, Furio Honsell, Marina Lenisa:
RPO, Second-Order Contexts, and lambda-Calculus. 334-349 - Nathan Mishra-Linger, Tim Sheard:
Erasure and Polymorphism in Pure Type Systems. 350-364 - Bruno Barras, Bruno Bernardo:
The Implicit Calculus of Constructions as a Programming Language with Dependent Types. 365-379 - Kentaro Kikuchi, Stéphane Lengrand:
Strong Normalisation of Cut-Elimination That Simulates beta-Reduction. 380-394 - Filippo Bonchi, Ugo Montanari:
Symbolic Semantics Revisited. 395-412 - Guilherme Rangel, Barbara König, Hartmut Ehrig:
Deriving Bisimulation Congruences in the Presence of Negative Application Conditions. 413-427 - Bartek Klin, Vladimiro Sassone:
Structural Operational Semantics for Stochastic Process Calculi. 428-442 - Christelle Braun, Konstantinos Chatzikokolakis, Catuscia Palamidessi:
Compositional Methods for Information-Hiding. 443-457 - Philippe Darondeau, Blaise Genest, Loïc Hélouët:
Products of Message Sequence Charts. 458-473 - Peter Habermehl, Radu Iosif, Tomás Vojnar:
What Else Is Decidable about Integer Arrays?. 474-489 - Stéphane Demri, Ranko Lazic, Arnaud Sangnier:
Model Checking Freeze LTL over One-Counter Automata. 490-504
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 2026-02-01 23:13 CET 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:
