Entity usage
From MaRDI portal
This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.
Showing below up to 16 results in range #1 to #16.
- Automatic construction of test sets: Theoretical approach: Label: en
- Inductive synthesis of term rewriting systems: Label: en
- Some models of inductive syntactical synthesis from sample computations: Label: en
- Inductive synthesis of dot expressions: Label: en
- Inductive inference of recursive functions: Complexity bounds: Label: en
- Inductive inference of recursive functions: Qualitative theory: Label: en
- Toward knowledge-based specifications of languages: Label: en
- Using resolution for deciding solvable classes and building finite models: Label: en
- Type-theoretical semantics of some declarative languages: Label: en
- The programming system PRIZ: Label: en
- Complexity of probabilistic versus deterministic automata: Label: en
- Rigal — a programming language for compiler writing: Label: en
- Investigation of finitary calculus for a discrete linear time logic by means of infinitary calculus: Label: en
- A compositional proof system for distributed programs: Label: en
- Aggregate approach for specification, validation, simulation and implementation of computer network protocols: Label: en
- Automatic construction of test sets: Practical approach: Label: en