scientific article; zbMATH DE number 236855
From MaRDI portal
Publication:5287559
Cited in
(only showing first 100 items - show all)- Rules + strategies for transforming lazy functional logic programs
- Efficient reductants calculi using partial evaluation techniques with thresholding
- Program verification: state of the art, problems, and results. I
- On one application of computations with oracle
- Lambda calculus with explicit recursion
- Partial evaluation of Maple
- 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
- A hybrid approach to conjunctive partial evaluation of logic programs
- Efficient and flexible access control via Jones-optimal logic program specialisation
- New architectures for constructed complex systems
- The development of a partial evaluator for extended lambda calculus
- A Logical Foundation for Environment Classifiers
- Inter-deriving Semantic Artifacts for Object-Oriented Programming
- Termination of Narrowing in Left-Linear Constructor Systems
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
- Applying abstract acceleration to (co-)reachability analysis of reactive programs
- Preserving Sharing in the Partial Evaluation of Lazy Functional Programs
- Fusing logic and control with local transformations: an example optimization
- Encoding types in ML-like languages
- Type-based homeomorphic embedding for online termination
- Constructive linear-time temporal logic: proof systems and Kripke semantics
- Parallel dynamic semantics of sequential programs with speculative and incremental computation
- Binding-time analysis for both static and dynamic expressions
- Imperative-program transformation by instrumented-interpreter specialization
- Self-generating program specializers
- DyC: An expressive annotation-directed dynamic compiler for C
- Proving the correctness of recursion-based automatic program transformations
- Proving the correctness of recursion-based automatic program transformations
- Composition is almost (but not quite) as good as \(s-1-1\)
- A calculus for reasoning about software composition
- An NSF proposal
- Derivation of efficient logic programs by specialization and reduction of nondeterminism
- Computing in unpredictable environments: Semantics, reduction strategies, and program transformations
- Reverse universal resolving algorithm and inverse driving
- MetaML and multi-stage programming with explicit annotations
- Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
- Solving non-linear Horn clauses using a linear Horn clause solver
- Termination of floating-point computations
- Code analysis for temporal predictability
- An investigation of Jones optimality and BTI-universal specializers
- Generalization strategies for the verification of infinite state systems
- Programming in biomolecular computation
- Termination of narrowing via termination of rewriting
- On reductants in the framework of multi-adjoint logic programming
- 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
- INSTANCE-SPECIFIC SOLUTIONS FOR ACCELERATING THE CKY PARSING OF LARGE CONTEXT-FREE GRAMMARS
- Horn clause solvers for program verification
- An improved reductant calculus using fuzzy partial evaluation techniques
- Closed-form upper bounds in static cost analysis
- An iterative approach to precondition inference using constrained Horn clauses
- Programs as data structures in \(\lambda\)SF-calculus
- Maximal incompleteness as obfuscation potency
- Extending abstract acceleration methods to data-flow programs with numerical inputs
- Partial evaluation of string obfuscations for Java malware detection
- scientific article; zbMATH DE number 6982909 (Why is no real title available?)
- REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION
- A regeneration scheme for generating extensions
- Computing in unpredictable environments: semantics, reduction strategies, and program transformations
- A survey of strategies in rule-based program transformation systems
- Model-checking process equivalences
- Optimization of rewrite theories by equational partial evaluation
- 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?)
- Narrowing and rewriting logic: from foundations to applications
- A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs
- Fast offline partial evaluation of logic programs
- Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant
- Intensional computation with higher-order functions
- Efficient instance retrieval with standard and relational path indexing
- Chemical foundations of distributed aspects
- Schlegel diagram and optimizable immediate snapshot protocol
- Transformation-Enabled Precondition Inference
- Symbolic Specialization of Rewriting Logic Theories with Presto
- A Case Study in Abstract Interpretation Based Program Transformation
- Impact of accuracy optimization on the convergence of numerical iterative methods
- An Action Semantics Based on Two Combinators
- A unifying approach to goal-directed evaluation
- A portable approach to dynamic optimization in run-time specialization
- The applicability of logic program analysis and transformation to theorem proving
- Oracle-based partial evaluation
- Tree dimension in verification of constrained Horn clauses
- Proof-directed program transformation: a functional account of efficient regular expression matching
- Program specialization as a tool for solving word equations
- Generalizing Cook's transformation to imperative stack programs
- Condition/decision duality and the internal logic of extensive restriction categories
- A partial evaluation framework for order-sorted equational programs modulo axioms
- Asymptotic speedups, bisimulation and distillation (work in progress)
- Reversible computing from a programming language perspective
- Optimizing Maude programs via program specialization
- Termination analysis for offline partial evaluation of a higher order functional language
- The next 700 program transformers
- Property-driven code obfuscations reinterpreting Jones-optimality in abstract interpretation
- scientific article; zbMATH DE number 7526055 (Why is no real title available?)
- Context-sensitive meta-constraint systems for explainable program analysis
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)
