Публикации

  • Ulyantsev V., Zakirzyanov I., Shalyto A.
    Proceedings of International Conference on Language and Automata Theory and Applications. - 2015. - P. 611-622.,
  • Dmitry Boulytchev
    Proceedings of 6th International Andrei Ershov Memorial Conference on Perspectives of System Informatics,
  • Azat Abdullin, Marat Akhin
    SoftwareMining 2016: Proceedings of the 5th International Workshop on Software Mining,
  • Marina Polubelova, Sergey Bozhko, Semyon Grigorev

    There are numerous toolchains designed for certified programming, but F* is the only language that support both general-purpose programming and semi-automated proving. We work on the application of this technique to a grammarware research and development project YaccConstructor. We present a work in progress verified implementation of transformation of Context-free grammar to Chomsky normal form, that is making progress toward the certification of the entire project. Among other features, F* system allows to extract code in F# or OCaml languages from a program written in F*. YaccConstructor project is mostly written in F#, so this feature of F* is of particular importance because it allows to maintain compatibility between certified modules and those existing in the project which are not certified yet.

    Proceedings of the Institute for System Programming,
  • Stephan Krusche, Irina Camilleri, Andreas Seitz, Cecil Wöbker, Kirill Krinkin and Bernd Bruegge

    Software engineering is an interactive, collaborative and creative activity that cannot be entirely planned. Inspection and adaption are required to cope with changes during the development process. Software engineering education requires practical application of knowledge, but it is challenging and time consuming for instructors to evaluate the creation of innovative solutions to problems. Current higher education practices lead to a multitude of rules, guidelines and order. Instructors see deviations of students as failures and limit the creative thinking processes of students. In this paper we describe chaordic learning, a self-organizing, adaptive and nonlinear learning approach, to stimulate the creative thinking of students.

  • Koznov, D., Luciv, D., Basit, H.A., Lieh, O.E., Smirnov, M.
    Clone detection in reuse of software technical documentation
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9609, pp. 170-185,
  • Sp. S. Prakash Tn. Nagabhushan, K. Krinkin
    Proceedings 19th Conference of Open Innovations Association FRUCT — Finland, University of Jyväskylä, 9-11 Nov 2016 Pp: 189-195,
  • Dmitry Boulytchev
    Science of Computer Programming,
  • Chivilikhin D., Ulyantsev V., Shalyto A.
    Proceedings of the 13th International Conference on Machine Learning and Applications (ICMLA'14), pp. 350-355,
  • Daniil Berezun and Neil D. Jones
    Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation,
  • Koznov, D., Pliskin, M.
    Computer-supported collaborative learning with mind-maps
    Communications in Computer and Information Science 17 CCIS, pp. 478-489,
  • Ulyantsev V., Melnik M.
    Proceedings of International Conference on Algorithms for Computational Biology. - 2015. - 141-153,
  • Semyon Grigorev, Anastasiya Ragozina

    Graph data model and graph databases are very popular in various areas such as bioinformatics, semantic web, and social networks. One specific problem in the area is a path querying with constraints formulated in terms of formal grammars. The query in this approach is written as grammar, and paths querying is graph parsing with respect to given grammar. There are several solutions to it, but how to provide structural representation of query result which is practical for answer processing and debugging is still an open problem. In this paper we propose a graph parsing technique which allows one to build such representation with respect to given grammar in polynomial time and space for arbitrary context-free grammar and graph. Proposed algorithm is based on generalized LL parsing algorithm, while previous solutions are based mostly on CYK or Earley algorithms, which reduces time complexity in some cases.

    arXiv,
  • Dmitry Boulytchev, Eugene Vigdorchik
    Workshop on Multiparadigm Programming with Object-Oriented Languages,
  • K. Krinkin, Elena Stotskaya, Yury Stotskiy
    PROCEEDING OF THE AINL-ISMW FRUCT CONFERENCE,

Сортировка:

  • Фильтр по группам: