default search action
Nikolay V. Shilov 0002
Person information
- affiliation: Innopolis University, Innopolis, Russia
- affiliation (former): Ershov Institute of Informatics Systems, Novosibirsk, Russia
Other persons with the same name
- Nikolay Shilov 0001
(aka: Nikolai Chilov 0001) — SPIIRAS, St. Petersburg, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [i4]Nikolai Kudasov
Detecting unanticipated mutual recursion using Elegant Objects representation of object-oriented programs. CoRR abs/2209.01803 (2022) - 2021
- [j13]Nikolay V. Shilov
Knowledge-Based Algorithms for BDI Agents. Autom. Control. Comput. Sci. 55(7): 786-794 (2021) - [c28]Tatiana V. Liakh
Modeling and Verification using Different Notations for CPSs: The One-Water-Tank Case Study. FedCSIS 2021: 485-488 - 2020
- [i3]Antonio Cerone, Markus Roggenbach, James H. Davenport, Casey Denner, Marie Farrell, Magne Haveraaen, Faron Moller, Philipp Koerner
Rooting Formal Methods within Higher Education Curricula for Computer Science and Software Engineering - A White Paper. CoRR abs/2010.05708 (2020)
2010 – 2019
- 2019
- [j12]Nikolay V. Shilov
Platform-Independent Specification and Verification of the Standard Mathematical Square Root Function. Autom. Control. Comput. Sci. 53(7): 595-616 (2019) - [j11]Nikolai Vyacheslavovich Shilov, Svetlana Olegovna Shilova:
Particular sides with working with talented students in professional training of a teacher. Russ. Digit. Libr. J. 22(5): 474-479 (2019) - [c27]Nikolay V. Shilov
Teaching Efficient Recursive Programming and Recursion Elimination Using Olympiads and Contests Problems. FISEE 2019: 246-264 - [c26]Antonio Cerone
Rooting Formal Methods Within Higher Education Curricula for Computer Science and Software Engineering - A White Paper -. FMFun 2019: 1-26 - [c25]Nikolay V. Shilov
Fun with Formal Methods for Better Education. FMFun 2019: 92-105 - [c24]Sergey M. Staroletov
Applying Model Checking Approach with Floating Point Arithmetic for Verification of Air Collision Avoidance Maneuver Hybrid Model. SPIN 2019: 193-207 - [i2]Nikolay V. Shilov, Boris L. Faifel, Svetlana O. Shilova, Aleksey V. Promsky:
Towards platform-independent specification and verification of the standard trigonometry functions. CoRR abs/1901.03414 (2019) - 2018
- [i1]Nikolay V. Shilov, Igor S. Anureev, Mikhail Berdyshev, Dmitry Kondratev, Aleksey V. Promsky:
Towards platform-independent verification of the standard mathematical functions: the square root function. CoRR abs/1801.00969 (2018) - 2016
- [j10]Nikolay V. Shilov
Program schemata technique for propositional program logics: A 30-year history. Program. Comput. Softw. 42(4): 239-256 (2016) - 2015
- [c23]Nikolay V. Shilov
Agent Knowledge and Beliefs in a Cloud. EGC 2015: 11-20 - [c22]Nikolay Shilov
Program Schemata Technique to Solve Propositional Program Logics Revised. Ershov Memorial Conference 2015: 245-259 - 2014
- [p1]Nikolay V. Shilov:
An Approach to Design of Automata-Based Axiomatization for Propositional Program and Temporal Logics (by Example of Linear Temporal Logic). Logic, Computation, Hierarchies 2014: 297-324 - 2013
- [c21]Julia V. Grebeneva, Nikolay V. Shilov, Natalia Olegovna Garanina:
Towards Description Logic on Concept Lattices. CLA 2013: 287-292 - 2012
- [j9]Nikolay V. Shilov
Verification of backtracking and branch and bound design templates. Autom. Control. Comput. Sci. 46(7): 402-409 (2012) - 2011
- [j8]Nikolay V. Shilov
F@BOOL@: Experiment with a simple verifying compiler based on SAT-solvers. Autom. Control. Comput. Sci. 45(7): 428-436 (2011) - [c20]Nikolay V. Shilov
Development of the Computer Language Classification Knowledge Portal. Ershov Memorial Conference 2011: 340-348 - [c19]Nikolay V. Shilov
Algorithm Design Template Base on Temporal ADT. TIME 2011: 157-162 - 2010
- [c18]Nikolay V. Shilov:
Tableau-Like Automata-Based Axiomatization for Propositional Linear Temporal Logic. PSPL@LICS 2010: 23-24
2000 – 2009
- 2009
- [r1]Nikolay V. Shilov, Natalya Olegovna Garanina:
Modal Logics for Reasoning about Multiagent Systems. Encyclopedia of Artificial Intelligence 2009: 1089-1094 - 2008
- [j7]Nikolay V. Shilov
Generation of correctness conditions for imperative programs. Program. Comput. Softw. 34(6): 307-321 (2008) - [c17]Nikolay V. Shilov:
Realization Problem for Formal Concept Analysis. Description Logics 2008 - 2007
- [c16]Nikolay V. Shilov, Sang-Yong Han:
A Proposal of Description Logic on Concept Lattices. CLA 2007 - [c15]Nikolay V. Shilov, Igor S. Anureev, Natalya Olegovna Garanina:
Combining Two Formalism for Reasoning about Concepts. Description Logics 2007 - [c14]Nikolay V. Shilov
Combined Logics of Knowledge, Time, and Actions for Reasoning about Multi-agent Systems. KONT/KPP 2007: 48-58 - 2006
- [j6]Nikolay V. Shilov, Natalya Olegovna Garanina, K.-M. Choe:
Update and Abstraction in Model Checking of Knowledge and Branching Time. Fundam. Informaticae 72(1-3): 347-361 (2006) - [c13]Nikolay V. Shilov, Natalya Olegovna Garanina:
Well-Structured Model Checking of Multiagent Systems. Ershov Memorial Conference 2006: 363-376 - 2004
- [j5]Svetlana O. Shilova, Nikolay V. Shilov:
Etude on theme of Dijkstra. SIGACT News 35(3): 102-108 (2004) - [j4]Svetlana O. Shilova, Nikolay V. Shilov:
Addendum to Etude on theme of Dijkstra. SIGACT News 35(4): 118 (2004) - [c12]E. V. Kouzmin, Nikolay V. Shilov, Valery A. Sokolov:
Model Checking mu-Calculus in Well-Structured Transition Systems. TIME 2004: 152-155 - 2003
- [c11]Nikolay V. Shilov, Natalya Olegovna Garanina:
Polynomial Approximations for Model Checking. Ershov Memorial Conference 2003: 395-400 - 2002
- [j3]Nikolay V. Shilov
Engaging students with theory through ACM collegiate programming contest. Commun. ACM 45(9): 98-101 (2002) - [c10]Nikolay V. Shilov, Natalya Olegovna Garanina:
Model checking knowledge and fixpoints. FICS 2002: 25-39 - [c9]Valery A. Nepomniaschy, Nikolay V. Shilov, Evgeny V. Bodin, Vitaly E. Kozura:
Basic-REAL: Integrated Approach for Design, Specification and Verification of Distributed Systems. IFM 2002: 69-88 - 2001
- [j2]Nikolay V. Shilov, Kwang Yi:
How to Find a Coin: Propositional Program Logics Made Easy. Bull. EATCS 75: 127-151 (2001) - [c8]Nikolay V. Shilov, Kwang Yi:
On Expressive and Model Checking Power of Propositional Program Logics. Ershov Memorial Conference 2001: 39-46 - 2000
- [c7]Nikolay V. Shilov, Kwangkeun Yi:
A Note on Model Checkers Reuse and Validation. APLAS 2000: 69-77 - [c6]Nikolay V. Shilov
Puzzles for Learning Model Checking, Model Checking for Programming Puzzles, Puzzles for Testing Model Checkers. FM-Everywhere@FORTE/PSTV 2000: 34-49
1990 – 1999
- 1999
- [c5]Ron van der Meyden, Nikolay V. Shilov
Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract). FSTTCS 1999: 432-445 - 1997
- [j1]Nikolay V. Shilov
Program Schemata vs. Automata for Decidability of Program Logics. Theor. Comput. Sci. 175(1): 15-27 (1997) - [c4]Igor Rents, Nikolay V. Shilov:
Some Results on Propositional Dynamic Logic with Fixed Points. LFCS 1997: 323-332 - 1994
- [c3]Sergey Berezin, Nikolay V. Shilov
An Approach to Effective Model-Checking of Real-Time Finite-State Machines in Mu-Calculus. LFCS 1994: 47-55 - 1993
- [c2]Valery A. Nepomniaschy, Nikolay V. Shilov
REAL92: A Combined Specification Language for Real-Time Concurrent Systems and Properties. Formal Methods in Programming and Their Applications 1993: 377-393 - 1992
- [c1]Nikolay V. Shilov
Propositional Dynamic Logic with Fixed Points: Algorithmic Tools for Verification of Finite State Machines. LFCS 1992: 452-458
Coauthor Index
aka: Natalia Olegovna Garanina
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: