The following pages link to (Q5452362):
Displaying 44 items.
- Modeling grammatical evolution by automaton (Q351022) (← links)
- Approximating the buffer allocation problem using epochs (Q436884) (← links)
- On the incremental growth and shrinkage of LR goto-graphs (Q471185) (← links)
- Hoare logic-based genetic programming (Q543275) (← links)
- A predictive bottom-up parser (Q644894) (← links)
- Magic-sets for localised analysis of Java bytecode (Q656846) (← links)
- High speed synchronization of processors using fuzzy barriers (Q750131) (← links)
- Data flow analysis of distributed communicating processes (Q751233) (← links)
- An operational semantics for paragon: A design notation for parallel architectures (Q756433) (← links)
- Transformational derivation of an improved alias analysis algorithm (Q815001) (← links)
- Deriving escape analysis by abstract interpretation (Q857916) (← links)
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach (Q880526) (← links)
- Properties of data flow frameworks: A unified model (Q910237) (← links)
- Uncle-attributed grammars (Q911316) (← links)
- The calculus of context relations (Q918720) (← links)
- Defining, analysing and implementing communication protocols using attribute grammars (Q919803) (← links)
- Object-oriented description of graph data structures (Q927450) (← links)
- Efficient SIMD optimization for media processors (Q931944) (← links)
- From flow logic to static type systems for coordination languages (Q967521) (← links)
- LR error repair using the A* algorithm (Q969645) (← links)
- An introduction to compilation issues for parallel machines (Q973430) (← links)
- A novel analysis space for pointer analysis and its application for bug finding (Q988180) (← links)
- The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution (Q988183) (← links)
- Type inference and strong static type checking for Promela (Q988201) (← links)
- The time complexity of typechecking tree-walking tree transducers (Q1014274) (← links)
- Krylov subspace spectral methods for the time-dependent Schrödinger equation with non-smooth potentials (Q1027787) (← links)
- On the implementation of automatic differentiation tools (Q1029809) (← links)
- On regular tree languages and deterministic pushdown automata (Q1037619) (← links)
- Early action in an Earley parser (Q1038423) (← links)
- Component approach for construction of optimizing compilers (Q1040339) (← links)
- Automatic symmetry detection for Promela (Q1040774) (← links)
- Research on closed-loop simulation system for digital AC servo system (Q1045436) (← links)
- Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages) (Q1123986) (← links)
- Algorithms for finding matrix models of propositional calculi (Q1181707) (← links)
- Dataflow analysis of array and scalar references (Q1186095) (← links)
- Parallelization of WHILE loops on pipelined architectures (Q1186817) (← links)
- Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703) (← links)
- Regular expressions into finite automata (Q1314367) (← links)
- Optimal loop storage allocation for argument-fetching dataflow machines (Q1322508) (← links)
- Profile-assisted instruction scheduling (Q1329105) (← links)
- Dynamic dictionary matching (Q1337462) (← links)
- Specification, verification and prototyping of an optimized compiler (Q1346607) (← links)
- The validation of SGML content models (Q1370524) (← links)
- Regular expression simplification (Q1404690) (← links)
