- Aiken, A., Bugrara, S., Dillig, I., Dillig, T., Hackett, B., Hawkins, P. An overview of the SATURN project. In PASTE (2007), 43--48. Google ScholarDigital Library
- Ball, T. Rajamani, S. Bebop: A symbolic model checker for Boolean programs. In SPIN (2000), 113--130. Google ScholarDigital Library
- Ball, T., Rajamani, S. Automatically validating temporal safety properties of interfaces. LNCS 2057 (2001), 103--122. Google ScholarDigital Library
- Boole, G. An Investigation of the Laws of Thought. Dover Publications, Incorporated, 1858. Google ScholarDigital Library
- Cook, B., Gotsman, A., Podelski, A., Rybalchenko, A., Vardi, M. Proving that programs eventually do something good. In POPL (2007), 265--276. Google ScholarDigital Library
- Das, M., Lerner, S., Seigle, M. ESP: Path-sensitive program verification in polynomial time. In PLDI (2002), 57--68. Google ScholarDigital Library
- Henglein, F. Type inference and semi-unification. In Conference on LISP and Functional Programming (1988), 184--197. Google ScholarDigital Library
- Henzinger, T., Jhala, R., Majumdar, R., McMillan, K. Abstractions from proofs. In POPL (2004), 232--244. Google ScholarDigital Library
- Mycroft, A. Polymorphic type schemes and recursive definitions. In International Symposium on Programming (1984), 217--228. Google ScholarDigital Library
- Reps, T., Horwitz, S., Sagiv, M. Precise interprocedural dataflow analysis via graph reachability. In POPL (1995), 49--61. Google ScholarDigital Library
- Schmidt, D. A calculus of logical relations for over-and underapproximating static analyses. Science of Computer Programming 64, 1 (2007), 29--53. Google ScholarDigital Library
Index Terms
Reasoning about the unknown in static analysis
Recommendations
Combined Static and Dynamic Analysis
Static analysis is usually faster than dynamic analysis but less precise. Therefore it is often desirable to retain information from static analysis for run-time verification, or to compare the results of both techniques. However, this requires writing ...
Perceptual Reasoning: A New Computing with Words Engine
GRC '07: Proceedings of the 2007 IEEE International Conference on Granular Computingwords (CWW). We have proposed a CWW architecture for making subjective judgments, called a Perceptual Computer (Per- C). Because words mean different things to different people, the Per-C uses interval type-2 fuzzy sets (IT2 FSs). The encoder of the Per-...
Comparison of fuzzy reasoning methods
L.A. Zadeh, E.H. Mamdani, and M. Mizumoto et al. have proposed methods for fuzzy reasoning in which the antecedent involves a fuzzy conditional proposition 'If x is A then y is B', with A and B being fuzzy concepts. Mizumoto et al. have investigated the ...
Comments