T. Cattel. Modeling and Verification of sC++ Applications. In TACAS'98: Tools and Algorithms for the Construction and Analysis of Systems, number 1384 in Lecture Notes in Computer Science, April 1998. Lisbon, Portugal.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Promela. Few attempts have been made to automatically verify programs written in real programming languages. The most recent attempt we can mention is the one reported in [4] which also translates Java programs into Promela, however not handling exceptions or polymorphism as we do. The work in [2] defines a translator from a concurrent extension of a limited subset of C to Promela. A disadvantage of this solution is that the concurrency extensions are not broadly used by C programmers. In [5] is described what is called extended static checking, a technique for detecting, at ....

T. Cattel. Modeling and Verification of sC++ Applications. In TACAS'98: Tools and Algorithms for the Construction and Analysis of Systems, number 1384 in Lecture Notes in Computer Science, April 1998. Lisbon, Portugal.

....checking, Java. 1 Introduction Model checking of programs has received an increased attention from the formal methods community within the last couple of years. Several systems have emerged that can model check source code, such as Java, C and C directly (typically subsets of these languages) [17, 9, 4, 20, 28, 25]. The majority of these systems can be classified as translators, which translate from the programming language source code to the modeling language of the model checker. The Java PathFinder 1 (JPF1) 17] developed at NASA Ames Research Center, was such an early attempt to bridge the gap between ....

T. Cattel. Modeling and Verification of sC++ Applications. In Proceedings of TACAS98: Tools and Algorithms for the Construction and Analysis of Systems, volume 1384 of LNCS, LISBON, April 1998.

....tools from programming languages to PROMELA, to allow model checking with SPIN, have recently gained the interest of the research community. The JAVA PathFinder [HP99] developed at NASA Ames translates from JAVA to PROMELA. Another JAVA to PROMELA translator is described in [IDS98] whereas in [Cat98] a concurrent extension of C is considered (called sC , and in fact is extending C with active objects) In addition we are also translating C code to PROMELA within the DEOS project, but unlike the above mentioned tools, we do the translation by hand (we are however trying to stay as close ....

T. Cattel. Modeling and Verification of sC++ Applications. In Proceedings of TACAS98: Tools and Algorithms for the Construction and Analysis of Systems, volume 1384 of LNCS, LISBON, April 1998.

....we are aware of is the one reported in [2] which also tries to model check Java programs by mapping into Promela. This work does, however, not handle exceptions, nor polymorphism (passing, e.g. an object of a subclass of a class C to a method requiring a C object as parameter) The work in [3] defines a translator from a concurrent extension of a very limited subset of C to Promela. The drawback of this solution is that the concurrency extensions are not broadly used by C programmers. Corbett [4] describes a theory of translating Java to a transition model, making use of static ....

....Task extends Thread LockTable t; int p; Activity a; public Task(LockTable t,int p,Activity a) this.t = t; this.p = p; this.a = a; this.start( public void run( try t.lock(p,this) a.activity( catch (LockException e) finally t. release(p) class LockTable Task[ table = new Task[3]; public synchronized void lock(int property,Task task) throws LockException if (table[property] null) LockException e = new LockException( throw(e) table[property] task; public synchronized void release(int property) table[property] null; Fig. 1. Task Execution and Lock ....

T. Cattel. Modeling and Verification of sC++ Applications. In Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, Lisbon, Portugal, LNCS 1384, April 1998.

....logic model checking on such representation. To our knowledge, no concurrency analysis tool based on these approaches has ever been developed for the Java language. A work that has some aspects in common with the one presented here regards the formal analysis of sC , a concurrent extension of C [1]. The method outlined in [1] relies on the SPIN analyzer as we do, and the object oriented nature of sC puts problems similar to the ones found when modeling Java applications. The main differences between our work and that of [1] are the input languages, that differ under various respects among ....

....representation. To our knowledge, no concurrency analysis tool based on these approaches has ever been developed for the Java language. A work that has some aspects in common with the one presented here regards the formal analysis of sC , a concurrent extension of C [1] The method outlined in [1] relies on the SPIN analyzer as we do, and the object oriented nature of sC puts problems similar to the ones found when modeling Java applications. The main differences between our work and that of [1] are the input languages, that differ under various respects among which inter process ....

[Article contains additional citation context not shown here]

Thierry Cattel, "Modeling and verification of sC++ applications", Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, Lisbon, Portugal, LNCS 1384, Springer, (April 1998), pp. 232-248.

....Promela. Few attempts have been made to automatically verify programs written in real programming languages. The most recent attempt we can mention is the one reported in [2] which also translates Java programs into Promela, however not handling exceptions or polymorphism as we do. The work in [3] defines a translator from a concurrent extension of a very limited subset of C . The drawback of this solution is that the concurrency extensions are not broadly used by C programmers. In [5] is described what is called Extended static checking, a technique for detecting, at compile time, ....

....enclosed by f. g) and each Ei is an exception type (class) The body T of the try statement is executed until either an exception is thrown or it finishes successfully. If an exception is thrown, the catch 1. class Buffer implements BufferInterface 2. protected Object[ array = new Object[3]; 3. protected int putPtr = 0; 4. protected int getPtr = 0; 5. protected int usedSlots = 0; 6. protected boolean halted; 7. 8. public synchronized void put(Object x) 9. while (usedSlots = 3) 10. try wait( 11. catch(InterruptedException ex) 12. array[putPtr] x; 13. putPtr = putPtr ....

[Article contains additional citation context not shown here]

T. Cattel. Modeling and Verification of sC++ Applications. In Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, Lisbon, Portugal, LNCS 1384., April 1998.

....one reported in [3] which also tries to model check Java programs by mapping into Promela. This work does, however, not handle exceptions, nor polymorphism (passing, e.g. an object of a subclass of a class C to a method requiring a C object 1 http: www.cchess.net as parameter) The work in [4] defines a translator from a concurrent extension of a very limited subset of C to Promela. The drawback of this solution is that the concurrency extensions are not broadly used by C programmers. The VeriSoft tool [8] is a an exhaustive state space exploration tool for detecting ....

T. Cattel. Modeling and Verification of sC++ Applications. In Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, Lisbon, Portugal, LNCS 1384., April 1998.

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