F. Lerda and W. Visser. Addressing dynamic issues of program model checking. In SPIN, pages 80--102. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Software Construction and Analysis Tools for Future Space Missions - Lowry (2001) (2 citations) (Correct)
....therefore be able to terminate) it is required to store each state reached in the graph of states. When analyzing a Java program each state can be very large and thus require significant memory to store, hence reducing the size of systems that can be checked. In JPF state compression techniques [19] reduce the memory requirements of the model checker by an order of magnitude. Another novel feature of JPF is the use of symmetry reduction techniques to allow states that are the same modulo where an object is stored in memory to be considered equal [19] Since object oriented programs typically ....
....In JPF state compression techniques [19] reduce the memory requirements of the model checker by an order of magnitude. Another novel feature of JPF is the use of symmetry reduction techniques to allow states that are the same modulo where an object is stored in memory to be considered equal [19]. Since object oriented programs typically make use of many objects, this symmetry reduction often allows an order of magnitude less states to be analyzed in a typical program. JPF also supports distributed memory model checking, where the memory required for model checking is distributed over a ....
[Article contains additional citation context not shown here]
Lerda, F., Visser, W.: Addressing dynamic issues of program model checking. Lecture Notes Computer Science, Vol. 2057 (2001), Springer-Verlag.
Symmetric Model Checking for Object-Based Programs - Iosif (Correct)
....in the state space, thus reducing the memory requirements of a model checker. Since our algorithm determines all reachable objects in a given program state, it can be combined with on the y garbage collection, which is another technique already used by existing software model checkers [21, 18]. The main contribution of this paper is the presentation of a new symmetry reduction strategy that we have implemented on top of the dSPIN model checker [20] This is an extension of the well known model checker SPIN [19] providing e ective support for the nite state veri cation of object based ....
....this might not hold when symmetries of pure data components (objects) are considered, since a program can create and store an unbounded number of identical objects. To our knowledge, the problem of exploiting heap symmetries in model checking has been informally addressed by Visser and Lerda in [18]. They solve the ordering problem by storing with each allocator statement the memory location it returns when it is rst executed. The rst time location will be returned by all subsequent calls to the allocator. This approach looks attractive due to its simplicity, still no formal evidence of ....
F. Lerda and W. Visser. Addressing Dynamic Issues of Program Model Checking, Proc. 8th SPIN Workshop, LNCS
Program Model Checking as a New Trend - Havelund, Visser (2000) (1 citation) Self-citation (Visser) (Correct)
....problem that had to be solved for JPF2 to work. Others considered this problem too hard and developed so called state less model checkers (i.e. they don t store states and therefore do a partial state space search) 20] In JPF2 this problem is solved by using novel state compression techniques [41] that reduce the memory requirements of the model checker by an order of magnitude. Another novel feature of JPF2 is the use of symmetry reduction techniques to allow states that are the same modulo where an object is stored in memory to be considered equal [41] Since, object oriented programs ....
....novel state compression techniques [41] that reduce the memory requirements of the model checker by an order of magnitude. Another novel feature of JPF2 is the use of symmetry reduction techniques to allow states that are the same modulo where an object is stored in memory to be considered equal [41]. Since, object oriented programs typically make use of many objects, this symmetry reduction often allows an order of magnitude less states to be analyzed in a typical program. JPF2 uses the BANDERA [9] toolset for specifying the properties to be analyzed, the display of the errorpath if one ....
[Article contains additional citation context not shown here]
Flavio Lerda and Willem Visser. Addressing dynamic issues of program model checking. In Proc. of the 8th International SPIN Workshop, volume 2057 of LNCS 2057. Springer-Verlag, May 2001. Klaus Havelund, Willem Visser: Program Model Checking as a New Trend
Program Model Checking as a New Trend - Havelund, Visser (2000) (1 citation) Self-citation (Visser) (Correct)
....problem that had to be solved for JPF2 to work. Others considered this problem too hard and developed so called state less model checkers (i.e. they don t store states and therefore do a partial state space search) 20] In JPF2 this problem is solved by using novel state compression tech niques [41] that reduce the memory requirements of the model checker by an order of magnitude. Another novel feature of JPF2 is the use of symmetry reduction techniques to allow states that are the same modulo where an object is stored in memory to be considered equal [41] Since, object oriented programs ....
....novel state compression tech niques [41] that reduce the memory requirements of the model checker by an order of magnitude. Another novel feature of JPF2 is the use of symmetry reduction techniques to allow states that are the same modulo where an object is stored in memory to be considered equal [41]. Since, object oriented programs typically make use of many objects, this symmetry reduction often allows an order of magnitude less states to be analyzed in a typical program. JPF2 uses the BANDERA [9] toolset for specifying the properties to be analyzed, the display of the errorpath if one ....
[Article contains additional citation context not shown here]
Flavio Lerda and Willem Visser. Addressing dynamic issues of program model checking. In Proc. of the 8th International SPIN Workshop, volume 2057 of LNCS 2057. Springer-Verlag, May 2001. Klaus Havelund, Willem Visser: Program Model Checking as a New Trend
External Program Model Checking - Stefan Edelkamp Shahid (Correct)
No context found.
F. Lerda and W. Visser. Addressing dynamic issues of program model checking. In SPIN, pages 80--102.
Space-Reduction Strategies for Model Checking Dynamic.. - Robby, Dwyer, Hatcliff.. (2003) (2 citations) (Correct)
No context found.
F. Lerda and W. Visser. Addressing dynamic issues of program model checking. In M. B. Dwyer, editor, Proceedings of Eigth International SPIN Workshop, volume 2057.
Cmc: A Model Checker For Network Protocol Implementations - Musuvathi (2004) (Correct)
No context found.
Flavio Lerda and Willem Visser. Addressing dynamic issues of program model checking. Lecture Notes in Computer Science, 2057:80--102, 2001.
The Parallel PV Model-Checker - Palmer, Gopalakrishnan (Correct)
No context found.
Flavio Lerda and Willem Visser. Addressing dynamic issues of program model checking. In Proceedings of the 7th International SPIN Workshop, pages 80--102, 2001. LNCS 2057.
Tools Day - Cerna (2002) (Correct)
No context found.
Flavio Lerda and Willem Visser. Addressing dynamic issues of program model checking. In Proceedings of the 7th International SPIN Workshop, pages 80--102, 2001. LNCS 2057.
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