Sciweavers

428 search results - page 72 / 86
» FPGA-Based SAT Solver
Sort
View
IJISEC
2008
101views more  IJISEC 2008»
13 years 7 months ago
SAT-based model-checking for security protocols analysis
We present a model checking technique for security protocols based on a reduction to propositional logic. At the core of our approach is a procedure that, given a description of th...
Alessandro Armando, Luca Compagna
IJCSA
2007
104views more  IJCSA 2007»
13 years 7 months ago
Solving the Satisfiability Problem Using Finite Learning Automata
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
Ole-Christoffer Granmo, Noureddine Bouhmala
ICCAD
2010
IEEE
119views Hardware» more  ICCAD 2010»
13 years 5 months ago
Symbolic system level reliability analysis
Abstract--More and more embedded systems provide a multitude of services, implemented by a large number of networked hardware components. In early design phases, dimensioning such ...
Michael Glaß, Martin Lukasiewycz, Felix Reim...
NFM
2011
303views Formal Methods» more  NFM 2011»
13 years 2 months ago
Instantiation-Based Invariant Discovery
Abstract. We present a general scheme for automated instantiation-based invariant discovery. Given a transition system, the scheme produces k-inductive invariants from templates re...
Temesghen Kahsai, Yeting Ge, Cesare Tinelli
FROCOS
2011
Springer
12 years 7 months ago
Automatic Proof and Disproof in Isabelle/HOL
Abstract. Isabelle/HOL is a popular interactive theorem prover based on higherorder logic. It owes its success to its ease of use and powerful automation. Much of the automation is...
Jasmin Christian Blanchette, Lukas Bulwahn, Tobias...