Filters








60 Hits in 4.1 sec

Exact DFA Identification Using SAT Solvers [chapter]

Marijn J. H. Heule, Sicco Verwer
2010 Lecture Notes in Computer Science  
We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers.  ...  Experiments on a well-known suite of random DFA identification problems show that SAT solvers can efficiently tackle all instances.  ...  The price to pay is of course that the solution provided by the SAT solver will no longer be exact.  ... 
doi:10.1007/978-3-642-15488-1_7 fatcat:tqe7pyxd6zhnziocuf6gy57qna

Software model synthesis using satisfiability solvers

Marijn J. H. Heule, Sicco Verwer
2012 Empirical Software Engineering  
We propose -when EDSM becomes too weak -to tackle the reduced identification problem using satisfiability solvers.  ...  Third, in case the amount of positive data is small, we solve the identification problem several times by randomizing the greedy heuristic and combine the solutions using a voting scheme.  ...  |R| + i colors // try to find an exact solution with i extra states solve the formula using a SAT-solver if the solver returns a DFA solution A then add A to D and break // if the SAT solver finds a solution  ... 
doi:10.1007/s10664-012-9222-z fatcat:s6qepw7ieff4pit3gokfjrnbfa

Symmetry Breaking Predicates for SAT-based DFA Identification [article]

Vladimir Ulyantsev, Ilya Zakirzyanov, Anatoly Shalyto
2016 arXiv   pre-print
Modern SAT-solvers can tackle hard DFA identification instances efficiently.  ...  It was shown before that the NP-hard problem of deterministic finite automata (DFA) identification can be effectively translated to Boolean satisfiability (SAT).  ...  Acknowledgements The authors would like to thank Igor Buzhinsky, Daniil Chivilikhin and Maxim Buzdalov for useful comments.  ... 
arXiv:1602.05028v2 fatcat:n2alm5kpo5cq7jognoiurb3ulu

Differential Fault Attack on Grain v1, ACORN v3 and Lizard [chapter]

Akhilesh Siddhanti, Santanu Sarkar, Subhamoy Maitra, Anupam Chattopadhyay
2017 Lecture Notes in Computer Science  
While we have used the basic framework of DFA that appears in literature quite frequently, specific tweaks have to be explored to mount the actual attacks that were not used earlier.  ...  However, the 'hard fault' model requires a lot more assumption than the generic DFA. In this paper, we mount a DFA on ACORN v3 that requires 9 faults to obtain the state.  ...  Using the given set of faulty and fault-free key streams, equations are generated and fed into a SAT solver. The outline of such DFA will be discussed in Section II.  ... 
doi:10.1007/978-3-319-71501-8_14 fatcat:2eqv6ima2naiblx2dpr2s7kq74

BFS-Based Symmetry Breaking Predicates for DFA Identification [chapter]

Vladimir Ulyantsev, Ilya Zakirzyanov, Anatoly Shalyto
2015 Lecture Notes in Computer Science  
     , , 1 , , , , , 1 , Experimental setup Random data sets Binary alphabet TL -time limit (TL = 1800 seconds) lingeling SAT-solver Mean time among 100 launches of experiments  ...  does not exist Noisy DFA identification when the target DFA does not exist, S = 50N strings Conclusion Exact solution for noisy DFA identification New symmetry breaking predicates based on BFS • Applicable  ... 
doi:10.1007/978-3-319-15579-1_48 fatcat:6f4xtduvcbblvejvk7v6cmzhpq

Answer Set Programming for Regular Inference

Wojciech Wieczorek, Tomasz Jastrzab, Olgierd Unold
2020 Applied Sciences  
The results show that our method outperforms, in terms of CPU time, a SAT approach and other exact algorithms on all benchmarks.  ...  We then ask an ASP solver to find an answer set for the program, which we use to extract the automaton of the required size.  ...  It has been fruitfully used in a range of applications. Early ASP solvers used backtracking to find solutions. With the evolution of Boolean SAT solvers, several ASP solvers were built on top them.  ... 
doi:10.3390/app10217700 fatcat:2ppdhlkpq5fvjguneovofzogze

Differential Fault Attack against Grain Family with Very Few Faults and Minimal Assumptions

Santanu Sarkar, Subhadeep Banik, Subhamoy Maitra
2015 IEEE transactions on computers  
In line of algebraic cryptanalysis, we accumulate such equations based on the fault-free and faulty key-stream bits and solve them using the SAT Solver Cryptominisat-2.9.5 installed with SAGE 5.7.  ...  In this paper we present a significantly improved scenario from the adversarial point of view for DFA against the Grain family of stream ciphers.  ...  A DFA on Trivium using SAT solvers has been presented in [27] (see also [22, 23] for other DFAs on Trivium).  ... 
doi:10.1109/tc.2014.2339854 fatcat:fwag63zyz5ajbdjatw6acieoaq

Exact finite-state machine identification from scenarios and temporal properties

Vladimir Ulyantsev, Igor Buzhinsky, Anatoly Shalyto
2016 International Journal on Software Tools for Technology Transfer (STTT)  
This paper presents four exact methods to tackle the problem of minimum FSM identification from a set of test scenarios and a temporal specification represented in linear temporal logic.  ...  Three of them are based on translations of the FSM identification problem to SAT or QSAT problem instances. Accounting for temporal properties is done via counterexample prohibition.  ...  FSM identification methods Four exact FSM identification methods are presented in this paper.  ... 
doi:10.1007/s10009-016-0442-1 fatcat:ne7vicgd65cifprr6uw6d4t6gy

Differential fault location identification by machine learning

Anubhab Baksi, Santanu Sarkar, Akhilesh Siddhanti, Ravi Anand, Anupam Chattopadhyay
2021 CAAI Transactions on Intelligence Technology  
In particular, finding the exact fault location by analysing the output difference (typically the XOR of the nonfaulty and the faulty ciphertexts) is somewhat nontrivial.  ...  In this regard, we propose a machine learning (ML) assisted tool that can be used in the context of a differential fault attack.  ...  With the information on the flipped bit, some automated tool (typically, a SAT solver, e.g. in [3, 5] ) is used to model the state, thereby recovering it.  ... 
doi:10.1049/cit2.12027 fatcat:7ziudhgq4rh6pdnsbex7ryyoou

Fully Automated Differential Fault Analysis on Software Implementations of Block Ciphers

Xiaolu Hou, Jakub Breier, Fuyuan Zhang, Yang Liu
2019 Transactions on Cryptographic Hardware and Embedded Systems  
We establish an effective description of DFA as constraints that are passed to an SMT solver.  ...  We create a tool that takes assembly code as input, analyzes the dependencies among instructions, automatically attacks vulnerable instructions using SMT solver and outputs the attack details that recover  ...  Another work utilizing SAT solver was automation of DFA on the circuit level [GBH + 16]. They describe the circuit, as well as the fault, in conjunctive normal form and use SAT to solve for the key.  ... 
doi:10.13154/tches.v2019.i3.1-29 dblp:journals/tches/HouBZL19 fatcat:qwtjzmpndzginnuvhfnc4yulce

Modeling Machine Learning and Data Mining Problems with FO(·)

Hendrik Blockeel, Bart Bogaerts, Maurice Bruynooghe, Broes De Cat, Stef De Pooter, Marc Denecker, Anthony Labarre, Jan Ramon, Sicco Verwer, Marc Herbstritt
2012 International Conference on Logic Programming  
This paper reports on the use of the FO(•) language and the IDP framework for modeling and solving some machine learning and data mining tasks.  ...  A second task is about a somewhat similar problem within biology where phylogenetic trees are used to represent the evolution of species.  ...  Recently [11] won the 2010 Stamina DFA learning competition [19] by reducing the DFA learning problem to a SAT problem and running an off-the-shelf SAT solver.  ... 
doi:10.4230/lipics.iclp.2012.14 dblp:conf/iclp/BlockeelBBCP12 fatcat:kec3kjdzarfwvnimw5pclyaxqm

Regular inference as vertex coloring

Christophe Costa Florêncio, Sicco Verwer
2014 Theoretical Computer Science  
We immediately obtain new complexity bounds, as well as a family of new learning algorithms which can be used to obtain exact hypotheses as well as fast approximations.  ...  This paper is concerned with the problem of supervised learning of deterministic finite state automata, in the technical sense of identification in the limit from complete data, by finding a minimal DFA  ...  Recently, instead of wrapping a search technique around EDSM, a translation of the regular inference problem into satisfiability (SAT) was proposed in order to use a state-of-the-art SAT-solver to search  ... 
doi:10.1016/j.tcs.2014.09.023 fatcat:eveyl6lharhgrlfyx6keubdmhm

Regular Inference as Vertex Coloring [chapter]

Christophe Costa Florêncio, Sicco Verwer
2012 Lecture Notes in Computer Science  
We immediately obtain new complexity bounds, as well as a family of new learning algorithms which can be used to obtain exact hypotheses as well as fast approximations.  ...  This paper is concerned with the problem of supervised learning of deterministic finite state automata, in the technical sense of identification in the limit from complete data, by finding a minimal DFA  ...  Recently, instead of wrapping a search technique around EDSM, a translation of the regular inference problem into satisfiability (SAT) was proposed in order to use a state-of-the-art SAT-solver to search  ... 
doi:10.1007/978-3-642-34106-9_10 fatcat:ewficpo5ubeeljwdr2zx375nse

DeepSynth: Automata Synthesis for Automatic Task Segmentation in Deep Reinforcement Learning [article]

Mohammadhosein Hasanbeig, Natasha Yogananda Jeppu, Alessandro Abate, Tom Melham, Daniel Kroening
2021 arXiv   pre-print
Synth converts the model learning problem into a Boolean Satisfiability (SAT) problem and uses a SAT solver to generate models.  ...  SAT solvers, in turn, use a backtracking search algorithm, DPLL (Davis and Putnam 1960) , to look for a satisfying assignment to the variables in the Boolean formula.  ... 
arXiv:1911.10244v5 fatcat:c2r47b7aafdbbkadkltxocclde

Automated assumption generation for compositional verification

Anubhav Gupta, K. L. McMillan, Zhaohui Fu
2008 Formal methods in system design  
We describe a method for computing a minimum-state automaton to act as an intermediate assertion in assume-guarantee reasoning, using a sampling approach and a Boolean satisfiability solver.  ...  We use a SAT solver to find the minimum-state partition, using the following encoding of the problem of existence of a consistent partition of k states. Let n = log 2 k .  ...  Finding a minimumstate automaton consistent with a set of labeled strings is itself an NP-complete problem [Gol78] , and we solve it using a Boolean Satisfiability (SAT) solver.  ... 
doi:10.1007/s10703-008-0050-0 fatcat:sxzsoguegzbl5hyotojamgimpy
« Previous Showing results 1 — 15 out of 60 results