Arkiver - Side 12

• PB-324 On the compositional checking of validity

  Nr. 324 (1990)

• PB-319 INTERFACE

  Nr. 319 (1990)

• PB-321 Systematic sources of sub-optimal interface design in large product development organizations

  Nr. 321 (1990)

• PB-323 Two analyses of CSCW and groupware

  Nr. 323 (1990)

• PB-318 Genericity and inheritance

  Nr. 318 (1990)

• PB-325 Data flow analysis as model checking

  Nr. 325 (1990)

• PB-320 The development of interactive systems: bridging the gaps between developers and users

  Nr. 320 (1990)

• PB-316 Types and automata

  Nr. 316 (1990)

• PB-322 Some new thoughts on Neural Networks with complex connection matrices

  Nr. 322 (1990)

• PB-315 Extended Smolensky's method

  Nr. 315 (1990)

• PB-326 Strong typing of object-oriented languages revisited

  Nr. 326 (1990)

• PB-314 A simple algorithm for computing the smallest enclosing circle

  Nr. 314 (1990)

• PB-310 Elementary transition systems

  Nr. 310 (1990)

• PB-308 True concurrency can be traced

  Nr. 308 (1990)

• PB-309 A logical characterization of asynchronously communicating agents

  Nr. 309 (1990)

• PB-313 A note on opaque types

  Nr. 313 (1990)

• PB-302 Object oriented development: integrating analysis, design and implementation

  Nr. 302 (1990)

• PB-312 Teaching object-oriented programming using BETA

  Nr. 312 (1990)

• PB-311 Optimal detection of query injectivity

  Nr. 311 (1990)

• PB-307 Partial orders and fully abstract models for concurrency

  Nr. 307 (1990)

• PB-306 Are There Elimination Algorithms for the Permanent?

  Nr. 306 (1990)

• PB-304 Graph Grammars for Knowledge Representation

  Nr. 304 (1990)

• PB-301 Petri Nets as Models of Linear Logic

  Nr. 301 (1990)

• PB-305 Substitution Polymorphism for Object-Oriented Programming

  Nr. 305 (1990)

• PB-303 A Note on the Jacobian Conjecture

  Nr. 303 (1990)