Unifying theories for logic programming
From MaRDI portal
Recommendations
Cited in
(76)- Refinement and verification in component-based model-driven design
- Behaviour approximated on subgroups
- Against digital ontology
- A CSP model with flexible parallel termination semantics
- Logic programming with external procedures: Introducing S-unification
- The role of standardising apart in logic programming
- A calculus for schemas in Z
- On the antisymmetry of Galois embeddings
- Soundness of data refinement for a higher-order imperative language
- An algebraic hardware/software partitioning algorithm
- A fixpoint theory for non-monotonic parallelism
- Sound refactorings
- Infinite executions of lazy and strict computations
- Foundations of logic programming in hybrid logics with user-defined sharing
- The weakest specifunction
- 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
- An algebraic approach for compiling real-time programs
- Semantic domains for Handel-C
- Unifying lazy and strict computations
- Pair algebras and Galois connections.
- rCOS: defining meanings of component-based software architectures
- 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
- Data refinement with probability in mind
- A graph-based implementation for mechanized refinement calculus of OO programs
- Unifying heterogeneous state-spaces with lenses
- scientific article; zbMATH DE number 4178744 (Why is no real title available?)
- Translating Testing Theories for Concurrent Systems
- Levels of abstraction and the Turing test
- Safe Reasoning with Logic LTS
- CSP with Hierarchical State
- Philosophical Conceptions of Information
- Synthesis of a unification algorithm in a logic programming calculus
- scientific article; zbMATH DE number 3921947 (Why is no real title available?)
- scientific article; zbMATH DE number 3980532 (Why is no real title available?)
- Extended unification algorithms for the integration of functional programming into logic programming
- Specifying termination in CSP
- scientific article; zbMATH DE number 517056 (Why is no real title available?)
- scientific article; zbMATH DE number 675534 (Why is no real title available?)
- Connectors as designs: modeling, refinement and test case generation
- Mechanised wire-wise verification of Handel-C synthesis
- Refinement-oriented models of Stateflow charts
- An interactive semantics of logic programming
- Unifying Semantics for Concurrent Programming
- Selective Unification in (Constraint) Logic Programming*
- Unifying Theories of Logic and Specification
- Complete model-based equivalence class testing for nondeterministic systems
- Towards a meaning of life
- Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl)
- A semantics for behavior trees using CSP with specification commands
- Properties of a Pruning Operator
- Imperative abstractions for functional actions
- An algebraic approach to the design of compilers for object-oriented languages
- An algebraic approach to simulation and verification for cyber-physical systems with shared-variable concurrency
- Algebras for iteration and infinite computations
- Testing for refinement in \textsf{Circus}
- Correct hardware synthesis
- Regular algebra applied to language problems
- Normal design algebra
- Angelic nondeterminism in the unifying theories of programming
- rCOS: a refinement calculus of object systems
- Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited
- Local variable scoping and Kleene algebra with tests
- Modelling higher-order dual nondeterminacy
- Service refinement
- CSP is a retract of CCS
- A process algebraic framework for specification and validation of real-time systems
- Robustness testing for software components
This page was built for publication: Unifying theories for logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2767980)
