university of illinois at chicago dept of computer science
play

University of Illinois at Chicago Dept. of Computer Science - PDF document

University of Illinois at Chicago Dept. of Computer Science Traditional strength in software engineering Many, diverse research projects Ties with research in computer security, mobile computing, distributed systems, human-computer


  1. University of Illinois at Chicago Dept. of Computer Science • Traditional strength in software engineering • Many, diverse research projects • Ties with research in computer security, mobile computing, distributed systems, human-computer interaction • Software engineering faculty: – Ugo Buy – Tadao Murata – Sol Shatz – Prasad Sistla – Jeffrey Tsai – Lenore Zuck Control software for manufacturing plants Investigator: Ugo Buy---Support: NIST GUI Problem Statement and Motivation Plant SFCs Constraints spec • Control programs are hard to write and Translator maintain TPNs • Flexible manufacturing demands rapid reconfiguration Supervisor generator • Possibility of deadlock, mutex violations, deadline violations Refined Code Control code TPNs generator Technical Approach Key Achievements and Future Goals • Avoid verification complexity with supervisory • System for enforcing deadlines on transition control firing in time Petri nets • Petri nets vs. finite state automata • Framework for compositional control • Synthesis of deadline-enforcing supervisors • Integration of methods for enforcing mutual using net unfolding exclusion and freedom from deadlock • Compositional methods (e.g., hierarchical • Generation of target code control) 1

  2. Performance Modeling and Analysis of Distributed Systems Using Petri Nets and Fuzzy Logic Investigator: Tadao Murata---Sponsor: NSF Problem Statement and Motivation t 1a P 1a P out-a • The size and complexity of real-time distributed P a (4,5,7,9) (0,0,0,0) systems makes it extremely difficult to predict the d 1a ( τ ) d 2a ( τ ) performance of these applications and their underlying networks d 2a ( τ ) (4,5,7,9) P free • Fuzzy-timing models associate possibility d 2b ( τ ) (4,5,7,9) distributions of delays with events taking place in the system being modeled, well mimicking complex d 2b ( τ ) behaviors of the system, making the formal model P b d 1b ( τ ) very beneficial in performance modeling and analysis P 1b (4,5,7,9) P out-b of complicated distributed systems Key Achievements and Future Goals Technical Approach • Applied FTHN model to assist us in the design of a • Monitor the system to obtain parameters such as high-speed transport protocol for Long Fat Networks. bandwidth and latency to characterize the possibility distributions of the Fuzzy-Timing Petri Net (FTHN) • Developed techniques and tools for performance model analysis of network protocols and QoS requirement analysis of the networks: Proposed a topology- • Build the FTHN model of the architecture to be approximation to enable the formal model to have analyzed based on the collected data capability in modeling unpredictable dynamic topology, • Use fuzzy logic and simulation to analyze and verify thus enlarging its application domains the modeled system. Network features that are needed • Future work includes: apply FTHN model in other in order to implement currently unattainable areas such as developing the intelligent optimization of interactions can be obtained concerted heterogeneous data transmissions in distributed wide-area cluster computing environments APPLYING FORMAL MODELING TO UML DIAGRAMS Investigator: Sol M. Shatz---Support: ARO, NSF Problem Statement and Motivation UML model Rational UML-CPN Rose (XMI) Conversion • Complex software systems difficult to design and analyze CPN • Software engineering dilemma: Semi-formal Model languages (e.g., UML) easy to use but do not (XML) support formal analysis; Formal languages (e.g., Petri nets) support formal analysis but MSC difficult to understand Simulation Simulation Trace Design/CPN • Develop techniques to profit from both types of Query Tool languages. Key Achievements and Future Goals Technical Approach • Transformation based approach • Defined formal semantics of UML statecharts (via translation into colored Petri nets) • Algorithmic translation of UML diagrams into formal notation (colored Petri nets) • Developed software for transforming UML statecharts into colored Petri nets • Formal analysis based on simulation • Developed software for specifying and • Develop various techniques to help users, who answering queries about system behavior are not familiar with the formal notation, reason about the behavior of a system design • Future plans: Other types of UML diagrams; experimental evaluation; timed models and • Develop techniques for checking qualitative analysis properties of the system 2

  3. Automatic Analysis and Verification of Concurrent Hardware/Software Systems Investigators: A. Prasad Sistla---Support: NSF Concurrent Problem Statement and Motivation System Yes/No • The project develops tools for debugging and Spec verification hardware/software systems. Model • Errors in hardware/software analysis occur Checker frequently • Can have enormous economic and social impact Correctness Counter example Spec • Can cause serious security breaches • Errors must be detected and corrected Technical Approach Key Achievements and Future Goals • Model Checking based approach • Developed SMC (Symmetry-based Model Checker ) • Correctness specified in a suitable logical frame work • Employed to find bugs in Fire Wire Protocol • Also employed in analysis of security protocols • Employs State Space Exploration • Different techniques for containing state • Need to extend to embedded systems and general software systems space explosion are used • Need to combine static analysis methods with model checking AID: Adaptive Intrusion Detection System Investigator: Jeffrey J.P. Tsai, Department of Computer Science Problem Statement and Motivation • Computer virus attacks cost global business an estimated $55 billion in 2003, a sum that is expected to increase this year. (ZDNet Security News) • The research goal is to develop an adaptive intrusion detection system (IDS) to reduce the cost of intrusion detection for network systems Key Achievements and Future Goals Technical Approach • Develop a new learning algorithm to produce • An intrusion detection system based on high performance detection models. learning algorithm has been implemented. • Use neural network to improve the decision • The IDS gets better performance than the making procedure from multiple models. winner of the KDDCUP’99 contest using the DARPA database. • Design a new predication algorithm to tune the detection model dynamically. • The IDS will be extended to detect the security problem of wireless sensor network systems. 3

  4. APPLICATIONS OF FORMAL METHODS Lenore Zuck---Sponsors: NSF, ONR, and SRC Problem Statement and Motivation • Translation Validation ─ Backward Compatibility of successive generations of software ─ Formal proofs that optimizing compilers maintain semantics of programs • Termination proofs of Pointer programs • Property Verification of parameterized systems (bus protocols, cache coherence, etc.) Key Achievements and Future Goals Technical Approach • Based on methodology developed, Intel is using • Translation validation verifies each go of the MicroFormal to verify backward compatibility of system. Verification conditions that are microprograms (between RISC & CISC) automatically created are send to theorem provers • (Need to develop better methodologies to prove theories that have bit vectors) • Combination of model checking and deductive methods allows to push the • IIV is a new tool that allows automatic envelope of automatic verification of infinite- verification of safety properties of parameterized state systems (for both pointer programs and systems protocols) • Researchers at MSR have expressed interest to integrate pointer analysis in their verification tool 4

Recommend


More recommend