Rostislav Yavorskiy

Research interests

• first order logic;
• provability logic, logic of proofs;
• applications of mathematical logic in computer science.

Selected publications

• Rostislav Yavorskiy. On Kripke-style Semantics for the Provability Logic of Godel's Proof Predicate with Quantifiers on Proofs. Journal of Logic and Computation 2005, Vol. 15, No. 4, pp. 539-549.
• Vladimir Filatov and Rostislav Yavorskiy. Scenario based analysis of linear computations. Proceedings of 12th International Workshop on Abstract State Machines ASM'05, March 8-11, 2005, Laboratory of Algorithmics, Complexity and Logic, University Paris 12 - Val de Marne, Creteil, France, pp. 167-174.PDF
• Andrey Novikov and Rostislav Yavorskiy. Applying formal semantics of an object-oriented language to program invariant checking. Proceedings of 12th International Workshop on Abstract State Machines ASM'05, March 8-11, 2005, Laboratory of Algorithmics, Complexity and Logic, University Paris 12 - Val de Marne, Creteil, France, pp. 305-312. PDF
• Anton Esin, Andrey Novikov and Rostislav Yavorskiy. Experiments on Semantics Based Testing of a Compiler. Manuscript, December 2004. PDF
• R.E. Yavorsky. First order logics of individual theories. In Logic Colloquium '99 Lecture Notes in Logic 17, pp. 200-208. Edited by J. van Eijck, V. van Oostrom, and A. Visser. A K Peters, 2004. PostScript
• Yu. Gurevich and R. Yavorsky. Observations on the Decidability of Transitions. Abstract State Machines 2004, W. Zimmerman and B. Thalheim, editors. Springer Lecture Notes in Computer Science vol. 3052 (2004), pp. 161-168. PostScript
• R.E.Yavorskiy. Undecidability of the minimal provability logic with quantifiers on proofs. Manuscript, 3 pages, October 2003. PostScript in Russian.
• R.E. Yavorsky. On Prenex Fragment of Provability Logic with Quantifiers on Proofs. Trudy Matematicheskogo Instituta imeni V.A.Steklova, vol. 242, 2003, pp. 123-135. PostScript in Russian
• M. Veanes and R. Yavorsky. Combined Algorithm for Approximating a Finite State Abstraction of a Large System. In SCESM 2003, 2nd International Workshop on Scenarios and State Machines: Models, Algorithms, and Tools, May 2003, pp. 86-91. PDF
• R. Yavorskiy. Translation of a fragment of AsmL Specification Language to Higher Order Logic. Microsoft Research technical report MSR-TR-2003-22, April 2003, 17 p. PostScript
• R.E. Yavorsky. Provability logics with quantifiers on proofs. Annals of Pure an Applied Logic, vol. 113 (2002), nos. 1-3, pp. 373-387. PostScript
• R.E. Yavorsky. On arithmetical completeness of first-order logics of provability. Advances in Modal Logic, vol. 3, F. Wolter, H. Wansing, M. de Rijke, and M. Zakharyaschev, eds. 2002, pp. 1-16. PostScript
• R.E. Yavorsky. On the logic of the standard proof predicate. Springer Lecture Notes in Computer Science, vol. 1862, pp. 527-542. Proceedings of 14th International Conference of Computer Science Logic 2000. PostScript
• R.E. Yavorsky. First order logics of expressively strong theories. Matematicheskie Zametki. 1999, Vol. 66, N 5, pp. 777-788. PostScript in Russian, PostScript in English
• R.E. Yavorsky. Decidable first order logics. Fundamentalnaja i prikladnaja matematika 1998, Vol. 4, N. 2 pp. 733-749. PostScript in Russian
• R.E. Yavorskiy. Predikatnye logiki teorij pervogo poryadka. Ph.D. thesis. Moscow State University, 1998. PostScript in Russian
• R.E. Yavorsky. First order logics of decidable fragments of arithmetic. Vestnik Moskovskogo Universiteta. Ser. 1. Mat. Mekh. 1998, N. 2. pp. 12-16. (in Russian)
• R.E. Yavorsky. Logical Schemes for First Order Theories. Logical Foundations of Computer Science, Yaroslavl, Russia, 1997. Springer Lecture Notes in Computer Science, vol. 1234 (1997), pp. 410-418.
• R.E. Yavorsky. Axiom systems and models for first order theories with provability operator. Vestnik Moskovskogo Universiteta. Ser. 1. Mat. Mekh. 1996, N. 1, pp. 12-16. (in Russian)

Misc

AsmL examples

Variants

Course program

Folder

Library

Yours, Rostik.

Last updated on March 22, 2005.