talk by Likai Liu

• Next message: Yarom Gabay: "cs-520 Problem Set 8"
• Previous message: Assaf Kfoury: "more on homework assignments and implementations"
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

Return-Path: <kfoury@cs.bu.edu>
Received: from cs.bu.edu (cs [128.197.12.2]) by cs3.bu.edu (8.12.11/8.12.11) with ESMTP id i9RMRt8D008449; Wed, 27 Oct 2004 18:27:56 -0400
Received: from cs.bu.edu (kfoury@fiddle [128.197.10.114]) (authenticated bits=0) by cs.bu.edu (8.12.2/8.12.2) with ESMTP id i9RLN5s7022078; Wed, 27 Oct 2004 17:23:05 -0400 (EDT)
Sender: kfoury@cs.bu.edu
Message-ID: <418011B5.AF512716@cs.bu.edu>
Date: Wed, 27 Oct 2004 17:23:01 -0400
From: "Assaf J. Kfoury" <kfoury@cs.bu.edu>
Organization: Boston University
X-Mailer: Mozilla 4.78 [en] (X11; U; SunOS 5.8 sun4u)
X-Accept-Language: en
To: cs520@cs.bu.edu
CC: "Adam D. Bradley" <artdodge@cs.bu.edu>, "Assaf J. Kfoury" <kfoury@cs.bu.edu>
Subject: talk by Likai Liu
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
X-Spam-HitLevel: 
X-Spam-DCC: sgs_public_dcc_server: cs3.bu.edu 1199; Body=3 Fuz1=3 Fuz2=3
X-Spam-Checker-Version: SpamAssassin 3.0.1-gtw (2004-10-22) on cs3.bu.edu
X-Spam-Level: 
X-Spam-Status: No, score=-4.1 required=10.0 tests=ALL_TRUSTED,AWL,BAYES_00  autolearn=ham version=3.0.1-gtw
X-Spam-Pyzor: Reported 0 times.
Status: RO
X-Mozilla-Status: 8001
X-Mozilla-Status2: 00000000
X-UIDL: 411f69ec000017f0

Hello all,

I repeat an announcement I made in lecture
this morning. If you want to see an application
of the material we learn in CS 520 to a networking
problem, come and listen to Likai Liu tomorrow.
The information is attached below.

Assaf

---------------------------------------------

Title:
Safe Compositional Specification of Network Systems

Presented by Likai Liu

Time: Thursday, Oct 28, 3:30 pm
Place: MCS Room 180

Abstract:
A specification language, with a type system featuring
subtyping that is inspired by functional and OO programming
languages, is proposed to describe components of a
network service and their properties. Furthermore, we
develop a type inference algorithm, the compositional
analysis, to facilitate fully modular, constraint-based
typing. The objective is to defer analysis of unknown
components and to resume analysis when the component
is assigned, without re-analyzing the entire system. This
avoids the need of specification-disclosure when several
parties work to determine the interoperability of their systems.

• Next message: Yarom Gabay: "cs-520 Problem Set 8"
• Previous message: Assaf Kfoury: "more on homework assignments and implementations"
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

This archive was generated by hypermail 2b29 : Fri Nov 19 2004 - 17:00:43 EST