The following pages link to Newtonian program analysis (Q2999782):
Displaying 13 items.
- Algebraic program analysis (Q832153) (← links)
- Convergence of Newton's method over commutative semirings (Q899320) (← links)
- A type checking algorithm for concurrent object protocols (Q1785846) (← links)
- Parikh's theorem: a simple and direct automaton construction (Q1944966) (← links)
- Approximate minimization of weighted tree automata (Q2064525) (← links)
- Equational theories for automata (Q2074221) (← links)
- Fuzzy set abstraction (Q2130563) (← links)
- Computing least and greatest fixed points in absorptive semirings (Q2695365) (← links)
- The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems (Q2800417) (← links)
- Introduction to the special issue on computational logic for verification (Q4644352) (← links)
- Tree dimension in verification of constrained Horn clauses (Q4644355) (← links)
- FPSOLVE: A Generic Solver for Fixpoint Equations Over Semirings (Q5744123) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)
