The LaTeX full version of this Call for Papers is available.
Static Analysis is increasingly recognised as a fundamental tool for high performance implementations and verification systems of high-level programming languages. The last two decades have witnessed substantial developments in this area, ranging from theoretical frameworks to design and implementation of analysers and their applications in optimising compilers. The technical program will consist of invited lectures, presentations of refereed papers and software demonstrations. Contributions are welcome on all aspects of Analysis, including, but not limited to: Abstract Interpretation; Optimising Compilers; Applications; Specific Analyses; Complexity; Theoretical Frameworks; Experimental Evaluation; Verification Systems; Fixpoint Algorithms; Type Inference; Partial Evaluation; Abstract Domains.
Important Dates Subm: 15 April; Notif: 10 June; Final Vers: 3 July.
Contact and Submission address Email: sas-95@cl.cam.ac.uk
Tel: +44 1223 334621; Fax: +44 1223 334678
Post: Alan Mycroft, Computer Laboratory, New Museums Site
Pembroke Street Cambridge, CB2 3QG, United Kingdom.
Submissions can address any programming paradigm including concurrent, constraint, functional, imperative, logic and object oriented programming. Survey papers which present aspects of the above topics with a new coherence are also welcomed.
Papers must be written in English, max 15 pages (excluding references and figures) and must contain a cover page including the following: a 200 word abstract, keywords, and postal and e-mail addresses as well as phone numbers and fax numbers of one of the authors.
Submissions should be sent to the following addresses: either e-mail a WWW URL descriptor for your submission; or e-mail a Postscript or (uuencoded) DVI file; or send six paper copies. (Electronic submission is prefered but do ensure that your submission is self-contained and prints on A4 paper.) Also e-mail an ascii or Latex version of the cover page if possible. Information on SAS'95 is also on the WWW .