89 Hits in 7.6 sec

Constructing Interaction Test Suites for Highly-Configurable Systems in the Presence of Constraints: A Greedy Approach

M.B. Cohen, M.B. Dwyer, Jiangfan Shi
2008 IEEE Transactions on Software Engineering  
In this paper, we build upon our previous work to develop a family of greedy CIT sample generation algorithms that exploit calculations made by modern Boolean satisfiability (SAT) solvers to prune the  ...  We perform a comparative evaluation of the cost effectiveness of these algorithms on four real-world highly-configurable software systems and on a population of synthetic examples that share the characteristics  ...  ACKNOWLEDGMENTS The authors thank the following for helpful comments on this subject: Alan Hartman, Tim Klinger, Christopher Lott, and George Sherwood.  ... 
doi:10.1109/tse.2008.50 fatcat:uqtyrngfnbcyjn56z5nyzwpedi

Access time minimization in IEEE 1687 networks

Rene Krenz-Baath, Farrokh Ghani Zadegan, Erik Larsson
2015 2015 IEEE International Test Conference (ITC)  
In this paper we model the reconfiguration problem using Boolean Satisfiability Problem (SAT).  ...  It means the IEEE 1687 network needs to be frequently reconfigured from accessing one set of instruments to accessing a different set of instruments.  ...  To create the networks, a number of shift-registers are considered for each module as follows: • a shift-register with a length equal to the number of input pins, • a shift-register with a length equal  ... 
doi:10.1109/test.2015.7342408 dblp:conf/itc/Krenz-BaathZL15 fatcat:qwla6dfx3fblrhkg4pctk7nqk4

Massively Parallel Probabilistic Computing with Sparse Ising Machines [article]

Navid Anjum Aadit, Andrea Grimaldi, Mario Carpentieri, Luke Theogarajan, John M. Martinis, Giovanni Finocchio, Kerem Y. Camsari
2022 arXiv   pre-print
Strikingly, sIM beats competition-winning SAT solvers (by 4-700x in runtime to reach 95% accuracy) in solving 3SAT problems.  ...  The problem encoding and sparsification techniques we introduce can be applied to other Ising Machines (classical and quantum) and the architecture we present can be used for scaling the demonstrated 5,000  ...  Different reconfigurable RNG options in the sIM. (a) A linear-feedback shift register (LFSR) with programmable bit-width. (b) A Xoshiro128+ [70] RNG. (c) A Mersenne Twister [71].  ... 
arXiv:2110.02481v2 fatcat:3iio4xjfhvh2ndo4gzk63i7zmm

X-alignment techniques for improving the observability of response compactors

Ozgur Sinanoglu, Sobeeh Almukhaizim
2009 2009 International Test Conference  
., rotate and delay bits, is formulated as a MAX-SAT problem, and efficient heuristics are provided.  ...  Consequently, a larger number of scan cells are observed after compaction for any test pattern.  ...  from Math and Computer Science Department, Kuwait University, for her contribution in the implementation and experimentation.  ... 
doi:10.1109/test.2009.5355682 dblp:conf/itc/SinanogluA09 fatcat:qqzsuhrxxnaoddikjmqiwt4w3a

Real-World Snapshots vs. Theory: Questioning the t-Probing Security Model [article]

Thilo Krachenfels, Fatemeh Ganji, Amir Moradi, Shahin Tajik, Jean-Pierre Seifert
2020 arXiv   pre-print
Second, we consider an implementation with unknown register locations, where we make use of multiple snapshots and a SAT solver to reveal the secrets.  ...  In this work, we present a novel laser-assisted SCA technique, called Laser Logic State Imaging (LLSI), which offers an unlimited number of contactless probes, and therefore, violates the probing security  ...  Japan and Germany for their help and support on the PHEMOS system. The authors declare no other financial and non-financial competing interests.  ... 
arXiv:2009.04263v1 fatcat:het52agzkfew7b7cingp3nu3qa

Scalable hybrid verification of complex microprocessors

Maher Mneimneh, Fadi Aloul, Chris Weaver, Saugata Chatterjee, Karem Sakallah, Todd Austin
2001 Proceedings of the 38th conference on Design automation - DAC '01  
We introduce a new verification methodology for modern microprocessors that uses a simple checker processor to validate the execution of a companion high-performance processor.  ...  An alternative approach for checking the validity of LEUF formulas is based on converting them to propositional logic and testing them for satisfiability using a Boolean SAT solver.  ...  In some rare cases, the SAT solver returned a satisfiable assignment for an instruction that was correct.  ... 
doi:10.1145/378239.378265 dblp:conf/dac/MneimnehAWCSA01 fatcat:qp2cnhdprvdadnlmkvrwzkzkzq

ReCoFused partial reconfiguration for secure moving-target countermeasures on FPGAs

Buse Ustaoğlu, Kenneth Schmitz, Daniel Große, Rolf Drechsler
2020 SN Applied Sciences  
This applies in particular to reconfiguration-based countermeasures which are intensively used to create a moving target for an attacker.  ...  Reconfiguration-based countermeasures against side-channel attacks or differential power analysis (DPA) attacks were implemented.  ...  Using SAT as underlying machinery for BMC is feasible as the current state-of-the-art SAT solvers [35] can solve millions of clauses in moderate time.  ... 
doi:10.1007/s42452-020-3003-x fatcat:ppj7cli2anfsdi73myxeael7ze

Formal co-validation of low-level hardware/software interfaces

Alex Horn, Michael Tautschnig, Celina Val, Lihao Liang, Tom Melham, Jim Grundy, Daniel Kroening
2013 2013 Formal Methods in Computer-Aided Design  
We illustrate and evaluate our technique on three realistic benchmarks in which software I/O is subject to hardware-specific protocol rules: a real-time clock, a temperature sensor on an I 2 C bus, and  ...  These interactions make it difficult to design and validate the hardware and software separately; instead, a verifiable co-design is required that takes them into account.  ...  ACKNOWLEDGEMENTS This work is funded by a donation from Intel Corporation for research on Effective Validation of Firmware.  ... 
doi:10.1109/fmcad.2013.6679400 fatcat:ghkb7mhcirdidaxerfmtvfo7va

A Near-Term Quantum Computing Approach for Hard Computational Problems in Space Exploration [article]

Vadim N. Smelyanskiy, Eleanor G. Rieffel, Sergey I. Knysh, Colin P. Williams, Mark W. Johnson, Murray C. Thom, William G. Macready, Kristen L. Pudenz
2012 arXiv   pre-print
Finally, we discuss the ways to circumvent the limitation of the Ising mapping using a "blackbox" approach based on ideas from probabilistic computing.  ...  We review quantum algorithms for structured learning for multi-label classification and introduce a hybrid classical/quantum approach for learning the weights.  ...  The MAX-3-SAT problem is an optimization problem specified by clauses of the same form as for a 3-SAT problem together with weights indicating the importance of satisfying the clause.  ... 
arXiv:1204.2821v2 fatcat:yogef3xqfjbmhfis4oyq2ldm3m

Safety Verification of Parameterized Systems under Release-Acquire [article]

Adwait Godbole, Shankara Narayanan Krishna, Roland Meyer
2022 arXiv   pre-print
We show that the complexity jumps to \nexp-complete for thread-modular verification where an unrestricted distinguished 'ego' thread interacts with an environment of CAS-free threads plus loop-free distinguished  ...  Our first contribution is a new semantics that considerably simplifies RA but is still equivalent for the above systems as far as safety verification is concerned.  ...  Threads compute locally over a set of registers and interact with each other by writing to and reading from a shared memory.  ... 
arXiv:2101.12123v2 fatcat:76wwxehpt5e37cknq5yl4rrzqm

Reconfigurable scan networks : formal verification, access optimization, and protection [article]

Rafal Baranowski, Universität Stuttgart, Universität Stuttgart
The proposed model is based on a temporal abstraction which is both sound and complete for a wide array of scan networks.  ...  Reconfigurable scan architectures emerge as a suitable mechanism for access to on-chip instruments.  ...  However, the modification of a SAT instance in a learning-based SAT solver is hard: Every invocation of the SAT solver extends the instance with learned clauses which hold only for the actual instance.  ... 
doi:10.18419/opus-3246 fatcat:653o7kq4sff43a57mpiftqvfdm

Specification Of Security Enablers For Data Management

Marko Vukolic
2016 Zenodo  
Chapter 6 introduces a generic state-transfer tool for partitioned state-mac [...]  ...  Chapter 5 empirically evaluates latency-optimization for state-machine replication in WANs and informs the design of novel state-machine replication protocols.  ...  To prove correct function evaluation, we need to show that for every real-world adversary A interacting with Trinocchio, there is an ideal-world simulator S A that interacts with the trusted party for  ... 
doi:10.5281/zenodo.263831 fatcat:ksk4ze2tuncfbexjzsorjnoabe

Assessing Model-Driven Software Product Lines for Lean and Agile Development: An Experience Report

Antti Jääskeläinen, Mika Katara, Julia Rubin, Tali Yatzkar-Haham, Mila Keren
2010 Software Product Lines Conference  
This paper presents an exploratory study that compares the stability promoted by XPI and EJP in terms of modularity properties.  ...  Stability is a key driving requirement in incremental development of systems that are strategic to organizations, such as Software Product Lines (SPLs).  ...  We would also like to thank Ina Schaefer for suggesting the case study that appears in Section IV.  ... 
dblp:conf/splc/JaaskelainenKRYK10 fatcat:tlzfby6kyba7xkgwy2nfz7o3tm

Visible Light-Assisted Soft-Chemistry Route to Silver Nanomaterials at Room Temperature

Yi Wu, Xin Liu, Zi Huang, Xiang Fei He, Xi Yang, Qing Li
2019 Key Engineering Materials  
Silver nanoparticles (AgNPs) were synthesizd by a light-assisted liquid phase reduction method with sodium hypophosphite as a reducing agent. DTAB was used to perform as the surfactant.  ...  We present the SAT clauses that aim at inferring the model and explain them. The SAT formulation is tested on artificial data sets.  ...  Finally, we present a MAX-SAT formulation which allows inferring a RMP model when the learning set is not fully compatible with such a model. The MAX-SAT formulation is tested on artificial datasets.  ... 
doi:10.4028/ fatcat:xara5sxzf5fsvbib2dy6vrl7j4

Interaction-aware analysis and optimization of real-time application and operating system [article]

Christian Dietrich, University, My
For the area real-time operating systems (RTOSs), which form the base layer for many of these computerized control systems, we deploy way more flexibility than what is actually required for the applications  ...  With the advances of general-purpose computing, the development of these control systems shifted more and more from a problem-specific one to a one-size-fits-all mentality as the trade-off between per-instance  ...  However, it also gives the solver the freedom to shift ABB executions to higher power states if the state counts allow for it.  ... 
doi:10.15488/7253 fatcat:djadjlmrx5b75bvtr2rinlroum
« Previous Showing results 1 — 15 out of 89 results