|Compiler positions available for week ending April 20 firstname.lastname@example.org (2003-04-20)|
|Compiler positions available for week ending April 20 email@example.com (1997-04-20)|
|Date:||20 Apr 1997 12:23:27 -0400|
This is a digest of ``help wanted'' and ``position available'' messages
received at comp.compilers during the preceding week. Messages must
advertise a position having something to do with compilers and must also
conform to the guidelines periodically posted in misc.jobs.offered.
Positions that remain open may be re-advertised once a month. To respond
to a job offer, send mail to the author of the message. To submit a
message, mail it to firstname.lastname@example.org.
From: Greg Michaelson <email@example.com>
Subject: UK PhD Scholarship - Program Transformation
Date: 15 Apr 1997 16:26:52 GMT
Organization: Dept of Computing & Electrical Engineering, Heriot-Watt University, Scotland
``Proof Planning for Program Transformation''
Andrew Ireland, Peter King, Greg Michaelson
Dependable Systems Group
Computing and Electrical Engineering
The lack of effective methodologies for parallel programming
represents a major hurdle to the widespread use of parallel
computers. One approach to overcoming this hurdle is to develop
parallelising compilers. The studentship on offer is linked to an
EPSRC funded research programme (EPSRC grant GR/L42889:
``Parallelising compilation of Standard ML through prototype
instrumentation and transformation'') which will investigate such an
approach. A major deliverable of this research programme will be a
parallelising compiler for a subset of Standard ML which automatically
generates portable parallel C.
The focal point of the studentship will be the development of the
transformation component of the compiler. Techniques for automatically
transforming functional code so as to maximize the opportunities for
exploiting parallelism will play a pivotal role within the
compiler. Formal correctness will be crucial to the transformation
work since it directly effects the integrity of the compiler. To
address this concern we aim to exploit the strong connections which
exist between computation and formal proof. Transformation will be
viewed as the manipulation of proofs rather than programs. As a
consequence, automated theorem proving techniques will under-pin the
transformation component. The intention is to build upon the notion of
a proof plan . A proof plan provides a representation of the common
structure which defines a family of proofs. This common structure can
be used to automate the search for particular proofs.
The proof plan ideas have been used to optimize functional code
through proof transformation . In the context of our work we
envisage the development of proof plans for controlling the synthesis,
verification and application of program transformations. We have
already obtained promising results  using the proof plans approach
in verifying transformations. The synthesis of transformations is
essentially a program synthesis task. Proof plans have been shown to
provide an effective framework for synthesizing functional programs
[1,3]. Our application, however, calls for the synthesis of
higher-order functions which has not been extensively investigated.
The Dependable Systems Group
The central aim of the Dependable Systems Group is to promote the
reliability, safety, security and performance of software systems
through the development of techniques and methodologies which have a
formal or rigorous basis.
The group comprises of 3 Academic Staff, 2 Research Assistants, 4 PhD
students and 2 visiting Research Fellows. In addition to EPSRC grant
GR/L42889 the group also collaborates with the Mathematical Reasoning
Group at the University of Edinburgh through EPSRC grant GR/L11724.
If you wish further information please do not hesitate to contact
either Dr Andrew Ireland (email: firstname.lastname@example.org, tel: 0131 451 3409)
or Dr Greg Michaelson (email: email@example.com, tel: 0131 451 3422)
who will be jointly supervising the studentship.
 Alan Bundy, A.Smaill, and J.Hesketh.
Turning eureka steps into calculations in automatic
In S.L.H. Clarke, editor, Proceedings of UK IT 90 221--6, 1990.
 Alan Bundy.
The use of explicit plans to guide inductive proofs.
In R.Lusk and R.Overbeek, editors, 9th Conference on Automated
Deduction, pages 111--120. Springer-Verlag, 1988.
 J.Hesketh, A.Bundy, and A.Smaill.
Using middle-out reasoning to control the synthesis of
In Deepak Kapur, editor, 11th Conference on Automated Deduction,
1992. Published as Springer Lecture Notes in Artificial
Intelligence, No 607.
 A.Ireland and A.Bundy.
Extensions to a Generalization Critic for Inductive Proof.
In M.A. McRobbie and J.K. Slaney, editors, 13th Conference on
Automated Deduction, pages 47--61. Springer-Verlag, 1996.
Springer Lecture Notes in Artificial Intelligence No. 1104.
Automatic program optimization via the transformation of
Nuprl synthesis proofs.
In L.Clarke, editor, Proceedings of the 1988 Alvey Technical
Conference. The Alvey Directorate, 1988.
Also available from Edinburgh as DAI Research Paper 392
From: firstname.lastname@example.org (the shadow)
Subject: Compiler Engineering at Intel in Oregon
Date: 16 Apr 1997 15:53:16 GMT
Compiler Engineering opportunities at Intel in Oregon
We have positions, in Oregon, for experienced engineers interested in
working on various aspects of a product compilers. Some positions
require very expert knowledge of compilers, other require only a high
level knowledge of software tools including compilers.
We have immediate openings in compiler development, engineering
support, technical marketing, and some directed research and
development to support future processor architectures.
Our team develops very advanced compiler products currently used by
companies with products seeking performance advantages through the use
of superior compiler technology to build their products. Our team is
growing due to increased demand for our product and we are seeking
motivated and flexible compiler engineers with strong programming and
problem solving skills.
The ideal candidate for our team will have:
* Strong problem solving skills
* C programming experience
* Working knowledge of software design
* Knowledge of compilers
* Strong desire to work on real products
Other desirable qualifications include:
* Compiler development experience
* Customer interaction experience
* Experience with Win/NT
* Knowledge of C++
* Knowledge of computer architecture
* Knowledge of Fortran
* Performance analysis/benchmarking experience
We offer a very competitive salary, excellent benefits and a relocation
Please submit an ASCII text resume to email@example.com.
[Also see http://www.lightlink.com/fors/ -John]
Date: 18 Apr 1997 14:15:44 -0500
From: "DAR" <firstname.lastname@example.org>
Subject: Compiler tools job [agent]
Our client is looking for an individual to make tool and compiler
level enhancements to their interactive performance analyzer and
symbolic program debugger. These tools support debugging and
profiling of highly optimized parallel applications. The candidate
will work on compiler-tool interfaces.
This will involve design, implementation, testing, within the tools
PhD., MS, or BS with 2 years experience. Familiarity with object-oriented
development and C++. UNIX software development experience. Good oral and
written communication skills, strong analytical skills,
Interests in one or more of the following areas:
- different phases of compilation especially compiler optimization, code
generation, and object file generation.
- experience with object file formats
- development of symbolic debuggers and performance analysis tools
- shared memory or distributed multiprocessor systems
- program optimization on parallel architectures
- Fortran, C, and/or assembly language
Please email your cv to DAR/CC, Scientific Placement, EMail:
Return to the
Search the comp.compilers archives again.