scientific article; zbMATH DE number 236855

zbMATH Open0875.68290MaRDI QIDQ5287559FDOQ5287559

Authors: Neil D. Jones, Carsten K. Gomard, Peter Sestoft

Publication date: 15 July 1993

Title of this publication is not available (Why is that?)

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of software (68N99)

Cited In (only showing first 100 items - show all)

Termination of Narrowing in Left-Linear Constructor Systems
REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION
Efficient reductants calculi using partial evaluation techniques with thresholding
Computing in unpredictable environments: semantics, reduction strategies, and program transformations
New architectures for constructed complex systems
Self-generating program specializers
INSTANCE-SPECIFIC SOLUTIONS FOR ACCELERATING THE CKY PARSING OF LARGE CONTEXT-FREE GRAMMARS
Programs as data structures in \(\lambda\)SF-calculus
A hybrid approach to conjunctive partial evaluation of logic programs
Preserving Sharing in the Partial Evaluation of Lazy Functional Programs
Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
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
Termination of narrowing via termination of rewriting
Termination of floating-point computations
Code analysis for temporal predictability
An investigation of Jones optimality and BTI-universal specializers
MetaML and multi-stage programming with explicit annotations
Horn clause solvers for program verification
An iterative approach to precondition inference using constrained Horn clauses
A regeneration scheme for generating extensions
Applying abstract acceleration to (co-)reachability analysis of reactive programs
On reductants in the framework of multi-adjoint logic programming
Reverse universal resolving algorithm and inverse driving
An improved reductant calculus using fuzzy partial evaluation techniques
Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
Generalization strategies for the verification of infinite state systems
Lambda calculus with explicit recursion
Fusing logic and control with local transformations: an example optimization
Programming in biomolecular computation
Imperative-program transformation by instrumented-interpreter specialization
Composition is almost (but not quite) as good as \(s-1-1\)
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
On one application of computations with oracle
Solving non-linear Horn clauses using a linear Horn clause solver
Rules + strategies for transforming lazy functional logic programs
Inter-deriving Semantic Artifacts for Object-Oriented Programming
Binding-time analysis for both static and dynamic expressions
Extending abstract acceleration methods to data-flow programs with numerical inputs
Efficient and flexible access control via Jones-optimal logic program specialisation
DyC: An expressive annotation-directed dynamic compiler for C
Title not available (Why is that?)
Maximal incompleteness as obfuscation potency
Partial evaluation of string obfuscations for Java malware detection
Partial evaluation of Maple
Encoding types in ML-like languages
Parallel dynamic semantics of sequential programs with speculative and incremental computation
A calculus for reasoning about software composition
Computing in unpredictable environments: Semantics, reduction strategies, and program transformations
An NSF proposal
Derivation of efficient logic programs by specialization and reduction of nondeterminism
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
Proving the correctness of recursion-based automatic program transformations
Oracle-based partial evaluation
A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs
Fast offline partial evaluation of logic programs
Constraint-based partial evaluation for imperative languages
Intensional computation with higher-order functions
Generalizing Cook's transformation to imperative stack programs
A partial evaluation framework for order-sorted equational programs modulo axioms
Title not available (Why is that?)
Analysis and Transformation of Constrained Horn Clauses for Program Verification
Efficient instance retrieval with standard and relational path indexing
Chemical foundations of distributed aspects
Syntactic type soundness for the region calculus
Automatically splitting a two-stage lambda calculus
Fast Offline Partial Evaluation of Large Logic Programs
Self-quotation in a typed, intensional lambda-calculus
Impact of accuracy optimization on the convergence of numerical iterative methods
Proof-directed program transformation: a functional account of efficient regular expression matching
Reversible computing from a programming language perspective
Termination analysis for offline partial evaluation of a higher order functional language
Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant
Optimizing Maude programs via program specialization
A residualizing semantics for the partial evaluation of functional logic programs.
A practical simulation result for two-way pushdown automata
Maximally-polyvariant partial evaluation in polynomial time
Narrowing and rewriting logic: from foundations to applications
Transformation-Enabled Precondition Inference
Symbolic Specialization of Rewriting Logic Theories with Presto
Type specialization in Aldor
Open call-by-value
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Optimization of rewrite theories by equational partial evaluation
Property-driven code obfuscations reinterpreting Jones-optimality in abstract interpretation

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)