Information and Computation, Volume 208

Volume 208, Number 1, January 2010

• Francesco Ranzato, Francesco Tapparo:
  An efficient simulation algorithm based on abstract interpretation. 1-22
  
• Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas:
  Effective symbolic dynamics, random points, statistical behavior, complexity and entropy. 23-41
  
• Sibylle B. Fröschle, Petr Jancar, Slawomir Lasota, Zdenek Sawa:
  Non-interleaving bisimulation equivalences on Basic Parallel Processes. 42-62
  
• Oliver Schulte, Wei Luo, Russell Greiner:
  Mind change optimal learning of Bayes net structure from dependency and independency data. 63-82
  
• Dominik D. Freydenberger, Daniel Reidenbach:
  Bad news on decision problems for patterns. 83-96
  

Volume 208, Number 2, February 2010

• Patricia Bouyer, Fabrice Chevalier, Nicolas Markey:
  On the expressiveness of TPTL and MTL. 97-116
  
• Sebastian Nanz, Flemming Nielson, Hanne Riis Nielson:
  Static analysis of topology-dependent broadcast networks. 117-139
  
• Guillaume Burel, Claude Kirchner:
  Regaining cut admissibility in deduction modulo using abstract completion. 140-164
  
• Nadja Betzler, Jiong Guo, Rolf Niedermeier:
  Parameterized computational complexity of Dodgson and Young elections. 165-177
  
• Sharon Shoham, Orna Grumberg:
  Compositional verification and 3-valued abstractions join forces. 178-202
  
• Josée Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden:
  Weak bisimulation is sound and complete for pCTL^*. 203-219
  

Volume 208, Number 3, March 2010

• Hsing-Yen Ann, Chang-Biau Yang, Yung-Hsing Peng, Bern-Cherng Liaw:
  Efficient algorithms for the block edit problems. 221-229
  
• Murdoch James Gabbay, Dominic P. Mulligan:
  Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms. 230-258
  
• Hans L. Bodlaender, Arie M. C. A. Koster:
  Treewidth computations I. Upper bounds. 259-275
  
• Matthias Mann, Manfred Schmidt-Schauß:
  Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi. 276-291
  
• Cristian S. Calude, Marius Zimand:
  Algorithmically independent sequences. 292-308
  

Volume 208, Number 4, April 2010

• Asaf Nachmias, Asaf Shapira:
  Testing the expansion of a graph. 309-314
  
• Arie Matsliah, Ofer Strichman:
  Underapproximation for model-checking based on universal circuits. 315-326
  
• Matthew de Brecht, Akihiro Yamamoto:
  Topological properties of concept spaces (full version). 327-340
  
• Selçuk Kavut, Melek Diker Yücel:
  9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class. 341-350
  
• Vikraman Arvind, Partha Mukhopadhyay:
  The ideal membership problem and polynomial identity testing. 351-363
  
• Gábor Bartók, Csaba Szepesvári, Sandra Zilles:
  Models of active learning in group-structured state spaces. 364-384
  
• Viliam Geffert, Carlo Mereghetti, Beatrice Palano:
  More concise representation of regular languages by automata and regular expressions. 385-394
  

Volume 208, Number 5, May 2010

• Daniel Leivant, Ruy J. G. B. de Queiroz:
  Logic, language, information and computation. 395-396
  

• Raffaella Bernardi, Michael Moortgat:
  Continuation semantics for the Lambek-Grishin calculus. 397-416
  
• Ryan Siders:
  On quantifier-rank equivalence between linear orders. 417-432
  
• Thomas Bolander, René Rydhof Hansen:
  Hybrid logical analyses of the ambient calculus. 433-449
  
• Adrian Brasoveanu:
  Structured anaphora to quantifier domains. 450-473
  
• Cristiano Calcagno, Thomas Dinsdale-Young, Philippa Gardner:
  Adjunct elimination in Context Logic for trees. 474-499
  
• Alessandra Carbone:
  A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs. 500-509
  
• Annie Foret:
  A modular and parameterized presentation of pregroup calculus. 510-520
  
• Sven Hartmann, Sebastian Link:
  Numerical constraints on XML data. 521-544
  
• André Hirschowitz, Marco Maggesi:
  Modules over monads and initial semantics. 545-564
  
• Paulo Oliva:
  Functional interpretations of linear and intuitionistic logic. 565-577
  
• Alexandra Silva, Jan J. M. M. Rutten:
  A coinductive calculus of binary trees. 578-593
  
• Kim Solin:
  A sketch of a dynamic epistemic semiring. 594-604
  

Volume 208, Number 6, June 2010

• Luís Caires, Vasco Thudichum Vasconcelos:
  18th International Conference on Concurrency Theory. 605
  

• Thomas Ehrhard, Olivier Laurent:
  Interpreting a finitary pi-calculus in differential interaction nets. 606-633
  
• Michael Mendler, Gerald Lüttgen:
  Is observational congruence on µ-expressions axiomatisable in equational Horn logic? 634-651
  
• Luigi Santocanale:
  A nice labelling for tree-like event structures of degree 3. 652-665
  
• Luca de Alfaro, Pritam Roy:
  Solving games via three-valued abstraction refinement. 666-676
  
• Krishnendu Chatterjee, Thomas A. Henzinger, Nir Piterman:
  Strategy logic. 677-693
  
• Konstantinos Chatzikokolakis, Catuscia Palamidessi:
  Making random choices invisible to the scheduler. 694-715
  
• Gérard Boudol:
  Typing termination in a higher-order concurrent imperative language. 716-736
  

Volume 208, Number 7, July 2010

• Paolo Gentilini, Maurizio Martelli:
  Abstract deduction and inferential models for type theory. 737-771
  
• Antonín Kucera, Richard Mayr:
  On the complexity of checking semantic equivalences between pushdown processes and finite-state processes. 772-796
  
• Paul Gastin, Dietrich Kuske:
  Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces. 797-816
  
• Jan A. Bergstra, C. A. Middelburg:
  A thread calculus with molecular dynamics. 817-844
  
• Gerald Lüttgen, Walter Vogler:
  Ready simulation for concurrency: It's logical! 845-867
  

Volume 208, Number 8, August 2010

• Roberta Gori, Francesca Levi:
  Abstract interpretation based verification of temporal properties for BioAmbients. 869-921
  
• Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas:
  Context-sensitive dependency pairs. 922-968
  
• Luca Breveglieri, Stefano Crespi-Reghizzi, Massimiliano Goldwurm:
  Efficient recognition of trace languages defined by repeat-until loops. 969-981
  
• Juraj Hromkovic, Georg Schnitger:
  On probabilistic pushdown automata. 982-995
  

Volume 208, Number 9, September 2010

• Naijun Zhan, Mila E. Majster-Cederbaum:
  On hierarchically developing reactive systems. 997-1019
  
• Ohad Lipsky, Benny Porat, Ely Porat, B. Riva Shalom, Asaf Tsur:
  String matching with up to k swaps and mismatches. 1020-1030
  
• Daniele Gorla:
  Towards a unified approach to encodability and separation results for process calculi. 1031-1053
  
• Maxime Crochemore, Ely Porat:
  Fast computation of a longest increasing subsequence and application. 1054-1059
  
• Juhani Karhumäki, Michal Kunc, Alexander Okhotin:
  Computational power of two stacks with restricted communication. 1060-1089
  

Volume 208, Number 10, October 2010

• Franck van Breugel, Marsha Chechik:
  19th International Conference on Concurrency Theory. 1091-1092
  

• Martín Abadi, Tim Harris, Katherine F. Moore:
  A model of dynamic separation for transactional memory. 1093-1117
  
• Lucia Acciai, Michele Boreale:
  Spatial and behavioral types in the pi-calculus. 1118-1153
  
• Philippe Darondeau, Blaise Genest, P. S. Thiagarajan, Shaofa Yang:
  Quasi-static scheduling of communicating tasks. 1154-1168
  
• Paolo Baldan, Thomas Chatain, Stefan Haar, Barbara König:
  Unfolding-based diagnosis of systems with an evolving topology. 1169-1192
  
• Petr Jancar, Martin Kot, Zdenek Sawa:
  Complexity of deciding bisimilarity between normed BPA and normed BPP. 1193-1205
  
• Dietmar Berwanger, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, Thomas A. Henzinger:
  Strategy construction for parity games with imperfect information. 1206-1220
  
• Julian Rathke, Pawel Sobocinski:
  Deriving structural labelled transitions for mobile ambients. 1221-1242
  

Volume 208, Number 11, November 2010

• Javier Herranz, Dennis Hofheinz, Eike Kiltz:
  Some (in)sufficient conditions for secure hybrid encryption. 1243-1257
  
• Jean Berstel, Luc Boasson, Olivier Carton, Jean-Eric Pin, Antonio Restivo:
  The expressive power of the shuffle product. 1258-1272
  
• Oscar H. Ibarra:
  On the universe, disjointness, and containment problems for simple machines. 1273-1282
  
• Felix Klaedtke:
  Ehrenfeucht-Fraïssé goes automatic for real addition. 1283-1295
  
• Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari:
  About randomised distributed graph colouring and graph partition algorithms. 1296-1304
  

Volume 208, Number 12, December 2010

• Jirí Adámek, Clemens Kupke:
  Preface. 1305
  
• Jirí Adámek, Stefan Milius, Jiri Velebil:
  Equational properties of iterative monads. 1306-1348
  
• Vincenzo Ciancia, Ugo Montanari:
  Symmetries, local names and dynamic (de)-allocation of names. 1349-1367
  
• Helle Hvid Hansen:
  Subsequential transducers: a coalgebraic perspective. 1368-1397
  
• Clemens Kupke, Jan J. M. M. Rutten:
  Complete sets of cooperations. 1398-1420
  
• Alexander Kurz, Daniela Petrisan:
  Presenting functors on many-sorted varieties and applications. 1421-1446
  
• Dirk Pattinson, Lutz Schröder:
  Cut elimination in coalgebraic logics. 1447-1468
  
• Daniel Schwencke:
  Coequational logic for accessible functors. 1469-1489
  

Last update Thu May 23 18:50:54 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page