Fine-grained concurrent completion
From MaRDI portal
Publication:5055848
Recommendations
- scientific article; zbMATH DE number 1263425
- scientific article; zbMATH DE number 1241620
- scientific article; zbMATH DE number 4030960
- On the Knuth-Bendix completion for concurrent processes
- Strategy compliant multi-threaded term completion
- Multi-completion with termination tools
- Continuous completions
- Partial memoization of concurrency and communication
Cites work
- scientific article; zbMATH DE number 1375600 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
- An algorithm for finding canonical sets of ground rewrite rules in polynomial time
- Derivation of a termination detection algorithm for distributed computations
- Distributed deduction by clause-diffusion: Distributed contraction and the Aquarius prover
- Fine-grained concurrent completion
- Modularity of completeness revisited
- On the sequential nature of unification
- Partheo: A high-performance parallel theorem prover
This page was built for publication: Fine-grained concurrent completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055848)