scientific article; zbMATH DE number 3936465
From MaRDI portal
Publication:3707340
Cited in
(72)- Rough sets and 3-valued logics
- Termination conventions and comparative semantics
- A guided tour of the mathematics of MetaSoft '88
- A state-based approach to communicating processes
- Auxiliary variables in data refinement
- Design and verification of fault tolerant systems with CSP
- Modular structuring of VDM specifications in VVSL
- A proof rule for while loop in VDM
- Mechanizing some advanced refinement concepts
- Program refinement in fair transition systems
- Proof versus formalization
- The formal specification of abstract data types and their implementation in Fortran 90
- Essential concepts of algebraic specification and program development
- Angelic processes for CSP via the UTP
- Relation algebra as programming language using the Ampersand compiler
- Unifying separation logic and region logic to allow interoperability
- Inherited extension of many-sorted theories
- CASL: the Common Algebraic Specification Language.
- Unification: A case-study in data refinement
- A logical framework for evolving software systems
- Towards leveraging domain knowledge in state-based formal methods
- Empowering the Event-B method using external theories
- Override and update
- Abstract implementation of algebraic specifications in a temporal logic language
- Assembling a prehistory for formal methods: a personal view
- Missing values and dragonfly operations in fuzzy relational compositions
- Stepwise refinement of sequence diagrams with soft real-time constraints
- Consistency-preserving refactoring of refinement structures in Event-B models
- BOND-GRAPHS FOR INFORMATION SYSTEMS
- Semantic subtyping with an SMT solver
- On methods for safe introduction of operations
- Unifying theories of programming in Isabelle
- A new roadmap for linking theories of programming
- How to brew-up a refinement ordering
- scientific article; zbMATH DE number 3866548 (Why is no real title available?)
- A formal semantics for sql
- Efficient Well-Definedness Checking
- scientific article; zbMATH DE number 3960970 (Why is no real title available?)
- A Formal Method for the Abstract Specification of Software
- An observationally complete program logic for imperative higher-order functions
- scientific article; zbMATH DE number 18650 (Why is no real title available?)
- scientific article; zbMATH DE number 46957 (Why is no real title available?)
- scientific article; zbMATH DE number 176125 (Why is no real title available?)
- Program specification and data refinement in type theory
- scientific article; zbMATH DE number 550761 (Why is no real title available?)
- scientific article; zbMATH DE number 605793 (Why is no real title available?)
- scientific article; zbMATH DE number 1107134 (Why is no real title available?)
- Higher-order equational logic for specification, simulation and testing
- FORMAL VALIDATION AND VERIFICATION OF ATOMIC RESOLUTION MICROSCOPE CONTROL AND TOPOGRAPHY
- scientific article; zbMATH DE number 814830 (Why is no real title available?)
- scientific article; zbMATH DE number 897908 (Why is no real title available?)
- A category theory approach to conceptual data modeling
- A conceptual and formal framework for the integration of data type and process modeling techniques
- Extended Static Checking by Calculation Using the Pointfree Transform
- Toward formal development of programs from algebraic specifications: model-theoretic foundations
- Software Development in Relation Algebra with Ampersand
- Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems
- Type inference for set theory
- On solvability of systems of partial fuzzy relational equations
- Extending rely-guarantee thinking to handle real-time scheduling
- Algebraic proofs of consistency and completeness
- A single complete rule for data refinement
- Simple consequence relations
- A non-deterministic view on non-classical negations
- Transposing partial components--an exercise on coalgebraic refinement
- A logic for Miranda
- 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
- The axiomatization of override and update
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)
