V. A. Nepomniaschy - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

2017

Application of Colored Petri Nets for Verification of Scenario Control Structures in UCM NotationN. V. Vizovitin, V. A. Nepomniaschy, A. A. Stenenko. accs, 51(7):489-497, 2017. [doi]

2013

Deductive verification of the Sliding Window ProtocolD. A. Chkliaev, V. A. Nepomniaschy. accs, 47(7):420-426, 2013. [doi]

2011

C program verification in SPECTRUM multilanguage systemV. A. Nepomniaschy, Igor S. Anureev, M. M. Atuchin, I. V. Maryasov, A. A. Petrov, Alexey V. Promsky. accs, 45(7):413-420, 2011. [doi]

2008

Modeling and verification of the SDL-specified communication protocols using high-level Petri netsV. A. Nepomniaschy, Victor S. Argirov, Dmitri M. Beloglazov, Alexandre V. Bystrov, Eugene A. Chetvertakov, Tatiana G. Churina. pcs, 34(6):330-340, 2008. [doi]

2006

Towards verification of C# programs: A three-level approachV. A. Nepomniaschy, Igor S. Anureev, I. V. Dubranovskii, Alexey V. Promsky. pcs, 32(4):190-202, 2006. [doi]

2005

Symbolic method of verification of definite iterations over altered data structuresV. A. Nepomniaschy. pcs, 31(1):1-9, 2005. [doi]

2003

Verification-Oriented Language C-Light and Its Structural Operational SemanticsV. A. Nepomniaschy, Igor S. Anureev, Alexey V. Promsky. ershov 2003: 103-111 [doi]

Towards Verification of C Programs: Axiomatic Semantics of the C-kernel LanguageV. A. Nepomniaschy, Igor S. Anureev, Alexey V. Promsky. pcs, 29(6):338-350, 2003. [doi]

2002

Verification of Finite Iterations over Tuples of Data StructuresV. A. Nepomniaschy. pcs, 28(1):1-8, 2002. [doi]

Basic-REAL: Integrated Approach for Design, Specification and Verification of Distributed SystemsV. A. Nepomniaschy, Nikolay V. Shilov, E. V. Bodin, Vitaly E. Kozura. IFM 2002: 69-88 [doi]

Towards Verification of C Programs. C-Light Language and Its Formal SemanticsV. A. Nepomniaschy, Igor S. Anureev, I. N. Mikhailov, Alexey V. Promsky. pcs, 28(6):314-323, 2002. [doi]

2001

Verification of Estelle-Specified Communication Protocols Using High-Level Petri NetsV. A. Nepomniaschy, Gennady I. Alekseev, Alexandre V. Bystrov, Sergey P. Mylnikov, E. V. Okunishnikova, P. A. Chubarev, Tatiana G. Churina. pcs, 27(2):58-68, 2001. [doi]

1999

Verification of Definite Iteration over Hierarchical Data StructuresV. A. Nepomniaschy. FASE 1999: 176-187

Symbolic Verification Method for Definite Iteration over Data StructuresV. A. Nepomniaschy. ipl, 69(4):207-213, 1999. [doi]

1995

Petri Net Modelling of Estelle-specified Communication ProtocolsV. A. Nepomniaschy, Gennady I. Alekseev, Alexandre V. Bystrov, Tatiana G. Churina, Sergey P. Mylnikov, E. V. Okunishnikova. pact 1995: 94-108

1993

Problem-Oriented Verification System and its Application to Linear Algebra ProgramsV. A. Nepomniaschy, A. A. Sulimov. TCS, 119(1):173-185, 1993.

Problem-Oriented Means of Program Specification and Verification in Project SPECTRUMV. A. Nepomniaschy, A. A. Sulimov. disco 1993: 374-378

REAL92: A Combined Specification Language for Real-Time Concurrent Systems and PropertiesV. A. Nepomniaschy, Nikolay V. Shilov. ershov 1993: 377-393

1978

Zur Vollständigkeit von BefehlssystemenV. A. Nepomniaschy, Lutz Voelkel. eik, 14(1/2):43-48, 1978.

On Divergence and Halting Problems for Monadic Program SchemasV. A. Nepomniaschy. mfcs 1978: 385-392

1976

On Divergence Problems for Program SchemasV. A. Nepomniaschy. mfcs 1976: 442-445

1972

Criteria for the algorithmic completeness of the systems of operationsV. A. Nepomniaschy. ershov 1974: 172-186

1971

Conditions for the Algorithmic Completeness of Systems of OperationsV. A. Nepomniaschy. ifip 1971: 52-55

Sign in or sign up to see more results.

runs on WebDSL