default search action
Information and Computation, Volume 207
Volume 207, Number 1, January 2009
- Tirza Hirst:
A Rice-style theorem for parallel automata. 1-13 - Filippo Bonchi
, Fabio Gadducci
Synthesising CCS bisimulation using graph rewriting. 14-40 - Patrick Baillot, Kazushige Terui:
Light types for polynomial time computation in lambda calculus. 41-62 - Stefano Berardi, Ugo de'Liguoro:
Toward the interpretation of non-constructive reasoning as non-monotonic learning. 63-81
Volume 207, Number 2, February 2009
- Rob J. van Glabbeek, Peter D. Mosses
Special issue on structural operational semantics. 83-84 - Mohammad Reza Mousavi
Semantics and expressiveness of ordered SOS. 85-119 - Irek Ulidowski
Generating priority rewrite systems for OSOS process languages. 120-145 - David de Frutos-Escrig
(Bi)simulations up-to characterise process semantics. 146-170 - Samuel Hym:
Mobility control via passports. 171-193 - Massimo Merro
An Observational Theory for Mobile Ad Hoc Networks (full version). 194-208 - Marcelo P. Fiore, Sam Staton:
A congruence rule format for name-passing process calculi. 209-236 - Bartek Klin
Bialgebraic methods and modal logic in structural operational semantics. 237-257 - Patrick Cousot, Radhia Cousot:
Bi-inductive structural semantics. 258-283 - Xavier Leroy, Hervé Grall:
Coinductive big-step operational semantics. 284-304 - Traian-Florin Serbanuta, Grigore Rosu, José Meseguer:
A rewriting logic approach to operational semantics. 305-340 - Patricia Johann, Janis Voigtländer
A family of syntactic logical relations for the semantics of Haskell-like languages. 341-368
Volume 207, Number 3, March 2009
- Hubie Chen:
Existentially restricted quantified constraint satisfaction. 369-388 - Hans Langmaack, Andrzej Salwicki, Marek Warpechowski:
On an algorithm determining direct superclasses in Java and similar languages with inner classes - Its correctness, completeness and uniqueness of solutions. 389-410 - Martín Hötzel Escardó, Weng Kin Ho
Operational domain theory and topology of sequential programming languages. 411-437 - Magnus Ågren, Pierre Flener
Revisiting constraint-directed search. 438-457
Volume 207, Number 4, April 2009
- Denis Caromel, Ludovic Henrio, Bernard P. Serpette:
Asynchronous sequential processes. 459-495 - Mathieu Baudet
Computationally sound implementations of equational theories against passive adversaries. 496-520 - Henning Fernau
Algorithms for learning regular expressions from positive data. 521-541
Volume 207, Number 5, May 2009
- Roberto M. Amadio, Giuseppe Castagna, Andrea Asperti
Preface. 543-544 - Giuseppe Longo:
From exact sciences to life phenomena: Following Schrödinger and Turing on Programs, Life and Causality. 545-558 - Henk Barendregt, Jan Willem Klop:
Applications of infinitary lambda calculus. 559-582 - Furio Honsell, Gordon D. Plotkin:
On the completeness of order-theoretic models of the lambda-calculus. 583-594 - Mariangiola Dezani-Ciancaglini
Objects and session types. 595-641 - Abbas Edalat:
A computable approach to measure and integration theory. 642-659 - Thierry Paul:
Semiclassical analysis and sensitivity to initial conditions. 660-669
Volume 207, Number 6, June 2009
- Mojmír Kretínský, Vojtech Rehák
Reachability is decidable for weakly extended process rewrite systems. 671-680 - Jacques Julliand, Pierre-Alain Masson, Emilie Oudot:
Partitioned PLTL model-checking for refined transition systems. 681-698 - Michele Boreale
Quantifying information leakage in process calculi. 699-725 - Didier Le Botlan, Didier Rémy:
Recasting MLF. 726-785
Volume 207, Number 7, July 2009
- Russell Impagliazzo
A zero-one law for RP and derandomization of AM if NP is not small. 787-792 - Stephen L. Bloom, Zoltán Ésik:
Axiomatizing rational power series over natural numbers. 793-811 - Hans Hüttel
Undecidable equivalences for basic parallel processes. 812-829 - Mathieu Hoyrup, Cristobal Rojas
Computability of probability measures and Martin-Löf randomness over metric spaces. 830-847
Volume 207, Number 8, August 2009
- Paolo Ferragina
The myriad virtues of Wavelet Trees. 849-866 - Ian Pratt-Hartmann
Data-complexity of the two-variable fragment with counting quantifiers. 867-888 - Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan:
Improving the round complexity of VSS in point-to-point networks. 889-899 - Juha Honkala:
The equality problem for infinite words generated by primitive morphisms. 900-907
Volume 207, Number 9, September 2009
- Manfred Jaeger
On fairness and randomness. 909-922 - Ferdinand Börner, Andrei A. Bulatov, Hubie Chen, Peter Jeavons, Andrei A. Krokhin
The complexity of constraint satisfaction games and QCSP. 923-944 - Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis:
Well-founded semantics for Boolean grammars. 945-967
Volume 207, Number 10, October 2009
- Grigori Mints, Valeria de Paiva
Logic, Language, Information and Computation. 969-970
- Solomon Feferman:
Operational set theory and small large cardinals. 971-979 - Tim Fernando:
Situations in LTL as strings. 980-999 - Renata P. de Freitas, Paulo A. S. Veloso, Sheila R. M. Veloso, Jorge Petrucio Viana:
On graph reasoning. 1000-1014 - Bryan Renne:
Propositional games with explicit strategies. 1015-1043 - Iliano Cervesato
Relating state-based and process-based concurrency through linear logic (full-version). 1044-1077 - Dan E. Willard:
Some specially formulated axiomizations for ISigma0 manage to evade the Herbrandized version of the Second Incompleteness Theorem. 1078-1093
Volume 207, Number 11, November 2009
- Carlos Martín-Vide, Cristina Tîrnauca
2nd International Conference on Language and Automata Theory and Applications (LATA 2008). 1095
- Terry Anderson, John Loftus, Narad Rampersad, Nicolae Santean, Jeffrey O. Shallit:
Detecting palindromes, patterns and borders in regular languages. 1096-1118 - Dorothea Baumeister, Jörg Rothe:
The three-color and two-color TantrixTM rotation puzzle problems are NP-complete via parsimonious reductions. 1119-1139 - Suna Bensch
On input-revolving deterministic and nondeterministic finite automata. 1140-1155 - Alan J. Cain
Automatic presentations for semigroups. 1156-1168 - Silvio Capobianco
On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems. 1169-1180 - Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren:
Efficient inclusion checking for deterministic tree automata and XML Schemas. 1181-1208 - Michael Domaratzki
Minimality in template-guided recombination. 1209-1220 - Mathieu Giraud
Asymptotic behavior of the numbers of runs and microruns. 1221-1228 - Ozan Kahramanogullari:
On linear logic planning and concurrency. 1229-1258 - Martin Korp, Aart Middeldorp
Match-bounds revisited. 1259-1283 - Andreas Maletti:
Minimizing deterministic weighted tree automata. 1284-1299 - Martin Plátek
Two-dimensional hierarchies of proper languages of lexicalized FRR-automata. 1300-1314 - S. A. Puzynina:
On periodicity of generalized two-dimensional infinite words. 1315-1328 - Elaine Render, Mark Kambites:
Rational subsets of polycyclic monoids and valence automata. 1329-1339 - Arto Salomaa, Kai Salomaa, Sheng Yu:
Variants of codes and indecomposable languages. 1340-1349
Volume 207, Number 12, December 2009
- Michael Okun
On the round complexity of Byzantine agreement without initial set-up. 1351-1368 - Murdoch James Gabbay
The lambda-context calculus (extended version). 1369-1400
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 2024-11-15 19:21 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: