SATによるシステム検証(<特集>最近のSAT技術の発展) [in Japanese] SAT-Based System Verification(<Special Issue>Recent Advances in SAT Techniques) [in Japanese]
-
- 番原 睦則 BANBARA Mutsunori
- 神戸大学学術情報基盤センター Information Science and Technology Center, Kobe University
-
- 田村 直之 TAMURA Naoyuki
- 神戸大学学術情報基盤センター Information Science and Technology Center, Kobe University
Access this Article
Search this Article
Author(s)
-
- 番原 睦則 BANBARA Mutsunori
- 神戸大学学術情報基盤センター Information Science and Technology Center, Kobe University
-
- 田村 直之 TAMURA Naoyuki
- 神戸大学学術情報基盤センター Information Science and Technology Center, Kobe University
Journal
-
- Journal of Japanese Society for Artificial Intelligence
-
Journal of Japanese Society for Artificial Intelligence 25(1), 122-129, 2010-01-01
人工知能学会
References: 31
-
1
- Symbolic model checking without BDDs
-
BIERE A.
Proc. 5th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), 193-207, 1999
Cited by (1)
-
2
- Bounded Model Checking
-
BIERE A.
Handbook of Satisfiability, 457-481, 2009
Cited by (1)
-
3
- On the state of strength-three covering arrays
-
CHATEAUNEUF M. A.
J. Combinatorial Designs 10(4), 217-238, 2002
Cited by (1)
-
4
- Design and synthesis of symchronization skeletons using branching-time temporal logic
-
CLARKE E. M.
Proc. Workshop on Logic Programs, 1982, 1982
Cited by (1)
-
5
- <no title>
-
CLARKE E. M.
Model Checking, 1999
Cited by (1)
-
6
- Constructing test suites for interaction testing
-
COHEN M. B.
Proc. 25th Int. Conf. on Software Engineering, 2003, 38-48, 2003
Cited by (1)
-
7
- Combinatorial aspects of covering arrays
-
COLBOURN C. J.
Le Matematiche (Catania) 58, 121-167, 2004
Cited by (1)
-
8
- Covering Array Tables for t=2,3,4,5,6
-
COLBOURN C. J.
http://www.public.asu.edu/〜ccolbou/src/tabby/catable.html, 2009
Cited by (1)
-
9
- <no title>
-
DRECHSLER R.
Test Pattern Generation using Boolean Proof Engines, 2009
Cited by (1)
-
10
- An Extensible SAT-solver
-
EEN N.
Proc. 6th Int. Conf. on Theory and Applicationsof Satisfiability Testing (SAT2003), 502-518, 2003
Cited by (1)
-
11
- Temporal induction by incremental SAT solving
-
EEN N.
Proc. 1st Int. Workshop on Bounded Model Checking (BMC), 2003, 2003
Cited by (1)
-
12
- Problems and algorithms for covering arrays
-
HARTMAN A.
Discrete Mathematics 284(1-3), 149-156, 2004
Cited by (1)
-
13
- Constraint-based approaches to the covering test problem, Faltings
-
HNICH B.
Recent Advances in Constraints, Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2004, 2005
Cited by (1)
-
14
- Constraint models for the covering test problem
-
HNICH B.
Constraints 11(2-3), 199-219, 2006
Cited by (1)
-
15
- In-parameter-order : A test generation strategy for pairwise testing
-
LEI Y.
Proc. 3rd IEEE Int. Symp. on High-Assurance Systems Engineering (HASE'98), 254-261, 1998
Cited by (1)
-
16
- Group construction of covering arrays
-
MEAGHER K.
J. Combinatorial Designs 13(1), 70-77, 2005
Cited by (1)
-
17
- Upper bounds for covering arrays by tabu search
-
NURMELA K. J.
Discrete Applied Mathematics 138(1-2), 143-152, 2004
Cited by (1)
-
18
- The temporal logic of programs
-
PNUELI A.
Proc. IEEE Symp. on Foundations of Computer Science, 1977, 1977
Cited by (1)
-
19
- A survey of recent advances in SAT-based formal verification
-
PRASAD M.
SoftwareTools for Technology Transfer 7(2), 156-173, 2005
Cited by (1)
-
20
- Generalized arc consistency for global cardinality constraint
-
REGIN J.-C.
Proc. 13th Nat'l Conf. on Artificial Intelligence (AAAI'96) 1, 209-215, 1996
Cited by (1)
-
21
- Covering arrays and intersecting codes
-
SLOANE N. J. A.
J. Combinatorial Designs 1, 51-63, 1993
Cited by (1)
-
22
- Compiling finite linear CSP into SAT
-
TAMURA N.
Proc. 12th Int. Conf. on Principles and Practice of Constraint Programming (CP 2006), 590-603, 2006
Cited by (1)
-
23
- Compiling finite linear CSP into SAT
-
TAMURA N.
Constraints 14(2), 254-272, 2009
Cited by (1)
-
24
- Automating test case generation for the new generation missionsoftware system
-
TUNG Y.-W.
Proc. IEEE Aerospace Conference, 2000, 431-437, 2000
Cited by (1)
-
25
- Determination of test configurations for pair-wise interaction coverage
-
WILLIAMS A. W.
Proc. 13th Int. Conf. on Testing Communicating Systems (TestCom 2000), 59-74, 2000
Cited by (1)
-
26
- The AETG System : An Approach to Testing Based on Combinatiorial Design
-
COHEN D. M.
IEEE Transactions on Software Engineering 23(7), 437-444, 1997
Cited by (8)
-
27
- Noise strategies for improving local search
-
SELMAN B.
Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI'94), Seattle, 1994
Cited by (7)
-
28
- Checking safety properties using induction and a SAT-solver
-
SHEERAN M.
Proceedings of the 3rd International Conference on Formal Methods in Computer-Aided Design, 2000, 2000
Cited by (5)
-
29
- Recent Advances in SAT Algorithms [in Japanese]
-
FUJITA Masahiro
The Journal of the Institute of Electronics, Information and Communication Engineers 90(12), 1067-1072, 2007-12-01
References (10) Cited by (1)
-
30
- Foundations of SAT Solvers(<Special Issue>Recent Advances in SAT Techniques) [in Japanese]
-
INOUE Katsumi , TAMURA Naoyuki , Katsumi Inoue , Naoyuki Tamura , 国立情報学研究所:総合研究大学院大学情報学専攻 , 神戸大学学術情報基盤センター , National Institute of Informatics:Department of Informatics The Graduate University for Advanced Studies , Information Science and Technology Center Kobe University
Journal of Japanese Society for Artificial Intelligence 25(1), 57-67, 2010-01-01
JSAI References (56) Cited by (8)
-
31
- Constraint Optimization Problems and SAT Encodings(<Special Issue>Recent Advances in SAT Techniques) [in Japanese]
-
TAMURA Naoyuki , TANJO Tomoya , BANBARA Mutsunori , Naoyuki Tamura , Tomoya Tanjo , Mutsunori Banbara , 神戸大学学術情報基盤センター , 神戸大学大学院工学研究科 , 神戸大学学術情報基盤センター , Information Science and Technology Center Kobe University , Graduate School of Engineering Kobe University , Information Science and Technology Center Kobe University
Journal of Japanese Society for Artificial Intelligence 25(1), 77-85, 2010-01-01
JSAI References (40) Cited by (4)
Cited by: 5
-
1
- SAT/SMT solvers and their applications [in Japanese]
-
UMEMURA Akihiro
コンピュータソフトウェア 27(3), 24-35, 2010-07-27
References (26) Cited by (9)
-
2
- Foundations of SAT Solvers(<Special Issue>Recent Advances in SAT Techniques) [in Japanese]
-
INOUE Katsumi , TAMURA Naoyuki , Katsumi Inoue , Naoyuki Tamura , 国立情報学研究所:総合研究大学院大学情報学専攻 , 神戸大学学術情報基盤センター , National Institute of Informatics:Department of Informatics The Graduate University for Advanced Studies , Information Science and Technology Center Kobe University
Journal of Japanese Society for Artificial Intelligence 25(1), 57-67, 2010-01-01
JSAI References (56) Cited by (8)
-
3
- Constraint Optimization Problems and SAT Encodings(<Special Issue>Recent Advances in SAT Techniques) [in Japanese]
-
TAMURA Naoyuki , TANJO Tomoya , BANBARA Mutsunori , Naoyuki Tamura , Tomoya Tanjo , Mutsunori Banbara , 神戸大学学術情報基盤センター , 神戸大学大学院工学研究科 , 神戸大学学術情報基盤センター , Information Science and Technology Center Kobe University , Graduate School of Engineering Kobe University , Information Science and Technology Center Kobe University
Journal of Japanese Society for Artificial Intelligence 25(1), 77-85, 2010-01-01
JSAI References (40) Cited by (4)
-
4
- SMT-based Bounded Model Checking for Assembly program [in Japanese]
-
KOBASHI Jumpei , TAKESHITA Atsushi , YAMANE Satoshi
Technical report of IEICE. KBSE 112(314), 19-24, 2012-11-15
CiNii PDF - Open Access References (16)
-
5
- Model Checking that Uses Satisfiability Solving [in Japanese]
-
TSUCHIYA Tatsuhiro
Computer Software 29(1), 19-29, 2012-01-26
J-STAGE References (37)