Aleksey Bragin is a president of the “ReactOS” foundation. He was graduated from Bauman MSTU (he got master degree from IU7 department, and finished post-graduate studying).
ReactOS® is an effort to create a Free and Open Source replacement for the Microsoft Windows NT® family that is compatible with both applications and drivers. The NT® architecture has always been highly flexible and powerful and its continued dominance in the computer industry means it is one of the most supported family of operating systems in existence, with its latest iteration being Windows 8.
As these days operating systems are little more than gateways to applications that users want to run, an open source NT implementation would allow users to continue using familiar programs in a familiar environment. The project seeks to embrace the strengths of the NT family while avoiding many of the configuration decisions that made older versions of Windows vulnerable and maintaining a lightweight environment so that a computer’s resources can be dedicated to what really matters to the user, running their applications.
Dmitry Zavalishin is co-founder and head of “Digital Zone”. He created network magazine “dz-online”. Since 2002 Dmitry worked at Yandex (projects «Яндекс-гуру», «Яндекс-маркет»). In august 2005 Dmitry Zavalishin founded Digital Zone company, http://dz.ru/. Now Digital Zone is developing Phantom OS.
Leonid Eisymont is affiliated with FSUE “NII KVANT” now. He is graduated from the Moscow Engineering Physics Institute (1973). In 1983 he has received a Ph.D. in computer science from the Institute of Applied Mathematics of Academy of Sciences of USSR. Science interests are hardware and software, evolution of hardware components for high performance supercomputers, functional and non-procedural programming languages.
Sergey V. Samborskiy, Nadezhda I. Viukova, Vladimir A. Galatenko — Scientific Research Institute for System Analysis, Russian Academy of Sciences, Division of Compiler Technologies. Science interests are programming systems, algorithms complexity, mathematical programming and optimization problems.
Zelenov Sergey is seniour researcher of Institute for System Programming (Russian Academy of Sciences, Moscow). He is graduated from Lomonosov Moscow State University, Ph.D. His research topics are software engineering, software design, integrated modular avionics (IMA).
Fedor Strok is a postgraduate student at Department of Data Analysis and Artificial Intelligence (Higher School of Economics). He works at Yandex. His science interests are intellectual data analysis, machine learning, software testing.
Roland Meyer - Juniorprofessor of Theoretical Computer Science, Head of the Concurrency Theory Group (University of Kaiserslautern). Previously, he was a CNRS postdoc in LIAFA, University Paris 7, from March 2009 to June 2010. He worked in the Transregional Research Center AVACS at the University of Oldenburg. In February 2009, he obtained his PhD from the University of Oldenburg, where he was a PhD student in the graduate school TrustSoft. From October 2001 to September 2005, I studied Computer Science and Mathematics in Oldenburg. His research interests are expressiveness, computer-aided verification, and formal languages of concurrent systems. Focus on infinite-state models, in particular reconfigurable networks and relaxed memory models.
Sequential Consistency (SC) is the intuitive shared memory model where operations happen atomically and in the order in which they were issued. Programmers often assume their code runs on SC hardware, an assumption that is no longer valid for modern multiprocessors. For performance reasons, recent hardware only implements relaxed memory models that admit out-of-program-order and non-store atomic executions. Programs that work correctly under SC may show undesirable effects when run on relaxed memory models. With the trend towards multicore machines, bugs due to relaxed memory models become a serious problem in mainstream programming.
In this talk, we provide an overview of recent results on the verification of concurrent programs that run on relaxed memory models. We concentrate on the Total Store Ordering model that is implemented in x86 processors, and discuss the problems of reachability and robustness. Given a concurrent program and a configuration, reachability checks whether the program admits an execution leading to this configuration. Robustness is to decide whether the behaviour of a given program on a relaxed memory model coincides with the expected SC semantics. Both problems have been shown to be decidable, but with very different complexity.
Alexander Shalimov — Senior Programmer-Developer at Applied Research Center for Computer Networks, Russia, and a Researcher at Lomonosov Moscow State University, Russia. He received Ph.D. in computer science. Summer 2010, he was an intern at Microsoft Research, Redmond, USA. From July, 2011 till July, 2012, he was a Visiting Researcher at Microsoft Research, Redmond, USA. Research interests are computer networks, computer architectures, and compilers.
Seminar “Software Development and Analysis Technologies” continues in 2013.
Vasily A. Sartakov
Vasily Sartakov - Ph.D. student at MEPhI (department of cybernetics). The main topics of interests are embedding and high-performance system development, operating systems. Head of R&D department of ksys labs since 2011. Contributor at open-source projects.