Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A polynomial-time algorithm that recognizes the commutative equivalence of program schemata

From MaRDI portal
Publication:1594177
Jump to:navigation, search

zbMath0959.68507MaRDI QIDQ1594177

Vladimir A. Zakharov, R. I. Podlovchenko

Publication date: 28 January 2001

Published in: Doklady Mathematics (Search for Journal in Brave)


zbMATH Keywords

polynomial algorithm\(c\)-equivalence


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) General topics in the theory of software (68N01)


Related Items (4)

On a class of algebraic models of programs of practical interest ⋮ Program equivalence checking by two-tape automata ⋮ On an equivalence checking technique for algebraic models of programs ⋮ Using algebraic models of programs for detecting metamorphic malwares






This page was built for publication: A polynomial-time algorithm that recognizes the commutative equivalence of program schemata

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1594177&oldid=13885094"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 02:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki