Pages that link to "Item:Q1594177"
From MaRDI portal
The following pages link to A polynomial-time algorithm that recognizes the commutative equivalence of program schemata (Q1594177):
Displaying 10 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)
- Using algebraic models of programs for detecting metamorphic malwares (Q549466) (← links)
- Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time (Q875512) (← links)
- An algorithm deciding functional equivalence in a new class of program schemes (Q912596) (← links)
- On an equivalence checking technique for algebraic models of programs (Q1758688) (← links)
- Equivalence of conservative, free, linear program schemas is decidable (Q1853616) (← links)
- Program equivalence checking by two-tape automata (Q2452753) (← links)
- An Efficient Equivalence-checking Algorithm for a Model of Programs with Commutative and Absorptive Statements (Q4589207) (← links)
- Static Analysis (Q5466562) (← links)
