SCOPUS 정보 검색 플랫폼

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3305, Issue , 2004, Pages 745-754

SAT-based analysis of cellular automata

(2) D'Antonio, Massimo a Delzanno, Giorgio a

a UNIVERSITY OF GENOA (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CELLULAR AUTOMATA; COMPUTATIONAL COMPLEXITY; DECISION THEORY; FORMAL LOGIC; INDUSTRIAL RESEARCH; MODEL CHECKING;

FIRING SQUAD SYNCHRONIZATION PROBLEMS; PROPOSITIONAL FORMULAS; PROPOSITIONAL LOGIC; QUALITATIVE ANALYSIS; REACHABILITY PROBLEM; SAT SOLVERS; SAT-BASED ANALYSIS; SATISFIABILITY PROBLEMS;

INVERSE PROBLEMS;

EID: 35048859827 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/978-3-540-30479-1_77 Document Type: Article

Times cited : (4)

References (15)

1
- 84957047352
- Verifiying Safety Properties of a Power PC Microprocessor Using Symbolic Model Checking without BDDs
- Lecture Notes in Computer Science
- A. Biere, E.M. Clarke, R. Raimi, Y. Zhu. Verifiying Safety Properties of a Power PC Microprocessor Using Symbolic Model Checking without BDDs, CAV '99, Lecture Notes in Computer Science, 60-71, 1999.
- (1999) CAV '99 , pp. 60-71
- Biere, A.¹ Clarke, E.M.² Raimi, R.³ Zhu, Y.⁴

2
- 35048852188
- Tesi di laurea, Dip. di Informatica e Scienze dell'Informazione, Università di Genova, Marzo
- M. D'Antonio. Analisi SAT-based di Automi Cellulari, Tesi di laurea, Dip. di Informatica e Scienze dell'Informazione, Università di Genova, Marzo 2004.
- (2004) Analisi SAT-based di Automi Cellulari
- D'Antonio, M.¹

3
- 84881072062
- A computing procedure for quantification theory
- M. Davis, H. Putnam. A computing procedure for quantification theory, Journal of the Association for Computing Machinery, 7:201-215, 1960.
- (1960) Journal of the Association for Computing Machinery , vol.7 , pp. 201-215
- Davis, M.¹ Putnam, H.²

4
- 12244300696
- NP-Complete Problems in Cellular Automata
- F. Green. NP-Complete Problems in Cellular Automata, Complex Systems, 1:453-474, 1987.
- (1987) Complex Systems , vol.1 , pp. 453-474
- Green, F.¹

5
- 0034140365
- The propositional formula checker HeerHugo
- J. Groote, J. Warners The propositional formula checker HeerHugo, Journal of Automated Reasoning, 24(1-2):101-125, 2000.
- (2000) Journal of Automated Reasoning , vol.24 , Issue.1-2 , pp. 101-125
- Groote, J.¹ Warners, J.²

6
- 35048833401
- The ICS home page: http://www.icansolve.com
- The ICS Home Page

7
- 0023496686
- A six-state minimal time solution to the firing squad synchronization problem
- Elsevier
- J. Mazoyer. A six-state minimal time solution to the firing squad synchronization problem, Theoretical Computer Science, 50(2): 183-240, Elsevier, 1987.
- (1987) Theoretical Computer Science , vol.50 , Issue.2 , pp. 183-240
- Mazoyer, J.¹

8
- 0003781207
- Sequential machines
- E.F. Moore Addison-Wesley, Reading
- E.F. Moore. Sequential machines in: E.F. Moore Selected Papers, Addison-Wesley, Reading, 1964.
- (1964) Selected Papers
- Moore, E.F.¹

9
- 0034852165
- Chaff: Engineering an Efficient SAT Solver
- M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang, S. Malik. Chaff: Engineering an Efficient SAT Solver, Proceedings of the 38th Design Automation Conference (DAC'01), 2001.
- (2001) Proceedings of the 38th Design Automation Conference (DAC'01)
- Moskewicz, M.W.¹ Madigan, C.F.² Zhao, Y.³ Zhang, L.⁴ Malik, S.⁵

10
- 84888496147
- A Structure Preserving Clause Form Translation
- D. A. Plaisted and S. Greenbaum. A Structure Preserving Clause Form Translation Journal of Symbolic Computation, 2(3):293-304, 1986.
- (1986) Journal of Symbolic Computation , vol.2 , Issue.3 , pp. 293-304
- Plaisted, D.A.¹ Greenbaum, S.²

11
- 35048867987
- The SIMO web page: http://www.mrg.dist.unige.it/ sim/simo/
- The SIMO Web Page

12
- 0029252127
- On the computational complexity of finite cellular automata
- K. Sutner. On the computational complexity of finite cellular automata, JCSS, 50(1):87-97, 1995.
- (1995) JCSS , vol.50 , Issue.1 , pp. 87-97
- Sutner, K.¹

13
- 0020495993
- Universality and complexity in cellular automata
- S. Wolfram. Universality and complexity in cellular automata, Physica D, 10:1-35, 1984.
- (1984) Physica D , vol.10 , pp. 1-35
- Wolfram, S.¹

14
- 0002812729
- Computation Theory of Cellular Automata
- November
- S. Wolfram. Computation Theory of Cellular Automata, Communications in Mathematical Physics, 96:15-57, November 1984.
- (1984) Communications in Mathematical Physics , vol.96 , pp. 15-57
- Wolfram, S.¹

15
- 0343598906
- Programming Environments for Cellular Automata
- Universitat Karlsruhe, Fakultat fur Informatik
- T. Worsch. Programming Environments for Cellular Automata,Technical report 37/96, Universitat Karlsruhe, Fakultat fur Informatik, 1996.
- (1996) Technical Report , vol.37-96
- Worsch, T.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.