scholarly journals Security Testing Tool for NoSQL Systems

2019 ◽  
Vol 8 (1) ◽  
pp. 85-93
Author(s):  
Muhammad A. Lawal and Mostaf A. Saleh Muhammad A. Lawal and Mostaf A. Saleh
Keyword(s):  
Relational Database ◽  
Finite Automaton ◽  
Recent Literature ◽  
Data Encryption ◽  
Deterministic Finite Automaton ◽  
Security Testing ◽  
Injection Attacks ◽  
Security Challenges ◽  
Testing Tool ◽  
Input Validation

NoSQL systems are becoming more popular due to their inherent advantages and solutions it provides to the limits of a relational database. However, despite its benefits, it comes with security challenges. In this paper, an input validation mechanism architecture is proposed for Mongo DB to detect and prevent NoSQL injection attacks, the mechanism employs a Deterministic Finite Automaton (DFA) approach to detect and prevent attacks on NoSQL systems. Furthermore, a security comparison of some NoSQL systems is provided based on recent literature. The security features compared are authentication, authorization, data encryption and input validation. The proposed mechanism will improve the security of Mongo DB system because invalid inputs requests will be detected and prevented from being processed.

Model reformulation for conflict-free routing problems using Petri Net and Deterministic Finite Automaton

2015 ◽  
Vol 20 (3) ◽  
pp. 262-269 ◽  
Author(s):  
Ryosuke Nakamura ◽  
Kenji Sawada ◽  
Seiichi Shin ◽  
Kenji Kumagai ◽  
Hisato Yoneda
Keyword(s):  
Petri Net ◽  
Finite Automaton ◽  
Deterministic Finite Automaton ◽  
Routing Problems ◽  
Model Reformulation

A Parallel Aho-Corasick Algorithm with Non-deterministic Finite Automaton Based on OpenMP

2015 ◽  
Author(s):  
Jiaxing Qu ◽  
Guoyin Zhang ◽  
Zhou Fang ◽  
Jiahui Liu ◽  
Xinyu Liu ◽  
...  
Keyword(s):  
Finite Automaton ◽  
Deterministic Finite Automaton

MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS

2005 ◽  
Vol 16 (05) ◽  
pp. 1027-1038 ◽  
Author(s):  
LYNETTE VAN ZIJL
Keyword(s):  
Finite Automaton ◽  
Finite Automata ◽  
Symmetric Difference ◽  
Magic Numbers ◽  
Deterministic Finite Automaton ◽  
Nondeterministic Finite Automata ◽  
Binary Case ◽  
Nondeterministic Finite Automaton

Iwama et al. showed that there exists an n-state binary nondeterministic finite automaton such that its equivalent minimal deterministic finite automaton has exactly 2n - α states, for all n ≥ 7 and 5 ≤ α ≤ 2n-2, subject to certain coprimality conditions. We investigate the same question for both unary and binary symmetric difference nondeterministic finite automata. In the binary case, we show that for any n ≥ 4, there is an n-state symmetric difference nondeterministic finite automaton for which the equivalent minimal deterministic finite automaton has 2n - 1 + 2k - 1 - 1 states, for 2 < k ≤ n - 1. In the unary case, we consider a large practical subclass of unary symmetric difference nondeterministic finite automata: for all n ≥ 2, we argue that there are many values of α such that there is no n-state unary symmetric difference nondeterministic finite automaton with an equivalent minimal deterministic finite automaton with 2n - α states, where 0 < α < 2n - 1. For each n ≥ 2, we quantify such values of α precisely.

scholarly journals State Complexity of Suffix Distance

2019 ◽  
Vol 30 (06n07) ◽  
pp. 1197-1216
Author(s):  
Timothy Ng ◽  
David Rappaport ◽  
Kai Salomaa
Keyword(s):  
Lower Bound ◽  
Finite Automaton ◽  
Regular Language ◽  
Upper Bounds ◽  
The State ◽  
Deterministic Finite Automaton ◽  
Tight Bound ◽  
State Complexity

The neighbourhood of a regular language with respect to the prefix, suffix and subword distance is always regular and a tight bound for the state complexity of prefix distance neighbourhoods is known. We give upper bounds for the state complexity of the neighbourhood of radius [Formula: see text] of an [Formula: see text]-state deterministic finite automaton language with respect to the suffix distance and the subword distance, respectively. For restricted values of [Formula: see text] and [Formula: see text] we give a matching lower bound for the state complexity of suffix distance neighbourhoods.

scholarly journals Deterministic automata for extended regular expressions

2017 ◽  
Vol 7 (1) ◽  
pp. 24-28
Author(s):  
Mirzakhmet Syzdykov
Keyword(s):  
Finite Automaton ◽  
Regular Languages ◽  
Regular Expressions ◽  
Deterministic Finite Automaton ◽  
Past Work ◽  
The Past ◽  
Deterministic Automata ◽  
Extended Regular Expressions

Abstract In this work we present the algorithms to produce deterministic finite automaton (DFA) for extended operators in regular expressions like intersection, subtraction and complement. The method like “overriding” of the source NFA(NFA not defined) with subset construction rules is used. The past work described only the algorithm for AND-operator (or intersection of regular languages); in this paper the construction for the MINUS-operator (and complement) is shown.

scholarly journals VERIFICATION OF CONJUNCTIVE ARTIFACT-CENTRIC SERVICES

2012 ◽  
Vol 21 (02) ◽  
pp. 111-139 ◽  
Author(s):  
GIUSEPPE DE GIACOMO ◽  
RICCARDO DE MASELLIS ◽  
RICCARDO ROSATI
Keyword(s):  
Relational Database ◽  
Data Exchange ◽  
Recent Literature ◽  
Conjunctive Queries ◽  
First Order ◽  
Temporal Properties ◽  
Verification Time

An artifact-centric service is a stateful service that holistically represents both the data and the process in terms of a (dynamic) artifact. An artifact is constituted by a data component, holding all the data of interest for the service, and a lifecycle, which specifies the process that the service enacts. In this paper, we study artifact-centric services whose data component is a full-fledged relational database, queried through (first-order) conjunctive queries, and the lifecycle component is specified as sets of condition-action rules, where actions are tasks invocations, again based on conjunctive queries. Notably, the database can evolve in an unbounded way due to new values (unknown at verification time) inserted by tasks. The main result of the paper is that verification in this setting is decidable under a reasonable restriction on the form of tasks, called weak acyclicity, which we borrow from the recent literature on data exchange. In particular, we develop a sound, complete and terminating verification procedure for sophisticated temporal properties expressed in a first-order variant of μ-calculus.

Sign in / Sign up

Export Citation Format

Share Document