121. CMU CS Venari Project Home Page The thrust of the Venari project at Carnegie Mellon University is addressing the problem of search, hence the name. We touch upon areas in programming and specification language design, semantics, and implementation; concurrent and distributed systems; databases and persistent objects; and software development libraries and environments. http://www-2.cs.cmu.edu/afs/cs/project/venari/www/home.html

Venari Project Project Goals Venari means "to hunt" in Latin. The thrust of the Venari project at Carnegie Mellon University is addressing the problem of search , hence the name. We touch upon areas in programming and specification language design, semantics, and implementation; concurrent and distributed systems; databases and persistent objects; and software development libraries and environments. The primary goal of the Venari Project is to provide software support for storing, accessing, and retrieving objects based on their semantics. To support that goal, we have designed and implemented linguistic extensions to the Standard ML programming language to provide persistent data and transactions. A more complete statement of the project's goals is available here (in PostScript). Venari Papers Follow any of the links below to get the abstract and a pointer to the full text. Venari/ML: design and implementation of concurrent transactions for ML. Nicholas Haines, Darrell Kindred, J. Gregory Morrisett, Scott M. Nettles, and Jeannette M. Wing, Composing First-Class Transactions ACM Transactions on Programming Languages and Systems , Short Communication, November 1994.

122. Nissim Francez's Home Page The Technion Formal semantics of natural language, computational linguistics, semantics of programming languages, program verification, concurrent and distributed programming, logic programming. http://www.cs.technion.ac.il/~francez/

CS home page Nissim Francez's Home Page Bank Leumi professor of computer science Head, Computational Linguistics Laboratory Department of Computer Science The Technion Haifa 32000, Israel +972-4-8294369 (voice) +972-4-8294353, or +972-4-8221128 (fax) e-mail: francez@cs.technion.ac.il Home address: 10B Hanita st., Nahariya 22385, Israel Tl. (+972)(4) 9928444 Research Interests: Main: Formal semantics of Natural language, Type-logical grammar, Computational linguistics, unification-based grammar formalisms (LFG, HPSG). Secondary: Semantics of programming languages, program verification. Concurrent and distributed programming. Logic programming. My research activity is within the Computational Linguistics Laboratory (LCL). My CV

123. Old Home Page Of Maurizio Gabbrielli, Professor Of Computer Science University of Udine Formal methods for program verification and analysis, theory of concurrent constraint programming, program transformations, languages for real-time applications, logic programming. http://www.dimi.uniud.it/~gabbri/

Old home page of Maurizio Gabbrielli Professor of Computer Science This page is obsolete since Maurizio Gabbrielli has moved to the University of Bologna Please find here his new page Professional Research interests Papers available on-line Publications Projects ... ALP , the Association of Logic Programming (member of the Executive Committee) EAPLS , the European Association for Programming Languages and Systems (member of the Board) PPDP , the ACM Conference Principles and Practice of Declarative Programming (member of the Steering Committee) GULP , the Italian Association of Logic Programming (president) Conferences CL 2000 (PC member, Stream on Theory and Extensions ), July 2000, London. PPDP 2000 The 2nd Int'l Conf. on Principles and Practice of Declarative Programming (Program co-chair) CP 98 Fourth International Conference on Constraint Programming (PC member) PLILP/ALP 98 and SAS 98 Joint International Symposia (Conference chair) Other links The 2000 International Summer School in Computational Logic , Maratea (Italy) (co-organizer) COTIC 98 Second workshop on concurrent constraint programming for time critical applications and multi-agent systems Teaching Informatica Documentale Informatica Applicata Disponibilita' di Tesi Other related pointers

124. Concurrency And Computation Practice And Experience (Journal) Peerreviewed articles covering concurrent solutions, algorithms, programming environments and applicatons. Published by Wiley InterScience. http://www.interscience.wiley.com/jpages/1532-0626/

125. Oz Programming System concurrent constraint programming language designed for applications needing complex symbolic computations, organization into multiple agents, and soft realtime control. The original Oz DFKI Oz 2.0; features, tools, documents, download. Predecessor of Mozart. http://www.ps.uni-sb.de/oz2/

126. Carlos Baquero — GSD Minho University Distributed systems and mobile computing, concurrent object-oriented programming. http://gsd.di.uminho.pt/cbm/

Skip to content Small Text Normal Text Large Text Search GSD Sections Home Teaching Research Projects ... About Personal tools You are not logged in Log in You are here: Home Members cbm's Home Carlos Baquero Document Actions Assistant Professor email: cbm at di.uminho.pt Address: Departamento de Inform¡tica, Universidade do Minho, Campus de Gualtar, 4710-057 Braga, Portugal Phone: +351 253 604 449 / Internal: 4449 Fax: Selected Publications FEW: File Management for Portable Devices IWSSPS 2005 Bounded Version Vectors DISC 2004 Version stamps decentralized version vectors IEEE ICDCS 2002 Panasync: dependency tracking among file copies ACM SIGOPS EW 2000 Mobile transaction management in mobisnap ABDIS-DASFAA 2000 Improving causality logging in mobile computing networks ACM MC2R 1998 MobiScape: WWW browsing under disconnected and semi-connected operation Integration of Concurrency Control in a Language with Subtyping and Subclassing Usenix COOTS 1995 Categorized list of Publications and Talks Legacy documents folder Projects FEW (2005-) File Management for Portable Devices Panasync (2000-2004) Dependency tracking among arbitrary file copies MobiSnap (1999-2003) Managing Database Snapshots in a Mobile Environment COOP Events 1º Congreso de Tecnologias del Software Libre Teaching MSc: MSM BSc: LESI LMCC MAT Created by cbm Last modified 2005-07-28 09:15 AM This site conforms to the following standards:

127. The Scala Programming Language A general purpose programming language with a special focus on web services. It combines objectoriented, functional and concurrent elements. It is a successor of Funnel. Java-based implementation. http://lamp.epfl.ch/scala/

Introduction Documentation Downloads Examples Reporting a Bug ... Community News RSS Version 1.0.3 of the Scala Plugin for Eclipse has been released. Introduction paper on the documentation page has been updated. Version 1.4.0.0 has been released. Overview paper on the documentation page has been updated. Publicly accessible CVS Repository New documentation page " Scala Plugin for Eclipse Version 1.3.0.10 has been released. WWW Scala The Scala Programming Language - Full text also available as PDF or PostScript document Scala is a modern multi-paradigm programming language designed to express common programming patterns in a concise, elegant, and type-safe way. It smoothly integrates features of object-oriented and functional languages. Scala is object-oriented Scala is a pure object-oriented language in the sense that every value is an object . Types and behavior of objects are described by classes and traits . Class abstractions are extended by subclassing and a flexible mixin-based composition mechanism as a clean replacement for multiple inheritance.

128. Cybele From Intelligent Automation Inc OpenCybele, the open source agent infrastructure, is a runtime environment built on the top of the Java(TM) 2 platform for control and execution of agents. Features include plugn-play capability of agent services, Activity Centric programming (ACP), multi-thread support for concurrent agent execution, location independent communication, publish-subscribe based messaging, synchronous, asynchronous, broadcast, and point-to-point messaging. http://www.opencybele.org

129. A Distributed Implementation Of The C-Linda Programming Language Language combining C and Linda, gives six functions for concurrent process coordination, can be added to any other sequential language, unlike many other parallel languages, programmers needn't learn a new language. Thesis with essay, bibliography, code samples. http://www.cs.oberlin.edu/~jbasney/honors/thesis.html

A Distributed Implementation of the C-Linda Programming Language Jim Basney Computer Science Program Oberlin College May 1995 Introduction Professor David Arnow (Brooklyn College, City University of New York) has developed a C library for distributed programming on Unix systems called DP. The DP project has three main goals: power, simplicity, and implementability. The DP functions should be powerful enough to implement most distributed applications. They should be a simplified interface to the facilities already present in Unix for process management and communication. Additionally, they should be implementable on most distributed computing platforms. DP provides the C programmer with reliable message passing between processes and simplified non-local process spawning. The C-Linda language is a natural continuation of the above goals. It provides a metaphor for concurrent programming that can serve as an abstraction of the functionality provided by DP. The C-Linda Language The C-Linda programming language is the combination of the C and the Linda languages. Linda, developed by Professor David Gelernter (Yale University), is a coordination language. It provides six functions for concurrent process coordination that can be added to any sequential programming language, conforming to that language's function call syntax. Thus, unlike with many other modern parallel languages, the Linda programmer does not need to learn an entirely new computational language, but rather only needs to learn the Linda primitives for adding concurrency to the language that the programmer is most familiar with.

130. Erlang Book TOC Erlang is a concurrent functional programming language designed for programming large industrial realtime systems. Erlang is dynamically typed and has a http://www.erlang.se/publications/ErlangBook.shtml

Ericsson AB Home Product Info Licensing Consulting ... Open Source For comments or questions about this site, contact us Concurrent Programming in Erlang J. Armstrong, R. Virding, C. Wikström, M. Williams 2:nd Edition Prentice Hall, 1996, ISBN 0-13-508301-X Erlang is a concurrent functional programming language designed for programming large industrial real-time systems. Erlang is dynamically typed and has a pattern matching syntax. Functions are defined using recursion equations. Erlang provides explicit concurrency, has asynchronous message passing and is relatively free from side effects. Distributed Erlang programs can run transparently on cross-platform multi-vendor systems. The language has primitives for detecting run-time errors and for dynamic code replacement (i.e. changes to code can be made in a running real-time system, without stopping system). Erlang has real-time GC, modules and a foreign language interface.

131. Jeannette M. Wing Professor in the School of Computer Science Associate Dean of Doctoral Programs, Software specification and verification, security, concurrent and distributed systems, programming languages, programming methodology. http://www-2.cs.cmu.edu/~wing/

Jeannette M. Wing President's Professor of Computer Science Computer Science, Department Head Contact Information Address: Computer Science Department, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213 Office: 4220 Wean Hall Phone: 412-268-3068 (office) 412-260-8926 (cell) Fax: 412-268-5577 Email: wing@cs.cmu.edu Research Publications Areas of Interest : Software specification and verification security , concurrent and distributed systems programming languages programming methodology Projects Specification and Verification Center : Specification and verification tools, languages, and methods for hardware and software systems. Co-PIs: Ed Clarke, David Garlan, Bruce Krogh, Reid Simmons. Sponsored by the Army Research Office (David Hislop, program manager), National Science Foundation, and NASA/Ames. Software Security Attack Surface Measurement : People, publications, related articles. Attack graph generation and analysis Carnegie Mellon CyLab TOM Consortium : The TOM server automatically converts documents and files of one type to another. Great for reading e-mail attachments, creating web pages from powerpoint slides, excel spreadsheets, latex documents, etc. Past Projects Students Oren Dobzinski, ECE doctoral student.

132. Laboratorio De Fundamentos Da Computación E Intelixencia Artificial Affiliated with the University of Corunna. Does research in theoretical Computer Science, programming, distributed and concurrent functional environments and formal methods in Software Engineering. http://carpanta.dc.fi.udc.es/

Main Page Contact Info Staff Projects ... n LABORATORY OF FOUNDATIONS IN COMPUTER SCIENCE AND ARTIFICIAL INTELLIGENCE LFCIA is a laboratory affiliated to the Department of Computer Science of the Faculty of Informatics of the University of Corunna Interesting Links Models and Applications of Distributed Systems Group ( MADS Group MADS' Intranet VoDKA Project: Video on Demand Kernel Architecture VRDADER Project: Verificación, Rendimiento y Disponibilidad de Aplicaciones Distribuidas en Entornos Reales ... ARMISTICE Project: Advanced Risk Management Information System: Tracking Insurances, Claims and Exposures Vision Artificial y Reconocimiento de Patrones ( VARPA Group web@lfcia.org Main Page Contact Info ... Internal

133. Distributed Haskell Extension for parallel and distributed programming, with combinators from concurrent constraint programming; computational parts of programs are expressed functionally, development was first for tightly coupled multiprocessors, evolved from Goffin. http://www.cse.unsw.edu.au/~chak/goffin/

Distributed Haskell aka Goffin Parallel and Distributed Programming in Haskell Haskell is the most popular lazy, functional programming language. It includes a polymophic type system that supports overloading, a powerful standard library, and a convenient, purely functional I/O system. Currently, there are three mature implementations . There is even some poetry about it. Distributed Haskell extends plain Haskell with support for concurrent computations, distribution, reactive behaviour, soft-real time constraints, and inter-application communication. The resulting language facilitates the implementation of co-ordinative structures required in applications from parallel computing as well as distributed and Internet programming. High-performance SMP servers, clustered workstations, and modern supercomputers increasingly share the same architectures; at the same time, we see that distributed computing and parallel computing are converging. It is clear that this development has a strong impact on programming models and language design for networked and high-performance machines. Distributed Haskell is designed to allow implementin many parallel and distributed applications in the same framework. Distributed Haskell evolved from Goffin, an extension of Haskell with combinators from concurrent constraint programming. These combinators constitute a co-ordination sublanguage that allows the specification of the co-ordination portion of parallel and distributed programs. The computational portions of these programs are expressed purely functional. The distinguished feature of Goffin is that the semantic properties of the functional base language Haskell are preserved; in particular, the extension retains referential transparency. Although, the development of Goffin initially focused on tightly-coupled multiprocessors, some extensions that are required for applications executing on loosely-coupled systems have been proposed recently, which inspired the change of the name into Distributed Haskell

134. Scsh - The Scheme Shell A broadspectrum systems-programming environment for Unix embedded in R5RS Scheme (actually within version 0.53 of Scheme48). Support for concurrent system programming, sophisticated I/O and automatic garbage collection for process resources. http://www.scsh.net/

What is scsh? News Who wrote scsh? Scsh on SourceForge ... Praise scsh .net all about scsh Scsh is an open-source Unix shell embedded within Scheme , running on all major Unix platforms including AIX, Cygwin, Linux, FreeBSD, GNU Hurd, HP-UX, Irix, Mac OS X, Solaris, and some others. Scsh is a variant of Scheme 48 (an R RS Scsh has two main components: a process notation for running programs and setting up pipelines and redirections, and a complete syscall library for low-level access to the operating system, i.e. to POSIX , the least common denominator of more or less all Unices, plus widely supported extensions such as symbolic links and BSD sockets. Moreover, scsh provides an awk facility for pattern-directed computation over streams of records, a rich facility for matching regular-expression patterns in strings, event-based interrupt handling, user-level threads, a futuristic module system, and an interactive environment. Scsh comes with extensive documentation describing these and other features. The latest version of scsh is 0.6.6, released March 29, 2004. You may

135. CS343 Concurrent And Parallel Programming CS343 concurrent and Parallel programming with an emphasis on concurrency and writing concurrent programs at the programminglanguage level. http://www.student.cs.uwaterloo.ca/~cs342/

136. Concurrent Object-Oriented Programming In Python With ATOM concurrent ObjectOriented programming in Python with ATOM. http://www.python.org/workshops/1997-10/proceedings/atom/atom.html

Proceedings of the 6th International Python Conference Concurrent Object-Oriented Programming in Python with ATOM Michael Papathomas Anders Andersen Computing Department NORUT IT Lancaster University Lancaster LA1 4YR, UK michael@comp.lancs.ac.uk aandersen@acm.org Abstract 1 Introduction Object-oriented mechanisms, such as classes and inheritance, and concurrency mechanisms, such as threads and locks, provide two separate software structuring dimensions. The development of concurrent object-oriented software requires both dimensions to be taken into account simultaneously. Previous research has identified that substantial effort is required by programmers to avoid clashes in structuring software along these separate dimensions. This has led to the design of concurrent object-oriented programming models that integrate object-oriented features with concurrent execution and synchronization eliminating the need to consider two separate dimensions when developing concurrent object-oriented software [ There has been substantial research on Concurrent Object-Oriented Programming (COOP) models and several issues that have to be addressed by such models have been identified. However, research in the area are concentrated on the design of features that address particular issues in isolation and there is no consent on a programming model that addresses all these issues simultaneously. Furthermore, few languages incorporating the proposed features are widely available and little experience is reported from their use.

137. Hypersequential Programming: A New Way To Develop Concurrent Programs Hypersequential programming can produce a highly reliable concurrent program, by precluding the injection of harmful nondeterminism. http://doi.ieeecomputersociety.org/10.1109/4434.605918

Search: Advanced Search Home Digital Library Site Map ... July-September 1997 (Vol. 5, No. 3)   pp. 44-54 Hypersequential Programming: A New Way to Develop Concurrent Programs Naoshi Uchihira Shinichi Honiden Toshibumi Seki Full Article Text: DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/4434.605918 Abstract About References Back to Top References C.M. Pancake, "Software Support for Parallel Computing: Where Are We Headed?" Comm. ACM, Vol. 34, No. 11, Nov. 1991, pp. 53-64. ACM Computing Surveys, ... vol. 3, no. 2, pp. 166-178, Mar. 1992. [10] J. Burch, E. Clarke, K. McMillan, D. Dill, and L. Hwang, "Symbolic Model Checking: 1020States and Beyond," Proc. IEEE Symp. Logic in Computer Science, pp. 428-439, 1990. [1] D. Bernstein, and K. So, Debugging Parallel Programs by Serialization, US Patent No. 5048018, to IBM, Patent and Trademark Office, Washington, D.C., 1991. K.C. Tai, R.H. Carver, and E.E. Obaid, "Debugging Concurrent Ada Programs by Deterministic Execution,"

138. OOPSLA 2003 –– Advance Program -- Introduction To Concurrent Programming In Ja Official site of the OOPSLA 2003 Conference, Anaheim, California, October 2630, 2003. http://www.oopsla.org/oopsla2003/files/tut-2.html

Home Schedule Tracks Recommendations ... Tutorial Introduction to Concurrent Programming in Java David Holmes DLTeCH Pty Ltd dholmes@dltech.com.au Doug Lea State University of New York (SUNY) at Oswego dl@cs.oswego.edu Concurrent programming has mostly been the domain of systems programmers rather than application developers, but Java's support for concurrency has enticed many to try their hand at building concurrent applications. Concurrent programming poses many traps for the unwary, however. This tutorial demonstrates various design patterns and techniques for constructing concurrent applications in Java and for managing that concurrency. On the language side, we examine Java's mechanisms to support concurrent programming. On the design side, we explore object structures and design rules that can successfully resolve the competing forces (safety, liveness, efficiency, coordination, reusability) present in concurrent software design problems. Attendee background This tutorial targets anyone involved, or planning to get involved, in the development of concurrent object-oriented applications.

139. Concurrency - State Models & Java Programs Concurrency State Models Java Programs. Jeff Magee Jeff Kramer Demonstration Programs The set of demonstration programs in the book http://www-dse.doc.ic.ac.uk/concurrency/

Jeff Magee Jeff Kramer The following resources are available: Slides Demonstration Programs The set of demonstration programs in the book may be run as applets in a Java enabled browser from here. The program source is also included. Labelled Transition System Analyzer The LTS Analyzer can be run as an Applet from here in browsers which support Java 1.1 or later. Labelled Transition System Analyzer V2.2 This version also runs as an applet. It requires Java 1.3 Plugin published by Wiley New LTSA V2.2 - release(1/9/01) DOWNLOAD - LTS Analyzer Tool and Example Applets (3409KB) LTSA - bug fix release (14/4/99) Supplement on Program Verification (17/9/99) Errata (1/2/00) Solutions Comments, bugs, problems etc. - email jnm@doc.ic.ac.uk or jk@doc.ic.ac.uk

140. Index Of /classes/cs522 . DIR Parent Directory 02Mar-2004 1416 - DIR 1997/ 12-Jan-2000 1113 - DIR 1998/......Index of /classes/cs522. Name Last modified Size http://www.cs.arizona.edu/classes/cs522/

Index of /classes/cs522 Name Last modified Size Description ... Parent Directory 02-Mar-2004 14:16 - 12-Jan-2000 11:13 - 12-Jan-2000 11:13 - 12-Jan-2000 11:12 - 21-Mar-2001 14:05 - 25-Oct-2003 09:26 - 30-Oct-2002 16:26 - 04-Nov-2004 16:41 - 04-Nov-2004 16:41 - 04-Nov-2004 16:41 - 06-Mar-2002 17:00 - 02-Oct-2001 14:09 - 30-Oct-2002 16:26 - 30-Oct-2002 16:26 - 04-Nov-2004 16:41 - 04-Nov-2004 16:41 - 04-Nov-2004 16:41 - 30-Oct-2002 16:26 - 30-Oct-2002 16:26 - 04-Nov-2004 16:41 - 04-Nov-2004 16:41 - 04-Nov-2004 16:41 - Apache/1.3.33 Server at www.cs.arizona.edu Port 80

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Page 7     121-140 of 140    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7