nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Absolute versus Relative Time in Process Algebras
|
Corradini, Flavio |
|
2000 |
|
1-2 |
p. 122-172 51 p. |
artikel |
2 |
A compositional proof system on a category of labelled transition systems
|
Winskel, Glynn |
|
1990 |
|
1-2 |
p. 2-57 56 p. |
artikel |
3 |
A Lattice-Based Public-Key Cryptosystem
|
Cai, Jin-Yi |
|
1999 |
|
1-2 |
p. 17-31 15 p. |
artikel |
4 |
Algorithmic Analysis of Programs with Well Quasi-ordered Domains
|
Abdulla, Parosh Aziz |
|
2000 |
|
1-2 |
p. 109-127 19 p. |
artikel |
5 |
Almost Perfect Nonlinear Power Functions on GF(2 n ): The Niho Case
|
Dobbertin, Hans |
|
1999 |
|
1-2 |
p. 57-72 16 p. |
artikel |
6 |
A logic for reasoning about probabilities
|
Fagin, Ronald |
|
1990 |
|
1-2 |
p. 78-128 51 p. |
artikel |
7 |
A modest model of records, inheritance, and bounded quantification
|
Bruce, Kim B. |
|
1990 |
|
1-2 |
p. 196-240 45 p. |
artikel |
8 |
An algebra and a logic for NC 1
|
Compton, Kevin J. |
|
1990 |
|
1-2 |
p. 241-263 23 p. |
artikel |
9 |
An Algorithm for the k-Error Linear Complexity of Sequences over GF(p m ) with Period pn , p a Prime
|
Kaida, Takayasu |
|
1999 |
|
1-2 |
p. 134-147 14 p. |
artikel |
10 |
An Extension of System F with Subtyping
|
Cardelli, L. |
|
1994 |
|
1-2 |
p. 4-56 53 p. |
artikel |
11 |
An Until Hierarchy and Other Applications of an Ehrenfeucht–Fraı̈ssé Game for Temporal Logic
|
Etessami, Kousha |
|
2000 |
|
1-2 |
p. 88-108 21 p. |
artikel |
12 |
A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
|
Gulwani, Sumit |
|
2005 |
|
1-2 |
p. 107-131 25 p. |
artikel |
13 |
A Semantics for Static Type Inference
|
Plotkin, G. |
|
1994 |
|
1-2 |
p. 256-299 44 p. |
artikel |
14 |
A Semantics for Static Type Inference in a Nondeterministic Language
|
Abadi, M. |
|
1994 |
|
1-2 |
p. 300-306 7 p. |
artikel |
15 |
A Short Biography of Arto Salomaa
|
|
|
1999 |
|
1-2 |
p. 2-4 3 p. |
artikel |
16 |
A Type Inference Algorithm for a Stratified Polymorphic Type Discipline
|
Giannini, P. |
|
1994 |
|
1-2 |
p. 115-173 59 p. |
artikel |
17 |
A Uniform Procedure for Converting Matrix Proofs into Sequent-Style Systems
|
Kreitz, Christoph |
|
2000 |
|
1-2 |
p. 226-254 29 p. |
artikel |
18 |
Author Index for Volume 162
|
|
|
2000 |
|
1-2 |
p. 265- 1 p. |
artikel |
19 |
Author Index for Volume 109
|
|
|
1994 |
|
1-2 |
p. 307- 1 p. |
artikel |
20 |
Author Index for Volume 159
|
|
|
2000 |
|
1-2 |
p. 187- 1 p. |
artikel |
21 |
Author Index for Volume 156
|
|
|
2000 |
|
1-2 |
p. 386- 1 p. |
artikel |
22 |
Author Index for Volume 157
|
|
|
2000 |
|
1-2 |
p. 236- 1 p. |
artikel |
23 |
Author Index for Volume 155
|
|
|
1999 |
|
1-2 |
p. 202- 1 p. |
artikel |
24 |
Author index for volume 87
|
|
|
1990 |
|
1-2 |
p. 339- 1 p. |
artikel |
25 |
Author Index for Volume 151
|
|
|
1999 |
|
1-2 |
p. 173- 1 p. |
artikel |
26 |
Author Index for Volume 160
|
|
|
2000 |
|
1-2 |
p. 189- 1 p. |
artikel |
27 |
Automatic Acquisition of Search Control Knowledge from Multiple Proof Attempts
|
Denzinger, Jörg |
|
2000 |
|
1-2 |
p. 59-79 21 p. |
artikel |
28 |
Automating the dependency pair method
|
Hirokawa, Nao |
|
2005 |
|
1-2 |
p. 172-199 28 p. |
artikel |
29 |
A well-structured framework for analysing petri net extensions
|
Finkel, Alain |
|
2004 |
|
1-2 |
p. 1-29 29 p. |
artikel |
30 |
Binary Sequences of Period 2 m −1 with Large Linear Complexity
|
Helleseth, T |
|
1999 |
|
1-2 |
p. 73-91 19 p. |
artikel |
31 |
Bisimilarity in Term Graph Rewriting
|
Ariola, Zena M. |
|
2000 |
|
1-2 |
p. 2-24 23 p. |
artikel |
32 |
Bisimilarity of Open Terms
|
Rensink, Arend |
|
2000 |
|
1-2 |
p. 345-385 41 p. |
artikel |
33 |
Building Decision Procedures for Modal Logics from Propositional Decision Procedures: The Case Study of Modal K(m)
|
Giunchiglia, Fausto |
|
2000 |
|
1-2 |
p. 158-178 21 p. |
artikel |
34 |
Can LCF be topped? Flat lattice models of typed λ-calculus
|
Bloom, Bard |
|
1990 |
|
1-2 |
p. 264-301 38 p. |
artikel |
35 |
Canonization for disjoint unions of theories
|
Krstić, Sava |
|
2005 |
|
1-2 |
p. 87-106 20 p. |
artikel |
36 |
Combining Deduction and Model Checking into Tableaux and Algorithms for Converse-PDL
|
De Giacomo, Giuseppe |
|
2000 |
|
1-2 |
p. 117-137 21 p. |
artikel |
37 |
Comparing Object Encodings
|
Bruce, Kim B. |
|
1999 |
|
1-2 |
p. 108-133 26 p. |
artikel |
38 |
Completeness of Kozen's Axiomatisation of the Propositional μ-Calculus
|
Walukiewicz, Igor |
|
2000 |
|
1-2 |
p. 142-182 41 p. |
artikel |
39 |
Complexity of Nilpotent Unification and Matching Problems
|
Guo, Qing |
|
2000 |
|
1-2 |
p. 3-23 21 p. |
artikel |
40 |
Contracts, Games, and Refinement
|
Back, Ralph-Johan |
|
2000 |
|
1-2 |
p. 25-45 21 p. |
artikel |
41 |
Counting Modulo Quantifiers on Finite Structures
|
Nurmonen, Juha |
|
2000 |
|
1-2 |
p. 62-87 26 p. |
artikel |
42 |
Decidability and Confluence of βη top≤ Reduction in F ≤
|
Curien, P.L. |
|
1994 |
|
1-2 |
p. 57-114 58 p. |
artikel |
43 |
Descendants and Origins in Term Rewriting
|
Bethke, Inge |
|
2000 |
|
1-2 |
p. 59-124 66 p. |
artikel |
44 |
Editorial Board
|
|
|
2005 |
|
1-2 |
p. CO2- 1 p. |
artikel |
45 |
Editorial board
|
|
|
2005 |
|
1-2 |
p. CO2- 1 p. |
artikel |
46 |
Editorial board
|
|
|
2005 |
|
1-2 |
p. i- 1 p. |
artikel |
47 |
Editorial Board
|
|
|
2005 |
|
1-2 |
p. i- 1 p. |
artikel |
48 |
Editorial Board
|
|
|
2004 |
|
1-2 |
p. CO2- 1 p. |
artikel |
49 |
Editorial Board
|
|
|
1990 |
|
1-2 |
p. i- 1 p. |
artikel |
50 |
Editorial Board (continued)
|
|
|
2004 |
|
1-2 |
p. i- 1 p. |
artikel |
51 |
EDITOR'S FOREWORD
|
|
|
2000 |
|
1-2 |
p. 1- 1 p. |
artikel |
52 |
Efficient instance retrieval with standard and relational path indexing
|
Riazanov, Alexandre |
|
2005 |
|
1-2 |
p. 228-252 25 p. |
artikel |
53 |
Efficient Model Generation through Compilation
|
Schütz, Heribert |
|
2000 |
|
1-2 |
p. 138-157 20 p. |
artikel |
54 |
Equality between Functionals in the Presence of Coproducts
|
Dougherty, Daniel J. |
|
2000 |
|
1-2 |
p. 52-83 32 p. |
artikel |
55 |
Expressive Completeness of Duration Calculus
|
Rabinovich, Alexander |
|
2000 |
|
1-2 |
p. 320-344 25 p. |
artikel |
56 |
From Term Models to Domains
|
Phoa, W. |
|
1994 |
|
1-2 |
p. 211-255 45 p. |
artikel |
57 |
Function Field Sieve Method for Discrete Logarithms over Finite Fields
|
Adleman, Leonard M. |
|
1999 |
|
1-2 |
p. 5-16 12 p. |
artikel |
58 |
Further Results on Asymmetric Authentication Schemes
|
Johansson, Thomas |
|
1999 |
|
1-2 |
p. 100-133 34 p. |
artikel |
59 |
Games and Full Abstraction for FPC
|
McCusker, Guy |
|
2000 |
|
1-2 |
p. 1-61 61 p. |
artikel |
60 |
Higher Order Unification via Explicit Substitutions
|
Dowek, Gilles |
|
2000 |
|
1-2 |
p. 183-235 53 p. |
artikel |
61 |
Induction=I-Axiomatization+First-Order Consistency
|
Comon, Hubert |
|
2000 |
|
1-2 |
p. 151-186 36 p. |
artikel |
62 |
Integration in Real PCF
|
Edalat, Abbas |
|
2000 |
|
1-2 |
p. 128-166 39 p. |
artikel |
63 |
International-Conference on Theoretical Aspects of Computer Software - Preface
|
Dezaniciancaglini, M. |
|
1994 |
|
1-2 |
p. 1-3 3 p. |
artikel |
64 |
INTRODUCTION
|
Slaney, John |
|
2000 |
|
1-2 |
p. 1-2 2 p. |
artikel |
65 |
0–1 Laws and decision problems for fragments of second-order logic
|
Kolaitis, Phokion G. |
|
1990 |
|
1-2 |
p. 302-338 37 p. |
artikel |
66 |
Local temporal logic is expressively complete for cograph dependence alphabets
|
Diekert, Volker |
|
2004 |
|
1-2 |
p. 30-52 23 p. |
artikel |
67 |
Mechanising first-order temporal resolution
|
Konev, Boris |
|
2005 |
|
1-2 |
p. 55-86 32 p. |
artikel |
68 |
Minimal-change integrity maintenance using tuple deletions
|
Chomicki, Jan |
|
2005 |
|
1-2 |
p. 90-121 32 p. |
artikel |
69 |
Minimizing the maximum starting time on-line
|
Epstein, Leah |
|
2004 |
|
1-2 |
p. 53-65 13 p. |
artikel |
70 |
Model-Checking of Correctness Conditions for Concurrent Objects
|
Alur, Rajeev |
|
2000 |
|
1-2 |
p. 167-188 22 p. |
artikel |
71 |
Multireceiver Authentication Codes: Models, Bounds, Constructions, and Extensions
|
Safavi-Naini, R. |
|
1999 |
|
1-2 |
p. 148-172 25 p. |
artikel |
72 |
On Cryptographic Propagation Criteria for Boolean Functions
|
Carlet, Claude |
|
1999 |
|
1-2 |
p. 32-56 25 p. |
artikel |
73 |
On Terminating Lemma Speculations
|
Walther, Christoph |
|
2000 |
|
1-2 |
p. 96-116 21 p. |
artikel |
74 |
On the Expressiveness of Linda Coordination Primitives
|
Busi, Nadia |
|
2000 |
|
1-2 |
p. 90-121 32 p. |
artikel |
75 |
On the Undecidability of Second-Order Unification
|
Levy, Jordi |
|
2000 |
|
1-2 |
p. 125-150 26 p. |
artikel |
76 |
Optimal Axiomatizations of Finitely Valued Logics
|
Salzer, Gernot |
|
2000 |
|
1-2 |
p. 185-205 21 p. |
artikel |
77 |
Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic
|
Müller, Martin |
|
2000 |
|
1-2 |
p. 22-58 37 p. |
artikel |
78 |
Papers to Appear in Forthcoming Issues
|
|
|
2000 |
|
1-2 |
p. 266- 1 p. |
artikel |
79 |
Papers to Appear in Forthcoming Issues
|
|
|
2000 |
|
1-2 |
p. 188- 1 p. |
artikel |
80 |
Papers to Appear in Forthcoming Issues
|
|
|
2000 |
|
1-2 |
p. 190- 1 p. |
artikel |
81 |
Partitioning Methods for Satisfiability Testing on Large Formulas
|
Park, Tai Joon |
|
2000 |
|
1-2 |
p. 179-184 6 p. |
artikel |
82 |
Practically Useful Variants of Definitional Translations to Normal Form
|
Egly, Uwe |
|
2000 |
|
1-2 |
p. 255-264 10 p. |
artikel |
83 |
PREFACE
|
Palamidessi, Catuscia |
|
2000 |
|
1-2 |
p. 1- 1 p. |
artikel |
84 |
PREFACE
|
Ito, Takayasu |
|
1999 |
|
1-2 |
p. 1-2 2 p. |
artikel |
85 |
PREFACE
|
Nipkow, Tobias |
|
2000 |
|
1-2 |
p. 1- 1 p. |
artikel |
86 |
PREFACE
|
|
|
1999 |
|
1-2 |
p. 1- 1 p. |
artikel |
87 |
Preface
|
Gurevich, Yuri |
|
1990 |
|
1-2 |
p. 1- 1 p. |
artikel |
88 |
Priorities in process algebras
|
Cleaveland, Rance |
|
1990 |
|
1-2 |
p. 58-77 20 p. |
artikel |
89 |
Process Rewrite Systems
|
Mayr, Richard |
|
2000 |
|
1-2 |
p. 264-286 23 p. |
artikel |
90 |
Proving pointer programs in higher-order logic
|
Mehta, Farhad |
|
2005 |
|
1-2 |
p. 200-227 28 p. |
artikel |
91 |
Relational Interpretations of Recursive Types in an Operational Setting
|
Birkedal, Lars |
|
1999 |
|
1-2 |
p. 3-63 61 p. |
artikel |
92 |
Remarks on Thatte’s transformation of term rewriting systems
|
Luttik, Bas |
|
2004 |
|
1-2 |
p. 66-87 22 p. |
artikel |
93 |
Rigid E-unification: NP-completeness and applications to equational matings
|
Gallier, Jean |
|
1990 |
|
1-2 |
p. 129-195 67 p. |
artikel |
94 |
Semi-Explicit First-Class Polymorphism for ML
|
Garrigue, Jacques |
|
1999 |
|
1-2 |
p. 134-169 36 p. |
artikel |
95 |
Sequentiality, Monadic Second-Order Logic and Tree Automata
|
Comon, Hubert |
|
2000 |
|
1-2 |
p. 25-51 27 p. |
artikel |
96 |
Simulating perfect channels with probabilistic lossy channels
|
Abdulla, Parosh |
|
2005 |
|
1-2 |
p. 22-40 19 p. |
artikel |
97 |
Singleton, Union, and Intersection Types for Program Extraction
|
Hayashi, S. |
|
1994 |
|
1-2 |
p. 174-210 37 p. |
artikel |
98 |
Some Computational Problems of Cryptographic Significance Concerning Elliptic Curves over Rings
|
Huang, Ming-Deh A. |
|
1999 |
|
1-2 |
p. 92-99 8 p. |
artikel |
99 |
Specification in CTL+Past for Verification in CTL
|
Laroussinie, F. |
|
2000 |
|
1-2 |
p. 236-263 28 p. |
artikel |
100 |
Structural Cut Elimination
|
Pfenning, Frank |
|
2000 |
|
1-2 |
p. 84-141 58 p. |
artikel |
101 |
Structuring Metatheory on Inductive Definitions
|
Basin, David |
|
2000 |
|
1-2 |
p. 80-95 16 p. |
artikel |
102 |
Superposition with equivalence reasoning and delayed clause normal form transformation
|
Ganzinger, Harald |
|
2005 |
|
1-2 |
p. 3-23 21 p. |
artikel |
103 |
The Achievement of Knowledge Bases by Cycle Search
|
Roussel, Olivier |
|
2000 |
|
1-2 |
p. 43-58 16 p. |
artikel |
104 |
The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
|
Niemann, Gundula |
|
2005 |
|
1-2 |
p. 1-21 21 p. |
artikel |
105 |
The Combinator S
|
Waldmann, Johannes |
|
2000 |
|
1-2 |
p. 2-21 20 p. |
artikel |
106 |
The complexity of finite model reasoning in description logics
|
Lutz, Carsten |
|
2005 |
|
1-2 |
p. 132-171 40 p. |
artikel |
107 |
The equational theory of regular words
|
Bloom, Stephen L. |
|
2005 |
|
1-2 |
p. 55-89 35 p. |
artikel |
108 |
19th International Conference on Automated Deduction (CADE-19)
|
Baader, Franz |
|
2005 |
|
1-2 |
p. 1-2 2 p. |
artikel |
109 |
Tile Formats for Located and Mobile Systems
|
Ferrari, GianLuigi |
|
2000 |
|
1-2 |
p. 173-235 63 p. |
artikel |
110 |
Toward an Infinitary Logic of Domains: Abramsky Logic for Transition Systems
|
Bonsangue, Marcello M. |
|
1999 |
|
1-2 |
p. 170-201 32 p. |
artikel |
111 |
Transitivity in coercive subtyping
|
Luo, Zhaohui |
|
2005 |
|
1-2 |
p. 122-144 23 p. |
artikel |
112 |
Translation of resolution proofs into short first-order proofs without choice axioms
|
de Nivelle, Hans |
|
2005 |
|
1-2 |
p. 24-54 31 p. |
artikel |
113 |
Tree Canonization and Transitive Closure
|
Etessami, Kousha |
|
2000 |
|
1-2 |
p. 2-24 23 p. |
artikel |
114 |
Type-Directed Specialization of Polymorphism
|
Ohori, Atsushi |
|
1999 |
|
1-2 |
p. 64-107 44 p. |
artikel |
115 |
Unification Algorithms Cannot Be Combined in Polynomial Time
|
Hermann, Miki |
|
2000 |
|
1-2 |
p. 24-42 19 p. |
artikel |
116 |
Using Tableaux to Automate the Lambek and Other Categorial Calculi
|
Luz, Saturnino F. |
|
2000 |
|
1-2 |
p. 206-225 20 p. |
artikel |
117 |
Volume Author Index
|
|
|
2005 |
|
1-2 |
p. 145- 1 p. |
artikel |
118 |
Volume Author Index
|
|
|
2005 |
|
1-2 |
p. 253- 1 p. |
artikel |
119 |
Volume Author Index
|
|
|
2004 |
|
1-2 |
p. 88- 1 p. |
artikel |
120 |
Weakly useful sequences
|
Fenner, Stephen A. |
|
2005 |
|
1-2 |
p. 41-54 14 p. |
artikel |
121 |
What is a “Good” Encoding of Guarded Choice?
|
Nestmann, Uwe |
|
2000 |
|
1-2 |
p. 287-319 33 p. |
artikel |
122 |
Zero-Safe Nets: Comparing the Collective and Individual Token Approaches
|
Bruni, Roberto |
|
2000 |
|
1-2 |
p. 46-89 44 p. |
artikel |