The right algorithm at the right time: comparing data flow analysis algorithms for finite state verification
- 29 August 2005
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- CTL model checking based on forward state traversalPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Which pointer analysis should I use?Published by Association for Computing Machinery (ACM) ,2000
- A conservative data flow algorithm for detecting all pairs of statements that may happen in parallelPublished by Association for Computing Machinery (ACM) ,1998
- Improving efficiency of symbolic model checking for state-based system requirementsPublished by Association for Computing Machinery (ACM) ,1998
- Verification of communication protocols using data flow analysisPublished by Association for Computing Machinery (ACM) ,1996
- Data flow analysis for verifying properties of concurrent programsACM SIGSOFT Software Engineering Notes, 1994
- Symbolic Model CheckingPublished by Springer Nature ,1993
- Properties of data flow frameworksActa Informatica, 1990
- Generalized best-first search strategies and the optimality of A*Journal of the ACM, 1985
- Debugging Ada Tasking ProgramsIEEE Software, 1985