Igor S. Anureev E-mail anureev@iis.nsk.su Organization A.P. Ershov Institute of Informatics Systems SB RAS — senior researcher Academic degree PhD
Anureev I., Maryasov I., Mikhailov I. Method of the development of ontological operational semantics for imperative programming languages // Computer Science. — 2016. — # 40 — P. 15–35
Anureev I. Operational semantics development for procedural programming languages based on conceptual transition systems // Computer Science. — 2015. — # 38 — P. 1-28
Anureev I. Domain-specific transition systems and their application to a formal definition of a model programming language // Computer Science. — 2014. — # 37 — P. 23-39
Anureev I., Maryasov I., Nepomniaschy V. Two-level mixed verification method of C-light programs in terms of safety logic // Computer Science. — 2012. — # 34 — P. 23-42
Anureev I. Integrated approach to analysis and verification of imperative programs // Computer Science. — 2011. — # 32 — P. 1-18
Anureev I. Context machines as formalism for specification of dynamic systems // Computer Science. — 2009. — # 29 — P. 1-16
Anureev I. A three-stage method of C program verification // Computer Science. — 2008. — # 28 — P. 1-29
Anureev I., Bodin E., Gorodnyaya L., Marchuk A., Murzin F., Shilov N. On the problem of computer language classification // Computer Science. — 2008. — # 28 — P. 31-42
Anureev I. A language of actions in ontological transition systems // Computer Science. — 2007. — # 26 — P. 19-38
Anureev I., Bodin E., Shilov N. Effective generation of verification conditions for non-deterministic unstructured programs // Computer Science. — 2007. — # 26 — P. 39-63
Anureev I. Unified semantic language: syntax, semantics, and pragmatics // Computer Science. — 2004. — # 20 — P. 1-30
Nepomniaschy V., Anureev I., Dubranovsky I., Promsky A. A three-level approach to C# program verification // Computer Science. — 2004. — # 20 — P. 61-85
Anureev I. Program verification based on the specification language SIMPLE // Computer Science. — 2001. — # 15 — P. 1-16
Anureev I. A multi-branch narrowing: satisfiability and termination // Computer Science. — 2000. — # 13 — P. 1-11
Anureev I. Formula rewriting systems and their application to automated program verification // Computer Science. — 1999. — # 12 — P. 1-5
Anureev I. A method for simplification procedure design based on formula rewriting systems // Computer Science. — 1998. — # 8 — P. 1-18
