FLAVERS: A finite state verification technique for software systems

IBM Systems Journal

Volumn 41, Issue 1, 2002, Pages 140-165

  Cobleigh, J M ^a   Clarke, L A ^a   Osterweil, L J ^a  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SOFTWARE SELECTION AND EVALUATION; DISTRIBUTED COMPUTER SYSTEMS; FINITE AUTOMATA; JAVA PROGRAMMING LANGUAGE; MATHEMATICAL MODELS; OPTIMIZATION; SYSTEMS ANALYSIS; THEOREM PROVING;

CONTROL FLOW GRAPH; FINITE STATE VERIFICATION; JAVA PATH FINDER; SOFTWARE SYSTEMS; TRACE FLOW GRAPH;

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 0036316545     PISSN: 00188670     EISSN: None     Source Type: Journal    
DOI: 10.1147/sj.411.0140     Document Type: Article

References (51)

1. Assigning meaning to programs
2. PVS: An experience report
3. Formal methods: State of the art and future directions
4. 20 states and beyond
5. The model checker SPIN
6. Model checking large software specifications
7. Model checking software systems: A case study
8. Cecil: A sequencing constraint language for automatic static analysis generation
9. Data flow analysis for verifying properties of concurrent programs
10. Data flow analysis for checking properties of concurrent java programs
11. Applying static analysis to software architectures
12. Verifying properties of process definitions
13. Complexity of analyzing the synchronization structure of concurrent programs
14. A conservative data flow algorithm for detecting all pairs of statements that may happen in parallel
15. An efficient algorithm for computing MHP information for concurrent java programs
16. Efficient composite data flow analysis applied to concurrent programs
17. Properties of data flow frameworks: A unified model
18. The right algorithm at the right time: Comparing data flow analysis algorithms for finite state verification
19. Extending FLAVERS to check properties on infinite executions of concurrent software systems
20. Using partial order techniques to improve performance of data flow analysis based verification
21. Finding bugs with a constraint solver
22. Foundations for the arcadia environment architecture
23. Automated analysis of concurrent systems with the constrained expression toolset
24. DAVE - a validation error detection and documentation system for FORTRAN programs
25. Interprocedural static analysis of sequencing constraints
26. Model checking for programming languages using VeriSoft
27. Logic verification of ANSI-C code with SPIN
28. Model checking programs
29. Automatically validating temporal safety properties of interfaces
30. Bebop: A symbolic model checker for Boolean programs
31. Bandera: Extracting finite-state models from Java source code
32. Tool-supported program abstraction for finite-state verification
33. Slicing software for model construction
34. Checking system rules using system-specific, programmer-written compiler extensions
35. The temporal logic of programs
36. Temporal and modal logic
37. Patterns in property specifications for finite-state verification