Programming concepts, methods and calculi : proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods, and Calculi (PROCOMET '94), San Miniato, Italy, 6-10 June 1994
Ifip Tc, Calculi, Ernst-Rüdiger Olderog · Elsevier eBooks · 1994
Part 1 Mathematics of program derivation: decomposable functions and leaf trees - a systematic approach, A. Kaldewaij and V.J. Dielissen data distribution algebras - a formal basis for programming using skeletons, M. Sudholt ideal streams, B. Moller. Part 2 Support of program derivation: literate and structured presentation of formal proofs, M. Simons et al automatic, self-adaptive control and unfold transformations, J.M. Boyle. Part 3 Design of concurrent systems: action systems with synchronous communication, R.J.R. Back and K. Sere progress for local variable in UNITY, R.T. Udink et al. Part 4 Process algebra: a general conservative extension theorem in process algebra, C. Verhoef axiomatising ST bisimulation equivalence, N. Busi et al studying synchronous communication mechanisms by abstractions, M. Jourdan and F. Maraninchi bisimulation in higher-order process calculi, D. Sangiorgi. Part 5 Refinement of concurrent systems: methodological aspects of action refinement, A. Rensink parametric action refinement, H. Wehrheim a process algebraic semantics for statecharts via state refinements, A.C. Uselton and S.A. Smolka. Part 6 Compositionality in concurrency: compositionality in the inductive assertion method for concurrent system, F.S. de Boer some very compositional temporal properties, B. Moszkowski decomposing specifications of concurrent systems, M. Abadi and L. Lamport linking visual formalisms - a compositional proof system for statecharts based on symbolic timing diagram, W. Damm and J. Helbig. Part 7 Semantics of nondeterminism and concurrency: a relational model of programs without the restriction to Egli-Milner-monotonic constructs, H. Doornbos Plotkin, Hoare and Smyth order - on observational models for CSP, B.V. Karger modelling concurrent accesses to shared data via petri nets, N. de Francesco et al an event structure semantics for safe graph grammars, A. Corradini et al. Part 8 Semantics of programming languages: semantics of exceptions, K.R.M. Leino et al predicate transformer semantics of an oberon-like language, D.A. Naumann occam - specification and compiler correctness, E. Borger et al. Part 9 Types in specification: higher-order subtyping, M. Steffen and B. Pierce augmenting algebraic specifications with structured sorts and structured subsorting, Y.V. Srinivas. Part 10 Program analysis: reasoning about complexity of object-oriented programs, H.W. Schmidt and W. Zimmermann abstract interpretation of reactive sytems, D. Dams et al.