headers
John Reppy | 1 Jun 2005 16:48
Favicon

type-sensitive CFA?

[The Types Forum, http://lists.seas.upenn.edu/mailman/listinfo/types-list]

I'm looking at a program analysis problem for ML-like languages where
I want to exploit type abstraction to improve the precision of a
standard 0-CFA type analysis.  I was wondering if such analyses have
been previously studied and/or implemented?  Any pointers would
appreciated.  Thanks.

     - John
Permalink | Reply | 3 comments |
headers
Ralph.Matthes | 1 Jun 2005 21:40
Picon
Favicon

Job offer in Munich in Theoretical Computer Science

[The Types Forum, http://lists.seas.upenn.edu/mailman/listinfo/types-list]

The Research and Teaching Unit for

Theoretical Computer Science

at the Ludwig-Maximilians-University Munich invites applications for
the position of a 

Wissenschaftlicher Assistent (postdoc with teaching obligation) 

start date:  15th October 2005 (negotiable) 
deadline for applications: 1st July 2005

The position is for 3 years initially; an extension for another 3
years is possible thereafter. 

We offer the option of habilitation. The position is connected with a
teaching activity of 5 hours per week during term time. 

The research interests of candidates should fit within and complement
the present spectrum of themes at the Research and Teaching Unit for
Theoretical Computer Science. Possible research areas are for example,
but not exclusively, mathematical logic with regard to computer
science, theory of complexity and algorithms related to logic and
programming, automated reasoning, theory of programming languages,
formal methods. 

Applicants should have a relevant PhD degree. We offer a modern,
friendly, and cooperative working environment.
(Continue reading)

Permalink | Reply | 0 comments |
headers
Nadia Tawbi | 2 Jun 2005 15:25
Picon

Re: type-sensitive CFA?

[The Types Forum, http://lists.seas.upenn.edu/mailman/listinfo/types-list]

Hi John,

  we have presented a work on this subject in IFL 1996.
Here is the reference in bibtex.

 <at> InProceedings{DFT96,
  author =       "M. Debbabi and A. Faour and N. Tawbi",
  title =        "Efficient Type-Based Control-Flow Analysis of
                     Higher-Order Concurrent Programs",
  booktitle =    "Proceedings of the International Workshop on
		  Functional and Logic Programming, IFL'96",
  publisher =    "Spriger-Verlag LNCS 1268",
  pages = {247--266},
 month = sep,
  year =         "1996"
}

Regards,

Nadia

Quoting John Reppy <jhr@...>:

> [The Types Forum, http://lists.seas.upenn.edu/mailman/listinfo/types-list]
>
> I'm looking at a program analysis problem for ML-like languages where
> I want to exploit type abstraction to improve the precision of a
> standard 0-CFA type analysis.  I was wondering if such analyses have
(Continue reading)

Permalink | Reply | 2 comments |
headers
John Reppy | 2 Jun 2005 15:44
Favicon

Re: type-sensitive CFA?

[The Types Forum, http://lists.seas.upenn.edu/mailman/listinfo/types-list]

Thanks for the pointer, but I think my original question was not clear 
enough.
I'm not interested in analyses that are based on type systems or 
analyses that
are used to compute type information, but rather analyses for typed 
languages that
take advantage of type information to improve the analysis.

	- John

On Jun 2, 2005, at 8:25 AM, Nadia Tawbi wrote:

> Hi John,
>
>   we have presented a work on this subject in IFL 1996.
> Here is the reference in bibtex.
>
>
>  <at> InProceedings{DFT96,
>   author =       "M. Debbabi and A. Faour and N. Tawbi",
>   title =        "Efficient Type-Based Control-Flow Analysis of
>                      Higher-Order Concurrent Programs",
>   booktitle =    "Proceedings of the International Workshop on
> 		  Functional and Logic Programming, IFL'96",
>   publisher =    "Spriger-Verlag LNCS 1268",
>   pages = {247--266},
>  month = sep,
>   year =         "1996"
(Continue reading)

Permalink | Reply | 1 comment |
headers
Michael Hicks | 2 Jun 2005 21:35
Picon
Favicon

SCOOL

[The Types Forum, http://lists.seas.upenn.edu/mailman/listinfo/types-list]

If you are working on type-based solutions to concurrency problems (or 
other semantics issues involving concurrency), your submission to this 
workshop would be most welcome!
-Mike

                   Synchronization and Concurrency in

                   Object-Oriented Languages (SCOOL)

            OOPSLA 2005 Workshop, San Diego, California, USA

                        Sunday October 16, 2005

Call for papers

   As mainstream hardware moves to multicore processors, programmers
   will be forced to write multithreaded programs in order to achieve
   high performance.  One thing seems clear: mainstream programmers
   cannot use today's abstractions of locks, condition variables,
   semaphores, and barriers to develop scalable parallel software
   effectively.  This workshop addresses the problem of how best to
   express synchronization and concurrency in object-oriented
   multithreaded programming environments.

   This workshop will bring together researchers working on different
   parts of this problem, including: frameworks and libraries for
   concurrent object-oriented programming, patterns in concurrent
   software, tools for detecting concurrency-related bugs, new
(Continue reading)

Permalink | Reply | 0 comments |
headers
Josef Svenningsson | 3 Jun 2005 15:42
Picon
Gravatar

Re: type-sensitive CFA?

[The Types Forum, http://lists.seas.upenn.edu/mailman/listinfo/types-list]

On 6/2/05, John Reppy <jhr@...> wrote:
> [The Types Forum, http://lists.seas.upenn.edu/mailman/listinfo/types-list]
> 
> Thanks for the pointer, but I think my original question was not clear
> enough.
> I'm not interested in analyses that are based on type systems or
> analyses that
> are used to compute type information, but rather analyses for typed
> languages that
> take advantage of type information to improve the analysis.
> 
A collection of papers concerning type based analysis has been
collected by Jens Palsberg here:
http://www.cs.ucla.edu/~palsberg/tba/

Christian Mossins Ph.D. thesis (which can be found on the above page)
contains a couple of flavours of flow analysis. The papers by Nevin
Heintze should also be relevant to you.

/Josef Svenningsson
Permalink | Reply | 0 comments |
headers
Carlos Martin-Vide | 5 Jun 2005 06:01

sabbatical positions: 2005-10

[The Types Forum, http://lists.seas.upenn.edu/mailman/listinfo/types-list]

Apologies for multiple posting!
Please, pass the information to whom may be interested. Thanks.

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

A few sabbatical positions may be available in 2006-2007 in the Research Group on Mathematical
Linguistics at Rovira i Virgili University (Tarragona, Spain).

The web site of the host institute is:

http://www.grlmc.com

ELIGIBLE TOPICS

The eligible topics are the institute's current or future research directions:

- Formal language theory and its applications.
- Biomolecular computing and nanotechnology.
- Bioinformatics.
- Language and speech technologies.
- Formal theories of language acquisition and evolutionary linguistics.
- Computational neuroscience.

Other related fields might still be eligible provided there exist strong enough candidates for them.

JOB PROFILE

- Top-level appointments for experienced researchers being on leave from their home organization.
(Continue reading)

Permalink | Reply | 0 comments |
headers
Prof Faron G Moller | 5 Jun 2005 15:19
Picon
Picon
Favicon

PhD Studentships at Swansea University

[The Types Forum, http://lists.seas.upenn.edu/mailman/listinfo/types-list]

PhD Studentships in Computer Science

Swansea University

Three 3-year fully-funded PhD studentships, funded by the Engineering
and Physical Sciences Research Council (EPSRC), are available from
October 2005 (though the start date is negotiable).  The awards cover
academic fees plus living expenses (which amount to £12,000 for the
2005/2006 academic year).  These awards are open to EU Applicants.

The successful applicants may work in any one of our three main
Research Groups:  Theory, Graphics, or HCI.  One of the positions
will be tied to a specific project in Computability and Physical
Systems under the direction of Professor John Tucker and Dr Edwin
Beggs (Maths), and will formally be carried out in the Mathematics
Department.  The remaining positions have no a priori designation.

Information about the Department at Swansea University can be found
at
                http://www.swan.ac.uk/compsci

For further information and details of how to apply, please refer to
the web page
                http://www2.swan.ac.uk/postgraduate/index.html

where you will find all the information you need to apply for a
postgraduate position, particularly under the heading "Applying
& Further Information" where, by clicking on the link "How to apply"
(Continue reading)

Permalink | Reply | 0 comments |
headers
ICLP 2005 | 6 Jun 2005 12:26
Picon
Favicon

ICLP 2005: Call for Posters

[The Types Forum, http://lists.seas.upenn.edu/mailman/listinfo/types-list]

                 Final Call for poster submissions

    21st. INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING (ICLP'05)

                          Oct 2-5, 2005
                    Sitges (Barcelona), Spain

               http://www.iiia.csic.es/iclp2005/

* Conference scope. Poster contributions
  are sought in all areas of logic programming including:

  Theory (semantic foundations, formalisms, non-monotonic reasoning,
    knowledge representation, inductive logic programming)
  Language issues (constraints, concurrency, objects, coordination,
    higher order, types, modes, programming techniques)
  Implementation (compilation, memory management, virtual machines,
    parallelism)
  Environments (program analysis, program transformation, validation
    and verification, debugging)
  Applications (deductive databases, software engineering, natural
    language, web tools, internet agents, artificial intelligence,
    molecular biology)

* The ICLP Posters provide an excellent forum for authors to present
  their work in an informal and interactive setting. Posters are ideal
  for presenting speculative, late-breaking results or for giving an
  introduction to interesting, innovative work. Posters provide authors
(Continue reading)

Permalink | Reply | 0 comments |
headers
Dimitra Giannakopoulou | 6 Jun 2005 20:00
Picon
Picon

SAVCBS'05 **** DEADLINE EXTENSION ****

[The Types Forum, http://lists.seas.upenn.edu/mailman/listinfo/types-list]

===============================================

Please note the new submission deadline: June 20, 2005 

===============================================

CALL FOR PAPERS

	SAVCBS'05
	(Specification and Verification of Component-Based Systems)
	Workshop at ESEC/FSE 2005
	September 5-6, 2005
	Lisbon, Portugal

	http://www.cs.iastate.edu/SAVCBS/

The fourth workshop on specification and verification of component-based
systems is affiliated with ESEC/FSE'05 and will be held at the Campolide
campus of the New University of Lisbon, Portugal, September 5-6, 2005.

Seven page papers are due on May 23, 2005.

THEME AND TOPICS OF INTEREST

SAVCBS is focused on using formal (i.e., mathematical) techniques to
establish a foundation for the specification and verification of
component-based systems.  Suggested research topics of interest include
(but are not limited to):
(Continue reading)

Permalink | Reply | 0 comments |

Gmane