scientific article; zbMATH DE number 5254145
From MaRDI portal
Publication:5452362
Recommendations
- scientific article; zbMATH DE number 814823
- scientific article; zbMATH DE number 236850
- Modern Compiler Implementation in Java
- scientific article; zbMATH DE number 3843165
- scientific article; zbMATH DE number 1027561
- Compiler construction. Theory, design, generation
- scientific article; zbMATH DE number 4016161
- Compiler design. Syntactic and semantic analysis
- scientific article; zbMATH DE number 814099
- scientific article; zbMATH DE number 5912119
Cited in
(only showing first 100 items - show all)- The time complexity of typechecking tree-walking tree transducers
- Krylov subspace spectral methods for the time-dependent Schrödinger equation with non-smooth potentials
- On the implementation of automatic differentiation tools
- On regular tree languages and deterministic pushdown automata
- Early action in an Earley parser
- Component approach for construction of optimizing compilers
- Automatic symmetry detection for Promela
- Research on closed-loop simulation system for digital AC servo system
- Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages)
- Algorithms for finding matrix models of propositional calculi
- Dataflow analysis of array and scalar references
- Parallelization of WHILE loops on pipelined architectures
- Context-free hypergraph grammars have the same term-generating power as attribute grammars
- Regular expressions into finite automata
- Optimal loop storage allocation for argument-fetching dataflow machines
- Profile-assisted instruction scheduling
- Dynamic dictionary matching
- Specification, verification and prototyping of an optimized compiler
- The validation of SGML content models
- Regular expression simplification
- An efficient null-free procedure for deciding regular language membership
- Descending chains and narrowing on template abstract domains
- Model approach to grammatical evolution: deep-structured analyzing of model and representation
- A unifying view on SMT-based software verification
- Automation of the construction of models of normal program behavior
- Circular attribute grammars with remote attribute references and their evaluators
- Fast deterministic parsers for transition networks
- Slicing programs in the presence of errors
- On the look-ahead problem in lexical analysis
- Logical approximation for program analysis
- Identifying approximately common substructures in trees based on a restricted edit distance
- Tolerating radiation-induced transient faults in modern processors
- OSiL: An instance language for optimization
- Composing stack-attributed tree transducers
- How downwards causation occurs in digital computers
- Fast enumeration of words generated by Dyck grammars
- Minimal type inference for linked data consumers
- Modeling instruction semantics in ADL processor descriptions for C compiler retargeting
- BRNGLR: a cubic Tomita-style GLR parsing algorithm
- Secure evolvable hardware for public-key cryptosystems
- Generation of positive and negative tests for parsers
- Recursive descent parsing for Boolean grammars
- Recognition is not parsing - SPPF-style parsing from cubic recognisers
- A program auto-parallelizer based on the component technology of optimizing compiler construction
- ASF+SDF parsing tools applied to ELAN
- SICStus Prolog -- the first 25 years
- The complexity of regular(-like) expressions
- Matrix-free convex optimization modeling
- Conjunctive abstract interpretation using paramodulation
- A new acceleration-based combination framework for array properties
- Nominal automata with name binding
- Partial derivatives for context-free languages. From -regular expressions to pushdown automata
- Modelling of electromechanical systems with switch circuits by using transmission elements
- Typed quote/antiquote or: compile-time parsing
- On formal and cognitive semantics for semantic computing
- Regular expressions at their best: a case for rational design
- Strengthening induction-based race checking with lightweight static analysis
- Quantum automata theory -- a review
- One-sided random context grammars with leftmost derivations
- Combining model checking and data-flow analysis
- Optimizing Pointer Analysis Using Bisimilarity
- Automated Generation of Positive and Negative Tests for Parsers
- From safety critical Java programs to timed process models
- PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA
- Modeling grammatical evolution by automaton
- Computation Tree Regular Logic for Genetic Regulatory Networks
- An Introduction to Grammar Convergence
- Regular-expression derivatives re-examined
- Test Data Generation of Bytecode by CLP Partial Evaluation
- Traces of Control-Flow Graphs
- From Tessellations to Table Interpretation
- A Table Compression Method for Extended Aho-Corasick Automaton
- Analyzing Real-Time Event-Driven Programs
- scientific article; zbMATH DE number 4086978 (Why is no real title available?)
- scientific article; zbMATH DE number 1263458 (Why is no real title available?)
- Approximating the buffer allocation problem using epochs
- Modern Compiler Implementation in Java
- If the current clique algorithms are optimal, so is Valiant's parser
- ACCELERATION OF QUANTUM ALGORITHMS USING THREE-QUBIT GATES
- On the incremental growth and shrinkage of LR goto-graphs
- An algorithm for dynamic processing of dawg's
- Specifying and implementing visual process modeling languages with \textsc{DiaGen}
- A Computational Interpretation of Context-Free Expressions
- May-happen-in-parallel analysis for actor-based concurrency
- Hoare logic-based genetic programming
- Distinguishing redundant parentheses by syntax
- GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS
- Interprocedural Induction Variable Analysis
- EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES
- An optimal algorithm for the construction of the system dependence graph
- Error detection, error correction and performance evaluation in on-line mathematical expression recognition
- A predictive bottom-up parser
- Magic-sets for localised analysis of Java bytecode
- High speed synchronization of processors using fuzzy barriers
- Data flow analysis of distributed communicating processes
- An operational semantics for paragon: A design notation for parallel architectures
- Transformational derivation of an improved alias analysis algorithm
- Deriving escape analysis by abstract interpretation
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach
- Properties of data flow frameworks: A unified model
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452362)
