Regular path clauses and their application in solving loops
From MaRDI portal
Recommendations
Cites work
- A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
- A Transformation System for Developing Recursive Programs
- Abstract multiple specialization and its application to program parallelization
- Control-flow refinement by partial evaluation, and its application to termination and cost analysis
- Fast Algorithms for Solving Path Problems
- scientific article; zbMATH DE number 1324833 (Why is no real title available?)
- Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
- Invariant generation for multi-path loops with polynomial assignments
- Mechanical program analysis
- On the inference of resource usage upper and lower bounds
- Solving non-linear Horn clauses using a linear Horn clause solver
- The treatment of data types in EL1
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: Regular path clauses and their application in solving loops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6647300)