Learn More
A Sudoku puzzle can be regarded as a propositional SAT problem. Various encodings are known for encoding Sudoku as a Con-junctive Normal Form(CNF) formula. Using these encodings for large Sudoku puzzles, however, generates too many clauses, which impede the performance of state-of-the-art SAT solvers. This paper presents an optimized CNF encoding in order(More)
Multi-threaded Java programming such as an internet server program is difficult, because it is hard to detect subtle errors within multi-threading. LTSA is a too/for modeling and analyzing for catching some kinds of thread bugs, but still there remains scalability problem to deal with bigger applications. In this paper, we introduce a SAT based verification(More)
Model checking complex systems always suffers from the state explosion problem. Over the last 10 years there has been lots of researches on how to mitigate the state explosion problem. As a result, many techniques have been emerged such as absiraction, compositional reasoning, and exploiting symmetry. In line with these efforts, this paper proposes stepwise(More)