Nepomniaschy Valery Alexandrovich

Publications in Math-Net.Ru

1. The automation of C program verification by symbolic method of loop invariants elimination
   
   Model. Anal. Inform. Sist., 25:5 (2018),  491–505
2. Invariant elimination of definite iterations over arrays in C programs verification
   
   Model. Anal. Inform. Sist., 24:6 (2017),  743–754
3. Application of coloured Petri nets for verification of scenario control structures in UCM notation
   
   Model. Anal. Inform. Sist., 23:6 (2016),  688–702
4. Loop invariants elimination for definite iterations over unchangeable data structures in C programs
   
   Model. Anal. Inform. Sist., 22:6 (2015),  773–782
5. The application of coloured Petri nets to verification of distributed systems specified by message sequence charts
   
   Proceedings of ISP RAS, 27:3 (2015),  197–218
6. Analysis and verification of message sequence charts of distributed systems with the help of Coloured Petri Nets
   
   Model. Anal. Inform. Sist., 21:6 (2014),  94–106
7. Automatic C Program Verification Based on Mixed Axiomatic Semantics
   
   Model. Anal. Inform. Sist., 20:6 (2013),  52–63
8. Tools of Integrated Technology for Analysis and Verification of Telecom Application Specs
   
   Tr. SPIIRAN, 26 (2013),  349–383
9. Deductive Verification of the Sliding Window Protocol
   
   Model. Anal. Inform. Sist., 19:6 (2012),  57–68
10. Verification of telecommunication systems specified by communicating finite automata with the help of coloured Petri nets
    
    Model. Anal. Inform. Sist., 18:4 (2011),  144–156
11. C program verification in the multilanguage system spectrum
    
    Model. Anal. Inform. Sist., 17:4 (2010),  88–100
12. C-programs verification on basis of mixed axiomatic semantics
    
    Model. Anal. Inform. Sist., 17:3 (2010),  5–28
13. On the completeness of operations in operator algorithms
    
    Dokl. Akad. Nauk SSSR, 199:4 (1971),  780–782
14. Rudimentary predicates and Turing computations
    
    Dokl. Akad. Nauk SSSR, 195:2 (1970),  282–284
15. On certain automata capable of computing a basis for recursively enumerable sets
    
    Algebra i Logika. Sem., 5:5 (1966),  69–83
16. A basis for recursively-enumerable sets
    
    Dokl. Akad. Nauk SSSR, 170:6 (1966),  1262–1264


17. Boris Abramovich Trakhtenbrot (on the centenary of his birth)
    
    Uspekhi Mat. Nauk, 77:1(463) (2022),  191–195
18. From the editors of the special issue
    
    Model. Anal. Inform. Sist., 21:6 (2014),  5–6
19. From the editors of the special issue
    
    Model. Anal. Inform. Sist., 18:4 (2011),  5–6
20. From the editors of the special issue
    
    Model. Anal. Inform. Sist., 17:4 (2010),  1–2