Fine-grained concurrent completion
From MaRDI portal
Publication:5055848
DOI10.1007/3-540-61464-8_39zbMATH Open1503.68123OpenAlexW1562935458MaRDI QIDQ5055848FDOQ5055848
Authors:
Publication date: 9 December 2022
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61464-8_39
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
Grammars and rewriting systems (68Q42) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cites Work
- Distributed deduction by clause-diffusion: Distributed contraction and the Aquarius prover
- On the sequential nature of unification
- An algorithm for finding canonical sets of ground rewrite rules in polynomial time
- Title not available (Why is that?)
- Fine-grained concurrent completion
- A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
- Modularity of completeness revisited
- Derivation of a termination detection algorithm for distributed computations
- Partheo: A high-performance parallel theorem prover
- Title not available (Why is that?)
Cited In (2)
Uses Software
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)
