G. Ramalingam, A. Warshavsky, J. Field, D. Goyal, and M. Sagiv. Deriving specialized program analyses for certifying component-client conformance. In Proceeding of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, pages 83--94. ACM Press, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Partially Disjunctive Heap Abstraction - Mooly (2004) (1 citation) Self-citation (Ramalingam Field Sagiv) (Correct)
No context found.
G. Ramalingam, A. Warshavsky, J. Field, D. Goyal, and M. Sagiv. Deriving specialized program analyses for certifying component-client conformance. In Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, pages 83--94. ACM Press, June 2002.
Partially Disjunctive Heap Abstraction - Roman Manevich Mooly (2004) (1 citation) Self-citation (Ramalingam Field Sagiv) (Correct)
No context found.
G. Ramalingam, A. Warshavsky, J. Field, D. Goyal, and M. Sagiv. Deriving specialized program analyses for certifying component-client conformance. In Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, pages 83--94. ACM Press, June 2002.
Typestate Verification: Abstraction Techniques and.. - Field Goyal Ramalingam (2003) (2 citations) Self-citation (Ramalingam Field Goyal) (Correct)
No context found.
G. Ramalingam, A. Warshavsky, J. Field, D. Goyal, and M. Sagiv. Deriving specialized program analyses for certifying component-client conformance. In Proc. ACM Conf. on ProgrammingLanguageDesignand Implementation, volume 37, 5 ofACMSIGPLAN Notices, pages 83--94, NewYork, June 17--19 2002. ACM Press.
Partially Disjunctive Heap Abstraction - Manevich, Sagiv, Ramalingam, Field (2004) (1 citation) Self-citation (Ramalingam Field Sagiv) (Correct)
No context found.
G. Ramalingam, A. Warshavsky, J. Field, D. Goyal, and M. Sagiv. Deriving specialized program analyses for certifying component-client conformance. In Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, pages 83--94. ACM Press, June 2002.
Verifying Safety Properties using Separation and - Heterogeneous Ions Eran Self-citation (Ramalingam) (Correct)
No context found.
G. Ramalingam, A. Warshavsky, J. Field, D. Goyal, and M. Sagiv. Deriving specialized program analyses for certifying component-client conformance. In Proc. Conf. on Prog. Lang. Design and Impl., volume 37, 5, pages 83--94, June 2002.
Typestate Verification: Abstraction Techniques and.. - Field, Goyal.. (2004) (2 citations) Self-citation (Ramalingam Field Goyal) (Correct)
No context found.
G. Ramalingam,A. Warshavsky, J. Field, D. Goyal, and M. Sagiv. Deriving specialized program analyses for certifying component-client conformance. In Proc. ACM Conf. on Programming Language Design and Implementation, volume 37, 5 of ACM SIGPLAN Notices, pages 83--94, NewYork, June 17--19 2002. ACM Press.
Static Program Analysis via 3-Valued Logic - Thomas Reps Mooly (2004) (2 citations) Self-citation (Sagiv) (Correct)
No context found.
Ramalingam, G., Warshavsky, A., Field, J., Goyal, D., Sagiv, M.: Deriving specialized program analyses for certifying component-client conformance. In: Prog. Lang. Design and Impl. (2002) 83--94
Abstraction Refinement for 3-Valued-Logic Analysis - Loginov, Reps, Sagiv (2004) Self-citation (Sagiv) (Correct)
No context found.
G. Ramalingam, A. Warshavsky, J. Field, D. Goyal, and M. Sagiv. Deriving specialized program analyses for certifying component-client conformance. In Conf. on Prog. Lang. Design and Impl., pages 83--94, New York, NY, 2002. ACM Press.
Verifying Safety Properties using Separation and - Heterogeneous Ions Eran Self-citation (Ramalingam) (Correct)
No context found.
G. Ramalingam, A. Warshavsky, J. Field, D. Goyal, and M. Sagiv. Deriving specialized program analyses for certifying component-client conformance. In Proc. Conf. on Prog. Lang. Design and Impl., volume 37, 5, pages 83--94, June 2002.
Data Structures and Algorithms for Efficient Shape Analysis - Manevich (2003) Self-citation (Ramalingam Field Goyal Sagiv) (Correct)
No context found.
G. Ramalingam, Alex Warshavsky, John Field, Deepak Goyal, and Mooly Sagiv. Deriving specialized program analyses for certifying component-client conformance. In Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, 2002. (To appear.).
Typestate Verification: Abstraction Techniques and.. - Field, Goyal.. (2003) (2 citations) Self-citation (Ramalingam Field Goyal) (Correct)
....program verification, we are not aware of any previous work relating the difficulty of typestate verification to properties of the finite state automaton. This work is part of a broader effort to develop efficient program verification techniques that are tailored to the property being verified [23]. Typestate Verification and Shallow Programs In order to meaningfully compare the complexity of verification algorithms, we need to make some baseline assumptions about the precision of the analysis. In this paper, we will use the term Author s current affiliation: Calypto Design Systems ....
.... in Section 2) The polynomial time verification results summarized above use program abstractions that may be of independent interest in particular, they may prove useful as the starting point for developing more general abstractions for non shallow programs (e.g. in a manner similar to [23]) The bulk of the abstractions we use are predicate abstractions [15] however we show in the sequel that the vocabulary of predicates used in a predicate abstraction can have a dramatic impact on the efficiency of the resulting analysis. Our predicate vocabularies are carefully designed to yield ....
G. Ramalingam, A. Warshavsky, J. Field, D. Goyal, and M. Sagiv. Deriving specialized program analyses for certifying component-client conformance. In Proc. ACM Conf. on ProgrammingLanguageDesignand Implementation, volume 37, 5 ofACMSIGPLAN Notices, pages 83--94, NewYork, June 17--19 2002. ACM Press.
Benchmark and Framework for Encouraging Research on.. - Havelund, D.Stoller, Ur (2003) Self-citation (Field) (Correct)
....the program, and they produce false alarms if the program design is inconsistent with the design patterns encoded in the type system. There are also static analysis frameworks that can handle large classes of properties. Frameworks that use only conservative analyses, such as TVLA [23] and Canvas [28], support both verification and defect detection. TVLA can conservatively analyze systems with an unspecified and unbounded number of threads. Engler s analysis framework [15] is not conservative (it might miss some violations of the specified properties) and does not deal with concurrency ....
G. Ramalingam, A. Warshavsky, J. Field, D. Goyal, and M. Sagiv. Deriving specialized program analyses for certifying component-client conformance. In Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 8304, 2002.
Shallow Finite State Verification - Field, Goyal, Yahav, Ramalingam (2002) Self-citation (Ramalingam Field Goyal) (Correct)
....program verification, we are not aware of any previous work relating the difficulty of finite state verification to properties of the finite state automaton. This work is part of a broader effort to develop efficient program verification techniques that are tailored to the property being verified [16]. We will use the term verification to mean verification that is precise modulo the usual assumption that all paths in the program are feasible. Given a property, a path in a program is said to be an error path, if execution along that path would cause an invalid sequence of operations to be ....
....believe that results in this paper serve to provide insight into the inherent complexity of important classes of verification problems. In addition, the techniques we develop for precise polynomial time verification of certain shallow properties may be generalizable (e.g. in a manner similar to [ 16]) to arbitrary programs, and thereby permit more precise or efficient verification of such programs. x : new( sl :f : new( y : new ( while ( z : y; s2: f.readO; it ( it ( y.closeO; closeO; z : x; s3: newO; sO: z.readO; a) b) Figure h Program fragments ....
G. Ramalingam, A. Warshavsky, J. Field, D. Goyal, and M. Sagiv. Deriving specialized program analyses for certifying component-client conformance. In Proc. ACM Conf on Programming Language Design and Implementation, volume 37, 5 of ACM SIGPLAN Notices, pages 8394, New York, June 17 19 2002. ACM Press.
Compactly Representing First-Order Structures for.. - Manevich.. (2002) (11 citations) Self-citation (Ramalingam Field Goyal Sagiv) (Correct)
.... problems, including checking C programs for the presence of memory leaks and dangling or uninitialized pointers [4] verifying the correctness of a simple garbage collector [12] determining whether clients of a Java library satisfy the library s conformance constraints for correct usage [11], and verifying certain safety properties of a packet router [10] In carrying out these tasks, TVLA utilizes an abstract interpretation that maintains detailed information on the state of dynamically allocated memory. While this degree of precision is crucial to avoid reporting an excessive ....
....the instruction selection phase of the Tiger educational compiler [1] The GC benchmark [12] involves a partial verification of the mark phase of a mark and sweep garbage collector. The JFE and the Kernel benchmarks are both instances of the Concurrent Modification Problem (CMP) described in [11]. CMP requires identifying a specific type of misuse of Java Collection Classes. Finally, the MA benchmark [10] verifies certain safety properties of a packet router in the mobile ambient calculus [3] Results Table 1 presents actual time and space statistics for running TVLA on the benchmark ....
G. Ramalingam, A. Warshavsky, J. Field, D. Goyal, and M. Sagiv. Deriving specialized program analyses for certifying component-client conformance. In Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, pages 83--94, Berlin, June 2002.
Implications of a Data Structure Consistency Checking System - Kuncak, Lam, Zee, Rinard (2005) (Correct)
No context found.
G. Ramalingam, A. Warshavsky, J. Field, D. Goyal, and M. Sagiv. Deriving specialized program analyses for certifying component-client conformance. In Proceeding of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, pages 83--94. ACM Press, 2002.
On Modular Pluggable Analyses Using Set Interfaces - Lam, Kuncak, Rinard (2003) (Correct)
No context found.
G. Ramalingam, Alex Warshavsky, John Field, Deepak Goyal, and Mooly Sagiv. Deriving specialized program analyses for certifying component-client conformance. In Proceeding of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, pages 83--94. ACM Press, 2002.
On Decision Procedures for Set-Valued Fields - Kuncak, Rinard (2004) (Correct)
No context found.
Ramalingam, G., A. Warshavsky, J. Field, D. Goyal and M. Sagiv, Deriving specialized program analyses for certifying component-client conformance, in: Proceeding of the ACM SIGPLAN 2002.
On Modular Pluggable Analyses Using Set Interfaces - Lam, Kuncak, Rinard (2003) (Correct)
No context found.
G. Ramalingam, Alex Warshavsky, John Field, Deepak Goyal, and Mooly Sagiv. Deriving specialized program analyses for certifying component-client conformance. In Proceeding of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, pages 83--94. ACM Press, 2002.
Automatic Inference of Class Invariants - Logozzo (2004) (Correct)
No context found.
G. Ramalingam, A. Warshavsky, J. Field, D. Goyal, and M. Sagiv. Deriving specialized program analyses for certifying component-client conformance. In PLDI'02, June 2002. 12
On Modular Pluggable Analyses Using Set Interfaces - Lam, Kuncak, Rinard (2003) (Correct)
No context found.
G. Ramalingam, Alex Warshavsky, John Field, Deepak Goyal, and Mooly Sagiv. Deriving specialized program analyses for certifying component-client conformance. In Proceeding of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, pages 83--94. ACM Press, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC