scientific article; zbMATH DE number 3936465
From MaRDI portal
Publication:3707340
zbMATH Open0584.68008MaRDI QIDQ3707340FDOQ3707340
Authors: Cliff B. Jones 
Publication date: 1986
Title of this publication is not available (Why is that?)
Recommendations
proof theoryimplementationVDMAbstract data typesabstract specificationformal proof rulesmain programming constructssystematic software development
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of software (68Nxx)
Cited In (70)
- FORMAL VALIDATION AND VERIFICATION OF ATOMIC RESOLUTION MICROSCOPE CONTROL AND TOPOGRAPHY
- Extending rely-guarantee thinking to handle real-time scheduling
- BOND-GRAPHS FOR INFORMATION SYSTEMS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A conceptual and formal framework for the integration of data type and process modeling techniques
- Higher-order equational logic for specification, simulation and testing
- Unification: A case-study in data refinement
- Essential concepts of algebraic specification and program development
- Title not available (Why is that?)
- Extended Static Checking by Calculation Using the Pointfree Transform
- Program specification and data refinement in type theory
- Termination conventions and comparative semantics
- The axiomatization of override and update
- Inherited extension of many-sorted theories
- A proof rule for while loop in VDM
- On solvability of systems of partial fuzzy relational equations
- Towards leveraging domain knowledge in state-based formal methods
- A formal semantics for sql
- Software Development in Relation Algebra with Ampersand
- Proof obligations for blocks and procedures
- A guided tour of the mathematics of MetaSoft '88
- A state-based approach to communicating processes
- A new roadmap for linking theories of programming
- An observationally complete program logic for imperative higher-order functions
- The calculus of context relations
- On methods for safe introduction of operations
- Title not available (Why is that?)
- Stepwise refinement of sequence diagrams with soft real-time constraints
- A non-deterministic view on non-classical negations
- Angelic processes for CSP via the UTP
- Override and update
- The formal specification of abstract data types and their implementation in Fortran 90
- Type inference for set theory
- CASL: the Common Algebraic Specification Language.
- A logical framework for evolving software systems
- Auxiliary variables in data refinement
- Transposing partial components--an exercise on coalgebraic refinement
- A category theory approach to conceptual data modeling
- Mechanizing some advanced refinement concepts
- Simple consequence relations
- Relation algebra as programming language using the Ampersand compiler
- Program refinement in fair transition systems
- How to brew-up a refinement ordering
- Empowering the Event-B method using external theories
- Abstract implementation of algebraic specifications in a temporal logic language
- Assembling a prehistory for formal methods: a personal view
- A Formal Method for the Abstract Specification of Software
- Design and verification of fault tolerant systems with CSP
- Unifying separation logic and region logic to allow interoperability
- Unifying theories of programming in Isabelle
- A logic for Miranda
- A reification calculus for model-oriented software specification
- Modular structuring of VDM specifications in VVSL
- Proof versus formalization
- Toward formal development of programs from algebraic specifications: model-theoretic foundations
- Derivation of efficient parallel programs: An example from genetic sequence analysis
- A design method for embedded software systems
- Missing values and dragonfly operations in fuzzy relational compositions
- Consistency-preserving refactoring of refinement structures in Event-B models
- Title not available (Why is that?)
- Semantic subtyping with an SMT solver
- A single complete rule for data refinement
- Efficient Well-Definedness Checking
- Rough sets and 3-valued logics
- Algebraic proofs of consistency and completeness
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3707340)
