scientific article; zbMATH DE number 236855

Cited in

(only showing first 100 items - show all)

Context-sensitive meta-constraint systems for explainable program analysis
A portable approach to dynamic optimization in run-time specialization
Computing in unpredictable environments: Semantics, reduction strategies, and program transformations
An NSF proposal
Derivation of efficient logic programs by specialization and reduction of nondeterminism
Schlegel diagram and optimizable immediate snapshot protocol
Accurate binding-time analysis for imperative languages: Flow, context, and return sensitivity
Accurate program analyses for successful specialization of legacy system software
Extending a partial evaluator which supports separate compilation
Lambda-dropping: Transforming recursive equations into programs with block structure
Type-based homeomorphic embedding for online termination
Proving the correctness of recursion-based automatic program transformations
Condition/decision duality and the internal logic of extensive restriction categories
Proving the correctness of recursion-based automatic program transformations
Termination of Narrowing in Left-Linear Constructor Systems
Oracle-based partial evaluation
Fast offline partial evaluation of logic programs
REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION
Efficient reductants calculi using partial evaluation techniques with thresholding
A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs
Computing in unpredictable environments: semantics, reduction strategies, and program transformations
Constraint-based partial evaluation for imperative languages
New architectures for constructed complex systems
Self-generating program specializers
Intensional computation with higher-order functions
A partial evaluation framework for order-sorted equational programs modulo axioms
Programs as data structures in \(\lambda\)SF-calculus
INSTANCE-SPECIFIC SOLUTIONS FOR ACCELERATING THE CKY PARSING OF LARGE CONTEXT-FREE GRAMMARS
scientific article; zbMATH DE number 7526055 (Why is no real title available?)
Generalizing Cook's transformation to imperative stack programs
A hybrid approach to conjunctive partial evaluation of logic programs
Analysis and Transformation of Constrained Horn Clauses for Program Verification
Preserving Sharing in the Partial Evaluation of Lazy Functional Programs
Chemical foundations of distributed aspects
Efficient instance retrieval with standard and relational path indexing
Enhancing the implementation of mathematical formulas for fixed-point and floating-point arithmetics
On obtaining the Boyer-Moore string-matching algorithm by partial evaluation
Ensuring the quasi-termination of needed narrowing computations
Closed-form upper bounds in static cost analysis
The development of a partial evaluator for extended lambda calculus
Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
Termination of narrowing via termination of rewriting
Automatically splitting a two-stage lambda calculus
Syntactic type soundness for the region calculus
Termination of floating-point computations
Code analysis for temporal predictability
An investigation of Jones optimality and BTI-universal specializers
Fast Offline Partial Evaluation of Large Logic Programs
MetaML and multi-stage programming with explicit annotations
A regeneration scheme for generating extensions
Self-quotation in a typed, intensional lambda-calculus
Applying abstract acceleration to (co-)reachability analysis of reactive programs
Horn clause solvers for program verification
An iterative approach to precondition inference using constrained Horn clauses
On reductants in the framework of multi-adjoint logic programming
Reversible computing from a programming language perspective
Impact of accuracy optimization on the convergence of numerical iterative methods
Proof-directed program transformation: a functional account of efficient regular expression matching
Termination analysis for offline partial evaluation of a higher order functional language
Reverse universal resolving algorithm and inverse driving
An improved reductant calculus using fuzzy partial evaluation techniques
Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant
Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
Lambda calculus with explicit recursion
A residualizing semantics for the partial evaluation of functional logic programs.
Generalization strategies for the verification of infinite state systems
Optimizing Maude programs via program specialization
Fusing logic and control with local transformations: an example optimization
A practical simulation result for two-way pushdown automata
Maximally-polyvariant partial evaluation in polynomial time
Narrowing and rewriting logic: from foundations to applications
Type specialization in Aldor
Transformation-Enabled Precondition Inference
Symbolic Specialization of Rewriting Logic Theories with Presto
Open call-by-value
Programming in biomolecular computation
Composition is almost (but not quite) as good as \(s-1-1\)
Imperative-program transformation by instrumented-interpreter specialization
scientific article; zbMATH DE number 7453195 (Why is no real title available?)
scientific article; zbMATH DE number 1497826 (Why is no real title available?)
scientific article; zbMATH DE number 1497828 (Why is no real title available?)
scientific article; zbMATH DE number 1497831 (Why is no real title available?)
Program verification: state of the art, problems, and results. I
A Logical Foundation for Environment Classifiers
A survey of strategies in rule-based program transformation systems
Model-checking process equivalences
Constructive linear-time temporal logic: proof systems and Kripke semantics
Optimization of rewrite theories by equational partial evaluation
On one application of computations with oracle
Property-driven code obfuscations reinterpreting Jones-optimality in abstract interpretation
Solving non-linear Horn clauses using a linear Horn clause solver
Rules + strategies for transforming lazy functional logic programs
Program specialization as a tool for solving word equations
Inter-deriving Semantic Artifacts for Object-Oriented Programming
An Action Semantics Based on Two Combinators
Asymptotic speedups, bisimulation and distillation (work in progress)
Interleaving symbolic execution and partial evaluation
The next 700 program transformers
A Case Study in Abstract Interpretation Based Program Transformation
Binding-time analysis for both static and dynamic expressions

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 Q5287559)