posted 7 Mar 2012 12:25 by Stephen Taylor
British APL Association (London) presents a talk by Dr James A. Brown."The Future of APL".⍺An evolution from his Berlin talk, refined for San Jose APLBUG and again refined for NYSIGAPL.It will be presented at:The Albion2/3 New Bridge StreetCity of LondonLondonEC4V 6AAhttp://maps.google.co.uk/maps?q=The+Albion+EC4V+6AAon Thursday, 19 April 2012 at 7.30 p.m. "In 2010, at the international APL Conference in Berlin, it was surprising to see how much new work is being done by the APL vendors. APL is alive and well and is evolving. I will discuss the various features of APL offerings and give my feelings on which should be preserved and which I would be willing to give up. I will discuss newer technologies including parallelism and distributed processing which provide platforms where array technology can thrive. I will discuss a project to move APL computing to the Cloud."Jim Brown's Ph.D. thesis contained many of the extensions realized in IBM's APL2. He was IBM's chief architect for APL2. After retiring from IBM he founded SmartArrays with James Wheeler from STSC/Manugistics/APL2000. He has recently formed NestedComputing with Mircea Morosan, Morten Kromberg, and Gitte Christensen. |
posted 20 Feb 2012 08:25 by Stephen Taylor
In the proud tradition of APL Mooting from Ray Cannon's legendary early moots via Paul Mansour’s Kefalonian & Tuscan extravaganzas to Stephen Taylor’s inspired Iverson College in Cambridge we bring you the 2012 BAPLA AGM & Moot to be held at the YHA Lee Valley Youth Hostel, Cheshunt, on Friday-Sunday, 27-29 April. The event will start around midday Friday with the AGM at 14.30, the moot continuing into the evening, all Saturday ’til 16.00 on Sunday. We hope existing and new members will come along bringing ideas, demos, stories, games and work. There will be one or two presentations at the AGM and time will be allocated for plenary sessions during the moot for presentations or discussions. Limited places are reserved on a full-board basis for the duration. For full details please see http://moot.aplwiki.com/ where any comments and suggestions should be made. |
posted 3 Feb 2012 09:50 by Stephen Taylor
APL2000 User Conference 2012 will be held April 22 -24 in Jersey City NJ, across the Hudson River from New York City. You can find conference details including the presentation topics and registration information here:http://www.apl2000.com/conf2012/info.htm If you have any questions send an e-mail to sonia.beekman@apl2000.com |
posted 5 Jan 2012 06:27 by Stephen Taylor
In a new article, Stephen Taylor describes techniques for handling high-rank or ‘noble’ arrays, leading to a memorable understanding of the left argument of dyadic transpose. |
posted 1 Jan 2012 13:24 by Stephen Taylor
In two new articles Phil Last explains his famously – or infamously? – terse APL coding practices, including extensive use of user-defined operators. Read Co-operators and A way to write functions. |
posted 1 Jan 2012 07:47 by Stephen Taylor
[
updated 1 Jan 2012 09:55
]
New article by Kai Jaeger gives the background to the Dyalog APLTree project. |
posted 22 Dec 2011 05:31 by Stephen Taylor
[
updated 22 Dec 2011 05:32
]
New article: Ulmann blends APL and Forth to produce the tiny but potent stack-based 5 language. Something in your cup, and it’s not Java. |
posted 21 Dec 2011 08:44 by Stephen Taylor
[
updated 21 Dec 2011 08:45
]
posted 21 Dec 2011 05:17 by Stephen Taylor
[
updated 21 Dec 2011 05:17
]
The following message contains information about upcoming SIGPLAN conferences and other activities that may be of interest to SIGPLAN members. * ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Philadelphia, PA, January 25-27, 2012* CRA-W/CDC and SIGPLAN Programming Languages Mentoring Workshop, Philadelphia, PA, Jan 24, 2012* 24th International Conference on Computer Aided Verification (CAV 2012) July 7-13, 2012 Berkeley, California, USA* IEEE Computer Special Issue on Massively Threaded Computer Systems (Deadline: 15 February 2012)* WoDet 3: Third Workshop on Determinism and Correctness in Parallel Programming, London, England, March 3, 2012* ASPLOS call for posters & provocative ideas* CGO2012 Call for Workshops and Tutorials* CFP: CGO 2012 ACM Student Research Competition######################################################################*************************************************************** ACM SIGPLAN-SIGACT Symposium* on* Principles of Programming Languages** January 25-27, 2012* Philadelphia, PA, USA** Call for Participation** http://www.cse.psu.edu/popl/12/***************************************************************Important dates------------------------* Hotel reservation deadline: December 24, 2011* Early registration deadline: December 24, 2011* Conference: January 25-27, 2012* Colocated events: January 22-29, 2012Registration--------------------------To register online, please go to https://regmaster3.com/2012conf/POPL12/register.phpThe early registration deadline is December 24, 2011.Hotel-------------------------All the conference events will take place at the Sheraton Society HillHotel in Philadelphia's historic district. We encourage attendees tostay at the conference hotel. Information about the hotel can be foundon the POPL web page: http://www.cse.psu.edu/popl/12/To be eligible for the special conference rate, bookings must be madeby December 24, 2011. However, as the conference rate applies only toa limited number of rooms, attendees are encouraged to make theirhotel reservations at the earliest opportunity.Scope-------------------------The annual Symposium on Principles of Programming Languages is a forumfor the discussion of fundamental principles and important innovationsin the design, definition, analysis, transformation, implementationand verification of programming languages, programming systems, andprogramming abstractions. Both experimental and theoretical papers arewelcome.Preliminary program--------------------------A preliminary program can be found at the end of this email in textformat, or it can be found here: http://www.cse.psu.edu/popl/12/program.htmlProgram Highlights-------------------------Invited talks:* Sir Charles Antony Richard Hoare, FRS, FREng, FBCS, MicrosoftResearchACM SIGPLAN Programming Languages Achievement Award Interview* J Strother Moore, University of Texas at AustinMeta-Level Features in an Industrial-Strength Theorem Prover* Jennifer Rexford, Princeton UniversityProgramming Languages for Programmable NetworksOther attractions-------------------------POPL TutorialFest!:POPL 2012 will have a TutorialFest! event with seven "distilled" 90minute tutorials. This event is on January 28, immediately followingthe main POPL conference. The TutorialFest! requires separateregistration and registrants of TutorialFest! may attend any of thetutorials offered throughout the day.More information on the TutorialFest! is available at:http://www.cse.psu.edu/popl/12/tutorial.htmlAffiliated Events--------------------------* POPL TutorialFest: January 28, 2012* VMCAI:Verification Model Checking and Abstract Interpretation * January 22-24, 2012 http://lara.epfl.ch/vmcai2012/* LADA: Languages for Distributed Algorithms * January 23-24, 2012 http://sites.google.com/site/ladameeting/* PADL: Practical Applications of Declarative Languages * January 23-24, 2012 http://research.microsoft.com/en-us/um/people/crusso/padl12/* PEPM: Partial Evaluation and Semantics-Based Program Manipulation * January 23-24, 2012 http://www.program-transformation.org/PEPM12* PLMW: The CRA-W/CDC and SIGPLAN Programming Languages Mentoring Workshop * January 24, 2012 http://www.cis.upenn.edu/~sweirich/plmw12/* PLPV: Programming Languages meets Program Verification * January 24, 2012 http://research.microsoft.com/en-us/um/people/nswamy/plpv12/* DAMP: Declarative Aspects of Multicore Programming * January 28, 2012 http://www.mpi-sws.org/~umut/damp2012/* OBT: Off the Beaten Track: Underrepresented Problems for Programming Language Researchers * January 28, 2012 http://www.cs.princeton.edu/~dpw/obt/* TLDI:Types in Language Design and Implementation * January 28, 2012 http://www.cis.upenn.edu/~bcpierce/tldi12/* VSTTE: Verified Software: Theories, Tools and Experiments* January 28-29, 2012 https://sites.google.com/site/vstte2012/Travel awards and visa support letters--------------------------------A limited number of grants are available through the SIGPLANProfessional Activities Committee (PAC) to support students going toPOPL. You must be an ACM member to apply.Students that are interested in attending both POPL and the PLMWWorkshop should first seek funds via PLMW and then contact PAC if thePLMW grant is not awarded. PLMW grants are explained on the PLMWwebsite.Requests for visa support letters for purposes of attending orpresenting at POPL 2012 are handled by ACM. More information isavailable on the POPL 2012 website.Program---------------------------Wednesday, January 25===========================* 8:30-9:20: Breakfast* 9:20-9:30: Welcome* 9:30-10:30: Invited Talk (Session chairs: Andrew P. Black, PeterO'Hearn)- SIGPLAN Distinguished Achievement Award Presentation and Interview Tony Hoare, Microsoft Research.* 10:30-11:00: Break* 11:00-12:30: Session on Verification (Chair: Ranjit Jhala):-Freefinement (Stephan van Staden, Cristiano Calcagno, and BertrandMeyer)- Underspecified harnesses and interleaved bugs (Saurabh Joshi,Shuvendu Lahiri, and Akash Lal)- A Program Logic for JavaScript (Philippa Gardner, Sergio Maffeis, and Gareth Smith)* 11:00-12:30: Session on Semantics (Chair: Patricia Johann):- Higher-Order Functional Reactive Programming in Bounded Space (Neelakantan R Krishnaswami and Nick Benton and Jan Hoffmann)- The Marriage of Bisimulations and Kripke Logical Relations(Chung-Kil Hur, Derek Dreyer, Georg Neis, and Viktor Vafeiadis)- Information Effects (Roshan James and Amr Sabry)* 12:30-2:00: Lunch* 2:00-3:30: Session on Privacy and Access Control (Chair: NikhilSwamy):- A Language for Automatically Enforcing Privacy Policies (Jean Yang,Kuat Yessenov, and Armando Solar-Lezama)- Probabilistic Relational Reasoning for Differential Privacy (GillesBarthe, Boris Köpf, Federico Olmedo, and Santiago Zanella Beguelin)- Access Permission Contracts for Scripting Languages (PhillipHeidegger, Annette Bieniusa, and Peter Thiemann)* 2:00-3:30: Session on Decision Procedures (Chair: Swarat Chaudhuri):- Recursive Proofs for Inductive Tree Data-Structures (P Madhusudan,Xiaokang Qiu, and Andrei Stefanescu)- Symbolic Finite State Transducers, Algorithms and Applications(Nikolaj Bjorner, Pieter Hooimeijer, and Benjamin Livshits, DavidMolnar, and Margus Veanes)- Constraints as Control (Ali Sinan Köksal, Viktor Kuncak, andPhilippe Suter)* 3:30-4:15: Break* 4:15-5:15: Session on Security (Chair: Neelakantan Krishnaswami):- Multiple Facets for Dynamic Information Flow (Thomas Austin andCormac Flanagan)- Defining Code-injection Attacks (Donald Ray and Jay Ligatti)* 4:15-5:15: Session on Complexity for Concurrency (Chair: P.Madhusudan):- Deciding Choreography Realizability (Samik Basu, Tevfik Bultan, andMeriem Ouederni)- Analysis of Recursively Parallel Programs (Ahmed Bouajjani andMichael Emmi)* 5:15-6:00: Break* 6:00-8:00: Student Session (Chair: Tobias Wrigstad)Thursday, January 26===========================* 8:30-9:20: Breakfast* 9:20-9:30: Announcements* 9:30-10:30: Invited Talk (Session chair: Michael Hicks)- Programming Languages for Programmable Networks Jennifer Rexford, Princeton University* 10:30-11:00: Break* 11:00-12:30: Session on Medley (Chair: Suresh Jagannathan):- A Compiler and Run-time System for Network Programming Languages(Christopher Monsanto, Nate Foster, Rob Harrison, and David Walker)- Nested Refinements: A Logic For Duck Typing (Ravi Chugh, Patrick MRondon, and Ranjit Jhala)- An Abstract Interpretation Framework for Termination. (PatrickCousot and Radhia Cousot)* 11:00-12:30: Session on Mechanized Proofs (Chair: Adam Chlipala):- Playing in the Grey Area of Proofs (Krystof Hoder, Laura Kovacs, andAndrei Voronkov)- Static and User-Extensible Proof Checking (Antonis Stampoulis andZhong Shao)- Run Your Research: On the Effectiveness of Lightweight Mechanization(Casey Klein, John Clements, Christos Dimoulas, Carl Eastlund, andMatthias Felleisen, Matthew Flatt, Jay McCarthy, Jon Rafkind, SamTobin-Hochstadt, and Robert Bruce Findler)* 12:30-2:00: Lunch* 2:00-3:30: Session on Concurrency (Chair: Matt Parkinson):- Verification of Parameterized Concurrent Programs By ModularReasoning about Data and Control (Azadeh Farzan and Zachary Kincaid)-Resource-Sensitive Synchronization Inference by Abduction (MatkoBotincan and Mike Dodds and Suresh Jagannathan)- Syntactic Control of Interference for Separation Logic (Uday S Reddyand John C Reynolds)* 2:00-3:30: Session on Type Theory (Chair: Stephanie Weirich):- Canonicity for 2-Dimensional Type Theory (Daniel R Licata and RobertHarper)- Algebraic Foundations for Effect-Dependent Optimisations (OhadKammar and Gordon Plotkin)- On the Power of Coercion Abstraction (Didier Remy and Julien Cretin)* 3:30-4:15: Break* 4:15-5:15: Session on Dynamic Analysis (Chair: Aarti Gupta):- Abstractions From Tests (Mayur Naik, Hongseok Yang, and GhilaCastelnuovo and Mooly Sagiv)- Sound Predictive Race Detection in Polynomial Time (YannisSmaragdakis, Jacob M Evans, and Caitlin Sadowski, Jaeheon Yi, andCormac Flanagan)* 4:15-5:15: Session on Names and Binders (Chair: Zhong Shao):- Towards Nominal Computation (Mikolaj Bojanczyk, Laurent Braud,Bartek Klin, and Slawomir Lasota)- Programming with Binders and Indexed Data-Types (Andrew Cave andBrigitte Pientka)* 5:15-5:45: Business meeting* 7:00-: BanquetFriday, January 27===========================* 8:30-9:20: Breakfast* 9:20-9:30: POPL 2013 preview* 9:30-10:30: Invited Talk (Session chair: John Field)- Meta-level Features in an Industrial-Strength Theorem Prover J Strother Moore, University of Texas* 10:30-11:00: Break* 11:00-12:30: Session on Verified Transformations (Chair: ChrisHawblitzel):- Formalizing the LLVM Intermediate Representation for VerifiedProgram Transformation (Jianzhou Zhao, Steve Zdancewic, SantoshNagarakatte, and Milo M K Martin)- Optimal Randomized Transformation of Approximate Computations(Zeyuan Allen Zhu, Sasa Misailovic, Jonathan Kelner, and MartinRinard)- A Rely-Guarantee-Based Simulation for Verifying Concurrent ProgramTransformations (Hongjin Liang, Xinyu Feng, and Ming Fu)* 11:00-12:30: Session on Functional Programming (Chair: DimitriosVytiniotis):- A Unified Approach to Fully Lazy Sharing (Thibaut Balabonski)- The Ins and Outs of Gradual Type Inference (Aseem Rastogi and AvikChaudhuri and Basil Hosmer)- Edit Lenses (Martin Hofmann and Benjamin C Pierce and Daniel Wagner)* 12:30-2:00: Lunch* 2:00-3:30: Session on C/C++ Semantics (Chair: Andreas Podelski):- Clarifying and compiling C/C++ concurrency: from C++0x to POWER(Mark Batty, Kayvan Memarian, and Scott Owens, Susmit Sarkar, andPeter Sewell)- A mechanized semantics for C++ object construction and destruction,with applications to resource management (Tahina Ramananandro, GabrielDos Reis, and Xavier Leroy)- An Executable Formal Semantics of C with Applications (ChuckyEllison and Grigore Rosu)* 2:00-3:30: Session on Type Systems (Chair: Norman Ramsey):- A Type Theory for Probability Density Functions (Sooraj Bhat, AshishAgarwal, and Richard Vuduc and Alexander Gray)- A Type System for Borrowing Permissions (Karl Naden, Robert LBocchino Jr, Kevin Bierhoff, and Jonathan Aldrich)- Self-Certification: Bootstrapping Certified Typecheckers in F* withCoq (Pierre-Yves Strub and Nikhil Swamy, Cedric Fournet, and JuanChen)* 3:30-4:00: Closing and RaffleGeneral Chair:--------------------------John FieldGoogle76 Ninth Avenue,New York, NY 10011, USA.jfield@google.comProgram Chair:---------------------------Michael HicksDepartment of Computer ScienceUniversity of Maryland,College Park, MD 20866, USAmwh@cs.umd.eduProgram Committee:---------------------------Swarat Chaudhuri, Rice University, USAAdam Chlipala, MIT, USADan R. Ghica, University of Birmingham, UKAarti Gupta, NEC Labs America, USAChris Hawblitzel, Microsoft Research, Redmond, USASuresh Jagannathan, Purdue University, USARanjit Jhala, University of California, San Diego, USASorin Lerner, University of California, San Diego, USAOndrej Lhotak, University of Waterloo, CanadaP. Madhusudan, University of Illinois, Urbana-Champaign, USARupak Majumdar, MPI-SWS, GermanyMatthew Might, University of Utah, USATodd Millstein, University of California, Los Angeles, USAGreg Morrisett, Harvard University, USAAndrew Myers, Cornell University, USAMatthew Parkinson, Microsoft Research, Cambridge, UKFrank Piessens, K.U. Leuven, BelgiumAndrew Pitts, University of Cambridge, UKAndreas Podelski, University of Freiburg, GermanyFrançois Pottier, INRIA, FranceNorman Ramsey, Tufts University, USATachio Terauchi, Nagoya University, JapanMandana Vaziri, IBM Research, USADimitrios Vytiniotis, Microsoft Research, Cambridge, UKNobuko Yoshida, Imperial College, London, UKFrancesco Zappa Nardelli, INRIA, France######################################################################CALL FOR PARTICIPATIONCRA-W/CDC and SIGPLAN Programming Languages Mentoring WorkshopPhiladelphia, PA (co-located with POPL 2012)Tuesday January 24, 2012http://www.seas.upenn.edu/~sweirich/plmw12/We are pleased to invite students interested in programming languagesresearch to the first PL mentoring workshop. The goal of this workshopis to introduce senior undergraduate and early graduate students toresearch topics in programming language theory as well as providecareer mentoring advice to help them get through graduate school,land a great job, and succeed. We have recruited leaders from theprogramming language community to provide overviews of currentresearch topics, and have organized panels of speakers to givestudents valuable advice about how to thrive in graduate school,search for a job, and cultivate habits and skills that will help themin research careers.This workshop is part of the activities surrounding POPL, theSymposium on Principles of Programming Languages, and takes place theday before the main conference. One goal of the workshop is to makethe POPL conference more accessible to newcomers and we hope thatparticipants will stay through the entire conference.Through the generous donation of our sponsors, we are able to providetravel scholarships to fund student participation. These travelscholarships will cover reasonable travel expenses (airfare, hotel andregistration fees) for attendance at both the workshop and the POPLconference. Anyone may apply for a travel scholarship, but firstpriority will be given to women and under-represented minorityapplicants.The workshop registration is open to all. Students with alternativesources of funding for their travel and registration fees are welcome.APPLICATION for TRAVEL SUPPORT:The travel funding application can be accessed from the workshop website. The deadline for full consideration of funding is December 2,2011. Selected participants will be notified starting December 9th andwill need to register for the workshop by December 24th.ORGANIZERS:Stephanie Weirich, Kathleen Fisher and Ron GarciaSPONSORS:The Computing Research Association's Committee onthe Status of Women (CRA-W), the Coalition to Diversify Computing(CDC), and the ACM Special Interest Group on Programming Languages(SIGPLAN).######################################################################====== CALL FOR PAPERS ======24th International Conference on Computer Aided Verification (CAV2012) July 7-13, 2012 Berkeley, California, USAProgram Chairs: Madhusudan Parathasarathy and Sanjit A. SeshiaWebsite: http://cav12.cs.illinois.edu/Aims and Scope-------------------The conference on Computer Aided Verification (CAV), 2012, is the 24thin a series dedicated to the advancement of the theory and practice ofcomputer-aided formal analysis methods for hardware and softwaresystems. CAV considers it vital to continue spurring advances inhardware and software verification while expanding to new domains suchas biological systems and computer security. The conference covers thespectrum from theoretical results to concrete applications, with anemphasis on practical verification tools and the algorithms andtechniques that are needed for their implementation. The proceedingsof the conference will be published in the Springer-Verlag LectureNotes in Computer Science series. A selection of papers will beinvited to a special issue of Formal Methods in System Design and theJournal of the ACM.Topics of interest include:- Algorithms and tools for verifying models and implementations- Hardware verification techniques- Hybrid systems and embedded systems verification- Deductive, compositional, and abstraction techniques for verification- Program analysis and software verification- Testing and runtime analysis based on verification technology- Verification methods for parallel and concurrent hardware/software systems- Applications and case studies in verification- Verification in industrial practice- Algorithms and tools for system synthesis- Verification techniques for security- Formal models and methods for biological systems** NEW in 2012 **CAV will have *special tracks* in the following four areas:1. Hardware Verification (track chair: Andreas Kuehlmann)2. Computer Security (track chair: Somesh Jha)3. Embedded Systems (track chair: Stavros Tripakis)4. SAT and SMT (track chair: Daniel Kroening)Submissions in these four topics are especially encouraged.Papers in these areas will be subject to the same rigorous reviewprocess as other papers.Accepted special track papers will be organized into special sessionsthat are highlighted in the program.Events---------The conference will include the following events:* Pre-conference workshops on July 7-8.* The main conference will take place July 9th-13th: -- Invited tutorials on July 9th. -- Technical sessions on July 10-13.Please see the conference website for further details.Paper Submission--------------------There are two categories of submissions:A. Regular Papers: Submissions, not exceeding sixteen (16) pages usingSpringer's LNCS format, should contain original research, andsufficient detail to assess the merits and relevance of thecontribution. For papers reporting experimental results, authors arestrongly encouraged to make their data available with theirsubmission. Submissions reporting on case studies in an industrialcontext are strongly invited, and should describe details, weaknesses,and strengths in sufficient depth. Simultaneous submission to otherconferences with proceedings or submission of material that hasalready been published elsewhere is not allowed.B. Tool Presentations: Submissions, not exceeding six (6) pages usingSpringer's LNCS format, should describe the implemented tool and itsnovel features. An appendix that will not be part of the publishedpresentation may be added for use in the program committee selectionprocess. A demonstration, in a separate demonstration session, isexpected to accompany a tool presentation. Papers describing toolsthat have already been presented (in any conference) will be acceptedonly if significant and clear enhancements to the tool are reportedand implemented.Papers exceeding the stated maximum length run the risk of rejectionwithout review.Note that the page limit for submissions has been increased to 16pages. For regular papers, an appendix can be joined to thesubmissions providing additional material such as details on proofs orexperiments. The appendix is not guaranteed to be read or taken intoaccount by the reviewers and it should not contain informationnecessary to the understanding and the evaluation of the presentedwork. The review process will include a feedback/rebuttal period whereauthors will have the option to respond to reviewer comments.Papers must be submitted in PDF format. Submission is done withEasyChair. Information about the submission procedure will beavailable at: http://cav12.cs.illinois.edu/Important Dates- Abstract submission: January 15, 2012- Paper submission (firm): January 22, 2012 at 23:59 Samoa time (UTC/GMT-11)- Author feedback/rebuttal period: March 7-9, 2012- Notification of acceptance/rejection: March 22, 2012- Final version due: April 20, 2012Program Chairs------------------Madhusudan Parthasarathy, University of Illinois at Urbana-Champaign, USASanjit A. Seshia, University of California at Berkeley, USAProgram Committee---------------------Rajeev Alur (Univ. Pennsylvania)Roderick Bloem (TU Graz)Supratik Chakraborty (IIT Bombay)Swarat Chaudhuri (Rice Univ.)Adam Chlipala (MIT)Vincent Danos (University of Edinburgh)Thomas Dillig (College of William and Mary)Andy Gordon (Microsoft Research)Mike Gordon (Cambridge Univ.)Orna Grumberg (Technion)Aarti Gupta (NEC Labs)William Hung (Synopsys)Somesh Jha (Univ. Wisconsin)Ranjit Jhala (UCSD)Bengt Jonsson (Uppsala Univ.)Rajeev Joshi (NASA JPL)Daniel Kroening (Oxford Univ.)Andreas Kuehlmann (Coverity)Viktor Kuncak (EPFL)Shuvendu Lahiri (Microsoft Research)Rupak Majumdar (MPI-SWS)Ken Mcmillan (Microsoft Research)David Molnar (Microsoft Research)Kedar Namjoshi (Bell Labs)Albert Oliveras (TU Catalonia, Barcelona)Joel Ouaknine (Oxford Univ.)Gennaro Parlato (Univ. of Southampton)Madhusudan Parthasarathy (UIUC)Nir Piterman (Univ. of Leicester)Andreas Podelski (Univ. of Freiburg)Shaz Qadeer (Microsoft Research)Zvonimir Rakamaric (Univ. of Utah)Sriram Sankaranarayanan (Univ. of Colorado)Sanjit A. Seshia (UC Berkeley)Natasha Sharygina (Univ. of Lugano)Stavros Tripakis (UC Berkeley)Helmut Veith (TU Vienna)Mahesh Viswanathan (UIUC)Jin Yang (Intel)Karen Yorav (IBM)Steering Committee----------------------Michael Gordon, University of Cambridge, UKOrna Grumberg, Technion, IsraelRobert Kurshan, Cadence Design Systems, USAKenneth McMillan, Microsoft Research, USACAV Award------------The annual CAV Award has been established for a specific fundamentalcontribution or a series of outstanding contributions to the field ofComputer Aided Verification. The award of $10,000 will be granted toan individual or a group of individuals chosen by the Award Committeefrom a list of nominations. The Award Committee may choose to make noaward. The CAV Award shall be presented in an award ceremony at CAVand a citation will be published in a Journal of Record (currently,Formal Methods in System Design).Call for Nominations for the CAV Award------------------------------------------Anyone can submit a nomination. The Award Committee can originate anomination. Anyone, with the exception of members of the AwardCommittee, is eligible to receive the Award. A nomination must stateclearly the contribution(s), explain why the contribution isfundamental or the series of contributions is outstanding, and beaccompanied by supporting letters and other evidence of worthiness.Nominations should include a proposed citation (up to 25 words), asuccinct (100-250 words) description of the contribution(s), and adetailed statement to justify the nomination. The citedcontribution(s) must have been made not more recently than five yearsago and not over twenty years ago. In addition, the contribution(s)should not yet have received recognition via a major award, such asthe ACM Turing or Kanellakis Awards. The nominee may have receivedsuch an award for other contributions.The 2012 CAV Award Committee consists of Thomas A. Henzinger (Chair) Rajeev Alur Marta Kwiatkowska Aarti GuptaThe nominations should be sent to Thomas Henzinger at tah@ist.ac.at.Nominations must be received by January 22, 2012.######################################################################Title: Call for Papers: IEEE Computer Special Issue on MassivelyThreaded Computer SystemsSubmission deadline: 15 February 2012Publication date: August 2012Webpage: http://www.computer.org/portal/web/computingnow/cocfp8Contact email: s.reinhardt@computer.orgComputer seeks submissions for an August 2012 special issue onmassively threaded computer systems. This special issue seeks tohighlight the state of the art and future directions for massivelythreaded systems, defined as systems that support hundreds orthousands of hardware threads per device. Contributions should focuson the specific challenges that come from massive threading as well ashow threading helps address the looming challenges of chip andsystem-level parallel computing. Potential topics of interest for thisspecial issue include* applications and algorithms that effectively exploit massively threaded systems;* programming models, programming languages, and runtime or operating systems designed to support massively threaded execution;* chip or system architectures for massive threading;* embedded or special-purpose massively parallel architectures;* prototypes, testbeds, or other evaluation techniques for massively threaded systems.Other topics dealing with massive threading that are not describedabove also might be of interest. For more information, please contactthe guest editors: Steve Keckler of Nvidia Research and the Universityof Texas at Austin (skeckler@cs.utexas.edu) and Steve Reinhardt of AMDResearch (s.reinhardt@computer.org).######################################################################CALL FOR PAPERSWoDet 3: Third Workshop on Determinism and Correctness in ParallelProgramminghttp://goo.gl/K78CQMarch 3, 2012Co-located with ASPLOS 12, London, England, UKUnintentional non-determinism is the bane of multithreaded softwaredevelopment. Defective software might execute correctly hundreds oftimes before a subtle synchronization bug appears, and when it does,developers often cannot readily reproduce it while debugging.Nondeterminism also complicates testing as good coverage requires botha wide range of program inputs and a large number of possibleinterleavings for each input. These problems have taken on renewedurgency as multicore systems have driven parallel programming tobecome mainstream.Determinism is emerging as an important research area, ranging fromtechniques for existing code (including deterministic executionmodels, parallelizing compilers, and deterministic replay fordebugging) to new programming models (including deterministic generalpurpose languages and run-time systems). Deterministic multiprocessingyields deep open questions in programming languages, compilers,operating systems, runtime systems and architecture.While there is a growing consensus that determinism would greatly helpwith the programmability challenges of multicore systems, there isstill little consensus on many important questions. What are theperformance and programmability trade-offs for enforcing deterministicsemantics with different approaches? Should deterministic semantics bestrictly enforced or guaranteed only for programs that are"well-behaved" in certain ways? How can we support trulynon-deterministic algorithms, where non-determinism is intentionallyused for improved parallel performance? How can each layer of thesystem stack contribute to these goals? What are other safetyguarantees useful in making parallel programming easier and less errorprone (e.g., race-freedom, atomicity, etc..)?The Third Workshop on Determinism and Correctness in ParallelProgramming is an across-the-stack forum to discuss the role of a widerange of correctness properties in parallel and concurrentprogramming. While determinism is an important theme, the scope of theworkshop includes other correctness properties for parallel programsand systems. The workshop will be a full day event with a few invitedtalks, a moderated debate, and technical sessions for shortpeer-reviewed papers discussing ideas, positions, or preliminaryresearch results.In addition to answers to the questions above, topics of interest include:Language extensions for disciplined parallel programming models(deterministic, data race-free, etc.)Architecture, operating system, runtime system and compiler supportfor parallel program correctnessConcurrency debugging techniquesNew properties of parallel programsLimit studies and empirical studies of the cost of safety propertiesStudies of the applicability of correctness properties in parallelprograms and algorithmsConcurrency bug avoidance techniquesReal-world experience with safe parallel programming models, systems, ortoolsSubmissionsWe are seeking submissions of short position papers to be presented atthe workshop. Position papers may introduce new ideas relevant to theworkshop, propose interesting research directions, and/or describepreliminary research results. Workshop submissions will be judged onnovelty, technical merit, and potential for creating thought-provokingdiscussion at the workshop. There will NOT be a formal proceedings sowork presented at this workshop is eligible for republication infuture ACM conferences or journals (and other formal venues that havesimilar republication policies).Submissions must be in PDF format, in two columns, 10-point font,1-inch margins, and no longer than 6 pages in total. Please contactthe organizers if any of these present a hardship.Important DatesJanuary 6, 2012, 5 p.m. Eastern Time: submission deadlineJanuary 14, 2012: notification of acceptanceMarch 3, 2012: workshopOrganizerEmery Berger, University of Massachusetts AmherstProgram CommitteeVikram Adve, University of IllinoisEmery Berger, University of Massachusetts AmherstLuis Ceze, University of WashingtonJason Flinn, University of MichiganBryan Ford, Yale UniversitySuresh Jagannathan, Purdue UniversityShan Lu, University of WisconsinMadan Musuvathi, Microsoft Research (Redmond)Simon Peyton Jones, Microsoft Research (Cambridge)Koushik Sen, University of California, BerkeleyMartin Vechev, ETH ZurichEran Yahav, TechnionJunfeng Yang, Columbia University######################################################################ASPLOS call for posters & provocative ideas* ASPLOS 2012 poster session call (due 30 December)* ASPLOS 2012 provocative ideas session call (due 5 January)Also open are calls for many of the ASPLOS 2012 workshops, includingthe first ASPLOS doctoral workshop (due 5 January).Conference registration will soon be open, as will applications fortravel grants.All these are linked from:http://research.microsoft.com/asplos_2012######################################################################CGO2012 Call for Workshops and TutorialsThe 2012 ACM/IEEE International Symposium on Code GenerationMarch 31 to April 4, 2012, San Jose, CaliforniaCGO is looking for proposals for co-located workshops and tutorialsthat will run before the main conference.http://www.cgo.orghttp://www.cgo.org/cgo2012/submission/call-for-workshops/index.htmlhttp://www.cgo.org/cgo2012/submission/call-for-tutorials/index.htmlImportant Dates:Proposal Submission: Dec 16, 2011 (Extended! Now with rolling approval!)---------------------------------------------------------------------------Call for WorkshopsInterested parties are encouraged to contact the Workshops Chair TippMoseley (tipp@google.com).If you wish to organize a workshop (1/2 or 1 day), please e-mail aproposal to Tipp. Please include in your proposal:Title of the workshopOrganizers and their affiliationsBrief description of topics to be coveredExpected duration; i.e., 1/2 day or full dayExpected attendance (stats from previous years are ideal)URL where workshop information is, or will be posted (if available attime of submission).Any special requirements the workshop may have---------------------------------------------------------------------------Call for TutorialsInterested parties are encouraged to contact the Tutorials ChairRobert Hundt (rhundt@google.com).If you wish to organize a tutorial (1/2 or 1 day), please e-mail aproposal to Robert. Please include in your proposal:Title of the tutorialOrganizers and their affiliationsBrief description of topics to be coveredExpected duration; i.e., 1/2 day or full dayExpected attendance (stats from previous years are ideal)URL where tutorial information is, or will be posted (if available attime of submission).Any special requirements the tutorial may have######################################################################CFP: CGO 2012 ACM Student Research CompetitionWe are happy to announce that CGO 2012 will host the ACM StudentResearch Competition (SRC), sponsored by Microsoft Research. The SRCis a unique opportunity for both undergraduate and graduate studentsto present their original research at CGO before a panel of judges andattendees. Students accepted to participate at the SRC will beentitled to receive a travel grant (up to $500) to help them cover thetravel expenses. You can find more details in the call for SRCcontributions athttp://www.cgo.org/cgo2012/conference/acm-student-research-competition/index.html###################################################################### |
posted 6 Dec 2011 00:43 by Stephen Taylor
[
updated 11 Dec 2011 03:02
]
FinnAPL forest seminar 2012 takes place 19-20 Apr in Sannäs Manor, Finland "Conference Hotel Sannäs Manor is close, but still far enough. The manor surroundings are peaceful and located only less than an hour’s drive (60 km) from Helsinki and Helsinki-Vantaa Airport." Price 295 EUR + accommodation 105 EUR in a single room. Program details to come.
Contact Jouko Kangasniemi: Jouko {dot} Kangasniemi {at} ek {dot} fi |
|
