z-logo
open-access-imgOpen Access
Polynomial time algorithm for checking strong equivalence of program
Author(s) -
Vladimir A. Zakharov,
T.A. Novikova
Publication year - 2012
Publication title -
trudy instituta sistemnogo programmirovaniâ ran/trudy instituta sistemnogo programmirovaniâ
Language(s) - English
Resource type - Journals
eISSN - 2220-6426
pISSN - 2079-8156
DOI - 10.15514/ispras-2012-23-28
Subject(s) - decidability , equivalence (formal languages) , unification , time complexity , correctness , mathematics , logical equivalence , term (time) , discrete mathematics , substitution (logic) , formal equivalence checking , algorithm , computer science , algebra over a field , model checking , programming language , pure mathematics , physics , quantum mechanics

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