Finite Differencing of Computable Expressions

DOI10.1145/357172.357177zbMath0484.68009OpenAlexW1992808564MaRDI QIDQ3943982

No author found.

Publication date: 1982

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/357172.357177

zbMATH Keywords

verificationprogram transformationprogram optimizationprogram semanticsstrength reductiondifferentiable expressioniterator inversion

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

\textsc{Diffy}: inductive reasoning of array programs using difference invariants, Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study, Differential logical relations. II: Increments and derivatives, Combining relational calculus and the Dijkstra-Gries method for deriving relational programs, Cofree coalgebras and differential linear logic, Integration of expert systems and database management systems. - An extended disjunctive normal form approach, A sheaf-theoretic approach to pattern matching and related problems, Iterate, Incrementalize, and Implement: A Systematic Approach to Efficiency Improvement and Guarantees, A type system for reflective program generators, Representing proof transformations for program optimization, A Modular Static Analysis Approach to Affine Loop Invariants Detection, View-Augmented Abstractions, A linear time solution to the single function coarsest partition problem, Transformational derivation of an improved alias analysis algorithm, Derivation of efficient logic programs by specialization and reduction of nondeterminism