Nikolay V. Shilov - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2019

Platform-Independent Specification and Verification of the Standard Mathematical Square Root FunctionNikolay V. Shilov, Dmitry A. Kondratyev, Igor S. Anureev, Evgeny V. Bodin, Alexey V. Promsky. accs, 53(7):595-616, 2019. [doi]

Teaching Efficient Recursive Programming and Recursion Elimination Using Olympiads and Contests ProblemsNikolay V. Shilov, Danila Danko. fisee 2020: 246-264 [doi]

2016

Program schemata technique for propositional program logics: A 30-year historyNikolay V. Shilov, S. O. Shilova, A. Yu. Bernshtein. pcs, 42(4):239-256, 2016. [doi]

2015

Agent Knowledge and Beliefs in a CloudNikolay V. Shilov. egcee 2015: 11-20 [doi]

2014

An Approach to Design of Automata-Based Axiomatization for Propositional Program and Temporal Logics (by Example of Linear Temporal Logic)Nikolay V. Shilov. In Vasco Brattka, Hannes Diener, Dieter Spreen, editors, Logic, Computation, Hierarchies. Volume 4 of Ontos Mathematical Logic, pages 297-324, De Gruyter, 2014. [doi]

2013

Towards Description Logic on Concept LatticesJulia V. Grebeneva, Nikolay V. Shilov, Natalia Olegovna Garanina. cla 2013: 287-292 [doi]

2012

Verification of backtracking and branch and bound design templatesNikolay V. Shilov. accs, 46(7):402-409, 2012. [doi]

2011

Development of the Computer Language Classification Knowledge PortalNikolay V. Shilov, Alexander A. Akinin, Alexey V. Zubkov, Renat I. Idrisov. ershov 2012: 340-348 [doi]

Algorithm Design Template Base on Temporal ADTNikolay V. Shilov. time 2011: 157-162 [doi]

F@BOOL@: Experiment with a simple verifying compiler based on SAT-solversNikolay V. Shilov. accs, 45(7):428-436, 2011. [doi]

2010

Tableau-Like Automata-Based Axiomatization for Propositional Linear Temporal LogicNikolay V. Shilov. lics 2013: 23-24 [doi]

2008

Generation of correctness conditions for imperative programsNikolay V. Shilov, Igor S. Anureev, E. V. Bodin. pcs, 34(6):307-321, 2008. [doi]

2007

Combining Two Formalism for Reasoning about ConceptsNikolay V. Shilov, Igor S. Anureev, Natalya Olegovna Garanina. dlog 2007: [doi]

Combined Logics of Knowledge, Time, and Actions for Reasoning about Multi-agent SystemsNikolay V. Shilov, Natalya Olegovna Garanina. kont 2011: 48-58 [doi]

2006

Well-Structured Model Checking of Multiagent SystemsNikolay V. Shilov, Natalya Olegovna Garanina. ershov 2007: 363-376 [doi]

Update and Abstraction in Model Checking of Knowledge and Branching TimeNikolay V. Shilov, Natalya Olegovna Garanina, K.-M. Choe. FUIN, 72(1-3):347-361, 2006. [doi]

2004

Model Checking mu-Calculus in Well-Structured Transition SystemsE. V. Kouzmin, Nikolay V. Shilov, Valery A. Sokolov. time 2004: 152-155 [doi]

Etude on theme of DijkstraS. O. Shilova, Nikolay V. Shilov. sigact, 35(3):102-108, 2004. [doi]

Addendum to Etude on theme of DijkstraS. O. Shilova, Nikolay V. Shilov. sigact, 35(4):118, 2004. [doi]

2003

Polynomial Approximations for Model CheckingNikolay V. Shilov, Natalya Olegovna Garanina. ershov 2003: 395-400 [doi]

2002

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]

Model checking knowledge and fixpointsNikolay V. Shilov, Natalya Olegovna Garanina. fics 2002: 25-39

Engaging students with theory through ACM collegiate programming contestNikolay V. Shilov, Kwangkeun Yi. CACM, 45(9):98-101, 2002. [doi]

2001

On Expressive and Model Checking Power of Propositional Program LogicsNikolay V. Shilov, Kwang Yi. ershov 2001: 39-46 [doi]

How to Find a Coin: Propositional Program Logics Made EasyNikolay V. Shilov, Kwang Yi. eatcs, 75:127-151, 2001.

Puzzles for Learning Model Checking, Model Checking for Programming Puzzles, Puzzles for Testing Model CheckersNikolay V. Shilov, Kwang Yi. ENTCS, 43:34-49, 2001. [doi]

2000

A Note on Model Checkers Reuse and ValidationNikolay V. Shilov, Kwangkeun Yi. aplas 2000: 69-77

1999

Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract)Ron van der Meyden, Nikolay V. Shilov. fsttcs 1999: 432-445 [doi]

1997

Some Results on Propositional Dynamic Logic with Fixed PointsIgor Rents, Nikolay V. Shilov. lfcs 1997: 323-332

Program Schemata vs. Automata for Decidability of Program LogicsNikolay V. Shilov. TCS, 175(1):15-27, 1997. [doi]

1994

An Approach to Effective Model-Checking of Real-Time Finite-State Machines in Mu-CalculusSergey Berezin, Nikolay V. Shilov. lfcs 1994: 47-55

1993

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

1992

Propositional Dynamic Logic with Fixed Points: Algorithmic Tools for Verification of Finite State MachinesNikolay V. Shilov. lfcs 1992: 452-458

Sign in or sign up to see more results.

runs on WebDSL