|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
132 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | Abstract Behavior Types: a foundation model for components and their composition |
Arbab, Farhad |
2005 |
141-142 | 1-3 |
p. 3-52 50 p. |
artikel |
|
| 2 | Abstract interpretation based verification of logic programs |
Comini, Marco |
2003 |
141-142 | 1-3 |
p. 89-123 35 p. |
artikel |
|
| 3 | A calculational approach to reactive systems |
von Karger, Burghard |
2000 |
141-142 | 1-3 |
p. 139-161 23 p. |
artikel |
|
| 4 | A calculus of functional BSP programs |
Loulergue, Frédéric |
2000 |
141-142 | 1-3 |
p. 253-277 25 p. |
artikel |
|
| 5 | A calculus of program adaptation and its applications |
Ayed, Rahma Ben |
2000 |
141-142 | 1-3 |
p. 73-123 51 p. |
artikel |
|
| 6 | A discrete-time UML semantics for concurrency and communication in safety-critical applications |
Damm, Werner |
2005 |
141-142 | 1-3 |
p. 81-115 35 p. |
artikel |
|
| 7 | A generative methodology for the design of abstract machines |
Diehl, Stephan |
2000 |
141-142 | 1-3 |
p. 125-142 18 p. |
artikel |
|
| 8 | Algebraic properties of program integration |
Reps, Thomas |
1991 |
141-142 | 1-3 |
p. 139-215 77 p. |
artikel |
|
| 9 | Algebraic reasoning for object-oriented programming |
Borba, Paulo |
2004 |
141-142 | 1-3 |
p. 53-100 48 p. |
artikel |
|
| 10 | A methodology for hardware verification using compositional model checking |
McMillan, K.L. |
2000 |
141-142 | 1-3 |
p. 279-309 31 p. |
artikel |
|
| 11 | An algorithm for type-checking dependent types |
Coquand, Thierry |
1996 |
141-142 | 1-3 |
p. 167-177 11 p. |
artikel |
|
| 12 | A relational calculus for program construction by parts |
Frappier, M. |
1996 |
141-142 | 1-3 |
p. 237-254 18 p. |
artikel |
|
| 13 | Arrays, bounded quantification and iteration in logic and constraint logic programming |
Apt, Krzysztof R. |
1996 |
141-142 | 1-3 |
p. 133-148 16 p. |
artikel |
|
| 14 | A semantic approach to secure information flow |
Joshi, Rajeev |
2000 |
141-142 | 1-3 |
p. 113-138 26 p. |
artikel |
|
| 15 | A simple framework for real-time cryptographic protocol analysis with compositional proof rules |
Gorrieri, Roberto |
2004 |
141-142 | 1-3 |
p. 23-49 27 p. |
artikel |
|
| 16 | A sound polymorphic type system for a dialect of C |
Smith, Geoffrey |
1998 |
141-142 | 1-3 |
p. 49-72 24 p. |
artikel |
|
| 17 | Asynchronous system synthesis |
Plosila, J. |
2005 |
141-142 | 1-3 |
p. 259-288 30 p. |
artikel |
|
| 18 | A tool chain for reverse engineering C++ applications |
Kraft, Nicholas A. |
2007 |
141-142 | 1-3 |
p. 3-13 11 p. |
artikel |
|
| 19 | A tour of Tempo: a program specializer for the C language |
Consel, Charles |
2004 |
141-142 | 1-3 |
p. 341-370 30 p. |
artikel |
|
| 20 | A transformation-based optimiser for Haskell |
Peyton Jones, Simon L. |
1998 |
141-142 | 1-3 |
p. 3-47 45 p. |
artikel |
|
| 21 | A type system for implicit scaling |
Thatte, Satish |
1991 |
141-142 | 1-3 |
p. 217-245 29 p. |
artikel |
|
| 22 | Author Index |
2003 |
141-142 | 1-3 |
p. 159- 1 p. |
artikel |
||
| 23 | Author Index |
2005 |
141-142 | 1-3 |
p. 289-290 2 p. |
artikel |
||
| 24 | Author Index |
2004 |
141-142 | 1-3 |
p. 273- 1 p. |
artikel |
||
| 25 | Author Index |
2004 |
141-142 | 1-3 |
p. 371- 1 p. |
artikel |
||
| 26 | Author index of volume 32 |
1998 |
141-142 | 1-3 |
p. 221- 1 p. |
artikel |
||
| 27 | Author index of Volume 69 |
2007 |
141-142 | 1-3 |
p. 86- 1 p. |
artikel |
||
| 28 | Author index of volume 26 (1996) |
1996 |
141-142 | 1-3 |
p. 273- 1 p. |
artikel |
||
| 29 | Automated deduction in nonclassical logics |
Fischer, Michael |
1991 |
141-142 | 1-3 |
p. 256-258 3 p. |
artikel |
|
| 30 | Automatic autoprojection of higher order recursive equations |
Bondorf, Anders |
1991 |
141-142 | 1-3 |
p. 3-34 32 p. |
artikel |
|
| 31 | Automatic software model checking via constraint logic |
Flanagan, Cormac |
2004 |
141-142 | 1-3 |
p. 253-270 18 p. |
artikel |
|
| 32 | Automatic validation of code-improving transformations on low-level program representations |
van Engelen, Robert |
2004 |
141-142 | 1-3 |
p. 257-280 24 p. |
artikel |
|
| 33 | Basic simple type theory |
Francez, Nissim |
1998 |
141-142 | 1-3 |
p. 211-213 3 p. |
artikel |
|
| 34 | Building CBR systems with jcolibri |
Díaz-Agudo, Belén |
2007 |
141-142 | 1-3 |
p. 68-75 8 p. |
artikel |
|
| 35 | Building certified libraries for PCC: dynamic storage allocation |
Yu, Dachuan |
2004 |
141-142 | 1-3 |
p. 101-127 27 p. |
artikel |
|
| 36 | Case studies in systematic software development |
Hayes, Ian J. |
1991 |
141-142 | 1-3 |
p. 250-251 2 p. |
artikel |
|
| 37 | Chronos: A timing analyzer for embedded software |
Li, Xianfeng |
2007 |
141-142 | 1-3 |
p. 56-67 12 p. |
artikel |
|
| 38 | Combinations of abstract domains for logic programming: open product and generic pattern construction |
Cortesi, Agostino |
2000 |
141-142 | 1-3 |
p. 27-71 45 p. |
artikel |
|
| 39 | Communicating and Mobile Systems: the π-calculus, |
Sangiorgi, Davide |
2000 |
141-142 | 1-3 |
p. 151-153 3 p. |
artikel |
|
| 40 | Composition for component-based modeling |
Gössler, Gregor |
2005 |
141-142 | 1-3 |
p. 161-183 23 p. |
artikel |
|
| 41 | Computation calculus bridging a formalization gap |
Dijkstra, Rutger M. |
2000 |
141-142 | 1-3 |
p. 3-36 34 p. |
artikel |
|
| 42 | Constraints to stop deforestation |
Seidl, H. |
1998 |
141-142 | 1-3 |
p. 73-107 35 p. |
artikel |
|
| 43 | Convergence of program transformers in the metric space of trees |
Sørensen, Morten Heine B. |
2000 |
141-142 | 1-3 |
p. 163-205 43 p. |
artikel |
|
| 44 | Correctness of data representations involving heap data structures |
Reddy, Uday S. |
2004 |
141-142 | 1-3 |
p. 129-160 32 p. |
artikel |
|
| 45 | Costing parallel programs as a function of shapes |
Jay, C.Barry |
2000 |
141-142 | 1-3 |
p. 207-224 18 p. |
artikel |
|
| 46 | Deriving a class of layer-oriented graph algorithms |
Russling, Martin |
1996 |
141-142 | 1-3 |
p. 117-132 16 p. |
artikel |
|
| 47 | Deriving relational programs for computing kernels by reconstructing a proof of Richardson's theorem |
Berghammer, Rudolf |
2000 |
141-142 | 1-3 |
p. 1-25 25 p. |
artikel |
|
| 48 | Editorial |
2000 |
141-142 | 1-3 |
p. 1-2 2 p. |
artikel |
||
| 49 | Editorial |
Sintzoff, Michel |
1996 |
141-142 | 1-3 |
p. 1-2 2 p. |
artikel |
|
| 50 | Editorial Board |
2003 |
141-142 | 1-3 |
p. ii- 1 p. |
artikel |
||
| 51 | Editorial Board |
1998 |
141-142 | 1-3 |
p. ii- 1 p. |
artikel |
||
| 52 | Editorial Board |
2007 |
141-142 | 1-3 |
p. ii- 1 p. |
artikel |
||
| 53 | Editorial Board |
2007 |
141-142 | 1-3 |
p. IBC- 1 p. |
artikel |
||
| 54 | Editorial Board |
2005 |
141-142 | 1-3 |
p. ii- 1 p. |
artikel |
||
| 55 | Editorial Board |
2004 |
141-142 | 1-3 |
p. ii- 1 p. |
artikel |
||
| 56 | Editorial Board |
2004 |
141-142 | 1-3 |
p. ii- 1 p. |
artikel |
||
| 57 | Editorial Board |
1996 |
141-142 | 1-3 |
p. ii- 1 p. |
artikel |
||
| 58 | Editorial Board |
1991 |
141-142 | 1-3 |
p. ii- 1 p. |
artikel |
||
| 59 | Erratum |
2000 |
141-142 | 1-3 |
p. 311- 1 p. |
artikel |
||
| 60 | Essentials of logic programming |
1991 |
141-142 | 1-3 |
p. 254- 1 p. |
artikel |
||
| 61 | Exceptions considered harmless |
Monin, Jean-François |
1996 |
141-142 | 1-3 |
p. 179-196 18 p. |
artikel |
|
| 62 | Explorations in quantum computing |
de Wolf, Ronald |
1998 |
141-142 | 1-3 |
p. 213-217 5 p. |
artikel |
|
| 63 | Foreword |
Nielson, Hanne Riis |
1998 |
141-142 | 1-3 |
p. 1-2 2 p. |
artikel |
|
| 64 | Foreword |
Jones, N.D. |
1991 |
141-142 | 1-3 |
p. 1-2 2 p. |
artikel |
|
| 65 | Formalism in AI and computer science |
Malcolm, Grant |
1991 |
141-142 | 1-3 |
p. 267-269 3 p. |
artikel |
|
| 66 | Formal methods for smart cards: an experience report |
Breunesse, C.-B. |
2005 |
141-142 | 1-3 |
p. 53-80 28 p. |
artikel |
|
| 67 | Functional algorithm design |
Bird, Richard S. |
1996 |
141-142 | 1-3 |
p. 15-31 17 p. |
artikel |
|
| 68 | Generalising monads to arrows |
Hughes, John |
2000 |
141-142 | 1-3 |
p. 67-111 45 p. |
artikel |
|
| 69 | Generating error traces from verification-condition counterexamples |
Leino, K. Rustan M. |
2005 |
141-142 | 1-3 |
p. 209-226 18 p. |
artikel |
|
| 70 | Generic downwards accumulations |
Gibbons, Jeremy |
2000 |
141-142 | 1-3 |
p. 37-65 29 p. |
artikel |
|
| 71 | Guest editor’s introduction: Experimental Software and Toolkits (EST) |
van den Brand, M.G.J. |
2007 |
141-142 | 1-3 |
p. 1-2 2 p. |
artikel |
|
| 72 | How the design of JML accommodates both runtime assertion checking and formal verification |
Leavens, Gary T. |
2005 |
141-142 | 1-3 |
p. 185-208 24 p. |
artikel |
|
| 73 | Index |
2000 |
141-142 | 1-3 |
p. 159- 1 p. |
artikel |
||
| 74 | Index |
2000 |
141-142 | 1-3 |
p. 313- 1 p. |
artikel |
||
| 75 | I was a computer |
Turski, Wz.xl;ladysz.xl;law M. |
1996 |
141-142 | 1-3 |
p. 11-14 4 p. |
artikel |
|
| 76 | Lambda-calculus, types and models |
Klop, J.W. |
1998 |
141-142 | 1-3 |
p. 217-218 2 p. |
artikel |
|
| 77 | Languages for Parallel Architectures: Designs, semantics, implementation models |
Watson, Paul |
1991 |
141-142 | 1-3 |
p. 264-266 3 p. |
artikel |
|
| 78 | Leaf trees |
Kaldewaij, Anne |
1996 |
141-142 | 1-3 |
p. 149-165 17 p. |
artikel |
|
| 79 | Linear-time hierarchies for a functional language machine model |
Rose, Eva |
1998 |
141-142 | 1-3 |
p. 109-143 35 p. |
artikel |
|
| 80 | Live and let die: LSC based verification of UML models |
Damm, Werner |
2005 |
141-142 | 1-3 |
p. 117-159 43 p. |
artikel |
|
| 81 | Massive parallelization of divide-and-conquer algorithms over powerlists |
Achatz, Klaus |
1996 |
141-142 | 1-3 |
p. 59-78 20 p. |
artikel |
|
| 82 | Mathematics of program construction |
Backhouse, Roland |
1996 |
141-142 | 1-3 |
p. 5-9 5 p. |
artikel |
|
| 83 | Monadification of functional programs |
Erwig, Martin |
2004 |
141-142 | 1-3 |
p. 101-129 29 p. |
artikel |
|
| 84 | On the expressive power of programming languages |
Felleisen, Matthias |
1991 |
141-142 | 1-3 |
p. 35-75 41 p. |
artikel |
|
| 85 | On the secure implementation of security protocols |
Giambiagi, Pablo |
2004 |
141-142 | 1-3 |
p. 73-99 27 p. |
artikel |
|
| 86 | On the theory of system administration |
Burgess, Mark |
2003 |
141-142 | 1-3 |
p. 1-46 46 p. |
artikel |
|
| 87 | Optimal domains for disjunctive abstract interpretation |
Giacobazzi, Roberto |
1998 |
141-142 | 1-3 |
p. 177-210 34 p. |
artikel |
|
| 88 | Ordering from Satan's menu: a survey of requirements specification for formal analysis of cryptographic protocols |
Meadows, Catherine |
2004 |
141-142 | 1-3 |
p. 3-22 20 p. |
artikel |
|
| 89 | Performance Modeling with Deterministic and Stochastic Petri Nets |
Balbo, Gianfranco |
2000 |
141-142 | 1-3 |
p. 143-146 4 p. |
artikel |
|
| 90 | Pigs from sausages? Reengineering from assembler to C via FermaT transformations |
Ward, M.P. |
2004 |
141-142 | 1-3 |
p. 213-255 43 p. |
artikel |
|
| 91 | Power domain constructions |
Heckmann, Reinhold |
1991 |
141-142 | 1-3 |
p. 77-117 41 p. |
artikel |
|
| 92 | Practical Foundations of Mathematics |
Streicher, Thomas |
2000 |
141-142 | 1-3 |
p. 155-157 3 p. |
artikel |
|
| 93 | Predicate calculus and program semantics |
Monahan, Brian |
1991 |
141-142 | 1-3 |
p. 259-262 4 p. |
artikel |
|
| 94 | Preface |
de Boer, Frank |
2005 |
141-142 | 1-3 |
p. 1-2 2 p. |
artikel |
|
| 95 | Preface |
Degano, Pierpaolo |
2004 |
141-142 | 1-3 |
p. 1- 1 p. |
artikel |
|
| 96 | Preface |
Möller, Bernhard |
1996 |
141-142 | 1-3 |
p. 3- 1 p. |
artikel |
|
| 97 | Prolog: A logical approach |
1991 |
141-142 | 1-3 |
p. 254- 1 p. |
artikel |
||
| 98 | Proofs and pedagogy; science and systems: The grammar tool box |
Johnstone, Adrian |
2007 |
141-142 | 1-3 |
p. 76-85 10 p. |
artikel |
|
| 99 | Proofs with graphs |
Curtis, Sharon |
1996 |
141-142 | 1-3 |
p. 197-216 20 p. |
artikel |
|
| 100 | Publisher's note |
2004 |
141-142 | 1-3 |
p. 271- 1 p. |
artikel |
||
| 101 | PX: A computational logic |
Constable, R.L. |
1991 |
141-142 | 1-3 |
p. 252-253 2 p. |
artikel |
|
| 102 | Realistic compiler generation |
Watt, David A. |
1991 |
141-142 | 1-3 |
p. 262-264 3 p. |
artikel |
|
| 103 | Reductivity |
Doornbos, Henk |
1996 |
141-142 | 1-3 |
p. 217-236 20 p. |
artikel |
|
| 104 | Refinement principles supporting the transition from asynchronous to synchronous communication |
Stølen, Ketil |
1996 |
141-142 | 1-3 |
p. 255-272 18 p. |
artikel |
|
| 105 | Register allocation by proof transformation |
Ohori, Atsushi |
2004 |
141-142 | 1-3 |
p. 161-187 27 p. |
artikel |
|
| 106 | Resolution and type theory |
Helmink, Leen |
1991 |
141-142 | 1-3 |
p. 119-138 20 p. |
artikel |
|
| 107 | Security properties: two agents are sufficient |
Comon-Lundh, Hubert |
2004 |
141-142 | 1-3 |
p. 51-71 21 p. |
artikel |
|
| 108 | Shapeliness analysis of functional programs with algebraic data types |
Nitsche, Thomas |
2000 |
141-142 | 1-3 |
p. 225-252 28 p. |
artikel |
|
| 109 | Specification and (property) inheritance in CSP-OZ |
Olderog, Ernst-Rüdiger |
2005 |
141-142 | 1-3 |
p. 227-257 31 p. |
artikel |
|
| 110 | Specification and transformation of programs |
Henglein, Fritz |
1991 |
141-142 | 1-3 |
p. 247-249 3 p. |
artikel |
|
| 111 | Specifying the Caltech asynchronous microprocessor |
Back, R.J.R. |
1996 |
141-142 | 1-3 |
p. 79-97 19 p. |
artikel |
|
| 112 | Static composition of refactorings |
Kniesel, Günter |
2004 |
141-142 | 1-3 |
p. 9-51 43 p. |
artikel |
|
| 113 | Steps towards mechanizing program transformations using PVS |
Shankar, Natarajan |
1996 |
141-142 | 1-3 |
p. 33-57 25 p. |
artikel |
|
| 114 | Supporting incremental and experimental software evolution by runtime method transformations |
Zdun, Uwe |
2004 |
141-142 | 1-3 |
p. 131-163 33 p. |
artikel |
|
| 115 | The algebraic structure of interfaces |
Rees, D.Ll.L. |
2003 |
141-142 | 1-3 |
p. 47-88 42 p. |
artikel |
|
| 116 | The classification of greedy algorithms |
Curtis, S.A. |
2003 |
141-142 | 1-3 |
p. 125-157 33 p. |
artikel |
|
| 117 | The CommUnity Workbench |
Oliveira, Cristóvão |
2007 |
141-142 | 1-3 |
p. 46-55 10 p. |
artikel |
|
| 118 | The craft of prolog |
Spivey, Mike |
1991 |
141-142 | 1-3 |
p. 254-256 3 p. |
artikel |
|
| 119 | The Daikon system for dynamic detection of likely invariants |
Ernst, Michael D. |
2007 |
141-142 | 1-3 |
p. 35-45 11 p. |
artikel |
|
| 120 | The JastAdd system — modular extensible compiler construction |
Ekman, Torbjörn |
2007 |
141-142 | 1-3 |
p. 14-26 13 p. |
artikel |
|
| 121 | The Tbilisi Symposium on Logic, Language and Computation: Selected Papers |
van Eijck, Jan |
2000 |
141-142 | 1-3 |
p. 147-149 3 p. |
artikel |
|
| 122 | The transient combinator, higher-order strategies, and the distributed data problem |
Winter, Victor L. |
2004 |
141-142 | 1-3 |
p. 165-212 48 p. |
artikel |
|
| 123 | Towards a design calculus for CSP |
Berghammer, Rudolf |
1996 |
141-142 | 1-3 |
p. 99-115 17 p. |
artikel |
|
| 124 | Towards a logical semantics for pure Prolog |
Barbuti, Roberto |
1998 |
141-142 | 1-3 |
p. 145-176 32 p. |
artikel |
|
| 125 | Transformation by interpreter specialisation |
Jones, Neil D. |
2004 |
141-142 | 1-3 |
p. 307-339 33 p. |
artikel |
|
| 126 | Transformations everywhere |
Lämmel, Ralf |
2004 |
141-142 | 1-3 |
p. 1-8 8 p. |
artikel |
|
| 127 | Type error slicing in implicitly typed higher-order languages |
Haack, Christian |
2004 |
141-142 | 1-3 |
p. 189-224 36 p. |
artikel |
|
| 128 | Type inference for a distributed π-calculus |
Lhoussaine, Cédric |
2004 |
141-142 | 1-3 |
p. 225-251 27 p. |
artikel |
|
| 129 | Type-safe method inlining |
Glew, Neal |
2004 |
141-142 | 1-3 |
p. 281-306 26 p. |
artikel |
|
| 130 | USE: A UML-based specification environment for validating UML and OCL |
Gogolla, Martin |
2007 |
141-142 | 1-3 |
p. 27-34 8 p. |
artikel |
|
| 131 | Using C with Curses, Lex and YACC |
Hilditch, Steve |
1991 |
141-142 | 1-3 |
p. 266-267 2 p. |
artikel |
|
| 132 | Visual programming |
Dinesh, T.B. |
1998 |
141-142 | 1-3 |
p. 218-220 3 p. |
artikel |
132 gevonden resultaten