Archive for November 20th, 2008

[Concurrency] CFP: NASA Formal Methods 2009

————————————————–
CALL FOR PAPERS
————————————————–
The First NASA Formal Methods Symposium (NFM 2009)
http://ti.arc.nasa.gov/event/nfm09/
April 6 - 8, 2009 Moffett Field, California, USA
————————————————–
IMPORTANT DATES:
————————————————–
Submission: January 30, 2009
Notification: February 27, 2009
Final version: March 15, 2009
————————————————–
THEME OF CONFERENCE:
————————————————–
The widespread use and increasing complexity of safety-critical
systems require advanced techniques that address their verification
and certification […]

ISMM 2009 Call for Papers

International Symposium on Memory Management 2009
http://sysrun.haifa.il.ibm.com/hrl/ISMM2009
[…]

[Concurrency] PhD position: Trust and Authority in an Open Web

PhD POSITION:
“Trust and Authority in an Open Web Environment”
at the VU University Amsterdam, Department of Computer Science
Deadline for applications: December 15, 2008
THE POSITION
This PhD position is concerned with management of trust and authority
for accessing, integrating and distributing information resources with
varying access limitations, ranging from open Web sources to
confidential sources. […]

[Concurrency] PHD POSITION, Uppala University,

Phd Position at Uppsala University
Modeling Communication protocols and Automata Learning
within the starting European project CONNECT
Deadline: Dec. 12,
More details below.
Uppsala University announces the following
PhD position
Generating models of network components from observations of their behaviour
Background: The importance of model-based techniques for development and
verification has motivated research into automated techniques for
generating
or $-1??discovering?? models and specifications of program […]

Postdocs at the Caltech CMI

Caltech’s Center for the Mathematics of Information (CMI)
announces openings in the CMI Postdoctoral Fellowship Program,
starting in fall 2009. The CMI is dedicated to fundamental
mathematical research with an eye to the roles of information
and computation throughout science and engineering. Areas of
interest include algorithms, complexity, applied
combinatorics, applied probability, statistics, information
and coding theory, geometry processing, multiresolution
methods, control and […]