Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             191 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A computer perspective: Background to the computer age—new edition Zemanek, Heinz
1992
141-142 2 p. 207-209
3 p.
artikel
2 Actors: A model of concurrent computation in distributed systems Wolczko, Mario
1988
141-142 2 p. 212-213
2 p.
artikel
3 Adding mobility to software architectures Lopes, Antónia
2006
141-142 2 p. 114-135
22 p.
artikel
4 A fixed-space program of linear output complexity for the problem of the three vessels Rem, Martin
1982
141-142 2 p. 133-141
9 p.
artikel
5 A formal development of an efficient supercombinator compiler Bird, R.S.
1987
141-142 2 p. 113-137
25 p.
artikel
6 A graph transformation approach to software architecture reconfiguration Wermelinger, Michel
2002
141-142 2 p. 133-155
23 p.
artikel
7 A higher-order implementation of rewriting Paulson, Lawrence
1983
141-142 2 p. 119-149
31 p.
artikel
8 A hoare-like proof system for analysing the computation time of programs Nielson, Hanne Riis
1987
141-142 2 p. 107-136
30 p.
artikel
9 Algebraic approaches Mosses, Peter D.
1988
141-142 2 p. 175-176
2 p.
artikel
10 Algebraic theory of processes Weijland, W.Peter
1989
141-142 2 p. 167-168
2 p.
artikel
11 Algorithms and data structures Wallis, Peter
1989
141-142 2 p. 157-158
2 p.
artikel
12 Alvey—Britain's strategic computing initiative Georghiou, Luke
1991
141-142 2 p. 197-198
2 p.
artikel
13 A method of programming Mili, Ali
1989
141-142 2 p. 165-167
3 p.
artikel
14 An action compiler targeting Standard ML Iversen, Jørgen Bøndergaard
2007
141-142 2 p. 79-94
16 p.
artikel
15 An algorithm for transitive reduction of an acyclic graph Gries, David
1989
141-142 2 p. 151-155
5 p.
artikel
16 An alternative for the implementation of Kruskal's minimal spanning tree algorithm Katajainen, Jyrki
1983
141-142 2 p. 205-216
12 p.
artikel
17 A new approach to Earley's parsing algorithm Kruseman Aretz, F.E.J.
1989
141-142 2 p. 105-121
17 p.
artikel
18 An experimental evaluation of self-managing availability in shared data spaces Russello, Giovanni
2007
141-142 2 p. 246-262
17 p.
artikel
19 An introduction to functional programming through lambda calculus Launchbury, John
1991
141-142 2 p. 198-200
3 p.
artikel
20 An introduction to logic programming through prolog Etalle, Sandro
1999
141-142 2 p. 213-214
2 p.
artikel
21 An object-aware memory architecture Wright, Greg
2006
141-142 2 p. 145-163
19 p.
artikel
22 Application of static analyses for state-space reduction to the microcontroller binary code Schlich, Bastian
2011
141-142 2 p. 100-118
19 p.
artikel
23 A proof system for concurrent ADA programs Gerth, Rob
1984
141-142 2 p. 159-204
46 p.
artikel
24 A refinement calculus for tuple spaces Semini, Laura
1999
141-142 2 p. 79-140
62 p.
artikel
25 A state/event-based model-checking approach for the analysis of abstract system properties ter Beek, Maurice H.
2011
141-142 2 p. 119-135
17 p.
artikel
26 A survey of fault localization techniques in computer networks Steinder, Ma łgorzata
2004
141-142 2 p. 165-194
30 p.
artikel
27 A systematic approach to language constructs for concurrent programs Broy, Manfred
1984
141-142 2 p. 103-139
37 p.
artikel
28 A taxonomy of sublinear multiple keyword pattern matching algorithms Watson, B.W.
1996
141-142 2 p. 85-118
34 p.
artikel
29 Atomizer: A dynamic atomicity checker for multithreaded programs Flanagan, Cormac
2008
141-142 2 p. 89-109
21 p.
artikel
30 A transactional object calculus Jagannathan, Suresh
2005
141-142 2 p. 164-186
23 p.
artikel
31 A unifying framework for structured analysis and design models Knuth, Elod
1992
141-142 2 p. 221-222
2 p.
artikel
32 Authentication and delegation with smart-cards Abadi, M.
1993
141-142 2 p. 93-113
21 p.
artikel
33 Automatic autoprojection of recursive equations with global variables and abstract data types Bondorf, Anders
1991
141-142 2 p. 151-195
45 p.
artikel
34 Automatic binding time analysis for a typed λ-calculus Nielson, Hanne R.
1988
141-142 2 p. 139-176
38 p.
artikel
35 Automatic library migration for the generation of hardware-in-the-loop models Ryssel, Uwe
2012
141-142 2 p. 83-95
13 p.
artikel
36 Automatic recursion engineering of reduction incorporated parsers Johnstone, Adrian
2007
141-142 2 p. 95-110
16 p.
artikel
37 A visual environment for visual languages Bardohl, Roswitha
2002
141-142 2 p. 181-203
23 p.
artikel
38 Balanced trees with removals: an exercise in rewriting and proof Reade, C.M.P.
1992
141-142 2 p. 181-204
24 p.
artikel
39 Basic polymorphic typechecking Cardelli, Luca
1987
141-142 2 p. 147-172
26 p.
artikel
40 Books Apt, KrzysztofR.
1984
141-142 2 p. 211-218
8 p.
artikel
41 Books 1982
141-142 2 p. 153-
1 p.
artikel
42 Brains, machines and mathematics 1988
141-142 2 p. 191-195
5 p.
artikel
43 Communication complexity Buhrman, Harry
1999
141-142 2 p. 215-216
2 p.
artikel
44 Comparative programming languages Lindsey, C.H.
1989
141-142 2 p. 172-173
2 p.
artikel
45 Compared to what? An introduction to the analysis of algorithms van Emde Boas, Peter
1995
141-142 2 p. 183-185
3 p.
artikel
46 Compatibility and inheritance in software architectures Canal, Carlos
2001
141-142 2 p. 105-138
34 p.
artikel
47 Compiling functional languages Harrison, Rachel
1989
141-142 2 p. 164-165
2 p.
artikel
48 Composing atomic features Eugster, Patrick
2006
141-142 2 p. 130-146
17 p.
artikel
49 Compositional design of isochronous systems Talpin, Jean-Pierre
2012
141-142 2 p. 113-128
16 p.
artikel
50 Concepts and realization of a diagram editor generator based on hypergraph transformation Minas, Mark
2002
141-142 2 p. 157-180
24 p.
artikel
51 Concurrent determination of connected components Hesselink, Wim H.
2001
141-142 2 p. 173-194
22 p.
artikel
52 Concurrent program structures Stølen, Ketil
1988
141-142 2 p. 195-196
2 p.
artikel
53 Coordination with multicapabilities Udzir, Nur Izura
2007
141-142 2 p. 205-222
18 p.
artikel
54 Correctness of transformations on register transfers Jongejan, Jan H.
1992
141-142 2 p. 153-169
17 p.
artikel
55 Customizing an XML–Haskell data binding with type isomorphism inference in Generic Haskell Atanassow, Frank
2007
141-142 2 p. 72-107
36 p.
artikel
56 Deadlock and starvation free reentrant readers–writers: A case study combining model checking with theorem proving van Gastel, Bernard
2011
141-142 2 p. 82-99
18 p.
artikel
57 Denotational semantics Brookes, Steve
1988
141-142 2 p. 185-191
7 p.
artikel
58 Describing data flow analysis techniques with Kleene algebra Fernandes, Therrezinha
2007
141-142 2 p. 173-194
22 p.
artikel
59 Design and analysis of up-down counters Segers, John
1996
141-142 2 p. 185-204
20 p.
artikel
60 Designing the automatic transformation of visual languages Varró, Dániel
2002
141-142 2 p. 205-227
23 p.
artikel
61 Detecting stack-based environments in denotational definitions Schmidt, David A.
1988
141-142 2 p. 107-131
25 p.
artikel
62 Developing a linear algorithm for cubing a cyclic permutation Xue, Jinyun
1988
141-142 2 p. 161-165
5 p.
artikel
63 Documenting software systems using types van Deursen, Arie
2006
141-142 2 p. 205-220
16 p.
artikel
64 Dynamic binary translation using run-time feedbacks Ung, David
2006
141-142 2 p. 189-204
16 p.
artikel
65 E3: A logic for reasoning equationally in the presence of partiality Morris, Joseph M.
1999
141-142 2 p. 141-158
18 p.
artikel
66 Easy web service discovery: A query-by-example approach Crasso, Marco
2008
141-142 2 p. 144-164
21 p.
artikel
67 Editorial Board 2008
141-142 2 p. IFC-
1 p.
artikel
68 Editorial Board 2007
141-142 2 p. IFC-
1 p.
artikel
69 Editorial Board 2007
141-142 2 p. IFC-
1 p.
artikel
70 Editorial Board 2006
141-142 2 p. CO2-
1 p.
artikel
71 Editorial Board 2006
141-142 2 p. IFC-
1 p.
artikel
72 Editorial Board 2006
141-142 2 p. CO2-
1 p.
artikel
73 Editorial Board) 2007
141-142 2 p. CO2-
1 p.
artikel
74 Editorial Board 2007
141-142 2 p. IFC-
1 p.
artikel
75 Editorial Board 2005
141-142 2 p. CO2-
1 p.
artikel
76 Editorial Board 2004
141-142 2 p. IFC-
1 p.
artikel
77 Editorial–Science of Computer Programming–25 years Broy, Manfred
2007
141-142 2 p. 103-104
2 p.
artikel
78 Efficient memory management for concurrent programs that use message passing Sagonas, Konstantinos
2006
141-142 2 p. 98-121
24 p.
artikel
79 Equational reasoning in Isabelle Nipkow, Tobias
1989
141-142 2 p. 123-149
27 p.
artikel
80 Essential mathematics for software engineers Gibbins, Peter
1988
141-142 2 p. 218-219
2 p.
artikel
81 Exceptions and interrupts in CSP Dix, Trevor I.
1983
141-142 2 p. 189-204
16 p.
artikel
82 Executing Java programs with transactional memory Carlstrom, Brian D.
2006
141-142 2 p. 111-129
19 p.
artikel
83 Finding repeated elements Misra, J.
1982
141-142 2 p. 143-152
10 p.
artikel
84 Five perspectives on modern memory management: Systems, hardware and theory Jones, Richard
2006
141-142 2 p. 95-97
3 p.
artikel
85 Flash memory efficient LTL model checking Edelkamp, S.
2011
141-142 2 p. 136-157
22 p.
artikel
86 Foreword Ehrig, Hartmut
2002
141-142 2 p. 131-132
2 p.
artikel
87 Foreword Apt, Krzysztof R.
1993
141-142 2 p. 91-92
2 p.
artikel
88 Formal agent-oriented modeling with UML and graph transformation Depke, Ralph
2002
141-142 2 p. 229-252
24 p.
artikel
89 Formal derivation of a pattern matching algorithm Bird, R.S.
1989
141-142 2 p. 93-104
12 p.
artikel
90 Formal methods in standards: A report from the BCS working group Froome, Peter
1991
141-142 2 p. 204-205
2 p.
artikel
91 Formal specification and design, Cambridge tracts in theoretical computer science Reichel, Horst
1995
141-142 2 p. 185-186
2 p.
artikel
92 Formal specification of MPI 2.0: Case study in specifying a practical concurrent programming API Li, Guodong
2011
141-142 2 p. 65-81
17 p.
artikel
93 Formal specification of multi-agent e-barter systems Núñez, Manuel
2005
141-142 2 p. 187-216
30 p.
artikel
94 Generating data flow analysis algorithms from modal specifications Steffen, Bernhard
1993
141-142 2 p. 115-139
25 p.
artikel
95 Global computing in a dynamic network of tuple spaces De Nicola, Rocco
2007
141-142 2 p. 187-204
18 p.
artikel
96 Graph-based proof procedures for horn clauses Hansson, Åke
1992
141-142 2 p. 215-218
4 p.
artikel
97 Graphic design for electronic documents and user interfaces Nielsen, Jacob
1992
141-142 2 p. 218-221
4 p.
artikel
98 GXL: A graph-based standard exchange format for reengineering Holt, Richard C.
2006
141-142 2 p. 149-170
22 p.
artikel
99 High-fidelity C/C++ code transformation Waddington, Daniel
2007
141-142 2 p. 64-78
15 p.
artikel
100 Implementing specification freedoms London, Philip E.
1982
141-142 2 p. 91-131
41 p.
artikel
101 Improving recursive functions by inverting the order of evaluation Boiten, Eerke A.
1992
141-142 2 p. 139-179
41 p.
artikel
102 Inheritance hierarchies in knowledge representation and programming languages Østerby, Tom
1992
141-142 2 p. 209-213
5 p.
artikel
103 Introduction to functional programming Bailes, Paul A.
1989
141-142 2 p. 158-164
7 p.
artikel
104 Introduction to the special issue Jacquet, Jean-Marie
2007
141-142 2 p. 185-186
2 p.
artikel
105 Introduction to the Special Issue on Automatic Program Generation for Embedded Systems Hammond, Kevin
2012
141-142 2 p. 81-82
2 p.
artikel
106 Introduction to the special issue on software analysis, evolution and reengineering Balmas, Francoise
2006
141-142 2 p. 117-120
4 p.
artikel
107 Kleene getting lazy Möller, Bernhard
2007
141-142 2 p. 195-214
20 p.
artikel
108 Linear combinations of radioactive decay models for generational garbage collection Clinger, William D.
2006
141-142 2 p. 184-203
20 p.
artikel
109 Logic and computation—Interactive proof with Cambridge LCF Nipkow, Tobias
1988
141-142 2 p. 178-180
3 p.
artikel
110 Logic for computer science Martin, Ursula
1988
141-142 2 p. 176-178
3 p.
artikel
111 Logic programming and rapid prototyping Komorowski, Henryk Jan
1987
141-142 2 p. 179-205
27 p.
artikel
112 Logic Programming: Proceedings of the 1990 North American Conference Szeredi, Péter
1992
141-142 2 p. 213-215
3 p.
artikel
113 LR-parsing derived Hesselink, Wim H.
1992
141-142 2 p. 171-196
26 p.
artikel
114 Maude’s module algebra Durán, Francisco
2007
141-142 2 p. 125-153
29 p.
artikel
115 McLaren's masterpiece Gries, D.
1987
141-142 2 p. 139-145
7 p.
artikel
116 Metal: a formalism to specify formalisms Kahn, G.
1983
141-142 2 p. 151-188
38 p.
artikel
117 Metamorphisms: Streaming representation-changers Gibbons, Jeremy
2007
141-142 2 p. 108-139
32 p.
artikel
118 Modeling and verification of real-time systems based on equations Ogata, Kazuhiro
2007
141-142 2 p. 162-180
19 p.
artikel
119 Modeling component connectors in Reo by constraint automata Baier, Christel
2006
141-142 2 p. 75-113
39 p.
artikel
120 Modelling angelic and demonic nondeterminism with multirelations Martin, C.E.
2007
141-142 2 p. 140-158
19 p.
artikel
121 Modern Compiler Implementation in Java van Deursen, Arie
1999
141-142 2 p. 159-161
3 p.
artikel
122 Multi-paradigm Java–Prolog integration in tuProlog Denti, Enrico
2005
141-142 2 p. 217-250
34 p.
artikel
123 Nested transactional memory: Model and architecture sketches Moss, J. Eliot B.
2006
141-142 2 p. 186-201
16 p.
artikel
124 [No title] Hedin, Görel
2007
141-142 2 p. 63-
1 p.
artikel
125 OCCAM 2 1999
141-142 2 p. 217-219
3 p.
artikel
126 On abstraction and the expressive power of programming languages Mitchell, John C.
1993
141-142 2 p. 141-163
23 p.
artikel
127 On measuring garbage collection responsiveness Printezis, Tony
2006
141-142 2 p. 164-183
20 p.
artikel
128 On observed reproducibility in network configuration management Couch, Alva
2004
141-142 2 p. 215-253
39 p.
artikel
129 On the expressiveness of timed coordination models Linden, I.
2006
141-142 2 p. 152-187
36 p.
artikel
130 On the semantics of software adaptation Brogi, Antonio
2006
141-142 2 p. 136-151
16 p.
artikel
131 Partial correctness: The term-wise approach Sokołowski, Stefan
1984
141-142 2 p. 141-157
17 p.
artikel
132 Point-free substitution Bijlsma, A.
1996
141-142 2 p. 205-214
10 p.
artikel
133 Predicate transformers for reasoning about concurrent computation Chandy, K.Mani
1995
141-142 2 p. 129-147
19 p.
artikel
134 Preface Brogi, Antonio
2006
141-142 2 p. 73-74
2 p.
artikel
135 Preface Kozen, Dexter
2007
141-142 2 p. 71-
1 p.
artikel
136 Preface to the special issue on Formal Methods for Industrial Critical Systems (FMICS 2007 + FMICS 2008) Cofer, Darren
2011
141-142 2 p. 63-64
2 p.
artikel
137 Programming in Martin-Löf's type theory Mendler, Nax
1991
141-142 2 p. 202-203
2 p.
artikel
138 Programming in Occam Capon, Peter C.
1988
141-142 2 p. 217-
1 p.
artikel
139 Programming language concepts and paradigms Lindsey, C.H.
1991
141-142 2 p. 200-201
2 p.
artikel
140 Programming: The derivation of algorithms Morgan, Carroll
1992
141-142 2 p. 205-207
3 p.
artikel
141 Programming with exceptions in JCilk Danaher, John S.
2006
141-142 2 p. 147-171
25 p.
artikel
142 Programs with continuations and linear logic Nishizaki, Shin-ya
1993
141-142 2 p. 165-190
26 p.
artikel
143 Proving properties of real-time semaphores Scholefield, David
1995
141-142 2 p. 159-181
23 p.
artikel
144 Quality programming: Developing and testing software with statistical quality control Kitchenham, Barbara
1988
141-142 2 p. 213-215
3 p.
artikel
145 Refined compiliation of pattern-matching for functional languages Schnoebelen, Ph.
1988
141-142 2 p. 133-159
27 p.
artikel
146 Refinement of rational end-points real numbers by means of floating-point numbers Ait-Ameur, Yamine
1999
141-142 2 p. 133-162
30 p.
artikel
147 Relation partition algebra — mathematical aspects of uses and part-of relations Feijs, L.M.G.
1999
141-142 2 p. 163-212
50 p.
artikel
148 Revisiting the Δ IC approach to component recovery Koschke, Rainer
2006
141-142 2 p. 171-188
18 p.
artikel
149 Roles in networks Canright, Geoffrey
2004
141-142 2 p. 195-214
20 p.
artikel
150 Rotations in the plane and Prolog Csenki, Attila
2007
141-142 2 p. 154-161
8 p.
artikel
151 Safe manual memory management in Cyclone Swamy, Nikhil
2006
141-142 2 p. 122-144
23 p.
artikel
152 Separate compilation of hierarchical real-time programs into linear-bounded Embedded Machine code Ghosal, Arkadeb
2012
141-142 2 p. 96-112
17 p.
artikel
153 Small programming exercises 16 Rem, M.
1987
141-142 2 p. 203-211
9 p.
artikel
154 Small programming exercises Rem, M.
1983
141-142 2 p. 217-222
6 p.
artikel
155 Small programming exercises 19 Rem, M.
1987
141-142 2 p. 207-211
5 p.
artikel
156 Small programming exercises 4 Rem, M.
1984
141-142 2 p. 205-210
6 p.
artikel
157 Small programming exercises 22 Rem, M.
1988
141-142 2 p. 167-173
7 p.
artikel
158 Software development: Fashioning the boroque Turski, W.M.
1989
141-142 2 p. 174-175
2 p.
artikel
159 Software engineering mathematics Hall, Anthony
1989
141-142 2 p. 168-170
3 p.
artikel
160 Software productivity Jackson, Michael
1989
141-142 2 p. 170-172
3 p.
artikel
161 Software visualizations for improving and measuring the comprehensibility of source code Umphress, David A.
2006
141-142 2 p. 121-133
13 p.
artikel
162 Special issue on synchronization and concurrency in object-oriented languages Harris, Tim
2006
141-142 2 p. 109-110
2 p.
artikel
163 Stepwise refinement of communicating systems Butler, Michael J.
1996
141-142 2 p. 139-173
35 p.
artikel
164 Strengthening invariants for efficient computation Liu, Yanhong A.
2001
141-142 2 p. 139-172
34 p.
artikel
165 Strider: a black-box, state-based approach to change and configuration management and support Wang, Yi-Min
2004
141-142 2 p. 143-164
22 p.
artikel
166 Supporting module reuse in refinement Hayes, Ian J.
1996
141-142 2 p. 175-184
10 p.
artikel
167 Symbolic evaluation with structural recursive symbolic constants Giannotti, Fosca
1987
141-142 2 p. 161-177
17 p.
artikel
168 Synchronous programming with events and relations: the SIGNAL language and its semantics Benveniste, Albert
1991
141-142 2 p. 103-149
47 p.
artikel
169 Synthesizing and integrating legacy components as services using adapters Mudiam, Sudhakiran V.
2006
141-142 2 p. 134-148
15 p.
artikel
170 Systolic arrays for the recognition of permutation-invariant segments Katoen, Joost-Pieter
1996
141-142 2 p. 119-137
19 p.
artikel
171 Temporal logic of programs Fisher, Michael
1988
141-142 2 p. 215-216
2 p.
artikel
172 Termination of rewriting systems by polynomial interpretations and its implementation Ben Cherifa, Ahlem
1987
141-142 2 p. 137-159
23 p.
artikel
173 Terms with unbounded demonic and angelic nondeterminacy Morris, Joseph M.
2007
141-142 2 p. 159-172
14 p.
artikel
174 4th conference on foundations of software technology & theoretical computer science 1984
141-142 2 p. 219-
1 p.
artikel
175 The categorical abstract machine Cousineau, G.
1987
141-142 2 p. 173-202
30 p.
artikel
176 The derivation of graph marking algorithms from distributed termination detection protocols Tel, Gerard
1988
141-142 2 p. 107-137
31 p.
artikel
177 The Esterel synchronous programming language: design, semantics, implementation Berry, Gérard
1992
141-142 2 p. 87-152
66 p.
artikel
178 The foundations of program verification Grabowski, Michal
1988
141-142 2 p. 211-212
2 p.
artikel
179 The matrix as in-situ data structure Kaldewaij, Anne
1995
141-142 2 p. 149-158
10 p.
artikel
180 Topics in system administration Burgess, Mark
2004
141-142 2 p. 123-124
2 p.
artikel
181 Towards lightweight checks for mass maintenance transformations Veerman, Niels
2005
141-142 2 p. 129-163
35 p.
artikel
182 Two-level functional languages, Cambridge tracts in computer science, vol. 34 Moggi, E
1995
141-142 2 p. 186-187
2 p.
artikel
183 Uncovering architectural mismatch in component behavior Compare, Daniele
1999
141-142 2 p. 101-131
31 p.
artikel
184 Understanding Z—A specification language and its formal semantics Jones, Roger Bishop
1988
141-142 2 p. 180-184
5 p.
artikel
185 Using established Web Engineering knowledge in model-driven approaches Gitzel, Ralf
2007
141-142 2 p. 105-124
20 p.
artikel
186 Using role-based coordination to achieve software adaptability Colman, Alan
2007
141-142 2 p. 223-245
23 p.
artikel
187 Using service grammar to diagnose BGP configuration errors Qie, Xiaohu
2004
141-142 2 p. 125-141
17 p.
artikel
188 Verification of programs that destructively manipulate data Mason, Ian A.
1988
141-142 2 p. 177-210
34 p.
artikel
189 Verifying programs that use causally-ordered message-passing Stoller, Scott D
1995
141-142 2 p. 105-128
24 p.
artikel
190 Versioned boxes as the basis for memory transactions Cachopo, João
2006
141-142 2 p. 172-185
14 p.
artikel
191 XPi: A typed process calculus for XML messaging Acciai, Lucia
2008
141-142 2 p. 110-143
34 p.
artikel
                             191 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland