V. A. Nepomnyashchij

Available identifiers

zbMath Open nepomnyashchy.v-aMaRDI QIDQ174086

List of research outcomes

Publication	Date of Publication	Type
Boris Abramovich Trakhtenbrot	2022-05-09	Paper
https://portal.mardi4nfdi.de/entity/Q2979821	2017-04-26	Paper
https://portal.mardi4nfdi.de/entity/Q2979840	2017-04-26	Paper
https://portal.mardi4nfdi.de/entity/Q2979849	2017-04-26	Paper
https://portal.mardi4nfdi.de/entity/Q2979871	2017-04-26	Paper
Verification of finite iterations over collections of variable data structures	2008-01-30	Paper
Application of Petri nets in verification of distributed systems represented in the Estelle language	2005-09-23	Paper
Verification of finite iterations over tuples of data structures	2003-09-01	Paper
https://portal.mardi4nfdi.de/entity/Q4499485	2000-08-30	Paper
Verification of a finite iteration over data structures	2000-05-07	Paper
Problem-oriented knowledge bases and their application in the program verification system SPEKTR	1998-08-03	Paper
Verification of linear algebra programs in the SPEKTR system	1997-01-20	Paper
Problem-oriented verification system and its application to linear algebra programs	1994-01-26	Paper
Problem-oriented approach to verification of file-processing programs	1992-06-28	Paper
Nondeterministic program schemata and their relation to dynamic logic	1988-01-01	Paper
Problem-oriented program verification system ?SPEKTR?	1987-01-01	Paper
Problem-oriented program verification	1986-01-01	Paper
Elimination of loop invariants in program verification	1985-01-01	Paper
One approach to the specification and verification of translators	1983-01-01	Paper
The totality problem for program schemas	1983-01-01	Paper
Proving linear algebra program correctness	1982-01-01	Paper
Verification of file manipulation programs in the language PASCAL	1981-01-01	Paper
Elimination of identity assignments in standard program schemata	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4172040	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4166190	1978-01-01	Paper
Emptiness problem for program charts. II	1977-01-01	Paper
Emptiness problem for program flow diagrams. I	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4109268	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4117380	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5685063	1973-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5656374	1972-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5643959	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5628106	1970-01-01	Paper
Rudimentary interpretation of two-tape turing computation	1970-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5547578	1966-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5586329	1966-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5586364	1965-01-01	Paper

Research outcomes over time

This page was built for person: V. A. Nepomnyashchij