David Syman

David Syman
BitBrainery Unversity · Software Engineering

MD - Computer Science

About

9
Publications
912
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
16
Citations
Introduction
Graduated at Kiev National Taras Shevchenko University in 1989, he was working since 1984 in Security Review Консультант, a Moldavian IT firm, where he became CTO in 1989. Elected as Associated Professor at Moldova State Univerisity in 1992, he teached there until 2000. He moved in UK during year 2000, and become Associated Professor at BitBrainery University of London and CIO at Security Reviewer, UK.

Publications

Publications (9)
Article
Full-text available
Updated Results of a Dynamic Syntax Tree method implementation for enhancing the Static Analysis process. We collected the most significant results of latest 4 year, presented in this paper
Article
Full-text available
Updated Results of a Dynamic Syntax Tree method implementation for enhancing the Static Analysis process. We collected the most significant results of latest 4 year, presented in this paper
Article
Full-text available
Mobile devices are rapidly expanding as per user's need and they are potential risky for personal and professional privacy, because of the various malware and increasing security issues and threats. With lots of frequent application releases and updates happening, conducting a complete security analysis of mobile Apps becomes crucial. In this paper...
Article
Full-text available
Dynamic Syntax Tree (DST) implementations [1] use Binary Sandboxing for enhancing the Static Analysis process. In this paper we present a new Dynamic Binary analysis method for collecting information on ELF, PE and Mach-O executables and dynamic libraries. This information will enrich DST contents during application scanning
Article
Full-text available
In our earlier research[1], we described the Dynamic Syntax Tree method implementation for enhancing the Static Analysis process. After 10+ years of experience, we collected the significant results presented in this paper
Article
Full-text available
In our earlier research[1], we described the Dynamic Syntax Tree method implementation for enhancing the Static Analysis process. After 10+ years of experience, we collected the significant results presented in this paper
Article
Full-text available
In our earlier research[1], we described the Dynamic Syntax Tree method implementation for enhancing the Static Analysis process. After 10+ years of experience, we collected the significant results presented in this paper
Article
Full-text available
In our earlier research [1] on area of Static Analysis of applications written using modern languages, we discussed about lack of accurate analysis of algorithms based on Abstract Syntax and Concrete (CST, aka Parser) Trees. Moreover described is the Dynamic Syntax Tree method implementation for enhancing the Static Analysis process.
Conference Paper
Full-text available
Most of Static Analysis tools are nowadays based on Abstract Syntax or Concrete (aka Parser) Trees. For analyzing applications written in modern programming languages, were types and objects are dynamically created, those tools cannot provide accurate analysis results because they are designed for static programming languages only. Moreover describ...

Network