[HTML][HTML] Extending greedy feature selection algorithms to multiple solutions
G Borboudakis, I Tsamardinos - Data Mining and Knowledge Discovery, 2021 - Springer
Most feature selection methods identify only a single solution. This is acceptable for
predictive purposes, but is not sufficient for knowledge discovery if multiple solutions exist …
predictive purposes, but is not sufficient for knowledge discovery if multiple solutions exist …
Analysis & detection of SQL injection vulnerabilities via automatic test case generation of programs
SQL injection attacks occur due to vulnerabilities in the design of queries where a malicious
user can take advantage of input opportunities to insert code in the queries that modify the …
user can take advantage of input opportunities to insert code in the queries that modify the …
Towards Deterministic Compilation of Binary Decision Diagrams From Feature Models
Compiling binary decision diagrams (BDD) from feature models is a challenging task whose
outcome and performance depends on many interconnected factors. As almost all of these …
outcome and performance depends on many interconnected factors. As almost all of these …
High-level petri net model checking with alpina
S Hostettler, A Marechal, A Linard… - Fundamenta …, 2011 - content.iospress.com
Although model checking is heavily used in the hardware domain, it did not take off in
software engineering yet. One of the possible reasons is that software models are very …
software engineering yet. One of the possible reasons is that software models are very …
[HTML][HTML] On the benefits of knowledge compilation for feature-model analyses
Feature models are commonly used to specify the valid configurations of product lines. As
industrial feature models are typically complex, researchers and practitioners employ …
industrial feature models are typically complex, researchers and practitioners employ …
Bandwidth and wavefront reduction for static variable ordering in symbolic reachability analysis
J Meijer, J van de Pol - … Methods: 8th International Symposium, NFM 2016 …, 2016 - Springer
We investigate the use of bandwidth and wavefront reduction algorithms to determine a
static BDD variable ordering. The aim is to reduce the size of BDDs arising in symbolic …
static BDD variable ordering. The aim is to reduce the size of BDDs arising in symbolic …
Refinement and asynchronous composition of modal petri nets
D Elhog-Benzina, S Haddad, R Hennicker - Transactions on Petri Nets …, 2012 - Springer
We propose a framework for the specification of infinite state systems based on Petri nets
with distinguished may-and must-transitions (called modalities) which specify the allowed …
with distinguished may-and must-transitions (called modalities) which specify the allowed …
Decision diagrams for Petri nets: a comparison of variable ordering algorithms
The efficacy of decision diagram techniques for state space generation is known to be
heavily dependent on the variable order. Ordering can be done a-priori (static) or during the …
heavily dependent on the variable order. Ordering can be done a-priori (static) or during the …
Gradient-based variable ordering of decision diagrams for systems with structural units
This paper presents Gradient-\varPi, a novel heuristics for finding the variable ordering of
Decision Diagrams encoding the state space of Petri net systems. Gradient-\varPi combines …
Decision Diagrams encoding the state space of Petri net systems. Gradient-\varPi combines …
Shared reduced ordered binary decision diagram‐based thermal‐aware network synthesis
A Das, V Kumar Singh… - International Journal of …, 2022 - Wiley Online Library
In this work, a multi‐objective algorithm based on nondominated sorting genetic algorithm‐II
(NSGA‐II) for thermal‐aware realization of a combinational logic network has been …
(NSGA‐II) for thermal‐aware realization of a combinational logic network has been …