From mencl at nenya.ms.mff.cuni.cz Wed Nov 10 12:08:03 2004 From: mencl at nenya.ms.mff.cuni.cz (Vladimir Mencl) Date: Wed, 10 Nov 2004 12:08:03 +0100 (CET) Subject: seminar topics available Message-ID: Zdravim, v priloze posilam seznam temat na seminar. Vyberte si prosim a dejte mi vedet emailem. Zaalokovana temata jsou zatim pouze Comega (Pavel Jezek), IBM Autonomic Computing (Jan Kofron) a CIAO (Component-Integrated ACE ORB) (Luba Bulej nebo jeho diplomant) Seznam temat jsem taktez vyvesil na http://nenya.ms.mff.cuni.cz/teaching/topics-2004-11.html Je potreba pokryt seminari leden. Vetsina clenu skupiny jiz mela dva referaty na podzim, na kazdeho ale vychazi jeste jeden referat na leden. Dejte mi prosim do konce listopadu vedet, jake tema jste si vybrali. Vlada -------------- next part -------------- Object Systems Group (OSG) Geneve http://cui.unige.ch/OSG/ => ESOA: The Engineering Self-Organising Applications project (ESOA), funded by FNRS grant (21-68026.02), aims at enabling two or more programs, which do not know each other, to discover each other capabilities by exchanging formal specifications and proofs. http://www.co.umist.ac.uk/~mcaihak2/esoa-cfp.html http://www.co.umist.ac.uk/~mcaihak2/esoa-programme.htm => Self-Organising Applications: A Survey ... & others Agent Communication Languages (do an introductory overview) http://agents.umbc.edu/technology/acl.shtml FIPA is a non-profit organisation aimed at producing standards for the interoperation of heterogeneous software agents. ... Foundation for Intelligent Physical Agents. http://www.fipa.org/repository/bysubject.html JoCaml, http://pauillac.inria.fr/join/ Join Calculus - experimental language based on the homonymous process calculus. The join-calculus programming model features concurrent processes running on several machines, static type-checking, global lexical scope, transparent remote communication, agent-based mobility, and some failure-detection. M-Calculus - a higher-order version of the Distributed Join calculus with programmable localities. http://doi.acm.org/10.1145/604131.604136 SIGPLAN-SIGACT 2003 Alan Schmitt, Jean-Bernard Stefani: The m-calculus: a higher-order distributed process calculus Acute Language (Inria) Acute: high-level programming language design for distributed computation http://www.cl.cam.ac.uk/users/pes20/acute/ CIAO - Component-Integrated ACE ORB http://www.cse.wustl.edu/~nanbor/projects/CIAO/ TACS 2001, LNCS 2215 Caires, L., Cardelli, L.: A Spatial Logic for Concurrency (Part I) http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2215&spage=1 We present a logic that can express properties of freshness, secrecy, structure, and behavior of concurrent systems. In addition to standard logical and temporal operators, our logic includes spatial operations corresponding to composition, local name restriction, and a primitive fresh name quantifier. Properties can also be defined by recursion; a central theme of this paper is then the combination of a logical notion of freshness with inductive and coinductive definitions of properties. FASE04 LNCS 2984 Roman, G.-C., Julien, C., Payton, J. A Formal Treatment of Context-Awareness http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2984&spage=12 FOSSACS 2003, LNCS 2620 Matthew Hennessy, Massimo Merro, Julian Rathke Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems (Extended Abstract) http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2620&spage=282 WADT 2002, LNCS2755 P. Hoffman, Verifying Generative Casl Architectural Specifications http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2755&spage=233 We present a proof-calculus for architectural specifications, complete w.r.t. their generative semantics. Architectural specifications, introduced in the Casl specification language, are a formal mechanism for expressing implementation steps in program development. They state that to implement a needed unit, one may implement some other units and then assemble them in the prescribed manner; thus they capture modular design steps in the development process. We focus on developing verification techniques applicable to full Casl architectural specifications, which involves, inter alia, getting around the lack of amalgamation in the Casl institution. C-omega http://research.microsoft.com/Comega/ - A control flow extension for asynchronous wide-area concurrency (formerly known as Polyphonic C#): - A data type extension for XML and table manipulation (formerly known as Xen and as X#): Peter Lee: Proof-Carrying Code http://www-2.cs.cmu.edu/~petel/papers/pcc/pcc.html IBM Autonomic Computing - Creating self-managing computing systems http://www-1.ibm.com/servers/autonomic/ http://www.gartner.com/DisplayDocument?id=329887 From mencl at nenya.ms.mff.cuni.cz Thu Nov 11 17:50:41 2004 From: mencl at nenya.ms.mff.cuni.cz (Vladimir Mencl) Date: Thu, 11 Nov 2004 17:50:41 +0100 (CET) Subject: temata na seminar [dodatek] Message-ID: K jiz nabidnutym tematum pridavam jeste jedno velmi zajimave tema: An Extensible Type System for Component-Based Design Yuhong Xiong Ph.D. thesis, Technical Memorandum UCB/ERL M02/13 Electronics Research Laboratory, University of California, Berkeley, 2002. http://ptolemy.eecs.berkeley.edu/papers/02/typeSystem/ Cituji z abstraktu: ... To describe the dynamic behavior of components and perform compatibility check, we extend the concepts of conventional type system to behavioral level and capture the dynamic interaction between components, such as the communication protocols the components use to pass messages. In our system, the interaction types and the dynamic behavior of components are defined using a light-weight formalism, interface automata. Type checking, which checks the compatibility of a component with a certain interaction type, is conducted through automata composition. Our system is polymorphic in that a component may be compatible with more than one interaction types. We show that a subtyping relation exists among various interaction types and this relation can be described using a partial order. This behavioral type order provides significant insight into the relation among the interaction types. It can be used to facilitate the design of polymorphic components and simplify type checking. In addition to static type checking, we also propose to extend the use of interface automata to the on-line reflection of component states and to run-time type checking. We illustrate our framework using the Ptolemy II environment, and discuss the trade-offs in the design of behavioral type system. Dejte mi prosim vedet zamluvena temata. Mame i jeden volny termin 14.12., ten je potreba take vyuzit. Vlada Mencl