Collecting statistics over runtime executions

Electronic Notes in Theoretical Computer Science

Volumn 70, Issue 4, 2002, Pages 36-54

  Finkbeiner, Bernd ^a   Sankaranarayanan, Sriram ^a   Sipma, Henny ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; C (PROGRAMMING LANGUAGE); COMPUTER OPERATING SYSTEMS; COMPUTER SIMULATION; COMPUTER SOFTWARE; JAVA PROGRAMMING LANGUAGE; OBJECT ORIENTED PROGRAMMING; STATISTICS;

LINEAR-TIME TEMPORAL LOGIC; QUERY EVALUATION ALGORITHM; RUNTIME VERIFICATION ALGORITHM; SOFTWARE MODULES;

COMPUTER PROGRAMMING;

EID: 17444425048     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80576-0     Document Type: Conference Paper

References (20)

1. Alur R., Torre S.L., Ettessami K., Peled D. Parametric temporal logic for model measuring. Wiedermann J., van Emde Boas P., Nielsen M. ICALP'99, Prague, Czech Republic, LNCS. 1644:1999;159-168
2. Bartlett K., Scantlebury R., Wilkinson P. A note on reliable full-duplex transmission over half-duplex links. Communications of the ACM. 12:1969;260-261
3. Bjørner N.S., Browne A., Colón M., Finkbeiner B., Manna Z., Sipma H.B., Uribe T.E. Verifying temporal properties of reactive systems: A STeP tutorial. Formal Methods in System Design. 16:2000;227-270
4. Bruns G. and P. Godefroid, Temporal logic query checking, in: Proc. 16th IEEE Symp. Logic in Comp. Sci. (2001), pp. 409-417
5. Chakrabarti P., Dasgupta P., Deka J., Sankaranarayanan S. Min-max computation tree logic. Artificial Intelligence. 127:2001;137-162
6. Chandra A.K., Kozen D.C., Stockmeyer L.J. Alternation. J. ACM. 28:1981;114-133
7. Drusinsky D. The Temporal Rover and the ATG Rover. Havelund K., Penix J., Visser W. SPIN Model Checking and Software Verification, 7th Int'l SPIN Workshop, LNCS. 1885:2000;323-330
8. Emerson A., Mok A., Sistla A.P., Srinivasan J. Quantitative temporal reasoning. Real Time Systems. 4:1993;334-351
9. Emerson A. and R. Trefler, Generalized quantitative temporal reasoning: An automata-theoretic approach, in: TAPSOFT: 7th International Joint Conference on Theory and Practice of Software Development, 1997
10. Finkbeiner B., Sipma H. Checking finite traces using alternating automata. Havelund K., Rosu G. Electronic Notes in Theoretical Computer Science, Electronic Notes in Theoretical Computer Science. 55:2001;1-17
11. Graham, S. L., P. B. Kessler and M. K. McKusick, gprof: a call graph execution profiler, in: SIGPLAN Symposium on Compiler Construction, 1982, pp. 120-126
12. th Int'l SPIN Workshop, LNCS. 1885:2000;245-264
13. Havelund K., Rosu G. "Runtime Verification 2001," Electronic Notes in Theoretical Computer Science. 55:2001;Elsevier Science Publishers
14. Manna Z. and A. Pnueli, Specification and verification of concurrent programs by ∀-automata, in: B. Banieqbal, H. Barringer and A. Pnueli, editors, Temporal Logic in Specification, number 398 in LNCS, Springer-Verlag, Berlin, 1987 pp. 124-164
15. also in Proc. 14th ACM Symp. Princ. of Prog. Lang., Munich, Germany, pp. 1-12, January 1987
16. Manna Z., Pnueli A. "Temporal Verification of Reactive Systems: Safety," 1995;Springer-Verlag, New York
17. Manna Z. and A. Pnueli, "Temporal Verification of Reactive Systems: Progress," Springer-Verlag, New York, 1996, draft manuscript
18. Rosu G. and K. Havelund, Synthesizing dynamic programming algorithms from linear temporal logic formulae, 2001, submitted for publication
19. Vardi M.Y. Alternating automata and program verification. van Leeuwen J. Computer Science Today. Recent Trends and Developments, LNCS. 1000:1995;471-485 Springer-Verlag
20. Vardi M.Y. An automata-theoretic approach to linear temporal logic. Moller F., Birtwistle G. Logics for Concurrency. Structure versus Automata, LNCS. 1043:1996;238-266