The following pages link to (Q5452362):
Displaying 50 items.
- Fast deterministic parsers for transition networks (Q1789065) (← links)
- Slicing programs in the presence of errors (Q1815347) (← links)
- On the look-ahead problem in lexical analysis (Q1899099) (← links)
- Logical approximation for program analysis (Q1929363) (← links)
- Identifying approximately common substructures in trees based on a restricted edit distance (Q1971775) (← links)
- Tolerating radiation-induced transient faults in modern processors (Q2268752) (← links)
- OSiL: An instance language for optimization (Q2268923) (← links)
- Composing stack-attributed tree transducers (Q2272204) (← links)
- How downwards causation occurs in digital computers (Q2286509) (← links)
- Fast enumeration of words generated by Dyck grammars (Q2342339) (← links)
- Minimal type inference for linked data consumers (Q2348796) (← links)
- Modeling instruction semantics in ADL processor descriptions for C compiler retargeting (Q2432194) (← links)
- BRNGLR: a cubic Tomita-style GLR parsing algorithm (Q2458444) (← links)
- Secure evolvable hardware for public-key cryptosystems (Q2493297) (← links)
- Generation of positive and negative tests for parsers (Q2498284) (← links)
- Recursive descent parsing for Boolean grammars (Q2641876) (← links)
- Recognition is not parsing - SPPF-style parsing from cubic recognisers (Q2653934) (← links)
- A program auto-parallelizer based on the component technology of optimizing compiler construction (Q2654999) (← links)
- ASF+SDF parsing tools applied to ELAN (Q2703695) (← links)
- SICStus Prolog -- the first 25 years (Q2893089) (← links)
- The complexity of regular(-like) expressions (Q2909093) (← links)
- Matrix-Free Convex Optimization Modeling (Q2957708) (← links)
- Conjunctive Abstract Interpretation Using Paramodulation (Q2961582) (← links)
- A New Acceleration-Based Combination Framework for Array Properties (Q2964461) (← links)
- Nominal Automata with Name Binding (Q2988364) (← links)
- Partial Derivatives for Context-Free Languages (Q2988372) (← links)
- Modelling of electromechanical systems with switch circuits by using transmission elements (Q3015947) (← links)
- Typed quote/antiquote or: Compile-time parsing (Q3016212) (← links)
- ON FORMAL AND COGNITIVE SEMANTICS FOR SEMANTIC COMPUTING (Q3062792) (← links)
- Regular Expressions at Their Best: A Case for Rational Design (Q3073651) (← links)
- Strengthening Induction-Based Race Checking with Lightweight Static Analysis (Q3075479) (← links)
- Quantum Automata Theory – A Review (Q3098037) (← links)
- One-Sided Random Context Grammars with Leftmost Derivations (Q3166950) (← links)
- Combining Model Checking and Data-Flow Analysis (Q3176374) (← links)
- Optimizing Pointer Analysis Using Bisimilarity (Q3392929) (← links)
- Automated Generation of Positive and Negative Tests for Parsers (Q3434611) (← links)
- From Safety Critical Java Programs to Timed Process Models (Q3460876) (← links)
- PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA (Q3503094) (← links)
- Computation Tree Regular Logic for Genetic Regulatory Networks (Q3540063) (← links)
- An Introduction to Grammar Convergence (Q3605471) (← links)
- Regular-expression derivatives re-examined (Q3616446) (← links)
- Test Data Generation of Bytecode by CLP Partial Evaluation (Q3617426) (← links)
- Traces of Control-Flow Graphs (Q3637222) (← links)
- From Tessellations to Table Interpretation (Q3637299) (← links)
- A Table Compression Method for Extended Aho-Corasick Automaton (Q3637345) (← links)
- Analyzing Real-Time Event-Driven Programs (Q3648830) (← links)
- (Q4234365) (← links)
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
- ACCELERATION OF QUANTUM ALGORITHMS USING THREE-QUBIT GATES (Q4674235) (← links)
- An algorithm for dynamic processing of dawg's (Q4844553) (← links)
