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