Pages that link to "Item:Q1758688"
From MaRDI portal
The following pages link to On an equivalence checking technique for algebraic models of programs (Q1758688):
Displaying 16 items.
- Studies in the theory of algebraic models of programs with procedures (Q300376) (← links)
- Algorithm for verifying the equivalence of linear unary recursive programs on ordered semigroup scales (Q357923) (← links)
- Technique of traces in solving the equivalence problem in algebraic program models (Q844347) (← links)
- Efficient algorithms for checking the equivalence of programs in interrupt handling models (Q949234) (← links)
- The problem of equivalence in commutative s-models for programs (Q1111006) (← links)
- On the construction of complete systems of equivalent transformations of program schemes (Q1276514) (← links)
- A polynomial-time algorithm that recognizes the commutative equivalence of program schemata (Q1594177) (← links)
- Complete systems of equivalent transformations in balanced semigroup models of programs with left cancellation (Q1758669) (← links)
- On the polynomial complexity of the equivalence checking problem in algebraic models of programs (Q2452734) (← links)
- (Q2764059) (← links)
- Equivalence checking using structural methods (Q2783110) (← links)
- Algorithmic algebraic model checking. III: Approximate methods (Q2852017) (← links)
- AlPiNA: A Symbolic Model Checker (Q3569873) (← 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)
- (Q5754533) (← links)
