| K. S. Namjoshi and R. P. Kurshan. Syntactic program transformations for automatic abstraction. In CAV'2000: Computer Aided Verification, volume 1855 of LNCS, pages 139--153. Springer, 2000. |
....Bell Laboratories, Lucent Technologies kedar research.bell labs.com Abstract. We present the Autoabs tool, which carries out automatic, syntax directed program abstraction, prior to model checking. The heart of the tool is an algorithm for predicate abstraction from [NK00] We briefly describe this algorithm, then discuss implementation issues, the analysis of error traces, and directions for current and future work. Keywords: Abstraction, Model Checking, Static Program Analysis Corresponding Author: Kedar S. Namjoshi Address: 2C 301, 600 700 Mountain Ave. ....
....larger programs, however, it is essential to have an automated algorithm to compute these predicates. The algorithm should not, of course, exhaustively explore the global state space of the program, since this would defeat the purpose of abstraction. Autoabs implements the algorithm described in [NK00] which computes relevant predicates and an abstract program based purely on a syntax directed analysis of the program text. The analysis is based on weakest preconditions [Dij75] wlp s) which can be calculated by syntactic substitution. It also enjoys a completeness property: if the concrete ....
[Article contains additional citation context not shown here]
K. S. Namjoshi and R. P. Kurshan. Syntactic program transformations for automatic abstraction. In CAV, volume 1855 of LNCS. Springer Verlag, 2000.
....In Predicate Abstraction [14] the abstract program is de ned over a set of boolean variables which represent source program predicates. Determining a set of predicates relevant to showing a correctness property is undecidable in general [17] however, several (semi ) algorithms exist [26, 6, 3, 22]. We use a modi ed form of the algorithm from [26] This algorithm simultaneously derives a set of relevant predicates and computes the abstract actions, through an iterated weakest precondition calculation. The original algorithm operates on programs modeled by a set of actions de ned as ....
....is de ned over a set of boolean variables which represent source program predicates. Determining a set of predicates relevant to showing a correctness property is undecidable in general [17] however, several (semi ) algorithms exist [26, 6, 3, 22] We use a modi ed form of the algorithm from [26]. This algorithm simultaneously derives a set of relevant predicates and computes the abstract actions, through an iterated weakest precondition calculation. The original algorithm operates on programs modeled by a set of actions de ned as guarded commands. A sequential procedure body can be ....
[Article contains additional citation context not shown here]
K.S. Namjoshi and R.P. Kurshan. Syntactic program transformations for automatic abstraction. In CAV, volume 1855 of LNCS, 2000.
No context found.
K. S. Namjoshi and R. P. Kurshan. Syntactic program transformations for automatic abstraction. In CAV'2000: Computer Aided Verification, volume 1855 of LNCS, pages 139--153. Springer, 2000.
No context found.
K. Namjoshi and R. Kurshan. Syntactic program transformations for automatic abstraction. In Computer-Aided Veri cation (CAV 2000), LNCS 1855, July 2000.
No context found.
Kedar S. Namjoshi and Robert P. Kurshan. Syntactic program transformations for automatic abstraction. In 12th Conference on Computer Aided Verification, number 1855 in LNCS, 2000.
No context found.
K. S. Namjoshi and R. P. Kurshan. Syntactic program transformations for automatic abstraction. In Proceedings of CAV, volume 1855, pages 435-449. Springer LNCS, 2000.
No context found.
K. S. Namjoshi and R. P. Kurshan. Syntactic program transformations for automatic abstraction. In A. Emerson and P. Sistla, editors, Computer Aided Verification, LNCS 1855, pages 435--449, 2000.
No context found.
K. S. Namjoshi and R. K. Kurshan. Syntactic Program Transformations for Automatic Abstraction. In Proceedings of the 12th Conference on Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 435--449, Chicago, July 2000. Springer-Verlag.
No context found.
K. Namjoshi and R. Kurshan. Syntactic program transformations for automatic abstraction. In Computer-Aided Veri cation (CAV 2000), LNCS 1855, July 2000.
No context found.
Kedar S. Namjoshi and Robert P. Kurshan. Syntactic program transformations for automatic abstraction. In CAV'00, 2000.
No context found.
K.S. Namjoshi and R.P. Kurshan. Syntactic program transformations for automatic abstraction. In Proceedings of the 12th International Conference on Computer Aided Veri cation, volume 1855 of Lecture Notes in Computer Science, pages 435-449. Springer-Verlag, July 2000.
No context found.
Namjoshi, K. S. and R. P. Kurshan: 2000, `Syntactic Program Transformations for Automatic Abstraction'. In: Proceedings of CAV, Vol. 1855. pp. 435--449.
No context found.
K. S. Namjoshi and R. P. Kurshan. Syntactic program transformations for automatic abstraction. In A. Emerson and P. Sistla, editors, Computer Aided Verification, LNCS 1855, pages 435--449, 2000.
No context found.
K. Namjoshi and R. Kurshan. Syntactic program transformations for automatic abstraction. In CAV'00, 2000.
No context found.
Namjoshi, K. and R. Kurshan, Syntactic program transformations for automatic abstraction, Lecture Notes in Computer Science 1855 (2000), pp. 435-449.
No context found.
K. S. Namjoshi and R. P. Kurshan. Syntactic program transformations for automatic abstraction. In Proceedings of CAV, volume 1855, pages 435-449. Springer LNCS, 2000.
No context found.
K. S. Namjoshi and R. K. Kurshan. Syntactic Program Transformations for Automatic Abstraction. In Proceedings of the 12th Conference on Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 435--449, Chicago, July 2000. Springer-Verlag.
No context found.
K. S. Namjoshi and R. P. Kurshan. Syntactic program transformations for automatic abstraction. In Proc. of Conference on Computer-Aided Verification (CAV), volume 1855 of LNCS, pages 435--449, Chicago, IL, USA, July 2000. Springer.
No context found.
K. S. Namjoshi and R. P. Kurshan. Syntactic program transformations for automatic abstraction. In Proceedings of CAV, volume 1855, pages 435-449. Springer LNCS, 2000.
No context found.
Kedar S. Namjoshi and Robert P. Kurshan. Syntactic program transformations for automatic abstraction. In 12th Conference on Computer Aided Verification, number 1855 in LNCS, 2000.
No context found.
Namjoshi, K. and R. Kurshan, Syntactic program transformations for automatic abstraction, Lecture Notes in Computer Science 1855 (2000), pp. 435--449.
No context found.
K. Namjoshi and R. Kurshan. Syntactic program transformations for automatic abstraction. In E. A. Emerson and A. P. Sistla, editors, ComputerAided Veri cation, CAV '2000, volume 1855 of Lecture Notes in Computer Science, pages 435-449, Chicago, IL, July 2000. Springer-Verlag.
No context found.
K. S. Namjoshi and R. P. Kurshan. Syntactic program transformations for automatic abstraction. In CAV 00: Computer-Aided Veri cation, LNCS 1855, pages 435-449. Springer-Verlag, 2000.
No context found.
K. S. Namjoshi and R. P. Kurshan. Syntactic program transformations for automatic abstraction. In Proceedings of Computer Aided Veri cation'00, volume 1855 of LNCS, pages 433-449, Chicago, IL, USA, July 2000. Springer Verlag. 38
No context found.
Kedar S. Namjoshi and Robert P. Kurshan. Syntactic program transformations for automatic abstraction. In E.A. Emerson and A.P. Sistla, editors, Proc. of the 12th Conference on ComputerAided Verification, CAV'2000, number 1855 in Lecture Notes in Computer Science, pages 435--449, Chicago, IL, 2000. Springer-- Verlag.
First 50 documents
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