Inferring finite-state models with temporal constraints

ASE 2008 - 23rd IEEE/ACM International Conference on Automated Software Engineering, Proceedings

Volumn , Issue , 2008, Pages 248-257

  Walkinshaw, Neil ^a   Bogdanov, Kirill ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED VERIFICATIONS; EXECUTION TRACES; FINITE STATE MACHINES; INFERENCE PROCESSES; INFERENCE TECHNIQUES; STATE MACHINES; STATE MODELS; SYSTEM BEHAVIOURS; TEMPORAL CONSTRAINTS;

AUTOMATION; CONTOUR FOLLOWERS; SOFTWARE ENGINEERING; SPECIFICATIONS; VERIFICATION;

TEMPORAL LOGIC;

EID: 56249102132     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASE.2008.35     Document Type: Conference Paper

References (22)

1. G. Ammons, R. Bodík, and J. Larus. Mining specifications. In POPL'02, pages 4-16, Portland, Oregon, 2002.
2. D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87-106, 1987.
3. A. Biermann and J. Feldman. On the synthesis of finite-state machines from samples of their behavior. IEEE Transactions on Computers, 21:592-597, 1972.
4. J. Cobleigh, D. Giannakopoulou, and C. Pasareanu. Learning assumptions for compositional verification. In TACAS, volume 2619 of LNCS, pages 331-346. Springer, 2003.
5. J. E. Cook and A. L. Wolf. Discovering models of software processes from event-based data. ACM TOSEM, 7(3):215-249, 1998.
6. C. Damas, B. Lambeau, P. Dupont, and A. van Lamsweerde. Generating annotated behavior models from end-user scenarios. IEEE TSE, 31(12):1.056-1073, 2005.
7. P. Dupont, B. Lambeau, C. Damas, and A. van Lamsweerde. The QSM algorithm and its application to software behavior model induction. Applied Artificial Intelligence, 22:77-115, 2008.
8. M. Dwyer, G. Avrunin, and J. Corbett. Patterns in property specifications for finite-state verification. In ICSE, pages 411-420, 1999.
9. G. Holzmann. The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley, 2004.
10. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
11. K. Lang, B. Pearlmutter, and R. Price. Results of the Abbadingo One DFA learning competition and a new evidence-driven state merging algorithm. In Proceedings of the International Colloquium on Grammar Inference (ICGI'98), volume 1433, pages 1-12, 1998.
12. D. Lo and S. Khoo. QUARK: Empirical assessment of automaton-based specification miners. In Proceedings of the Working Conference on Reverse Engineering (WCRE'06), pages 51-60. IEEE Computer Society, 2006.
13. D. Lo and S. Khoo. SMArTIC: towards building an accurate, robust and scalable specification miner. In SIGSOFT FSE, pages 265-275, 2006.
14. A. L. Martins, H. S. Pinto, and A. L. Oliveira. Using a more powerful teacher to reduce the number of queries of the L* algorithm in practical applications. In EPIA'05, pages 325-336, 2005.
15. K. McMillan. Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic Publishers, 1993.
16. A. Nerode. Linear automata transformations. Proceedings of the American Mathematical Society, 9:541-544, 1958.
17. A. Pnueli. The Temporal Logics of Programs. In 18th IEEE Symposium on the Foundations of Computer Science, 1977.
18. P. Sistla. Safety, liveness and fairness in temporal logic. Formal Aspects of Computing, 6(5):495-512, 1994.
19. S. Uchitel, G. Brunet, and M. Chechik. Behaviour model synthesis from properties and scenarios. In ICSE, pages 34-43. IEEE Computer Society, 2007.
20. N. Walkinshaw, K. Bogdanov, M. Holcombe, and S. Salahuddin. Reverse engineering state machines by interactive grammar inference. In WCRE'07, 2007.
21. N. Walkinshaw, K. Bogdanov, M. Holcombe, and S. Salahuddin. Improving dynamic software analysis by applying grammar inference principles. Journal of Software Maintenance and Evolution: Research and Practice, 2008.
22. N. Walkinshaw, K. Bogdanov, and K. Johnson. Evaluation and comparison of inferred regular grammars. In ICGI'08, 2008. (to appear).