Nicolaj Bj rner, Anca Browne, and Zohar Manna. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science, 173(1):49-87, February 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Abstraction as the Key for Invariant Verification - Bensalem, Graf, Lakhnech (Correct)
....is necessary, even the decidability of implications is lost. Our examples, will often be taken from the group of those where decidability of implication is given, but reaching of fixpoints cannot be guaranteed. Notice that generic techniques for generating and strengthening invariants (cf. MP95a,BBM97,BLS96,SDB96,BL99] seem to give limited results, except when the property to be proven invariant is in some sense almost an invariant or when the system is relatively simple. To summarize, the deductive method has three drawbacks: 1. it is often hard to find suitable auxiliary invariants, 2. ....
N. Bjrner, A. Browne, and Z. Manna. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science, 173(1):49--87, 1997.
End-User Assertions: Propagating Their Implications - Summet, Burnett (2002) (Correct)
....B (of length N) into result variable S . The results above were inferred by observing the instrumented program s behavior on 100 randomly generated arrays of length 7 to 13, in which each element was a random number in the range 100 to 100, inclusive . 11 The formal proof system presented in [Bjrner et al. 1997] attempts to prove a given goal by generating intermediate assertions. This system is implemented in STeP, the Stanford Temporal Prover [Bjrner et al. 1995] a computer aided formal verification system for concurrent and reactive systems. Users specify axioms about their system and Figure 4: These ....
Bjrner, N., Browne, A., and Manna, Z. Automatic Generation of Invariants and Intermediate Assertions. Theoretical Computer Science, 173(1):49-87, February 1997.
Automatic Generation and Checking of Program Specifications - Nimmer (2001) (2 citations) (Correct)
....Manipulating complete representations of the heap incurs gross runtime and memory costs; heap approximations introduced to control costs weaken results. Many researchers consider it harder to determine what specification to propose than to do the checking itself [Weg74, WS76, MW77, Els74, BLS96, BBM97] Dynamic generation. Dynamic (runtime) analysis obtains information from program executions; examples include profiling and testing. Rather than modeling the state of the program, dynamic analysis uses actual values computed during program executions. Dynamic analysis can be efficient and ....
Nicolaj Bjrner, Anca Browne, and Zohar Manna. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science, 173(1):49--87, February 1997.
Invariant Inference for Static Checking: An Empirical Evaluation - Nimmer, Ernst (2002) (1 citation) (Correct)
No context found.
Nicolaj Bj rner, Anca Browne, and Zohar Manna. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science, 173(1):49-87, February 1997.
Automatic Generation of Program Specifications - Nimmer, Ernst (2002) (4 citations) (Correct)
No context found.
Nicolaj Bjrner, Anca Browne, and Zohar Manna. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science, 173(1):49--87, February 1997.
Dynamically Discovering Likely Program Invariants - Ernst (2000) (108 citations) (Correct)
No context found.
Nicolaj Bj rner, Anca Browne, and Zohar Manna. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science, 173(1):49-87, February 1997.
Computing Polynomial Program Invariants - Müller-Olm, Seidl (Correct)
No context found.
N. Bjrner, A. Browne, and Z. Manna. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science, 173(1):49--87, 1997.
Invariant Inference for Static Checking: An Empirical Evaluation - Nimmer, Ernst (2002) (1 citation) (Correct)
No context found.
Nicolaj Bj rner, Anca Browne, and Zohar Manna. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science, 173(1):49-87, February 1997.
Automatic Generation of Program Specifications - Nimmer, Ernst (2002) (4 citations) (Correct)
No context found.
Nicolaj Bjrner, Anca Browne, and Zohar Manna. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science, 173(1):49--87, February 1997.
Dynamically Discovering Likely Program Invariants - Ernst (2000) (108 citations) (Correct)
No context found.
Nicolaj Bj rner, Anca Browne, and Zohar Manna. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science, 173(1):49-87, February 1997.
Computing Polynomial Program Invariants - Müller-Olm, Seidl (2003) (Correct)
No context found.
N. Bjrner, A. Browne, and Z. Manna. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science, 173(1):49--87--, 1997.
Liveness with (0, 1, ∞)-Counter Abstraction - Pnueli, Xu, Zuck (Correct)
No context found.
N. Bjrner, I. Browne, and Z. Manna. Automatic generation of invariants and intermediate assertions. In 1 st Intl. Conf. on Principles and Practice of Constraint Programming, volume 976 of LNCS, pages 589--623. Springer-Verlag, 1995.
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