A high-level domain-specific language for SIEM (design, development and formal verification)

2017 ◽  
Vol 20 (3) ◽  
pp. 2423-2437 ◽  
Author(s):  
Anam Nazir ◽  
Masoom Alam ◽  
Saif U. R. Malik ◽  
Adnan Akhunzada ◽  
Muhammad Nadeem Cheema ◽  
...  
Author(s):  
Amel Benabbou ◽  
Safia Nait-Bahloul

Requirement specification is a key element in model-checking verification. The context-aware approach is an effective technique for automating the specification of requirement considering specific environmental conditions. In most of existing approaches, there is no support of this crucial task and are mainly based on the considerable efforts and expertise of engineers. A domain-specific language, called CDL, has been proposed to facilitate the specification of requirement by formalizing contexts. However, the feedback has shown that manually writing CDL is hard, error prone and difficult to grasp on complex systems. In this article, the authors propose an approach to automatically generate CDL models using (IODs) elaborated through transformation chains from textual use cases. They offer an intermediate formalism between informal use cases scenarios and CDL models allowing to engineers to manipulate with familiar artifacts. Thanks to such high-level formalism, the gap between informal and formal requirements is reduced; consequently, the requirement specification is facilitated.


2017 ◽  
Author(s):  
Dalvan Griebler ◽  
Renato B. Hoffmann ◽  
Junior Loff ◽  
Marco Danelutto ◽  
Luiz Gustavo Fernandes

The stream processing domain is present in several real-world applications that are running on multi-core systems. In this paper, we focus on data compression applications that are an important sub-set of this domain. Our main goal is to assess the programmability and efficiency of domain-specific language called SPar. It was specially designed for expressing stream parallelism and it promises higher-level parallelism abstractions without significant performance losses. Therefore, we parallelized Lzip and Bzip2 compressors with SPar and compared with state-of-the-art frameworks. The results revealed that SPar is able to efficiently exploit stream parallelism as well as provide suitable abstractions with less code intrusion and code refactoring.


2017 ◽  
Vol 27 (01) ◽  
pp. 1740005 ◽  
Author(s):  
Dalvan Griebler ◽  
Marco Danelutto ◽  
Massimo Torquati ◽  
Luiz Gustavo Fernandes

This paper introduces SPar, an internal C++ Domain-Specific Language (DSL) that supports the development of classic stream parallel applications. The DSL uses standard C++ attributes to introduce annotations tagging the notable components of stream parallel applications: stream sources and stream processing stages. A set of tools process SPar code (C++ annotated code using the SPar attributes) to generate FastFlow C++ code that exploits the stream parallelism denoted by SPar annotations while targeting shared memory multi-core architectures. We outline the main SPar features along with the main implementation techniques and tools. Also, we show the results of experiments assessing the feasibility of the entire approach as well as SPar’s performance and expressiveness.


Author(s):  
Greg Eakman ◽  
Howard Reubenstein ◽  
Tom Hawkins ◽  
Mitesh Jain ◽  
Panagiotis Manolios

2003 ◽  
Vol 01 (02) ◽  
pp. 201-230 ◽  
Author(s):  
Enrico Pontelli ◽  
Desh Ranjan ◽  
Gopal Gupta ◽  
Brook Milligan

Domain experts think and reason at a high level of abstraction when they solve problems in their domain of expertise. We present the design and motivation behind a domain specific language, called ΦLOG, to enable biologists to program solutions to phylogenetic inference problems at a very high level of abstraction. The implementation infrastructure (interpreter, compiler, debugger) for the DSL is automatically obtained through a software engineering framework based on Denotational Semantics and Logic Programming.


2018 ◽  
Author(s):  
Fabricio E. Rodriguez Cesen ◽  
P Gyanesh Kumar Patra ◽  
Christian Esteve Rothenberg ◽  
Gergely Pongracz

New trends in dataplane programmability inside Software Defined Networking (SDN) paradigm are in an effort to bring multi-platform support with a high-level definition of the dataplane pipeline functions. The MultiArchitecture Compiler System for Abstract Dataplanes (MACSAD) can integrate the Protocol-Independent Packet Processors (P4) domain-specific language and the OpenDataPlane Project (ODP) APIs, to define a programmable dataplane across multiple targets in a unified compiler system. In this paper, we present and evaluate the IPv4/IPv6 Longest Prefix Match (LPM) support in MACSAD. We develop a new ODP Helper library implementing the IPv6 lookup mechanism based on the current IPv4 solution and evaluate its performance and scalability for diverse workloads and target platform configurations.


Sign in / Sign up

Export Citation Format

Share Document