Syntax-guided termination analysis

DOI10.1007/978-3-319-96145-3_7MaRDI QIDQ6045001zbMATH OpenOpenAlexFDO

Authors Grigory Fedyukovich, Yueling Zhang, Aarti Gupta

Publication date 26 May 2023

Published in Computer Aided Verification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-96145-3_7

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 1761896
• scientific article; zbMATH DE number 2050923
• Static analysis for syntax objects
• Termination analysis for functional programs
• Termination of context-sensitive rewriting
• scientific article; zbMATH DE number 2018578
• Termination of term rewriting by interpretation
• Termination conventions and comparative semantics

Cited in

(16)

• Syntax checking either way
• Learning inductive invariants by sampling from frequency distributions
• Proving termination through conditional termination
• Proving Conditional Termination
• Alternation for termination
• Fold/unfold transformations for fixpoint logic
• Non-termination Checking for Imperative Programs
• Analysis and Transformation of Constrained Horn Clauses for Program Verification
• Proving unrealizability for syntax-guided synthesis
• Termination Analysis for the \pi -Calculus by Reduction to Sequential Program Termination
• Symbolic Model Construction for Saturated Constrained Horn Clauses
• Temporal verification of programs via first-order fixpoint logic
• An overview of the HFL model checking project
• CHC-COMP 2023: competition report
• Constraint-based relational verification
• Decision tree learning in CEGIS-based termination analysis

This page was built for publication: Syntax-guided termination analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6045001)