Pages that link to "Item:Q2452734"
From MaRDI portal
The following pages link to On the polynomial complexity of the equivalence checking problem in algebraic models of programs (Q2452734):
Displaying 12 items.
- Algorithm for verifying the equivalence of linear unary recursive programs on ordered semigroup scales (Q357923) (← links)
- On a class of algebraic models of programs of practical interest (Q395268) (← links)
- Technique of traces in solving the equivalence problem in algebraic program models (Q844347) (← links)
- Scheme inclusion verification algorithm in algebraic model of programs with constants (Q927457) (← links)
- Efficient algorithms for checking the equivalence of programs in interrupt handling models (Q949234) (← links)
- A polynomial-time algorithm that recognizes the commutative equivalence of program schemata (Q1594177) (← links)
- On an equivalence checking technique for algebraic models of programs (Q1758688) (← links)
- Deciding equivalence of separated non-nested attribute systems in polynomial time (Q2289099) (← links)
- Algorithmic algebraic model checking. III: Approximate methods (Q2852017) (← links)
- An Efficient Equivalence-checking Algorithm for a Model of Programs with Commutative and Absorptive Statements (Q4589207) (← links)
- Implementation and Application of Automata (Q5463990) (← links)
- A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems (Q5958118) (← links)
