scientific article
From MaRDI portal
Publication:2767980
zbMath1005.68036MaRDI QIDQ2767980
Publication date: 30 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (59)
An algebraic hardware/software partitioning algorithm ⋮ A fixpoint theory for non-monotonic parallelism ⋮ Pair algebras and Galois connections. ⋮ Translating Testing Theories for Concurrent Systems ⋮ Levels of abstraction and the Turing test ⋮ Normal design algebra ⋮ Unifying Heterogeneous State-Spaces with Lenses ⋮ Angelic nondeterminism in the unifying theories of programming ⋮ Unifying Lazy and Strict Computations ⋮ rCOS: a refinement calculus of object systems ⋮ Imperative abstractions for functional actions ⋮ An algebraic approach to the design of compilers for object-oriented languages ⋮ rCOS: Defining Meanings of Component-Based Software Architectures ⋮ Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited ⋮ Specifying termination in CSP ⋮ Connectors as designs: modeling, refinement and test case generation ⋮ Mechanised wire-wise verification of Handel-C synthesis ⋮ Refinement-oriented models of Stateflow charts ⋮ A Discrete Geometric Model of Concurrent Program Execution ⋮ A New Roadmap for Linking Theories of Programming ⋮ Towards a UTP Semantics for Modelica ⋮ A Two-Way Path Between Formal and Informal Design of Embedded Systems ⋮ UTP Semantics of Reactive Processes with Continuations ⋮ Local variable scoping and Kleene algebra with tests ⋮ Data Refinement with Probability in Mind ⋮ A Graph-Based Implementation for Mechanized Refinement Calculus of OO Programs ⋮ Modelling higher-order dual nondeterminacy ⋮ Service refinement ⋮ Complete model-based equivalence class testing for nondeterministic systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ CSP is a retract of CCS ⋮ Unifying Semantics for Concurrent Programming ⋮ The weakest specifunction ⋮ A process algebraic framework for specification and validation of real-time systems ⋮ A semantics for behavior trees using CSP with specification commands ⋮ Sound refactorings ⋮ Algebras for iteration and infinite computations ⋮ Safe Reasoning with Logic LTS ⋮ Robustness testing for software components ⋮ CSP with Hierarchical State ⋮ Refinement and verification in component-based model-driven design ⋮ Philosophical Conceptions of Information ⋮ Behaviour approximated on subgroups ⋮ Testing for refinement in \textsf{Circus} ⋮ Correct hardware synthesis ⋮ Against digital ontology ⋮ A CSP model with flexible parallel termination semantics ⋮ Set-Theoretic Models of Computations ⋮ Model-Based Mutation Testing of Reactive Systems ⋮ A Relational Approach to an Algebraic Community: From Paul Erdős to He Jifeng ⋮ Algebraic Program Semantics for Supercomputing ⋮ Modeling and Specification of Real-Time Interfaces with UTP ⋮ Generic Models of the Laws of Programming ⋮ A calculus for schemas in Z ⋮ Infinite executions of lazy and strict computations ⋮ On the antisymmetry of Galois embeddings ⋮ Soundness of data refinement for a higher-order imperative language ⋮ Regular algebra applied to language problems
This page was built for publication:
