Deconstructing shostak

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2001, Pages 19-28

  Ruess H ^a   Shankar, N ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; EQUIVALENCE CLASSES; LOGIC PROGRAMMING; THEOREM PROVING;

LINEAR ARITHMETIC; SHOSTAK DECISION PROCEDURE;

FORMAL LOGIC;

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

References (16)

1. Validity checking for combinations of theories with equality
2. Integrating decision procedures for temporal verification
3. Normalization via rewrite closures
4. Unification in the union of disjoint equational theories combining decision procedures
5. On Shostak's decision procedure for combinations of theories
6. Variations on the common subexpressions problem
7. ICS: Integrated canonizer and solver
8. Shostak's congruence closure as completion
9. STeP: Deductive-algorithmic verification of reactive and real-time systems
10. Simplification by cooperating decision procedures
11. Fast decision procedures based on congruence closure
12. PVS: A prototype verification system
13. An algorithm for reasoning about equality
14. Deciding combinations of theories
15. STP: A mechanized logic for specification and verification