Information and Computation, Volume 206

Volume 206, Number 1, January 2008

• 
  Philippe Moser:
  Generic density and small span theorem. 1-14
• 
  Philippe Moser:
  Baire categories on small complexity classes and meager-comeager laws. 15-33
• 
  Iain Phillips, Maria Grazia Vigliotti:
  Symmetric electoral systems for ambient calculi. 34-72
• 
  Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier:
  Timed Petri nets and timed automata: On the discriminating power of zeno sequences. 73-107
• 
  Wim H. Hesselink:
  Universal extensions to simulate specifications. 108-128

Volume 206, Numbers 2-4, February-April 2008

Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis (FCS-ARSPA '06)

• 
  Pierpaolo Degano, Ralf Küsters, Luca Viganò, Steve Zdancewic:
  Joint workshop on foundations of computer security and automated reasoning for security protocol analysis (FCS-ARSPA '06). 129
• 
  Octavian Udrea, Cristian Lumezanu, Jeffrey S. Foster:
  Rule-based static analysis of network protocol implementations. 130-157
• 
  Chamseddine Talhi, Nadia Tawbi, Mourad Debbabi:
  Execution monitoring enforcement under memory-limitation constraints. 158-184
• 
  A. Prasad Sistla, Min Zhou:
  Analysis of dynamic policies. 185-212
• 
  Thomas Santen:
  Preservation of probabilistic information flow under refinement. 213-249
• 
  Long Hoang Nguyen, A. W. Roscoe:
  Authenticating ad hoc networks by comparison of short digests. 250-271
• 
  Aybek Mukhamedov, Mark Dermot Ryan:
  Fair multi-party contract signing using private contract signatures. 272-290
• 
  Sebastian Mödersheim:
  On the relationships between models in protocol verification. 291-311
• 
  Stéphanie Delaune, Pascal Lafourcade, Denis Lugiez, Ralf Treinen:
  Symbolic protocol analysis for monoidal equational theories. 312-351
• 
  Yannick Chevalier, Michaël Rusinowitch:
  Hierarchical combination of intruder theories. 352-377
• 
  Konstantinos Chatzikokolakis, Catuscia Palamidessi, Prakash Panangaden:
  Anonymity protocols as noisy channels. 378-401
• 
  Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay, Christopher Walstad:
  Breaking and fixing public-key Kerberos. 402-424
• 
  Suzana Andova, Cas J. F. Cremers, Kristian Gjøsteen, Sjouke Mauw, Stig Fr. Mjølsnes, Sasa Radomirovic:
  A framework for compositional verification of security protocols. 425-459
• 
  Chiara Braghin, Agostino Cortesi, Riccardo Focardi:
  Information flow security in Boundary Ambients. 460-489

Volume 206, Number 5, May 2008

Special Issue: The 17th International Conference on Concurrency Theory (CONCUR 2006)

• 
  Christel Baier, Holger Hermanns:
  Special issue: CONCUR 2006. 491

Special Issue Articles

• 
  Taolue Chen, Wan Fokkink, Bas Luttik, Sumit Nain:
  On finite alphabets and infinite bases. 492-519
• 
  Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera:
  Reachability in recursive Markov decision processes. 520-537

Regular Issue Articles

• 
  Sven Kosub, Klaus W. Wagner:
  The boolean hierarchy of NP-partitions. 538-568
• 
  Frank Schulz:
  Trees with exponentially growing costs. 569-578
• 
  Ullrich Hustadt, Boris Motik, Ulrike Sattler:
  Deciding expressive description logics in the framework of resolution. 579-601
• 
  György Dósa, Leah Epstein:
  Preemptive scheduling on a small number of hierarchical machines. 602-619
• 
  Francesco Ranzato, Francesco Tapparo:
  Generalizing the Paige-Tarjan algorithm by abstract interpretation. 620-651
• 
  Salvador Lucas, José Meseguer:
  Termination of just/fair computations in term rewriting. 652-675
• 
  Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodia:
  Graph connectivity, partial words, and a theorem of Fine and Wilf. 676-693
• 
  Ganesh Baliga, John Case, Wolfgang Merkle, Frank Stephan, Rolf Wiehagen:
  When unlearning helps. 694-709

Volume 206, Number 6, June 2008

• 
  Adrian Francalanza, Matthew Hennessy:
  A theory of system behaviour in the presence of node and link failure. 711-759
• 
  Judy Goldsmith, Matthias Hagen, Martin Mundhenk:
  Complexity of DNF minimization and isomorphism testing for monotone formulas. 760-775
• 
  Sanjay Jain, Frank Stephan:
  Learning in Friedberg numberings. 776-790

Volume 206, Number 7, July 2008

• 
  Shih Ping Tung:
  Computational complexity of sentences over fields. 791-805
• 
  Wim Martens, Frank Neven, Marc Gyssens:
  Typechecking top-down XML transformations: Fixed input or output schemas. 806-827
• 
  Biing-Feng Wang, Tzu-Chin Lin, Chien-Hsin Lin, Shan-Chyun Ku:
  Finding the conditional location of a median path on a tree. 828-839
• 
  Dilian Gurov, Marieke Huisman, Christoph Sprenger:
  Compositional verification of sequential programs with procedures. 840-868
• 
  Paolo Baldan, Andrea Corradini, Barbara König:
  A framework for the verification of infinite-state graph transformation systems. 869-907
• 
  Leslie Ann Goldberg, Mark Jerrum:
  Inapproximability of the Tutte polynomial. 908-929

Volume 206, Number 8, August 2008

• 
  Daniele Gorla:
  Comparing communication primitives via their relative expressive power. 931-952
• 
  Jinjin Zhang, Zhaohui Zhu:
  Characterize branching distance in terms of (eta, alpha)-bisimilarity. 953-965
• 
  Jirí Adámek, Stefan Milius, Jiri Velebil:
  Bases for parametrized iterativity. 966-1002
• 
  José R. Correa, Leah Epstein:
  Bin packing with controllable item sizes. 1003-1016

Volume 206, Numbers 9-10, September - October 2008

• 
  Remco Loos, Carlos Martín-Vide:
  1st International Conference on Language and Automata Theory and Applications (LATA 2007). 1017
• 
  Nissim Francez, Michael Kaminski:
  Commutation-augmented pregroup grammars and push-down automata with cancellation. 1018-1032
• 
  Helmut Jürgensen:
  Synchronization. 1033-1044
• 
  Franz Baader, Jan Hladik, Rafael Peñaloza:
  Automata can show PSpace results for description logics. 1045-1056
• 
  Francine Blanchet-Sadri, Kevin Corcoran, Jenell Nyberg:
  Periodicity properties on partial words. 1057-1064
• 
  Olivier Bodini, Thomas Fernique, Eric Rémila:
  A characterization of flip-accessibility for rhombus tilings of the whole plane. 1065-1073
• 
  Paolo Boldi, Violetta Lonati, Roberto Radicioni, Massimo Santini:
  The number of convex permutominoes. 1074-1083
• 
  Benedikt Bollig, Dietrich Kuske:
  Muller message-passing automata and logics. 1084-1094
• 
  Jürgen Dassow, Henning Fernau:
  Comparison of some descriptional complexities of 0L systems obtained by a unifying approach. 1095-1103
• 
  Pietro di Lena, Luciano Margara:
  Computational complexity of dynamical systems: The case of cellular automata. 1104-1116
• 
  Yo-Sub Han, Derick Wood:
  Generalizations of 1-deterministic regular languages. 1117-1125
• 
  Miklós Krész:
  Soliton automata with constant external edges. 1126-1141
• 
  Martin Kutrib, Andreas Malcher:
  Fast reversible language recognition using cellular automata. 1142-1151
• 
  Martin Kutrib, Jens Reimann:
  Succinct description of regular languages by weak restarting automata. 1152-1160
• 
  Salvatore La Torre, Margherita Napoli, Mimmo Parente, Gennaro Parlato:
  Verification of scope-dependent hierarchical state machines. 1161-1177
• 
  Guangwu Liu, Carlos Martín-Vide, Arto Salomaa, Sheng Yu:
  State complexity of basic language operations combined with reversal. 1178-1186
• 
  Andreas Maletti:
  Compositions of extended top-down tree transducers. 1187-1196
• 
  Pavel V. Martugin:
  A series of slowly synchronizing automata with a zero state over a small alphabet. 1197-1203
• 
  Hartmut Messerschmidt, Friedrich Otto:
  On determinism versus nondeterminism for restarting automata. 1204-1218
• 
  Christos Nomikos, Panos Rondogiannis:
  Locally stratified Boolean grammars. 1219-1233
• 
  Alexander Okhotin:
  Unambiguous Boolean grammars. 1234-1247
• 
  Ralf Stiebe:
  Slender Siromoney matrix languages. 1248-1258

Volume 206, Number 11, November 2008

• 
  Petr Jancar:
  Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm. 1259-1263
• 
  Miroslav Chlebík, Janka Chlebíková:
  Approximation hardness of dominating set problems in bounded degree graphs. 1264-1275
• 
  Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
  Tree exploration with advice. 1276-1287
• 
  Ruo-Wei Hung:
  Optimal vertex ranking of block graphs. 1288-1302
• 
  Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette:
  The Minimum Substring Cover problem. 1303-1312
• 
  Sharon Shoham, Orna Grumberg:
  3-Valued abstraction: More precision at less cost. 1313-1333
• 
  Amos Israeli, Dror Rawitz, Oran Sharon:
  On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems. 1334-1345
• 
  Ion Petre, Vladimir Rogojin:
  Decision problem for shuffled genes. 1346-1352
• 
  Paul Bell, Igor Potapov:
  Reachability problems in quaternion matrix and rotation semigroups. 1353-1361
• 
  Yohji Akama, Thomas Zeugmann:
  Consistent and coherent learning with delta-delay. 1362-1374

Volume 206, Number 12, December 2008

• 
  Hayato Takahashi:
  On a definition of random sequences with respect to conditional probability. 1375-1382
• 
  Pierre Fraigniaud, Nicolas Nisse:
  Monotony properties of connected visible graph searching. 1383-1393
• 
  Alberto Casagrande, Carla Piazza, Alberto Policriti, Bud Mishra:
  Inclusion dynamics hybrid automata. 1394-1424
• 
  Yoram Hirshfeld, Alexander Moshe Rabinovich:
  Decidable metric logics. 1425-1442
• 
  Giorgi Japaridze:
  Sequential operators in computability logic. 1443-1475
• 
  Ernst-Erich Doberkat:
  Erratum and Addendum: Eilenberg-Moore algebras for stochastic relations. 1476-1484