z-logo
open-access-imgOpen Access
Polynomial time algorithm for checking strong equivalence of program
Author(s) -
В. А. Захаров,
Т.А. Новикова
Publication year - 2012
Publication title -
proceedings of the institute for system programming of ras
Language(s) - English
Resource type - Journals
eISSN - 2220-6426
pISSN - 2079-8156
DOI - 10.15514/ispras-2012-22-23
Subject(s) - decidability , equivalence (formal languages) , equivalence relation , formal equivalence checking , time complexity , logical equivalence , mathematics , discrete mathematics , computer science , algorithm , model checking

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom