The following pages link to Masami Hagiya (Q288805):
Displaying 49 items.
- Molecular computers for molecular robots as hybrid systems (Q288808) (← links)
- A typed \(\lambda\)-calculus for proving-by-example and bottom-up generalization procedure (Q674399) (← links)
- Synthesis of rewrite programs by higher-order and semantic unification (Q749216) (← links)
- Meta-circular interpreter for a strongly typed language (Q908683) (← links)
- A proof description language and its reduction system (Q1055769) (← links)
- Foundation of logic programming based on inductive definition (Q1075752) (← links)
- Generalization from partial parametrization in higher-order type theory (Q1122980) (← links)
- Higher order generalization and its application in program verification (Q1601844) (← links)
- Formalization and analysis of class loading in Java (Q1850957) (← links)
- Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms. (Q1853479) (← links)
- A transformation method for dynamic-sized tabulation (Q1892705) (← links)
- Implementation of Turing machine using DNA strand displacement (Q1989518) (← links)
- Self-stabilizing distributed algorithms by gellular automata (Q2038019) (← links)
- Self-stabilizing gellular automata (Q2326827) (← links)
- Universal Totalistic Asynchonous Cellular Automaton and Its Possible Implementation by DNA (Q2819160) (← links)
- Computational Soundness of Indistinguishability Properties without Computable Parsing (Q2894343) (← links)
- On DNA-Based Gellular Automata (Q2945537) (← links)
- (Q3024892) (← links)
- (Q3028318) (← links)
- (Q3044481) (← links)
- (Q3085177) (← links)
- Model Checking of Concurrent Algorithms: From Java to C (Q3163921) (← links)
- Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption (Q3631375) (← links)
- (Q4246979) (← links)
- (Q4263670) (← links)
- (Q4418585) (← links)
- (Q4529977) (← links)
- (Q4536408) (← links)
- (Q4737639) (← links)
- (Q4737643) (← links)
- (Q4737672) (← links)
- (Q4761820) (← links)
- Decidability and Undecidability Results on the Modal μ-Calculus with a Natural Number-Valued Semantics (Q4931597) (← links)
- Self-Stabilizing Distributed Algorithms by Gellular Automata (Q4957464) (← links)
- From programming-by-example to proving-by-example (Q5096230) (← links)
- On the Persistency of Gellular Automata (Q5112181) (← links)
- Functional and Logic Programming (Q5308008) (← links)
- A bounds inference method for vector-based memoization (Q5348874) (← links)
- Decidability of Safety Properties of Timed Multiset Rewriting (Q5392289) (← links)
- Unravel Four Hairpins! (Q5452588) (← links)
- Displacement Whiplash PCR: Optimized Architecture and Experimental Validation (Q5452589) (← links)
- Unconventional Computation (Q5479206) (← links)
- Automated Reasoning with Analytic Tableaux and Related Methods (Q5479283) (← links)
- DNA Computing (Q5494356) (← links)
- DNA Computing (Q5717645) (← links)
- DNA Computing (Q5717664) (← links)
- DNA Computing (Q5717674) (← links)
- Turing-completeness of asynchronous non-camouflage cellular automata (Q5915878) (← links)
- Turing-completeness of asynchronous non-camouflage cellular automata (Q5918964) (← links)
