Volume 300; Issue 1-3

Theoretical Computer Science

Volume 300; Issue 1-3
1

Presheaf models for CCS-like languages

Year:
2003
Language:
english
File:
PDF, 450 KB
english, 2003
2

A new framework for declarative programming

Year:
2003
Language:
english
File:
PDF, 594 KB
english, 2003
3

On the non-termination of MDG-based abstract state enumeration

Year:
2003
Language:
english
File:
PDF, 252 KB
english, 2003
4

Induction in the Timed Interval Calculus

Year:
2003
Language:
english
File:
PDF, 378 KB
english, 2003
5

Intersection of finitely generated congruences over term algebra

Year:
2003
Language:
english
File:
PDF, 350 KB
english, 2003
9

Automata over continuous time

Year:
2003
Language:
english
File:
PDF, 384 KB
english, 2003
10

A new proof-theoretic proof of the independence of Kirby–Paris’ Hydra Theorem

Year:
2003
Language:
english
File:
PDF, 370 KB
english, 2003
11

Typing correspondence assertions for communication protocols

Year:
2003
Language:
english
File:
PDF, 329 KB
english, 2003
12

The power of reachability testing for timed automata

Year:
2003
Language:
english
File:
PDF, 824 KB
english, 2003
14

Decidability results for primitive recursive algorithms

Year:
2003
Language:
english
File:
PDF, 360 KB
english, 2003
15

Editorial board v-ix

Year:
2003
Language:
english
File:
PDF, 54 KB
english, 2003
16

Author index

Year:
2003
Language:
english
File:
PDF, 67 KB
english, 2003
17

Master index

Year:
2003
Language:
english
File:
PDF, 147 KB
english, 2003