no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A cartesian closed category in Martin-Löf's intuitionistic type theory
|
Valentini, Silvio |
|
2003 |
290 |
1 |
p. 189-219 31 p. |
article |
2 |
A category of compositional domain-models for separable Stone spaces
|
Alessi, Fabio |
|
2003 |
290 |
1 |
p. 599-635 37 p. |
article |
3 |
A comparison of Statecharts step semantics
|
Maggiolo-Schettini, Andrea |
|
2003 |
290 |
1 |
p. 465-498 34 p. |
article |
4 |
A full continuous model of polymorphism
|
Barbanera, Franco |
|
2003 |
290 |
1 |
p. 407-428 22 p. |
article |
5 |
An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations
|
Gori, Roberta |
|
2003 |
290 |
1 |
p. 863-936 74 p. |
article |
6 |
An algebraic model of observable properties in distributed systems
|
Bernardinello, Luca |
|
2003 |
290 |
1 |
p. 637-668 32 p. |
article |
7 |
Analysis of security protocols as open systems
|
Martinelli, Fabio |
|
2003 |
290 |
1 |
p. 1057-1106 50 p. |
article |
8 |
A representation theorem for recovering contraction relations satisfying wci
|
Zhu, Zhaohui |
|
2003 |
290 |
1 |
p. 545-564 20 p. |
article |
9 |
A syntactical proof of the Marriage Lemma
|
Coquand, Thierry |
|
2003 |
290 |
1 |
p. 1107-1113 7 p. |
article |
10 |
A type system for JVM threads
|
Laneve, Cosimo |
|
2003 |
290 |
1 |
p. 741-778 38 p. |
article |
11 |
Axiomatization of frequent itemsets
|
Calders, T. |
|
2003 |
290 |
1 |
p. 669-693 25 p. |
article |
12 |
Bounded time-stamping in message-passing systems
|
Mukund, Madhavan |
|
2003 |
290 |
1 |
p. 221-239 19 p. |
article |
13 |
Confluency and strong normalizability of call-by-value λμ-calculus
|
Nakazawa, Koji |
|
2003 |
290 |
1 |
p. 429-463 35 p. |
article |
14 |
Correctness of substring-preprocessing in Boyer–Moore's pattern matching algorithm
|
Stomp, Frank |
|
2003 |
290 |
1 |
p. 59-78 20 p. |
article |
15 |
Discrete time generative–reactive probabilistic processes with different advancing speeds
|
Bravetti, M. |
|
2003 |
290 |
1 |
p. 355-406 52 p. |
article |
16 |
Editorial board
|
|
|
2003 |
290 |
1 |
p. v-ix nvt p. |
article |
17 |
Equivalence of conservative, free, linear program schemas is decidable
|
Laurence, Michael R. |
|
2003 |
290 |
1 |
p. 831-862 32 p. |
article |
18 |
Explicit versus implicit representations of subsets of the Herbrand universe
|
Pichler, Reinhard |
|
2003 |
290 |
1 |
p. 1021-1056 36 p. |
article |
19 |
Hybrid action systems
|
Rönkkö, Mauno |
|
2003 |
290 |
1 |
p. 937-973 37 p. |
article |
20 |
Hybrid diagrams
|
de Alfaro, Luca |
|
2003 |
290 |
1 |
p. 565-597 33 p. |
article |
21 |
Model checking of systems with many identical timed processes
|
Abdulla, Parosh Aziz |
|
2003 |
290 |
1 |
p. 241-264 24 p. |
article |
22 |
Normalization, approximation, and semantics for combinator systems
|
van Bakel, Steffen |
|
2003 |
290 |
1 |
p. 975-1019 45 p. |
article |
23 |
On infinite transition graphs having a decidable monadic theory
|
Caucal, Didier |
|
2003 |
290 |
1 |
p. 79-115 37 p. |
article |
24 |
On the symbolic reduction of processes with cryptographic functions
|
Amadio, Roberto M. |
|
2003 |
290 |
1 |
p. 695-740 46 p. |
article |
25 |
Parsing as abstract interpretation of grammar semantics
|
Cousot, Patrick |
|
2003 |
290 |
1 |
p. 531-544 14 p. |
article |
26 |
Performance measure sensitive congruences for Markovian process algebras
|
Bernardo, Marco |
|
2003 |
290 |
1 |
p. 117-160 44 p. |
article |
27 |
Polarized proof-nets and λμ-calculus
|
Laurent, Olivier |
|
2003 |
290 |
1 |
p. 161-188 28 p. |
article |
28 |
Relating defeasible and normal logic programming through transformation properties
|
Chesñevar, Carlos Iván |
|
2003 |
290 |
1 |
p. 499-529 31 p. |
article |
29 |
Relaxed models for rewriting logic
|
Lucanu, Dorel |
|
2003 |
290 |
1 |
p. 265-289 25 p. |
article |
30 |
Trade-off results for connection management
|
Mavronicolas, Marios |
|
2003 |
290 |
1 |
p. 1-57 57 p. |
article |
31 |
Understanding the mismatch combinator in chi calculus
|
Fu, Yuxi |
|
2003 |
290 |
1 |
p. 779-830 52 p. |
article |
32 |
Unions of non-disjoint theories and combinations of satisfiability procedures
|
Tinelli, Cesare |
|
2003 |
290 |
1 |
p. 291-353 63 p. |
article |