headers
Kim Bruce | 7 Dec 1998 20:34
Picon

Final program for FOOL 6

The final program for the sixth international workshop on Foundations of
Object-Oriented Languages (FOOL 6) is available on-line at 
http://www.cs.williams.edu/~kim/FOOL/FOOL6.html.  Information on registration
is also available there.  The advance registration deadline is December 23.

The workshop is co-located with POPL '99 and will be held on Saturday, 
January 23, 1999, in San Antonio, Texas.

	Kim Bruce
Permalink | Reply | 0 comments |
headers
Magne Haveraaen local | 9 Dec 1998 19:42
Picon
Picon

Positions in Programming Theory, University of Bergen

Department of Informatics, University of Bergen announces several positions
in
	Computer science: Programming theory

 - Full professorship: new deadline for application is January  15 1999
 - Associate professorship:    application deadline is December 21 1998
 - Ph.D. Scholarship:          application deadline is December 21 1998

General information about the positions and application procedure at
	http://www.ii.uib.no/gen/stilling.html

For more information contact any member of the programming theory group:
	Magne Haveraaen - magne@... - http://www.ii.uib.no/~magne
	Khalid Mughal - khalid@... - http://www.ii.uib.no/~khalid
	Michal Walicki - michal@... - http://www.ii.uib.no/~michal
	Valentinas Kriauciukas - valis@... - http://www.ii.uib.no/~valis

General information about the programming theory group, the department,
the university and Bergen may be found at
	http://www.ii.uib.no/pt/index_e.html
	http://www.ii.uib.no/index_e.shtml
	http://www.uib.no/elin/hovedside/index-e.html
	http://www.uib.no/guide
Permalink | Reply | 0 comments |
headers
Rance Cleaveland | 10 Dec 1998 17:46
Picon
Favicon

TACAS '99 Accepted Papers

Below, please find the list of papers that have been accepted for prese=ntation
at the 1999 Conference on Tools and Algorithms for the Construction and
Analysis of Systems (TACAS '99).  TACAS '99 is a constituent of the European
Joint Symposia on Theory and  Practice of Software (ETAPS '99), to be held in
Amsterdam.

For more information on the conference, please consult its URL:
http://www.csc.ncsu.edu/tacas99.

Rance Cleaveland
TACAS '99 PC Chair

-------------------------
TACAS '99 ACCEPTED PAPERS
-------------------------

Modular State Level Analysis of Distributed Systems - Techniques and
Tool Support
    Peter Buchholz, Peter Kemper
        Informatik IV
        University of Dortmund
        Germany

DYANA: An Environment for Embedded System Design and Analysis
    R.L. Smeliansky, A.G. Bakhmurov, A.P. Kapitonova
        Dept. of Computational Mathematics and Cybernetics
        Moscow State University
        Russia

Using Logic Programs with Stable Model Semantics to Solve Deadlock and
(Continue reading)

Permalink | Reply | 0 comments |
headers
Daniele Turi | 16 Dec 1998 19:26
Picon
Picon

abstract syntax and variable binding

The preprint

	Abstract Syntax and Variable Binding 

by 

	M. Fiore, G. Plotkin, and D. Turi

is available as

	http://www.dcs.ed.ac.uk/~dt/abstractsyn.ps

Synopsis:

We develop a theory of abstract syntax with variable binding.
To every binding signature we associate a category of models
consisting of \emph{variable sets} endowed with both a (binding) 
algebra and a substitution structure compatible with each other.
The syntax generated by the signature is the initial model.
This gives a notion of initial algebra semantics encompassing
the traditional one; besides compositionality, it automatically 
verifies the semantic substitution lemma.
Permalink | Reply | 0 comments |
headers
Dilip Sequeira | 17 Dec 1998 13:48
Picon
Picon

Thesis Announcement: Type Inference with Bounded Quantification


I am pleased to announce the availability of my (slightly misleadingly
titled) PhD thesis:

              "Type Inference with Bounded Quantification"
                              (1998)
[Abstract below]

The thesis is available electronically from the LFCS on-line
repository of technical reports:

     <http://www.dcs.ed.ac.uk/lfcsreps/>

Paper copies can be ordered from: 

Kendal Reid <reports@...>,
Laboratory for Foundations of Computer Science (LFCS),
The University of Edinburgh,
JCMB, The Kings Buildings,
Mayfield Road,
Edinburgh EH9 3JZ,
UK.

---------------------------- Abstract --------------------------

In this thesis we study some of the problems which occur when type
inference is used in a type system with subtyping. An underlying poset of
atomic types is used as a basis for our subtyping systems. We argue that
the class of Helly posets is of significant interest, as it includes
lattices and trees, and is closed under type formation not only with
(Continue reading)

Permalink | Reply | 0 comments |
headers
Sjouke Mauw | 21 Dec 1998 09:52
Picon
Picon
Favicon

CONCUR'99 CFP

                            CALL FOR PAPERS

                               CONCUR'99
          10th International Conference on Concurrency Theory
            Eindhoven, The Netherlands, August 24--27, 1999.

                   URL http://www.win.tue.nl/concur99/
                         E-mail concur99@...

(apologies for multiple copies)

A postscript version of this call for papers can be found on the above
mentioned website.

SCOPE
The purpose of the CONCUR conferences is to bring together researchers,
developers and students in order to advance the theory of concurrency,
and promote its applications. Interest in this topic is continuously
growing, as a consequence of the importance and ubiquity of concurrent
systems and their applications, and of the scientific relevance of
their foundations. Submissions are solicited in all areas of semantics,
logics and verification techniques for concurrent systems.

Topics include (but are not limited to) concurrency related aspects of:
models of computation and semantic domains, process algebras, Petri
nets, event structures, real-time systems, hybrid systems,
decidability, model-checking, verification techniques, refinement
techniques, term and graph rewriting, distributed programming, logic
constraint programming, object-oriented programming, typing systems and
algorithms, case studies, tools and environments for programming and
(Continue reading)

Permalink | Reply | 0 comments |
headers
Dave Schmidt | 30 Dec 1998 00:53
Favicon

studentship positions


The Laboratory for Specification, Analysis and Transformation of 
Software (SAnToS) at Kansas State University announces openings
for several funded Ph.D. studentships for Autumn 1999.  

The laboratory consists of 5 faculty members, Matthew Dwyer, John 
Hatcliff, Michael Huth, David Schmidt, and Allen Stoughton, as well 
as several visiting and post-doctoral researchers, doctoral and masters
students.  

The lab's research is devoted to theory and application of such topics as
program logics, static analysis, semantics, abstract interpretation,
partial evaluation, and model checking. 

Current projects include:
- Development and application of a common framework for expressing
  data-flow analyses, abstract interpretations, and model checking,
  where temporal logic is used as the common language for discourse.

- Application of partial evaluation to naive static analysis algorithms
  so as to generate useful implementations of slicing, code inlining,
  flow analysis, etc.

- Design and implementation of tools for compiling Java source code to 
  abstracted transition systems that can be used by non-formal methods
  experts to model check rudimentary safety properties. 

- Comparative empirical evaluation of existing approaches to finite-state
  verification to characterize effectiveness of automated
  verification with regards to classes of systems and correctness
(Continue reading)

Permalink | Reply | 0 comments |

Gmane