Information Technology Reference
In-Depth Information
2. Ball, T., Rajamani, S.K.: Automatically Validating Temporal Safety Properties
of Interfaces. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol. 2057, pp. 103-122.
Springer, Heidelberg (2001)
3. Beckman, N.E., Nori, A.V., Rajamani, S.K., Simmons, R.J.: Proofs from tests. In:
2008 International Symposium on Software Testing and Analysis, pp. 3-14. ACM
(2008)
4. Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE
Transactions on Computers C-35(8), 677-691 (1986)
5. Chalin, P., Kiniry, J.R., Leavens, G.T., Poll, E.: Beyond Assertions: Advanced
Specification and Verification with JML and eSC/Java2. In: de Boer, F.S., Bon-
sangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol. 4111, pp.
342-363. Springer, Heidelberg (2006)
6. Chandy, K.M., Misra, J.: Parallel Program Design: A Foundation. Addison-Wesley
(1988)
7. Coen-Porisini, A., Denaro, G., Ghezzi, C., Pezze, M.: Using symbolic execution
for verifying safety-critical systems. In: Joint 8th European Software Engineering
Conference and 9th ACM SIGSOFT Symposium on the Foundations of Software
Engineering, pp. 142-151. ACM (2001)
8. Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the
3rd Annual ACM Symposium on Theory of Computing, pp. 151-158 (1971)
9. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static
analysis of programs by construction or approximation of fixpoints. In: Proceedings
of the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming
Languages (POPL 1977), pp. 238-252. ACM, New York (1977)
10. Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall (1976)
11. Godefroid, P.: Model checking for programming languages using VeriSoft. In: Pro-
ceeding of the 24th ACM SIGACT-SIGPLAN Symposium on Principles of Pro-
gramming Languages (POPL 1997), pp. 174-186 (1997)
12. Godefroid, P., Klarlund, N., Sen, K.: DART: directed automated random test-
ing. In: 2005 ACM SIGPLAN Conference on Programming Language Design and
Implementation, pp. 213-223. ACM (2005)
13. Godefroid, P., Nori, A.V., Rajamani, S.K., Tetali, S.D.: Compositional may-must
program analysis: Unleashing the power of alternation. In: 37th ACM SIGACT-
SIGPLAN Symposium on Principles of Programming Languages, pp. 43-55. ACM
(2010)
14. Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: Pro-
ceeding of the 29th ACM SIGACT-SIGPLAN Symposium on Principles of Pro-
gramming Languages (POPL 2002), pp. 58-70 (2002)
15. King, J.C.: Symbolic execution and program testing. Communications of the
ACM 19(7), 385-394 (1976)
16. Sen, K., Marinov, D., Agha, G.: CUTE: a concolic unit testing engine for C. In: 10th
European Software Engineering Conference Held Jointly with 13th ACM SIGSOFT
International Symposium on Foundations of Software Engineering, pp. 263-272.
ACM (2005)
17. Tillmann, N., de Halleux, J.: Pex-White Box Test Generation for.NET. In: Beckert,
B., Hahnle, R. (eds.) TAP 2008. LNCS, vol. 4966, pp. 134-153. Springer, Heidelberg
(2008)
18. Yorsh, G., Ball, T., Sagiv, M.: Testing, abstraction, theorem proving: Better to-
gether! In: 2006 International Symposium on Software Testing and Analysis, pp.
145-156 (2006)
Search WWH ::
Custom Search