Compiler optimization correctness by temporal logic

DOI10.1023/B:LISP.0000029444.99264.c0zbMath1075.68015WikidataQ123207362 ScholiaQ123207362MaRDI QIDQ1768477

Carl Christian Frederiksen, Eric Van Wyk, Neil D. Jones, David Lacey

Publication date: 15 March 2005

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

model checkingtemporal logicoptimizing compilerscompiler verification

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items (4)

Asymptotic Speedups, Bisimulation and Distillation (Work in Progress) ⋮ A higher-order strategy for eliminating common subexpressions ⋮ Program and proof optimizations with type systems ⋮ Extracting Program Logics From Abstract Interpretations Defined by Logical Relations

This page was built for publication: Compiler optimization correctness by temporal logic