Static Analysis on Abstract Syntax Trees Based on Finite Automata

Valery Nikolayevich IGNATYEV

Proceedings of the Institute for System Programming of the RAS (Proceedings of ISP RAS)
Trudy Instituta sistemnogo programmirovaniâ

ISSN 2079-8156 (Print)
ISSN 2220-6426 (Online)

User

eng | рус

Proceedings of the Institute for System Programming of the RAS (Proceedings of ISP RAS)

Advanced search

Archives

Download this PDF file

Fullscreen

For citations:

IGNATYEV V.N. Static Analysis on Abstract Syntax Trees Based on Finite Automata. Proceedings of the Institute for System Programming of the RAS (Proceedings of ISP RAS). 2025;37(1):41-54. (In Russ.) https://doi.org/10.15514/ISPRAS-2025-37(1)-2

This work is licensed under a Creative Commons Attribution 4.0 License.

ISSN 2079-8156 (Print)
ISSN 2220-6426 (Online)

* not an advertisement

Indexing Databases

* not an advertisement

Popular articles

Editor-in-Chief

Academician Arutyun I. Avetisyan

Article Tools

How to cite item

Finding References

Email this article (Login required)

Email the author (Login required)

About the Author

Valery Nikolayevich IGNATYEV
Ivannikov Institute for System Programming of the Russian Academy of Sciences, Lomonosov Moscow State University
Russian Federation

Cand. Sci. (Phys.-Math.) in computer sciences, senior researcher at Ivannikov Institute for System Programming RAS and associate professor at system programming division of CMC faculty of Lomonosov Moscow State University. His research interests include program analysis techniques for error detection in program source code using classical static analysis and machine learning.

Notifications

Username
Password
	Remember me
Not a user? Register with this site Forgot your password?

User

Proceedings of the Institute for System Programming of the RAS (Proceedings of ISP RAS)

For citations:

Cookies policy