Formal Methods in Programming and Their Applications

Theory of domains and nearby.- Predicative programming — A survey.- A three-valued logic for refinement.- A compositional semantics of combining forms for gamma programs.- Algebraic properties of loop invariants.- An approach to parameterized first-order specifications: Semantics, correctness, parameter passing.- Algebraic modelling of imperative languages with pointers.- Galois connection based abstract interpretations for strictness analysis.- Efficient chaotic iteration strategies with widenings.- Semantic analysis of interval congruences.- Polymorphic typing for call-by-name semantics.- Logic program testing based on abstract interpretation.- Analysis of some semantic properties for programs of the applicative language AL.- Communication as unification in process algebras: Operational semantics.- Functional development of massively parallel programs.- Observing some properties of event structures.- The other linear logic.- Duration Calculi: An overview.- A unique formalism for specifying and designing objects in a parallel environment.- On the smooth calculation of relational recursive expressions out of first-order non-constructive specifications involving quantifiers.- Saturation replaces induction for a miniscoped linear temporal logic.- A formal approach to requirements engineering.- A two-phase approach to reverse engineering using formal methods.- Algebraically provable specification of optimized compilations.- Formal derivation of an error-detecting distributed data scheduler using Changeling.- REAL92: A combined specification language for real-time concurrent systems and properties.- Algebraic calculation of graph and sorting algorithms.- Automatical synthesis of programs with recursions.- Parsing in Isbes.