Nikolay V. Shilov

Orcid: 0000-0001-7515-9647

Affiliations:
  • Innopolis University, Innopolis, Russia
  • Ershov Institute of Informatics Systems, Novosibirsk, Russia (former)


According to our database1, Nikolay V. Shilov authored at least 46 papers between 1992 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Detecting unanticipated mutual recursion using Elegant Objects representation of object-oriented programs.
CoRR, 2022

2021
Knowledge-Based Algorithms for BDI Agents.
Autom. Control. Comput. Sci., 2021

Modeling and Verification using Different Notations for CPSs: The One-Water-Tank Case Study.
Proceedings of the 16th Conference on Computer Science and Intelligence Systems, 2021

2019
Particular sides with working with talented students in professional training of a teacher.
Russ. Digit. Libr. J., 2019

Towards platform-independent specification and verification of the standard trigonometry functions.
CoRR, 2019

Platform-Independent Specification and Verification of the Standard Mathematical Square Root Function.
Autom. Control. Comput. Sci., 2019

Applying Model Checking Approach with Floating Point Arithmetic for Verification of Air Collision Avoidance Maneuver Hybrid Model.
Proceedings of the Model Checking Software - 26th International Symposium, 2019

Rooting Formal Methods Within Higher Education Curricula for Computer Science and Software Engineering - A White Paper -.
Proceedings of the Formal Methods - Fun for Everybody - First International Workshop, 2019

Fun with Formal Methods for Better Education.
Proceedings of the Formal Methods - Fun for Everybody - First International Workshop, 2019

Teaching Efficient Recursive Programming and Recursion Elimination Using Olympiads and Contests Problems.
Proceedings of the Frontiers in Software Engineering Education, 2019

2018
Towards platform-independent verification of the standard mathematical functions: the square root function.
CoRR, 2018

2016
Program schemata technique for propositional program logics: A 30-year history.
Program. Comput. Softw., 2016

2015
Program Schemata Technique to Solve Propositional Program Logics Revised.
Proceedings of the Perspectives of System Informatics, 2015

Agent Knowledge and Beliefs in a Cloud.
Proceedings of the Embracing Global Computing in Emerging Economies - First Workshop, 2015

2014
An Approach to Design of Automata-Based Axiomatization for Propositional Program and Temporal Logics (by Example of Linear Temporal Logic).
Proceedings of the Logic, Computation, Hierarchies, 2014

2013
Towards Description Logic on Concept Lattices.
Proceedings of the Tenth International Conference on Concept Lattices and Their Applications, 2013

2012
Verification of backtracking and branch and bound design templates.
Autom. Control. Comput. Sci., 2012

2011
F@BOOL@: Experiment with a simple verifying compiler based on SAT-solvers.
Autom. Control. Comput. Sci., 2011

Algorithm Design Template Base on Temporal ADT.
Proceedings of the Eighteenth International Symposium on Temporal Representation and Reasoning, 2011

Development of the Computer Language Classification Knowledge Portal.
Proceedings of the Perspectives of Systems Informatics, 2011

2010
Tableau-Like Automata-Based Axiomatization for Propositional Linear Temporal Logic.
Proceedings of the International Workshop on Proof Systems for Program Logics, 2010

2009
Modal Logics for Reasoning about Multiagent Systems.
Proceedings of the Encyclopedia of Artificial Intelligence (3 Volumes), 2009

2008
Generation of correctness conditions for imperative programs.
Program. Comput. Softw., 2008

Realization Problem for Formal Concept Analysis.
Proceedings of the 21st International Workshop on Description Logics (DL2008), 2008

2007
Combined Logics of Knowledge, Time, and Actions for Reasoning about Multi-agent Systems.
Proceedings of the Knowledge Processing and Data Analysis - First International Conference, 2007

Combining Two Formalism for Reasoning about Concepts.
Proceedings of the 2007 International Workshop on Description Logics (DL2007), 2007

A Proposal of Description Logic on Concept Lattices.
Proceedings of the Fifth International Conference on Concept Lattices and Their Applications, 2007

2006
Update and Abstraction in Model Checking of Knowledge and Branching Time.
Fundam. Informaticae, 2006

Well-Structured Model Checking of Multiagent Systems.
Proceedings of the Perspectives of Systems Informatics, 2006

2004
Addendum to Etude on theme of Dijkstra.
SIGACT News, 2004

Etude on theme of Dijkstra.
SIGACT News, 2004

Model Checking mu-Calculus in Well-Structured Transition Systems.
Proceedings of the 11th International Symposium on Temporal Representation and Reasoning (TIME 2004), 2004

2003
Polynomial Approximations for Model Checking.
Proceedings of the Perspectives of Systems Informatics, 2003

2002
Engaging students with theory through ACM collegiate programming contest.
Commun. ACM, 2002

Basic-REAL: Integrated Approach for Design, Specification and Verification of Distributed Systems.
Proceedings of the Integrated Formal Methods, Third International Conference, 2002

Model checking knowledge and fixpoints.
Proceedings of the Fixed Points in Computer Science, 2002

2001
How to Find a Coin: Propositional Program Logics Made Easy.
Bull. EATCS, 2001

On Expressive and Model Checking Power of Propositional Program Logics.
Proceedings of the Perspectives of System Informatics, 2001

2000
Puzzles for Learning Model Checking, Model Checking for Programming Puzzles, Puzzles for Testing Model Checkers.
Proceedings of the Formal Methods Elsewhere, 2000

A Note on Model Checkers Reuse and Validation.
Proceedings of the First Asian Workshop on Programming Languages and Systems, 2000

1999
Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract).
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

1997
Program Schemata vs. Automata for Decidability of Program Logics.
Theor. Comput. Sci., 1997

Some Results on Propositional Dynamic Logic with Fixed Points.
Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

1994
An Approach to Effective Model-Checking of Real-Time Finite-State Machines in Mu-Calculus.
Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

1993
REAL92: A Combined Specification Language for Real-Time Concurrent Systems and Properties.
Proceedings of the Formal Methods in Programming and Their Applications, International Conference, Akademgorodok, Novosibirsk, Russia, June 28, 1993

1992
Propositional Dynamic Logic with Fixed Points: Algorithmic Tools for Verification of Finite State Machines.
Proceedings of the Logical Foundations of Computer Science, 1992


  Loading...