scientific article

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

proof theory implementation VDM Abstract data types abstract specification formal proof rules main programming constructs systematic software development

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of software (68Nxx)

Related Items

FORMAL VALIDATION AND VERIFICATION OF ATOMIC RESOLUTION MICROSCOPE CONTROL AND TOPOGRAPHY, Software Development in Relation Algebra with Ampersand, Proof versus formalization, Termination conventions and comparative semantics, The formal specification of abstract data types and their implementation in Fortran 90, Unification: A case-study in data refinement, Semantic subtyping with an SMT solver, Transposing partial components--an exercise on coalgebraic refinement, Program specification and data refinement in type theory, A guided tour of the mathematics of MetaSoft '88, A state-based approach to communicating processes, A logical framework for evolving software systems, Auxiliary variables in data refinement, Empowering the Event-B method using external theories, Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems, A formal semantics for sql, Essential concepts of algebraic specification and program development, An observationally complete program logic for imperative higher-order functions, Unifying Theories of Programming in Isabelle, Consistency-preserving refactoring of refinement structures in Event-B models, On solvability of systems of partial fuzzy relational equations, Override and update, A logic for Miranda, A New Roadmap for Linking Theories of Programming, A reification calculus for model-oriented software specification, Derivation of efficient parallel programs: An example from genetic sequence analysis, The calculus of context relations, Proof obligations for blocks and procedures, A design method for embedded software systems, Efficient Well-Definedness Checking, A category theory approach to conceptual data modeling, Design and verification of fault tolerant systems with CSP, How to Brew-up a Refinement Ordering, Modular structuring of VDM specifications in VVSL, Algebraic proofs of consistency and completeness, Higher-order equational logic for specification, simulation and testing, BOND-GRAPHS FOR INFORMATION SYSTEMS, A single complete rule for data refinement, Angelic processes for CSP via the UTP, A Conceptual and Formal Framework for the Integration of Data Type and Process Modeling Techniques, The axiomatization of override and update, Extended Static Checking by Calculation Using the Pointfree Transform, Abstract implementation of algebraic specifications in a temporal logic language, Relation algebra as programming language using the Ampersand compiler, Assembling a prehistory for formal methods: a personal view, Type inference for set theory, Toward formal development of programs from algebraic specifications: Model-theoretic foundations, Unifying separation logic and region logic to allow interoperability, Rough sets and 3-valued logics, A proof rule for while loop in VDM, Missing values and dragonfly operations in fuzzy relational compositions, Inherited extension of many-sorted theories, CASL: the Common Algebraic Specification Language., Mechanizing some advanced refinement concepts, Simple consequence relations, Stepwise refinement of sequence diagrams with soft real-time constraints, A non-deterministic view on non-classical negations, Towards leveraging domain knowledge in state-based formal methods, Program refinement in fair transition systems