CS 595 
Topics in Automated Verification  Spring 2004
Description:
In this seminar we will discuss
recent work in automated verification.
The topics include software model checking,
verification of infinite state systems, automated abstraction techniques,
symbolic representations for verification.
Each student is required to present a paper and read the papers
that are discussed.
Instructors:
Tevfik Bultan and
Oscar Ibarra
Meeting time:
Tuesdays, 1:45pm, Eng. I room 2114
Enrollement Code:
74906
Presentations

Time: Friday, June 4th at 1:00pm.
Place: CTL (trailer 932).
PhD thesis defense by Constantinos Bartzis:

Symbolic Representations for Integer Sets in Automated
Verification

Time: Wednesday, May 26th at 4:30pm.
Place: ECE Conference Room, 2162.
PhD thesis defense by Xiang Fu:

Formal Specification and Verification of Asynchronously
Communicating Web Services

May 25th, Tuesday at 1:45pm Cagdas Gerede will present:

An AutomataTheoretic Approach to
Linear Temporal Logic. Moshe Vardi.
Available
here

May 25th, Tuesday at 1:45pm Cagdas Gerede will present:

An AutomataTheoretic Approach to
Linear Temporal Logic. Moshe Vardi.
Available
here

May 14th, Friday at 12:00, Xiang Fu will present:

Analysis of Interacting BPEL Web Services.
Xiang Fu, Tevfik Bultan, and Jianwen Su.
To appear in the Proceedings of the Thirteenth International World Wide Web Conference (WWW 2004).
Available
here

May 4th, Graham Hughes will present:

CSSV: Towards a Realistic Tool for Statically Detecting
All Buffer Overflows in C.
Nurit Dor, Mchael Rodeh, and Mooly Sagiv.
PLDI 2003.
Available
here

Cleanness Checking of String Manipulations in C Programs via Integer Analysis.
Nurit Dor, Mchael Rodeh, and Mooly Sagiv.
SAS 2001.
Available
here

April 27th, Sara Woodworth will present:

Composability of InfiniteState Activity
Automata. Zhe Dang, Oscar Ibarra, and Jianwen Su

April 20th, Aysu Betin will present:

Modular Verification of Open Features Through ThreeValued Model
Checking. Harry C. Li and Shriram Krishnamurthi and Kathi Fisler
Automated Software Engineering: An International Journal, 2003.
Available
here

Modular Verification of CollaborationBased Software Designs. Kathi
Fisler and Shriram Krishnamurthi Joint European Software Engineering
Conference and ACM SIGSOFT Symposium on the Foundations of Software
Engineering, 2001.
Available
here

April 13th, Tuba Yavuz will present:

Verification of Java Programs Using Symbolic Execution
and Invariant Generation.
C. Pasareanu and W. Visser.
Proceedings of SPIN 2004.
Available
here

Generalized Symbolic Execution for Model Checking and Testing.
S. Khurshid, C. S. Pasareanu and W. Visser.
Proceedings of TACAS 2003. Warsaw, Poland, April 2003.
Available
here

April 6th, Constantinos Bartzis will present:

S. Bardin, A. Finkel, and J. Leroux. FASTer acceleration of counter automata in practice. In Proc. 10th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS'2004), Barcelona, Spain, Apr. 2004, volume 2988 of Lecture Notes in Computer Science, pages 576590. Springer, 2004.
Available
here
 A. Finkel and J. Leroux. Polynomial time image computation with intervaldefinable counters systems. In Model Checking Software, Proc. 11th Int. SPIN Workshop, Barcelona, Spain, Apr. 2004, volume 2989 of Lecture Notes in Computer Science, pages 182197. Springer, 2004. Available
here
Tentative List of Papers

An AutomataTheoretic Approach to Linear Temporal
Logic. Moshe Vardi.
Available
here

Dense Counter Machines and Verification Problems. G. Xie, Z.Dang,
O.Ibarra, and P. San Pietro.
Proc. of the 15th International Conference on Computer Aided
Verification (CAV 2003)}, LNCS, vol. 2725, pp. 93105, 2003.

Verification of Java Programs Using Symbolic Execution
and Invariant Generation.
C. Pasareanu and W. Visser.
Proceedings of SPIN 2004.
Available
here

Modular Verification of Open Features Through ThreeValued Model Checking
Harry C. Li and Shriram Krishnamurthi and Kathi Fisler
Automated Software Engineering: An International Journal, 2003
Available
here

Modular Verification of CollaborationBased Software Designs.
Kathi Fisler and Shriram Krishnamurthi
Joint European Software Engineering Conference and ACM SIGSOFT Symposium on the Foundations of Software Engineering, 2001.
Available
here

Checking Strong Specifications Using An Extensible Software Model Checking Framework, October 2003.
Robby, Edwin Rodríguez, Matthew B. Dwyer, John Hatcliff.
To appear in the Proceedings of the Tenth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2004).
Available
here

Bogor: An Extensible and HighlyModular Model Checking Framework, March 2003.
Robby, Matthew B. Dwyer, John Hatcliff
In the Proceedings of the Fourth Joint Meeting of the European Software Engineering Conference and ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE 2003).
Available
here

S. Qadeer, S.K. Rajamani and J. Rehof. Summarizing procedures in concurrent programs. Proceedings of the 31st Annual ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, 2004.
Available
here

Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Ken McMillan.
Abstractions from proofs.
Proceedings of the 31st Annual Symposium on Principles of Programming Languages (POPL), ACM Press, 2004, pp. 232244.
Available
here

Bruno Blanchet, Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné, David Monniaux, & Xavier Rival.
A Static Analyzer for Large SafetyCritical Software.
In PLDI 2003, ACM SIGPLAN SIGSOFT Conference on Programming Language Design and Implementation.
Available
here

S. Bardin, A. Finkel, and J. Leroux. FASTer acceleration of counter automata in practice. In Proc. 10th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS'2004), Barcelona, Spain, Apr. 2004, volume 2988 of Lecture Notes in Computer Science, pages 576590. Springer, 2004.
Available
here
 A. Finkel and J. Leroux. Polynomial time image computation with intervaldefinable counters systems. In Model Checking Software, Proc. 11th Int. SPIN Workshop, Barcelona, Spain, Apr. 2004, volume 2989 of Lecture Notes in Computer Science, pages 182197. Springer, 2004.
Available
here