It looks like you're offline.
Open Library logo
additional options menu

MARC Record from Harvard University

Record ID harvard_bibliographic_metadata/20220215_020.bib.mrc:154495383:7161
Source Harvard University
Download Link /show-records/harvard_bibliographic_metadata/20220215_020.bib.mrc:154495383:7161?format=raw

LEADER: 07161nam a22004098a 4500
005 20150218022835.0
008 010405s2001 gw 101 0 eng
001 990086840000203941
010 $a^^2001031296
020 $a3540420681 (pbk. : alk. paper)$0(uri) http://www.isbnsearch.org/isbn/3540420681
035 $a(MH)008684000HVD01-Aleph
035 $a(OCoLC)46713241$0(uri) http://www.worldcat.org/oclc/46713241
040 $aDLC$cDLC
042 $apcc
050 00 $aQA76.751$b.P33 2001
082 00 $a005.3$221
111 2 $aPADO 2001$d(2001 :$cAarhus, Denmark)$0(uri) http://id.loc.gov/authorities/names/n2001005431$0(uri) http://viaf.org/viaf/sourceID/LC|n2001005431
245 10 $aPrograms as data objects :$bSecond Symposium, PADO 2001, Aarhus, Denmark, May 21-23, 2001 : proceedings /$cOlivier Danvy, Andrzej Filinski (eds.).
260 $aBerlin ;$aNew York :$bSpringer,$c2001.
300 $aviii, 277 p. :$bill. ;$c24 cm.
490 1 $aLecture notes in computer science ;$v2053
500 $aIncludes index.
504 $aIncludes bibliographical references and index.
505 00 $tProgram Analysis for Implicit Computational Complexity /$rNeil D. Jones --$tDeriving Preconditions for Array Bound Check Elimination /$rWei-Ngan Chin, Siau-Cheng Khoo and Dana N. Xu --$tType Systems for Useless-Variable Elimination /$rAdam Fischbach and John Hannan --$tBoolean Constraints for Binding-Time Analysis /$rKevin Glynn, Peter J. Stuckey and Martin Sulzmann /$r[and others] --$tConstraint Abstractions /$rJorgen Gustavsson and Josef Svenningsson --$tImplementing Circularity Using Partial Evaluation /$rJulia L. Lawall --$tCombining Forward and Backward Analyses of Temporal Properties /$rDamien Masse --$tNumerical Power Analysis /$rIsabella Mastroeni --$tRun-Time Bytecode Specialization /$rHidehiko Masuhara and Akinori Yonezawa.
520 $aThis 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. . . . . . . . . . . . . . . . . . . . .
650 0 $aComputer programs$vCongresses.$0(uri) http://id.loc.gov/authorities/subjects/sh85029524
650 0 $aData structures (Computer science)$vCongresses.$0(uri) http://id.loc.gov/authorities/subjects/sh2009122874
655 7 $aConference papers and proceedings$2fast$0(uri) http://id.worldcat.org/fast/fst01423772
655 7 $aArhus (2001)$2swd
650 0 $aComputer science.$0(uri) http://id.loc.gov/authorities/subjects/sh89003285
650 0 $aSoftware engineering$0(uri) http://id.loc.gov/authorities/subjects/sh87007398
650 0 $aLogic design.$0(uri) http://id.loc.gov/authorities/subjects/sh85078117
700 1 $aDanvy, Olivier.$0(uri) http://id.loc.gov/authorities/names/n93003163$0(uri) http://viaf.org/viaf/sourceID/LC|n93003163
700 1 $aFilinski, Andrzej,$d1965-$0(uri) http://id.loc.gov/authorities/names/n2001005430$0(uri) http://viaf.org/viaf/sourceID/LC|n2001005430
830 0 $aLecture notes in computer science$v2053.$0(uri) http://id.loc.gov/authorities/names/n42015162$0(uri) http://viaf.org/viaf/sourceID/LC|n42015162
852 0 $bCAB$cRD$hQA75$i.L4 vol. 2053$8222050981530003941
876 $8222050981530003941$q1$70$mRD$yBOOK$pAS2NCM$cRD$0232050981520003941$h01$nQA75 .L4 vol. 2053$bCAB$lCAB