---
Stc Topics

---+ Papers for STC
---

Below are some papers I have selected for your talk in the [[Stc.WebHome][Software Technology Colloquium]]. Most, if not all, papers can only be downloaded if you're logged-in to Solis, or from CSUU intranet, due to access right restrictions.

If you need help making your way through the papers below, you can contact [[WP.WebHome][Wishnu Prasetya]].
About [[STCGrading][grading]].

TODO: update this!

%STARTINCLUDE%

---+++ Topics in Automated Software Testing

Contact:  [[WP.WebHome][Wishnu Prasetya]].


   1. *JPAX (Java Path Explorer)* is a tool that tries to apply verification techniques to test real applications. This sounds very cool; _"verification"_ of course promises a lot! But does it actually deliver when applied in real software? Perhaps you can evaluate this tool? Papers:
      * [[http://citeseer.ist.psu.edu/503358.html][Monitoring Java Programs with Java PathExplorer]], Havelund and Rosu, in Workshop on Runtime Verification, 2001. 
      * [[http://webcourse.cs.technion.ac.il/236801/Winter2004-2005/ho/WCFiles/Java-Path-Explorer.pdf][Java PathExplorer&#8211;A Runtime Verification Tool]], Havelund and Rosu, in 6th International Symposium on Artificial Intelligence, Robotics and Automation in Space, 2001. 
      * Oh, I also found [[http://research.microsoft.com/~qadeer/cav-issta-talks/jpax-daisy.ppt][A ppt presentation]] by Klaus Havelund, if it is of any help. <p>
   <!--
     -->
   1. *Automated Debugging with Weakest Pre-conditions*. The weakest pre-condition of a program P specifies the largest set of starting states for P such that it ends up in a correct state (usually specified with a post-condition). Under certain circumstances, it can be calculated easily. The paper combines the technique with traces obtained from debugging, in order to infer the exact source of an error. This is not always the place where an exeception is thrown. Quite often, the fault happens earlier; it is just not observed yet. Automatically finding the real source of an error is very useful. Paper:
      * [[http://dx.doi.org/10.1007/b95935][Automated Debugging Using Path-Based Weakest Preconditions]], Haifeng He and Neelam Gupta, in 7th International Conference in Fundamental Approaches to Software Engineering (FASE), 2004. <p>
   <!--
     -->
   1. So you want to do *automated testing on your parsers*? :) These folk claim they know how. Read the paper, and share it with us: [[http://www.springerlink.com/content/qvq7041786465563/fulltext.pdf][Automated Generation of Positive and Negative Tests for Parsers]], Sergey Zelenov and Sophia Zelenova. In 5th Int. Workshop on Formal Approaches to Testing of Software (FATES), 2005. <p>
   <!--
     -->

---+++ Topics in Automated Verification

Contact:  [[WP.WebHome][Wishnu Prasetya]].

   1. *[[http://ksl.stanford.edu/software/JTP][JTP]]* is an object-oriented modular reasoning system developed by Stanford University. JTP's main attraction is that it is implemented in Java, and thus ideal for easy integration with Java applications that need theorem proving support. Papers:
      * [[http://ksl.stanford.edu/KSL_Abstracts/KSL-03-01.html][JTP: A System Architecture and Component Library for Hybrid Reasoning]], R. Fikes et al, 7-th World Multiconference on Systemics, Cybernetics, and Informatics, 2003. 
      * [[http://ksl.stanford.edu/KSL_Abstracts/KSL-03-05.html][Including Domain-Specific Reasoners with Reusable Ontologies]],
Fikes et al, International Conference on Information and Knowledge Engineering, 2003. 

%STOPINCLUDE%