✍ Scribed by Danvy, Olivier; Filinski, Andrzej
No coin nor oath required. For personal study only.
This Volume Constitutes The Proceedings Of The Second Symposium On Programs Asdataobjects(pado-ii),heldattheuniversityofaarhus,denmark,onmay 21–23,2001. Pado-iiwascolocatedwiththethirdinternationalworkshopon Implicit Computational Complexity (icc2001) And The Seventeenth Conference On The Mathematical Foundations Of Programming Semantics (mfps Xvii). The?rstpadowasorganizedbyharaldganzingerandneiljones,in1985. This Second Symposium Took Place At The Occasion Of Neil Jones’s 60th Birthday, Andonhiswish,weorganizeditasaresearchevent. Thecallforpaperswas Openandelicited30submissionsfrom12countries. Overall,145reviewswere Collected,andbasedonthese,theprogramcommitteeselected14papersfor Presentation. Withoneexception,eachsubmissionreceivedatleast4reviews. Whererelevant,atranscriptofthe(electronic)pcmeetingwasalsoenclosed.^ 1 Pado-iiwassponsoredbybrics Andthe Espritworkinggroupappsem, And Organized In Cooperation With The European Association For Programming Languages And Systems (eapls) And The Special Interest Group On Progr- Ming Languagesof The Association For Computing Machinery (acm Sigplan). We Gratefully Acknowledge Their Support. We Also Extend Our Thanks To The Pc Members And External Reviewers For Theirtimeandthoughts,jannekrounchristensenandkarenkjærmøllerfor Theirorganizationalhelp,the Project For Hosting Our Submission Web Site,anddanieldamianforsettingitupandmaintainingit. February 2001 Olivier Danvy And Andrzej Filinski 1 Basicresearchincomputerscience(www. Brics. Dk), Fundedbythedanishnationalresearchfoundation.^ Conferenceorganization Conference Co-chairs Oliverdanvy,brics,universityofaarhus,denmark Andrzejfilinski,brics,universityofaarhus,denmark Program Committee Torbenamtoft Bostonuniversity,usa Charlesconsel Labri/enserb,france Catarinacoquand Chalmersuniversity,sweden Radhiacousot Ecolepolytechnique,france Olivierdanvy Universityofaarhus,denmark Andrzejfilinski Universityofaarhus,denmark Yoshihikofutamura Wasedauniversity,japan Fritzhenglein Ituniversity,denmark Peterlee Carnegiemellonuniversity,usa Y. Annieliu Sunystonybrook,usa Davemacqueen Belllabs,usa Jamess. Royer Syracuseuniversity,usa Mortenheinesørensen Itpractice,denmark Carolynl. Talcott Stanforduniversity,usa Jonlwhite Commerceone,inc. ,usa Additional Referees Zinobenaissa,edoardos. Biagioni,howarda. Blair,craigchambers,wei- Nganchin,larsr. Clausen,pierrecointe,thierrycoquand,nielsdamgaard, Danieldamian,damiendoligez,r´emidouence,r.^ Kentdybvig,pavelemel- Nov,gilbertofil´e,johngallagher,robertogiacobazzi,robertgl¨ Uck,john Hatcli?,nevinheintze,thomashildebrandt,zhenjianghu,dieterhutter, Kazuhikokakehi,jerzykarczmarczuk,andyking,naokikobayashi,zenjiro Konishi,kimg. Larsen,mariolatendresse,julial. Lawall,michaelleuschel, Jakoblichtenberg,francescologozzo,henningmakholm,jacquesmalenfant, Brianmayoh,antoinemin´e,torbenÆ. Mogensen,eugeniomoggi,davidm- Niaux,peterd. Mosses,joachimniehren,susanolder,albertopettorossi, Franco ¸ispottier,maurizioproietti,aarneranta,jakobrehof,johnreppy, Laurent R´ Eveill`ere,martinc. Rinard,kristo?erh. Rose,abhikroychoudhury, Louissalvail,jo˜aosaraiva,davida. Schmidt,jenspetersecher,marios¨udholt, S. Doaitseswierstra,haraldsøndergaard,arnaudvenet,hongweixi,zheyang, Kwangkeun Yi. Tableofcontents Invitedopeningtalk Program Analysis For Implicit Computational Complexity. . . . . . . . . . . . . . . 1 Neild.^ Jones Contributedpapers Deriving Pre-conditions For Array Bound Check Elimination. . . . . . . . . . . . . 2 Wei-nganchin,siau-chengkhoo,danan. Xu Type Systems For Useless-variable Elimination. . . . . . . . . . . . . . . . . . . . . . . . . 25 Adamfischbach,johnhannan Boolean Constraints For Binding-time Analysis. . . . . . . . . . . . . . . . . . . . . . . . 39 Kevinglynn,peterj. Stuckey,martinsulzmann,haraldsøndergaard Constraint Abstractions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 J¨orgengustavsson,josefsvenningsson Implementing Circularity Using Partial Evaluation. . . . . . . . . . . . . . . . . . . . . Program Analysis For Implicit Computational Complexity / Neil D. Jones -- Deriving Preconditions For Array Bound Check Elimination / Wei-ngan Chin, Siau-cheng Khoo And Dana N. Xu -- Type Systems For Useless-variable Elimination / Adam Fischbach And John Hannan -- Boolean Constraints For Binding-time Analysis / Kevin Glynn, Peter J. Stuckey And Martin Sulzmann / [and Others] -- Constraint Abstractions / Jorgen Gustavsson And Josef Svenningsson -- Implementing Circularity Using Partial Evaluation / Julia L. Lawall -- Combining Forward And Backward Analyses Of Temporal Properties / Damien Masse -- Numerical Power Analysis / Isabella Mastroeni -- Run-time Bytecode Specialization / Hidehiko Masuhara And Akinori Yonezawa. Olivier Danvy, Andrzej Filinski (eds.). Includes Index. Includes Bibliographical References And Index.
📜 SIMILAR VOLUMES