Verification technology transfer

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

Volumn 5000 LNCS, Issue , 2008, Pages 46-64

  Kurshan, R P ^a  

^a CADENCE DESIGN SYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; COMPUTER SIMULATION; PETROLEUM PRODUCTS; TECHNOLOGICAL FORECASTING; TECHNOLOGY; TECHNOLOGY TRANSFER;

COMMERCIAL PRODUCTS; COMPONENT FUNCTIONALITY; COMPUTER AIDED VERIFICATION; FUNCTIONAL BEHAVIORS; FUNCTIONAL SPECIFICATIONS; INTERNATIONAL CONFERENCES; LIMITED CAPACITY; MARKET PLACES; NEW TECHNOLOGIES; NEW TOOLS; SIMULATION TESTED;

MODEL CHECKING;

EID: 48949095115     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69850-0_3     Document Type: Conference Paper

References (29)

1. +99] Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., Zhu, Y.: Symbolic model checking using SAT procedures instead of BDDs. In: Proc. 36th Design Automation Conference, pp. 317-320. IEEE Computer Society Press, Los Alamitos (1999)
2. [BG92] Berry, G., Gonthier, G.: The Esterel Synchronous Programming Language: Design, Semantics, Implementation. Science of Computer Programming, vol. 19, pp. 87-152 (1992)
3. [BL84] Bledsoe, W.W., Loveland, D.W. (eds.): Automated Theorem Proving: After 25 Years, Contemporary Math. 29, pp. 119-132. Amer. Math. Soc. (1984); Especially the paper Proof-Checking, Theorem-Proving and Program Verification by R. S. Boyer and J. S. Moore
4. [BR02] Ball, T., Rajamani, S.K.: The SLAM Project: Debugging System Software via Static Analysis. In: Symposium on Principles of Programming Languages (POPL), pp. 1-3. ACM (January 2002)
5. [Büc62] Büchi, J.R.: On a Decision Method in Restricted Second-Order Arithmetic. In: Methodology and Philosophy of Science, Proc., 1960 Stanford Intern. Congr., pp. 1-11. Stanford Univ. Press, Stanford (1962)
6. [CBRZ01] Clarke, E.M., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. In: Formal Methods in System Design, vol. 19, Kluwer Academic Publishers (July 2001)
7. [CE82] Clarke, E.M., Emerson, E.A.: Design and Synthesis of Synchronization Skeletons for Branching Time Temporal Logic. In: Logic of Programs 1981. LNCS, vol. 131, pp. 52-71 (1982)
8. +00] Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexampleguided abstraction refinement. In: Computer Aided Verification, pp. 154-169 (2000)
9. [CKL04] Clarke, E., Kroening, D., Lerda, F.: A Tool for Checking ANSI-C Programs. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 168-176. Springer, Heidelberg (2004)
10. [Coe95] Coe, T.: Inside the Pentium FDIV Bug. Dr. Dobbs Journal 20, 129-135 (1995)
11. [DDHY92] Dill, D.L., Drexler, A.J., Hu, A.J., Yang, C.H.: Protocol Verification as a Hardware Design Aid. In: IEEE International Conference on Computer Design: VLSI in Computers and Processors, pp. 522-525. IEEE Computer Society (1992)
12. [GMW79] Gordon, M., Milner, R., Wadsworth, C.P.: Edinburgh LCF: A Mechanised Logic of Computation. LNCS, vol. 78 (1979)
13. [HHK96] Hardin, R.H., Har'El, Z., Kurshan, R.P.: COSPAN. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 423-427. Springer, Heidelberg (1996)
14. [JM05] Jhala, R., McMillan, K.L.: Interpolant-based transition relation approximation. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 39-51. Springer, Heidelberg (2005)
15. [KH90] Kurshan, R.P., Har'El, Z.: Software for analytical development of communication protocols. AT&T Tech. J. 69(1), 45-59 (1990)
16. [Kur94] Kurshan, R.P.: Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press (1994)
17. [Kur00] Kurshan, R.P.: Program Verification. Notices of the AMS 47(5), 534-545 (2000)
18. [MA03] McMillan, K.L., Amla, N.: Automatic Abstraction without Counterexamples. In: Garavel, H., Hatcliff, J. (eds.) ETAPS 2003 and TACAS 2003. LNCS, vol. 2619, pp. 2-17. Springer, Heidelberg (2003)
19. [McM93] McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers (1993)
20. [McM03] Kenneth, L., McMillan, K.L.: Interpolation and sat-based model checking. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 1-13. Springer, Heidelberg (2003)
21. [Pnu77] Pnueli, A.: The Temporal Logic of Programs. In: Proc. of the Eighteenth Symposium on Foundations of Computer Science (FOCS), Providence, RI, pp. 46-57 (1977)
22. [QS82] Queille, J.P., Sifakis, J.: Programming 1982. LNCS, vol. 137, pp. 337-351 (1982)
23. [Rob65] Robinson, J.A.: Machine-Oriented Logic Based on the Resolution Principle. Journal of the Association for Computing Machinery 12, 23-41 (1965)
24. [RS59] Rabin, M.O., Scott, D.: Finite Automata and Their Decisions Problems. IBM J. Res. and Dev. 3, 114-125 (1959)
25. [RW82] Rudin, H., West, C.: A validation technique for tightly coupled protocols. Transactions on Computers (April 1982)
26. [Tur36] Turing, A.: On Computable Numbers, With an Application to the Entscheidungsproblem. In: Proceedings of the London Mathematical Society, vol. 42 (1936)
27. [VW86] Vardi, M.Y., Wolper, P.: An Automata-Theoretic Approach to Automatic Program Verification. In: Proc (1st) IEEE Symposium on Logic in Computer Science (LICS), Boston, pp. 322-331 (1986)
28. [Wes78] West, C.H.: Generalized technique for communication protocol validation. IBM Journal of Res. and Devel. 22, 393-404 (1978)
29. [WR13] Alfred North Whitehead and Bertrand Russell. Principia Mathematica, pp. 1910-1913. Cambridge University Press (1913)