MembersFaculty & Post Doc: Samik Basu and Ganesh Ram Santhanam Students
- Zachary Oster (PhD): Requirements Analysis and Preferences
- Michelle Ruse (PhD): Vulnerability Analysis in Web Applications
- Tanmoy Sarkar (PhD): Testing Database Applications
- Swapnanjan Chatterjee (MS)
- Sneha Banker (MS)
- Carl Chapman (BS Software Engineering): Interface for Qualitative Preference Reasoning
- Katarina Mitchell (BS Computer Engineering): Interface for Multi-stakeholder Qualitative Preference Reasoning
- Paul Jennings (MS): MoSys
- Yuly Suvorov (MS): Lockheed Martin
- Jyotishman Pathak (PhD): Mayo Clinic
- Sayaan Mitra (PhD): Adobe
- Natalia Stakhanova (PhD): University of South Alabama
- Curt Keller (MS): Continental Data Graphics
- Laboratory of Software Design at ISU
- Laboratory of Software Safety at ISU
- Artificial Intelligence Laboratory at ISU
- Verification Laboratory at UCSB
Projects† undergraduate student
‡ graduate student
Reasoning with Qualitative Preference . Many applications call for techniques for representing and reasoning about qualitative preferences over a set of alternatives. The objective is to investigate different types of qualitative preference languages in terms of their expressive power and develop efficient techniques to reason using qualitative prefereces.
Project Collaborators: Carl Chapman†, Katarina Mitchell†, Zachary Oster‡, Ganesh Ram Santhanam, Robyn Lutz and Vasant Honavar.
Vulnerability Analysis of Web Applications. Web applications that accept user input are vulnerable to class of attacks known as injection attacks, among which include SQL Injection and Cross-Site Scripting Attacks. These injection attacks occur when a user input containing malicious values is passed from the browser to the server application, possibly onto the database or onto other data store. The objective is to develop techniques based on model checking, program analysis and testing to identify possible scripting attacks in Web applications.
Project Collaborators: Michelle Ruse‡.
Preference based Requirements Analysis in Software Engineering . Typically, alternative designs, technical and managerial choices in the domain of Software Engineering are analyzed on the basis of quantitative preferences and trade-offs. However, in many scenarios it is difficult to obtain (directly from users) and/or compute automatically preferences in quantitative terms. The objective is to develop an alternative approach purely based on qualitative preferences and realize application specific preference reasoning algorithms.
Project Collaborators: Zachary Oster‡ and Ganesh Ram Santhanam.
Verification of Asynchronous Systems. A crucial problem in dependability of concurrent and distributed software systems is the coordination of different components that form the whole system. In order to complete a task, components of a software system have to coordinate their executions by interacting with each other. Message-based communication is an increasingly common interaction mechanism used in concurrent and distributed systems where components interact with each other by sending and receiving messages. The goal of this project is to develop novel techniques for specification, analysis, and verification of message-based interactions.
Project Collaborators: Tevfik Bultan (UCSB), Oscar Ibarra (UCSB) and Meriem Ouderni (UMA).
Testing Database Applications. Database applications are built using two different programming language constructs; one that controls the behavior of the application, also referred to as the host language, and the other that allows the application to access/retrieve information from the backend database, also referred to as the query language. The interplay between these two languages make testing of database applications a challenging process. The objective of this project is to develop a testing framework that can automatically generate high-quality test cases for database applications.
Project Collaborators: Tanmoy Sarkar‡ and Johnny Wong.
Model Checking Parameterized Systems . Parameterized System describes an infinite family of (finite-state) systems, where each instance of the family is identified by the valuation of the parameter. Verification of parameterized system is undecidable in general. The challenge is to develop sound verification techniques for parameterized systems such that the techniques are independent of communication topology of the components of the system.
Project Collaborators: Hridesh Rajan, Youssef Hanna‡ and David Samuelson†.
Probabilistic Model Checking . Many applications call for techniques for representing and reasoning about qualitative preferences over a set of alternatives. Our objective is to investigate different types of qualitative preference languages in terms of their expressive power and develop efficient techniques to reason using qualitative prefereces.
Project Collaborators: Paul Jennings‡ and Arka P. Ghosh (Statistics, ISU)
Web Service Composition . One of the main challenges for developing composite services is that the user needs to have the knowledge of existing component services and manually compose them in a fashion that results in the desired composition. Furthermore, the user is responsible for understanding and using service specification languages like OWL-S and WSDL. This restricts the number of users who can develop and deploy new services and also makes the process of service composition (even by knowledgeable users) tedious and error-prone. This project aims at developing a methodology that not only enhances the current state-of-art techniques for Web service composition but also enables end-users to develop, realize and execute composite services with little or no knowledge of the specifics of service composition.
Project Collaborators: Zachary Oster‡, Ganesh Ram Santhanam, Jyotishman Pathak‡, Dinanath Nadkarni‡, Hongyu Sun‡, Robyn Lutz and Vasant Honavar