scientific article; zbMATH DE number 5344975
From MaRDI portal
Publication:3525697
Cited in
(52)- Optimizing the stack size of recursive functions
- A higher-order strategy for eliminating common subexpressions
- Operator precedence and the visibly pushdown property
- On the complexity of a linear ordering of weighted directed acyclic graphs
- Certified abstract cost analysis
- From regular expression matching to parsing
- Optimizing reversible programs
- Distinct fringe subtrees in random trees
- Spot the difference: a detailed comparison between B and Event-B
- Neural software vulnerability analysis using rich intermediate graph representations of programs
- Regular numeral systems for data structures
- Automatic synthesis of data-flow analyzers
- Correct approximation of IEEE 754 floating-point arithmetic for program verification
- Simplification of genetic programs: a literature survey
- Who dominates whom in the ecosystem? Energy flow bottlenecks and cascading extinctions
- Systematic discovery of the grammar of translational inhibition by RNA hairpins
- Some observations on LR-like parsing with delayed reduction
- Model approach to grammatical evolution: theory and case study
- New Developments in Parsing Mizar
- GUBS a Language for Synthetic Biology: Specification and Compilation
- Extension of superblock technique to hyperblock using predicate hierarchy graph
- Code optimization in FORM
- Improving multivariate Horner schemes with Monte Carlo tree search
- scientific article; zbMATH DE number 1263458 (Why is no real title available?)
- An extension of lazy abstraction with interpolation for programs with arrays
- scientific article; zbMATH DE number 7453192 (Why is no real title available?)
- Property-oriented expansion
- Generalized dominators for structured programs
- From Regular Expression Matching to Parsing
- EFFECTIVE TRANSLATION FOR LL(1)-GRAMMAR IN THE EXAMPLE OF A PROGRAMMING LANGUAGE
- Minimization of context-free grammars
- Compiling Janus to RSSA
- Non-self-embedding grammars and descriptional complexity
- One-unambiguous regular languages
- One-unambiguous regular languages
- Feynman integral evaluation by a sector decomposition approach (FIESTA)
- A Survey of the Proof-Theoretic Foundations of Logic Programming
- Fast matching of regular patterns with synchronizing counting
- Distributing and parallelizing non-canonical loops
- Optimization of reversible control flow graphs
- Formal methods for NFA equivalence: QBFs, witness extraction, and encoding verification
- Generating tokenizers with flat automata
- An efficient time-step-based self-adaptive algorithm for predictor-corrector methods of Runge-Kutta type
- Efficiency issues in the KBMAG procedure
- On typical hesitant fuzzy languages and automata
- Robotic system specification language use case
- Extended grammar-based fuzzing algorithm for JavaScript engines
- Non-Hausdorff parallelized manifolds over geometric models of conservative programs
- RoboWorld: verification of robotic systems with environment in the loop
- Timing-aware analysis of shared cache interference for non-preemptive scheduling
- Towards a library for straight-line programs
- Explaining safety violations in real-time systems
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 Q3525697)
