Automated Software Protection through Program Externalization on Memory-Limited Secure Devices

2010 ◽  
Author(s):  
Serge Chaumette ◽  
Olivier Ly ◽  
Renaud Tabary
Keyword(s):  
Software Protection ◽  
Automated Software

scholarly journals Automated Software Protection for the Masses Against Side-Channel Attacks

2019 ◽  
Vol 15 (4) ◽  
pp. 1-27 ◽  
Author(s):  
Nicolas Belleville ◽  
Damien Couroussé ◽  
Karine Heydemann ◽  
Henri-Pierre Charles
Keyword(s):  
Side Channel ◽  
Software Protection ◽  
Side Channel Attacks ◽  
The Masses ◽  
Automated Software

Conceptual model of choice of hardware and software protection

2020 ◽  
Vol 7 (1) ◽  
pp. 63-71
Author(s):  
Yaroslav E. Prokushev ◽  
◽  
Julia V. Maliy ◽  
Keyword(s):  
Conceptual Model ◽  
Software Protection

Assessment of a semi-automated software program for the identification of vertebral fractures in children

2017 ◽  
Author(s):  
Fawaz Alqahtani ◽  
Fabrizio Messina ◽  
Elzene Kruger ◽  
Heerunpal Gill ◽  
Michael Ellis ◽  
...  
Keyword(s):  
Vertebral Fractures ◽  
Fractures In Children ◽  
Software Program ◽  
Automated Software

Similarity Detection Using Latent Semantic Analysis Algorithm

2018 ◽  
Vol 6 (8) ◽  
pp. 102
Author(s):  
Priyanka R. Patil ◽  
Shital A. Patil
Keyword(s):  
Latent Semantic Analysis ◽  
Latent Dirichlet Allocation ◽  
Semantic Analysis ◽  
Mining Method ◽  
Research Papers ◽  
Information Measures ◽  
Automated Software ◽  
Day By Day ◽  
Ways Of Life ◽  
Dirichlet Allocation

Similarity View is an application for visually comparing and exploring multiple models of text and collection of document. Friendbook finds ways of life of clients from client driven sensor information, measures the closeness of ways of life amongst clients, and prescribes companions to clients if their ways of life have high likeness. Roused by demonstrate a clients day by day life as life records, from their ways of life are separated by utilizing the Latent Dirichlet Allocation Algorithm. Manual techniques can't be utilized for checking research papers, as the doled out commentator may have lacking learning in the exploration disciplines. For different subjective views, causing possible misinterpretations. An urgent need for an effective and feasible approach to check the submitted research papers with support of automated software. A method like text mining method come to solve the problem of automatically checking the research papers semantically. The proposed method to finding the proper similarity of text from the collection of documents by using Latent Dirichlet Allocation (LDA) algorithm and Latent Semantic Analysis (LSA) with synonym algorithm which is used to find synonyms of text index wise by using the English wordnet dictionary, another algorithm is LSA without synonym used to find the similarity of text based on index. LSA with synonym rate of accuracy is greater when the synonym are consider for matching.

Synthesizing Conjunctive & Disjunctive Linear Invariants by K-means++ and SVM

2020 ◽  
Vol 17 (6) ◽  
pp. 847-856
Author(s):  
Shengbing Ren ◽  
Xiang Zhang
Keyword(s):  
Software Verification ◽  
State Of The Art ◽  
Positive Sample ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Hoare Logic ◽  
Excellent Performance ◽  
Automated Software ◽  
Inductive Invariants ◽  
Linear Invariants

The problem of synthesizing adequate inductive invariants lies at the heart of automated software verification. The state-of-the-art machine learning algorithms for synthesizing invariants have gradually shown its excellent performance. However, synthesizing disjunctive invariants is a difficult task. In this paper, we propose a method k++ Support Vector Machine (SVM) integrating k-means++ and SVM to synthesize conjunctive and disjunctive invariants. At first, given a program, we start with executing the program to collect program states. Next, k++SVM adopts k-means++ to cluster the positive samples and then applies SVM to distinguish each positive sample cluster from all negative samples to synthesize the candidate invariants. Finally, a set of theories founded on Hoare logic are adopted to check whether the candidate invariants are true invariants. If the candidate invariants fail the check, we should sample more states and repeat our algorithm. The experimental results show that k++SVM is compatible with the algorithms for Intersection Of Half-space (IOH) and more efficient than the tool of Interproc. Furthermore, it is shown that our method can synthesize conjunctive and disjunctive invariants automatically

Software protection technology based on self-sealing code block

2009 ◽  
Vol 29 (3) ◽  
pp. 817-822
Author(s):  
Li-guo ZHOU ◽  
Xiao-bing XIONG ◽  
Jie SUN
Keyword(s):  
Software Protection ◽  
Protection Technology

Software protection game model based on divided-storage strategy

2013 ◽  
Vol 33 (9) ◽  
pp. 2525-2528
Author(s):  
Rui WANG ◽  
Qiuxiang YANG ◽  
Gouxi CHEN ◽  
Qiaomei MA
Keyword(s):  
Game Model ◽  
Software Protection ◽  
Model Based
Sign in / Sign up

Export Citation Format

Share Document