Acta Informatica, Volume 32

Volume 32, Number 1, 1995

• Joachim Biskup, Pratul Dublish, Yehoshua Sagiv:
  Optimization of a Subclass of Conjunctive Queries. 1-26
  
• Wlodzimierz Drabent:
  What is Failure? An Approach to Constructive Negation. 27-29
  
• Inman P. de Guzmán, Manuel Ojeda-Aciego, Agustín Valverde:
  A Formal Identification between Tuples and Lists with an Application to List-Arithmetic Categories. 61-78
  
• Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney:
  Parallel Integer Sorting Using Small Operations. 79-92
  

Volume 32, Number 2, 1995

• Wei-Ngan Chin, Masami Hagiya:
  A Transformation Method for Dynamic-Sized Tabulation. 93-115
  
• Janet A. Walz, Gregory F. Johnson:
  Inductive Attribute Grammars: A Basis for Incremental Program Execution. 117-144
  
• Wen-Jing Hsu, Carl V. Page:
  Parallel Tree Contraction and Prefix Computations on a Large Family of Interconnection Topologies. 145-153
  
• Lefteris M. Kirousis, Andreas G. Veneris:
  Efficient Algorithms for Checking the Atomicity of a Run of Read and Write Operations. 155-170
  
• Thomas Eiter:
  Generating Boolean mu-Expressions. 171-187
  

Volume 32, Number 3, 1995

• Ludmila Cherkasova, Rodney R. Howell, Louis E. Rosier:
  Bounded Self-Stabilizing Petri Nets. 189-207
  
• Baudouin Le Charlier, Pascal Van Hentenryck:
  Reexecution in Abstract Interpretation of Prolog. 209-270
  
• Adam L. Buchsbaum, Rajamani Sundar, Robert Endre Tarjan:
  Lazy Structure Sharing for Query Optimization. 255-270
  
• Vashudha Krishnaswamy, John L. Bruno:
  On the Complexity of Concurrency Control Using Semantic Information. 271-284
  
• Alexander Meduna:
  Syntactic Complexity of Scattered Context Grammars. 285-298
  

Volume 32, Number 4, 1995

• Ekkart Kindler:
  Invariants, Composition, and Substitution. 299-312
  
• Raymond R. Devillers:
  S-Invariant Analysis of General Recursive Petri Boxes. 313-345
  
• Cinzia Bernardeschi, Nicoletta De Francesco, Gigliola Vaglini:
  A Petri Nets Semantics for Data Flow Networks. 347-374
  
• Matthew Hennessy, Xinxin Liu:
  A Modal Logic for Message Passing Processes. 375-393
  
• Etsuji Tomita, Kazushi Seino:
  The Extendes Equivalence Problem for a Class of Non-Real-Time Deterministic Pushdowen Automata. 395-413
  

Volume 32, Number 5, 1995

• X. J. Chen, Carlo Montangero:
  Compositional Refinements in Multiple Blackboard Systems. 415-458
  
• Wuu Yang:
  On the Look-Ahead Problem in Lexical Analysis. 459-476
  
• Jean Neraud:
  Detecting Morphic Images of a Word on the Rank of a Pattern. 477-489
  
• Helmut Jürgensen, Ludwig Staiger:
  Local Hausdorff Dimension. 491-507
  

Volume 32, Number 6, 1995

• Matthew Hennessy:
  Concurrent Testing of Processes. 509-543
  
• Ugo Montanari, Francesca Rossi:
  Contextual Nets. 545-596
  
• Sumit Sur, Pradip K. Srimani:
  IEH Graphs. A Novel Generalization of Hypercube Graphs. 597-609
  

Volume 32, Number 7, 1995

• W. Wesley Peterson:
  Variance of Storage Requirements for B+-trees. 611-625
  
• Robert Gold:
  A Compositional Dataflow Semantics for Petri Nets. 627-645
  
• Eric Badouel, Philippe Darondeau:
  Trace Nets and Process Automata. 647-679
  
• Karel Culik II, Peter Rajcáni:
  Iterative Weighted Finite Transductions. 681-703
  

Volume 32, Number 8, 7 November 1995

• Gary T. Leavens, William E. Weihl:
  Specification and Verification of Object-Oriented Programs Using Supertype Abstraction. 705-778
  
• Chongkye Rhee, Y. Daniel Liang:
  Finding a Maximum Matching in a Permutation Graph. 779-792
  

Last update Tue May 21 18:17:53 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page