Pages that link to "Item:Q3452271"
From MaRDI portal
The following pages link to Precise interprocedural analysis through linear algebra (Q3452271):
Displayed 15 items.
- A quantifier-elimination based heuristic for automatically generating inductive assertions for programs (Q882517) (← links)
- Reducing concurrent analysis under a context bound to sequential analysis (Q1039852) (← links)
- Reference count analysis with shallow aliasing (Q1944038) (← links)
- Computing polynomial program invariants (Q2390319) (← links)
- Generating all polynomial invariants in simple loops (Q2457430) (← links)
- LTL over integer periodicity constraints (Q2503321) (← links)
- An Iterative Method for Generating Loop Invariants (Q3004678) (← links)
- Invariant Checking for Programs with Procedure Calls (Q3392933) (← links)
- Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis (Q3512480) (← links)
- A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis (Q3512505) (← links)
- Certification Using the Mobius Base Logic (Q3602993) (← links)
- Elimination Techniques for Program Analysis (Q4916078) (← links)
- Interprocedural Analysis of Concurrent Programs Under a Context Bound (Q5458333) (← links)
- Upper Adjoints for Fast Inter-procedural Variable Equalities (Q5458395) (← links)
- Program Analysis Using Weighted Pushdown Systems (Q5458821) (← links)