Classifying properties: An alternative to the safety-liveness classification

Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering

Volumn , Issue , 2000, Pages 159-168

  Naumovich, G ^a   Clarke, L A ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER HARDWARE DESCRIPTION LANGUAGES; FORMAL LOGIC; NATURAL LANGUAGE PROCESSING SYSTEMS; SEMANTICS; SYSTEMS ANALYSIS;

PROPERTY TAXONOMY; SAFETY-LIVENESS CLASSIFICATION;

SOFTWARE ENGINEERING;

EID: 0034450139     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Composing specifications
2. Adding liveness properties to coupled finite-state machines
3. Defining liveness
4. Recognizing safety and liveness
5. Verifying temporal properties without temporal logic
6. Verification of liveness properties using compositional reachability analysis
7. Checking safety properties using compositional reachability analysis
8. Automatic verification of finite-state concurrent systems using temporal logic specifications
9. Patterns in property specifications for finite-state verification
10. Data flow analysis for verifying properties of concurrent programs
11. Flow analysis for verifying specifications of concurrent and distributed software
12. On the verification of temporal properties
13. The model checking SPIN
14. Proving the correctness of multiprocess programs
15. What good is temporal logic?
16. Extending FLAVERS to check properties on infinite executions of concurrent software systems
17. Cecil: A sequencing constraint language for automatic static analysis generation
18. The temporal logic of programs
19. Verification of concurrent programs: The automata-theoretic framework
20. Temporal logic can be more expressive