DOCSLIB.ORG

Workshop on the Evaluation of Software Defect Detection Tools

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Workshop on the Evaluation of Software Defect Detection Tools Workshop on the Evaluation of Software Defect Detection Tools Sunday, June 12th, 2005 Co-located with PLDI 2005 Workshop co-chairs: William Pugh (University of Maryland) and Jim Larus (Microsoft Research) Program chair: Dawson Engler (Stanford University) Program Committee: Andy Chou, Manuvir Das, Michael Ernst, Cormac Flanagan, Dan Grossman, Jonathan Pincus, Andreas Zeller Time What Time What 8:30 am Discussion on Soundness 2:30 pm break 2:45 pm Research presentations The Soundness of Bugs is What Matters, Patrice Godefroid, Bell Laboratories, Lucent Technologies Experience from Developing the Dialyzer: A Static Soundness and its Role in Bug Detection Systems, Analysis Tool Detecting Defects in Erlang Yichen Xie, Mayur Naik, Brian Hackett, Alex Applications, Kostis Sagonas, Uppsala University Aiken, Stanford University Soundness by Static Analysis and False-alarm Removal by Statistical Analysis: Our Airac 9:15 am break Experience, Yungbum Jung, Jaehwang Kim, Jaeho 9:30 am Research presentations Sin, Kwangkeun Yi, Seoul National University Locating Matching Method Calls by Mining 3:45 pm break Revision History Data, Benjamin Livshits, 4:00 pm Discussion of Benchmarking Thomas Zimmermann, Stanford University Evaluating a Lightweight Defect Localization Dynamic Buffer Overflow Detection, Michael Tool, Valentin Dallmeier, Christian Lindig, Zhivich, Tim Leek, Richard Lippmann, MIT Andreas Zeller, Saarland University Lincoln Laboratory Using a Diagnostic Corpus of C Programs to 10:30 am break Evaluate Buffer Overflow Detection by Static 10:45 am Invited talk on Deployment and Adoption, Manuvir Das, Analysis Tools, Kendra Kratkiewicz, Richard Microsoft Lippmann, MIT Lincoln Laboratory 11:15 am Discussion of Deployment and Adoption BugBench: A Benchmark for Evaluating Bug Detection Tools, Shan Lu, Zhenmin Li, Feng Qin, The Open Source Proving Grounds, Ben Liblit, Lin Tan, Pin Zhou, Yuanyuan Zhou, UIUC University of Wisconsin-Madison Benchmarking Bug Detection Tools. Roger Issues in deploying SW defect detection tools, Thornton, Fortify Software David Cok, Eastman Kodak R&D A Call for a Public Bug and Tool Registry, Jeffrey False Positives Over Time: A Problem in Foster, Univ. of Maryland Deploying Static Analysis Tools, Andy Chou, Bug Specimens are Important, Jaime Spacco, Coverity David Hovemeyer, William Pugh, University Maryland 12 noon lunch NIST Software Assurance Metrics and Tool Evaluation (SAMATE) Project, Michael Kass, 1:00 pm Research presentations NIST Model Checking x86 Executables with CodeSurfer/x86 and WPDS++, Gogul 5:00 pm Discussion of New Ideas Balakrishnan, Thomas Reps, Nick Kidd, Akash Deploying Architectural Support for Software Lal, Junghee Lim, David Melski, Radu Gruian, Defect Detection in Future Processors Suan Yong, Chi-Hua Chen, Tim Teitelbaum, , Yuanyuan Univ. of Wisconsin Zhou, Josep Torrellas, UIUC Empowering Software Debugging Through Using Historical Information to Improve Bug Finding Techniques Architectural Support for Program Rollback, Radu , Chadd Williams, Jeffrey Teodorescu, Josep Torrellas, UIUC Computer Hollingsworth, Univ. of Maryland Locating defects is uncertain Science , Andreas Zeller, EXPLODE: A Lightweight, General Approach to Saarland University Is a Bug Avoidable and How Could It Be Found? Finding Serious Errors in Storage Systems, , Junfeng Yang, Paul Twohey, Ben Pfaff, Can Sar, Dan Grossman, Univ. of Washington Dawson Engler, Stanford University 5:45 pm wrap up and discussion of future workshops 6:00 pm done ¢¡¤£¦¥¨§ © ¤ ¤£§©¤ ¡¤ !£#"$ %'& §()$§ *¥+(£#,-£. 0/ 1243656798;:=<>!?(:A@B56>C79? D :;E9EF#24GH>C56243I>J567K:'L;MFN8;:;OP3RQ.:'8TS(O(>CE9>CUC79:;L VXW$YAZIY[K\^]`_aYcbdW![d_!ef\AbgZI]`_!e!YAZbdWhJ_ihJjdjXbBW$YkhJZmln[oYT\[d_pbBW$Ycq ]`Zmjsr`t hJ_0rubdWhJb[K\khJ_v[wr!Y6hxqW$]y\yYbw[dlxY¤Wh`\nzT]`lxY;{}|~[ozAb]`Z }Ce!] d o0gAg m oIT'$moA`H o`T H ;B Hg'A)mA`m m¦`w g)A g¡A ¡¡ØAoIóÙ¡+T ooAgA`4¬¡D¡¡¤ð9 ñ g$m` Ag4 T g¡A ogm) )¢g£+$ A¤¥`w6m¦JAy $ o ¡4m)ÃoA¦¡£ ð¥K¬ '¬`m¤© g¤g6î'`oa`g£'gg¡w oA` ñ § o+m g¨A;mCm¤$gm¤© BªXmo.y£¤¥ « y o « o'­¬ 𥦠g AnÑ£Å;ÉAÝ©ÅJÑ)ѣЫݩÅ;ɨÝÊ)Ê)È`Ñëðsg£Ø¦4Tª ¬ ñ ñ ¤© g£0g6m¡ . g4T IH%JK¢`Ñ6LPÏTÈyÅCÆTÅJÑÊ)Ê è¨µ¥¸6°;ùI»´y¸6¶£E4°Ù·'ÀGF +AÂ)A g ®¯±°²}³J´µ¨¶9·f¸³º¹¶s»¼½ ¾¿4·'ÀºÁ ÏBÔMÈAÉTÊ+ÝÊONP¢ÚmÒ¡QcÚTÒKÒdÑÐ)ÊSR±m gg4T g¡A6Ø££oA'¬PTg £m``w£¤¥¡o0A¤­wA¤© BªaAgy£¤¥ Hy o g¡AÃ$ o.A¦¡ mo oga £A` £g£ gaóm¡my)Iª¨¤¥oA Tª¢ªH'gßCï g ÄÅCÆfÇÈAÉmÊ«Xm + oko£JAg + g4T fËw`k¦`'`I'¤¦4£ à X¢gm¤© BªXmoyy£­ )` )ßA¤¥'am`A`AA ÀV¨°;ùI¶ ³JûK¸ U ¤¥A``̬iÍ#y¤¥Ag g4T g g`cT w o£}¡}gA oR 'y ¡ßAXW¢m`YW6Z[Zª )f`g¢oyK g¡ Rg )6y¡£¤¥A ¤¥`w6k¤¥AuÎoÏmЫÐgÑ)ÎÒKÅJÑÊ)ÊÓJÐgÏ6ÏBÔ)¬ dn)A g '­ g`£oá w gm g £A yg¡Ù`ë g`.£óÙ6 y o'`Hm¤± wA¤© BªaAg# w` ) g¡R'.kÎ)ÏTÕ#ÓJÖÑ£Ò×ÑØ £Aog6 « oooÙm¤BPw¡` ££'£ ¡££; om g¡Au goA`Ax§ )ÃB )T o¤g`' nð¥nA¦`B oo' « o' Ê£ÏTÈyÅCÆÚTÅCÚTÖÜÛIÊ«ÝÊ¡££; o=Þ4Iª¡ow ^R¦mK¤¥o£ ¡=`g ¬]\Ù¡` u g^w6m) ) ¡c £m¡ ¡` £A¡ g' gÙAJ¡X¦JA``+ o )6 )ßA ¢gJ 4 w£ aA¤!oAJ£g g¡¬ ñ ^$£o_\ym¤© #oA o4 6£y¦ g'­`gA`oXm¤ 'go g6g à y;B y¤¥6 « y£ g ³±á!âã¯Cäæå´'äCçoèR»±´µsä­·¶9·Iékê o;A¤s¨ðËow'`y6goÌ ¤¥AgA``y6gXA¤±¦;£¬ g¡Ak gÙAëAgÃgogg' ¦`AgkAn`g'A)mãAg4 T ñ mom¦`w g)A g¡A`'mou om À å¾·£¸x´ba(·£¸ùI´`úm¸¶9³4»· ` g¡Afy'A`n+mß'Ã`g¨m¤¢Î)ÏmÅÊ£ÑЫìTÚTÒKÝ©ìTÑÚAÇÊ«Ò9ÐgÚ'ÎÒKÝsÏTÅ`Ê«¬ ªaAo`ë`4y`kgoA)$ª¡ )xy`A }+ m¦`w g)A g¡A` í yg'­Xw` )u gÙ'¡+y£ g6 « æ; g4T Õ+ÚTÛ}`mJ£!¬ A6moæ gTªXm)oT;¡f £Aog6 « g`o£¬cD§ o '¦¡ ¢`g ¢ g}` ¤¥A g`¡¨î;6B o'`m¦¡¢g'=y6 w¡A Á + `w RA¦`B oo' « o'`£ Ç)ÏTÒ£¢ Î)ÏTЫÐoÑoΣÒKÅJÑÊoÊÓCÐgÏ6ÏBÔoÊkÚmÅJÆ ¡ØAoA`ï.g` )= gÙA¨mo¤Æ'ÏÏmÕÑ)Æ¢ o}o£JAg +ð¥+m Ad ñ ÇÈAÉmÊ$ÔÏTÈyÅJÆëmo.'`m)m; gà g+¦Jëw'`P¬ ¤smw}mmo(9¬ A¬¡ÈyÅ`ÊÏmÈyÅJÆ^Ç£ÈAÉTÊ«¬nò#6w`§ oRoA'g6gA ðsò.o g gA+m ggjA`yA w g¡ Àgf+èihØ® F Á e ¡§ oäsmwëA¡Ag+ëðsA¬ `¬¡`¦ `g¡ÃAo¨o gë ñ æ`£ª Ao'A )m` gÙA+ðsg£lknm±ò#o¥p8qSqSr ¤¥AfÚmÈyÒ×Ïmü ¦4' óy6 y o'ÃAammoº Aog§4 T o' g )`¡î;6 ;A ñ ñ ÕÚmÒ9ÝsÎ)ÚmÖ©ÖÜÛ ow g¡ wA¤© BªaAgRð¥K¬ '¬­`¨ ow ¨g¡A.y6 ÕÚmÛoAA)mvm4m g­!¦JA4ë o#A£)T o$¤smgaA¡Ag+ ñ g`m A¢¦¡¨ð2s ÚTÈyÒdÏTÕ+ÚTÒdÑ)Æ; gw¤s' ØóÙ oo' « g¡A¨¤¥g' m`R£4 Ø goî;¡g+ð9w¡A4 m; Ù+m}ôCAg ¬ ñ ñ w') v yyAuð p ÐoÚTÅJÆ'ÏTÕ ow g¡T  o`T ¡' o£g¤sA £A ñ ¡+ £óÙ`¡A ®¯±°öõ÷nøH³`ùI¸´`»±ú'°æ³Jû¢®a°Ù·£¸6¶s»¿!ÀkÁ m`pðt `m ¨ ow ÃA£)T o'n g ÆmÝ©ÐgÑ)ÎÒ£óÙ6 y o'` ñ ª ÒdÑ«Ê«ÒKÝ©Å;É4AH¦4£¨¨¢ gK¦¡¡¡A¨A¡¡A4y`w g ¤¥' m¡A.m g£o`m g¡AoA'oA `m g`¬ § oA`Aò j `g F F Á A AoIª¡Xmy oA+T o £yy×4wJ g¡A£o£ o £¡guA¦`w g)A « o'p g )`¡î;6£m¡ ¦'¤¥A4¦ ££oA¡APX¢§ o§×¡¡'ëyA¡¡AP¦`g`o£¬ y g£; Á ò j moØA`AoA' o£6+ g¦Jëw'`Py¦ yg'­¬ F Á £)m0'o£)ëm¤+AA g`¨AoÃôCAg }ðs4A¡A0 ' à d A¡¡A­+Ëow'`Ù h¨³Jµs°v³4ûvu ³4¾»¼±»°Ù··-w(À g¡ ¡(g4' (A g6B o. g4m'¢ £ÙH¡`g46 « g¡A¤ð¥+Ay ñ ooÌ+ð© g``cÚmÖ©ÖmJm g; gmJ¦'0m¤­¨`Aw o¡ £m$ J ñ `m;m`ëAy g'+T g6 ¬ 0o'w'Ø¡w¡¡AïÒdÑ«Ê«ÒKÝ©Å;É$Ä0ÅJÆTÊ Á ñ JAg oA' m .¤¥Aóy`A`B o'£6g#g6AgA`¦y ØA ¤¥A ÊÏmÈyÅJÆÃÇ£ÈAÉmÊHª¡+Õ+ÚTÛTüwÚmÅJÚmÖÜÛIÊ«ÝÊ¢ÆAÏ6Ñ«ÊëÅCÏTÒK¬ %xà ¡£4 o'w'`£ï oÃm¦¡¡§ o oTA¢ gÃA¦`w` A¤ ÔØÆAÑ9ÔÑ)ÎÒaÆAÑ£Ò×Ñ)ΣÒ9ÝsÏmÅ ÝÊ.Ò£¢ÑÉ;ÏÚmÖ¥¤§¦¨¢ÙÛÃÚTÐoÑ èþý#´yùT´¼³Ùÿ$À¡ ¦;H mæJ.4w6 g B oA¨¢y`mCgm) )¤¥AXgA`æ'¬ ÊÏÕ+ÚTÅ`ÛÆAÑ9ÔÑ)ÎÒÆAÑ£ÒdÑoΣÒKÝsÏTŤÒ×Ï6ÏTÖÜÊÇ)ÚIÊ£Ñ)Æ¢ÏmÅ}Õ+ÚTÛTüwÚmÅJÚmÖÜÛIÊ«ÝÊ © y zQcÚTÛRm`k oIQ ÈÙÊ«ÒHAg o ³J»úAµs¾·6¶s³J»0À^Á ê à × ¡¢JAg oA' g=¡w ³J¾!ùTúA°Ù·k³4ûõ÷fø±ùT°ÙúA¶9·¶9³4»HÀ m` o AÃm¤­`g'A)miA`m w£¬ 6Ù`Aw 0ogm) ) ê ê g¡Ag Ò ¦0ÏÆTÝÊ«ÒKÝ©ÅJΣÒJgA`o £$A¤C¡o g'++oA'oA oAA)mpm`A g¡±m`ëA£o4 £m g¡A¨`'­ o g6¨ g`0¦`A¡A` m`A g¡ïðs w¡` £¨ªHëªXm; oÃm`A ÃÏ)ÓѣŨoA'oA+£ ñ gTªXm)P o?QÚmÛHA`¨` ao£A; gªy£(Ay'y g¡A ªHÃ`£^oAw g cÑÅ4ìÝ©ÐoÏTÅ`Õ+Ñ£Å`ÒëÚIÊ)Ê«ÈyÕÓCÒ9ÝsÏmÅÊ#ðs¦ 4w¡ ñ m¤oA'oAm4m g gÙ'¡¬w`AA6B # gÃo£`A# g. ¦`mm4 ¨¦ ow g'g¡ oR`g'4 oA¡¨A¤{Q ÈÙÊ«Ò9$K¬ '¬0 g ¥ ! "$#%"'&$( #% )+*-,¥/.0"12% 234¥-562%¨!7!8") 2):9 y ëÒ£¢ÑëÊ£ÏTÈyÅJÆmÅJÑÊ)ʨÏwÔÇÈAÉmÊÄÐ)Ê«ÒK¬ -,¥$4) /34;§ <!¥):!"4 >=1 <? <!§@34¥?"4.A)34, 1 :B!)#%2)2C Soundness and its Role in Bug Detection Systems Yichen Xie Mayur Naik Brian Hackett Alex Aiken Computer Science Department Stanford University Stanford, CA 94305 The term soundness originated in mathematical logic: a The most widely used languages of the 1980's (C and C++) deductive system is sound with respect to a semantics if it deliberately had unsound type systems because of perceived only proves valid arguments. This concept naturally extends usability and performance problems with completely sound to the context of optimizing compilers, where static analysis type systems.
Load more

Recommended publications
  • Subdivision Surfaces Years of Experience at Pixar
    Subdivision Surfaces Years of Experience at Pixar - Recursively Generated B-Spline Surfaces on Arbitrary Topological Meshes Ed Catmull, Jim Clark 1978 Computer-Aided Design - Subdivision Surfaces in Character Animation Tony DeRose, Michael Kass, Tien Truong 1998 SIGGRAPH Proceedings - Feature Adaptive GPU Rendering of Catmull-Clark Subdivision Surfaces Matthias Niessner, Charles Loop, Mark Meyer, Tony DeRose 2012 ACM Transactions on Graphics Subdivision Advantages • Flexible Mesh Topology • Efficient Representation for Smooth Shapes • Semi-Sharp Creases for Fine Detail and Hard Surfaces • Open Source – Beta Available Now • It’s What We Use – Robust and Fast • Pixar Granting License to Necessary Subdivision Patents graphics.pixar.com Consistency • Exactly Matches RenderMan Internal Data Structures and Algorithms are the Same • Full Implementation Semi-Sharp Creases, Boundary Interpolation, Hierarchical Edits • Use OpenSubdiv for Your Projects! Custom and Third Party Animation, Modeling, and Painting Applications Performance • GPU Compute and GPU Tessellation • CUDA, OpenCL, GLSL, OpenMP • Linux, Windows, OS X • Insert Prman doc + hierarchical viewer GPU Performance • We use CUDA internally • Best Performance on CUDA and Kepler • NVIDIA Linux Profiling Tools OpenSubdiv On GPU Subdivision Mesh Topology Points CPU Subdivision VBO Tables GPU Patches Refine CUDA Kernels Tessellation Draw Improved Workflows • True Limit Surface Display • Interactive Manipulation • Animate While Displaying Full Surface Detail • New Sculpt and Paint Possibilities Sculpting & Ptex • Sculpt with Mudbox • Export to Ptex • Render with RenderMan • Insert toad demo Sculpt & Animate Too ! • OpenSubdiv Supports Ptex • OpenSubdiv Matches RenderMan • Enables Interactive Deformation • Insert rendered toad clip graphics.pixar.com Feature Adaptive GPU Rendering of Catmull-Clark Subdivision Surfaces Thursday – 2:00 pm Room 408a .
    [Show full text]
  • To Infinity and Back Again: Hand-Drawn Aesthetic and Affection for the Past in Pixar's Pioneering Animation
    To Infinity and Back Again: Hand-drawn Aesthetic and Affection for the Past in Pixar's Pioneering Animation Haswell, H. (2015). To Infinity and Back Again: Hand-drawn Aesthetic and Affection for the Past in Pixar's Pioneering Animation. Alphaville: Journal of Film and Screen Media, 8, [2]. http://www.alphavillejournal.com/Issue8/HTML/ArticleHaswell.html Published in: Alphaville: Journal of Film and Screen Media Document Version: Publisher's PDF, also known as Version of record Queen's University Belfast - Research Portal: Link to publication record in Queen's University Belfast Research Portal Publisher rights © 2015 The Authors. This is an open access article published under a Creative Commons Attribution-NonCommercial-NoDerivs License (https://creativecommons.org/licenses/by-nc-nd/4.0/), which permits distribution and reproduction for non-commercial purposes, provided the author and source are cited. General rights Copyright for the publications made accessible via the Queen's University Belfast Research Portal is retained by the author(s) and / or other copyright owners and it is a condition of accessing these publications that users recognise and abide by the legal requirements associated with these rights. Take down policy The Research Portal is Queen's institutional repository that provides access to Queen's research output. Every effort has been made to ensure that content in the Research Portal does not infringe any person's rights, or applicable UK laws. If you discover content in the Research Portal that you believe breaches copyright or violates any law, please contact [email protected]. Download date:28. Sep. 2021 1 To Infinity and Back Again: Hand-drawn Aesthetic and Affection for the Past in Pixar’s Pioneering Animation Helen Haswell, Queen’s University Belfast Abstract: In 2011, Pixar Animation Studios released a short film that challenged the contemporary characteristics of digital animation.
    [Show full text]
  • MONSTERS INC 3D Press Kit
    ©2012 Disney/Pixar. All Rights Reserved. CAST Sullivan . JOHN GOODMAN Mike . BILLY CRYSTAL Boo . MARY GIBBS Randall . STEVE BUSCEMI DISNEY Waternoose . JAMES COBURN Presents Celia . JENNIFER TILLY Roz . BOB PETERSON A Yeti . JOHN RATZENBERGER PIXAR ANIMATION STUDIOS Fungus . FRANK OZ Film Needleman & Smitty . DANIEL GERSON Floor Manager . STEVE SUSSKIND Flint . BONNIE HUNT Bile . JEFF PIDGEON George . SAM BLACK Additional Story Material by . .. BOB PETERSON DAVID SILVERMAN JOE RANFT STORY Story Manager . MARCIA GWENDOLYN JONES Directed by . PETE DOCTER Development Story Supervisor . JILL CULTON Co-Directed by . LEE UNKRICH Story Artists DAVID SILVERMAN MAX BRACE JIM CAPOBIANCO Produced by . DARLA K . ANDERSON DAVID FULP ROB GIBBS Executive Producers . JOHN LASSETER JASON KATZ BUD LUCKEY ANDREW STANTON MATTHEW LUHN TED MATHOT Associate Producer . .. KORI RAE KEN MITCHRONEY SANJAY PATEL Original Story by . PETE DOCTER JEFF PIDGEON JOE RANFT JILL CULTON BOB SCOTT DAVID SKELLY JEFF PIDGEON NATHAN STANTON RALPH EGGLESTON Additional Storyboarding Screenplay by . ANDREW STANTON GEEFWEE BOEDOE JOSEPH “ROCKET” EKERS DANIEL GERSON JORGEN KLUBIEN ANGUS MACLANE Music by . RANDY NEWMAN RICKY VEGA NIERVA FLOYD NORMAN Story Supervisor . BOB PETERSON JAN PINKAVA Film Editor . JIM STEWART Additional Screenplay Material by . ROBERT BAIRD Supervising Technical Director . THOMAS PORTER RHETT REESE Production Designers . HARLEY JESSUP JONATHAN ROBERTS BOB PAULEY Story Consultant . WILL CSAKLOS Art Directors . TIA W . KRATTER Script Coordinators . ESTHER PEARL DOMINIQUE LOUIS SHANNON WOOD Supervising Animators . GLENN MCQUEEN Story Coordinator . ESTHER PEARL RICH QUADE Story Production Assistants . ADRIAN OCHOA Lighting Supervisor . JEAN-CLAUDE J . KALACHE SABINE MAGDELENA KOCH Layout Supervisor . EWAN JOHNSON TOMOKO FERGUSON Shading Supervisor . RICK SAYRE Modeling Supervisor . EBEN OSTBY ART Set Dressing Supervisor .
    [Show full text]
  • The Metaverse and Digital Realities Transcript Introduction Plenary
    [Scientific Innovation Series 9] The Metaverse and Digital Realities Transcript Date: 08/27/2021 (Released) Editors: Ji Soo KIM, Jooseop LEE, Youwon PARK Introduction Yongtaek HONG: Welcome to the Chey Institute’s Scientific Innovation Series. Today, in the 9th iteration of the series, we focus on the Metaverse and Digital Realities. I am Yongtaek Hong, a Professor of Electrical and Computer Engineering at Seoul National University. I am particularly excited to moderate today’s webinar with the leading experts and scholars on the metaverse, a buzzword that has especially gained momentum during the online-everything shift of the pandemic. Today, we have Dr. Michael Kass and Dr. Douglas Lanman joining us from the United States. And we have Professor Byoungho Lee and Professor Woontack Woo joining us from Korea. Now, I will introduce you to our opening Plenary Speaker. Dr. Michael Kass is a senior distinguished engineer at NVIDIA and the overall software architect of NVIDIA Omniverse, NVIDIA’s platform and pipeline for collaborative 3D content creation based on USD. He is also the recipient of distinguished awards, including the 2005 Scientific and Technical Academy Award and the 2009 SIGGRAPH Computer Graphics Achievement Award. Plenary Session Michael KASS: So, my name is Michael Kass. I'm a distinguished engineer from NVIDIA. And today we'll be talking about NVIDIA's view of the metaverse and how we need an open metaverse. And we believe that the core of that metaverse should be USD, Pixar's Universal Theme Description. Now, I don't think I have to really do much to introduce the metaverse to this group, but the original name goes back to Neal Stephenson's novel Snow Crash in 1992, and the original idea probably goes back further.
    [Show full text]
  • Bibliography
    BIBLIOGRAPHY William W. Armstrong and Mark W. Green. Visual Computer, chapter The dynamics of artic- ulated rigid bodies for purposes of animation, pages 231–240. Springer-Verlag, 1985. David Baraff. Analytical methods for dynamic simulation of non-penetrating rigid bodies. Computer Graphics, 23(3):223–232, July 1989. Alan H. Barr. Global and local deformations of solid primitives. Computer Graphics, 18:21– 29, 1984. Proc. SIGGRAPH 1984. Ronen Barzel and Alan H. Barr. Topics in Physically Based Modeling, Course Notes, vol- ume 16, chapter Dynamic Constraints. SIGGRAPH, 1987. Ronen Barzel and Alan H. Barr. A modeling system based on dynamic constaints. Computer Graphics, 22:179–188, 1988. Armin Bruderlin and Thomas W. Calvert. Goal-directed, dynanmic animation of human walk- ing. Computer Graphics, 23(3):233–242, July 1989. John E. Chadwick, David R. Haumann, and Richard E. Parent. Layered construction for de- formable animated characters. Computer Graphics, 23(3):243–252, 1989. Proc. SIGGRAPH 1989. J. S. Duff, A. M. Erisman, and J.K. Reid. Direct Methods for Sparse Matrices. Oxford University Press, Oxford, UK, 1986. Kurt Fleischer and Andrew Witkin. A modeling testbed. In Proc. Graphics Interface, pages 127–137, 1988. Phillip Gill, Walter Murray, and Margret Wright. Practical Optimization. Academic Press, New York, NY, 1981. Michael Girard and Anthony A. Maciejewski. Computational Modeling for the Computer Animation of Legged Figures. Proc. SIGGRAPH, pages 263–270, 1985. Michael Gleicher and Andrew Witkin. Creating and manipulating constrained models. to appear, 1991. Michael Gleicher and Andrew Witkin. Snap together mathematics. In Edwin Blake and Peter Weisskirchen, editors, Proceedings of the 1990 Eurographics Workshop onObject Oriented Graphics.
    [Show full text]
  • To Infinity and Back Again: Hand-Drawn Aesthetic and Affection for the Past in Pixar's Pioneering Animation
    To Infinity and Back Again: Hand-drawn Aesthetic and Affection for the Past in Pixar's Pioneering Animation Haswell, H. (2015). To Infinity and Back Again: Hand-drawn Aesthetic and Affection for the Past in Pixar's Pioneering Animation. Alphaville: Journal of Film and Screen Media, 8, [2]. http://www.alphavillejournal.com/Issue8/HTML/ArticleHaswell.html Published in: Alphaville: Journal of Film and Screen Media Document Version: Publisher's PDF, also known as Version of record Queen's University Belfast - Research Portal: Link to publication record in Queen's University Belfast Research Portal Publisher rights © 2015 The Authors. This is an open access article published under a Creative Commons Attribution-NonCommercial-NoDerivs License (https://creativecommons.org/licenses/by-nc-nd/4.0/), which permits distribution and reproduction for non-commercial purposes, provided the author and source are cited. General rights Copyright for the publications made accessible via the Queen's University Belfast Research Portal is retained by the author(s) and / or other copyright owners and it is a condition of accessing these publications that users recognise and abide by the legal requirements associated with these rights. Take down policy The Research Portal is Queen's institutional repository that provides access to Queen's research output. Every effort has been made to ensure that content in the Research Portal does not infringe any person's rights, or applicable UK laws. If you discover content in the Research Portal that you believe breaches copyright or violates any law, please contact [email protected]. Download date:28. Sep. 2021 1 To Infinity and Back Again: Hand-drawn Aesthetic and Affection for the Past in Pixar’s Pioneering Animation Helen Haswell, Queen’s University Belfast Abstract: In 2011, Pixar Animation Studios released a short film that challenged the contemporary characteristics of digital animation.
    [Show full text]
  • An Introduction to Physically Based Modeling: an Introduction to Continuum Dynamics for Computer Graphics
    An Introduction to Physically Based Modeling: An Introduction to Continuum Dynamics for Computer Graphics Michael Kass Pixar Please note: This document is 1997 by Michael Kass. This chapter may be freely duplicated and distributed so long as no consideration is received in return, and this copyright notice remains intact. An Introduction to Continuum Dynamics for Computer Graphics Michael Kass Pixar 1 Introduction Mass-spring systems have been widely used in computer graphics because they provide a simple means of generating physically realistic motion for a wide range of situations of interest. Even though the actual mass of a real physical body is distributed through a volume, it is often possible to simu- late the motion of the body by lumping the mass into a collection of points. While the exact coupling between the motion of different points on a body may be extremely complex, it can frequently be ap- proximated by a set of springs. As a result, mass-spring systems provide a very versatile simulation technique. In many cases, however, there are much better simulation techniques than directly approximating a physical system with a set of mass points and springs. The motion of rigid bodies, for example, can be approximated by a small set of masses connected by very stiff springs. Unfortunately, the very stiff springs wreak havoc on the numerical solution methods, so it is much better to use a technique based on the rigid-body equations of motion. Another important special case arises with our subject here: elastic bodies and ¯uids. In many cases, they can be approximated by regular lattices of mass points and springs.
    [Show full text]
  • A Learning-Based Approach to Parametric Rotoscoping of Multi-Shape Systems
    A Learning-Based Approach to Parametric Rotoscoping of Multi-Shape Systems Luis Bermudez Nadine Dabby Yingxi Adelle Lin Intel Corporation Intel Corporation Intel Corporation [email protected] [email protected] [email protected] Sara Hilmarsdottir Narayan Sundararajan Swarnendu Kar Intel Corporation Intel Corporation Intel Corporation [email protected] [email protected] [email protected] Abstract artifacts to be imperceptible to the human eye, and they must be parametric so that an artist can iteratively modify Rotoscoping of facial features is often an integral part of them until the composite meets their rigorous standard. The Visual Effects post-production, where the parametric con- high standards and stringent requirements of state-of-the- tours created by artists need to be highly detailed, con- art rotoscoping still requires a significant amount of manual sist of multiple interacting components, and involve signif- labor from live action and animated films. icant manual supervision. Yet those assets are usually dis- We apply machine learning to automate rotoscoping in carded after compositing and hardly reused. In this paper, the post-production operations of stop-motion filmmaking, we present the first methodology to learn from these assets. in collaboration with LAIKA, a professional animation stu- With only a few manually rotoscoped shots, we identify and dio. LAIKA has a unique facial animation process in which extract semantically consistent and task specific landmark puppet expressions are comprised of multiple 3D printed points and re-vectorize the roto shapes based on these land- face parts that are snapped onto and off of the puppet over marks.
    [Show full text]
  • A System for Efficient 3D Printed Stop-Motion Face Animation
    A system for efficient 3D printed stop-motion face animation RINAT ABDRASHITOV, ALEC JACOBSON, KARAN SINGH, University of Toronto Fig. 1. Given an input mesh-animation sequence (a), our system segments and deforms the 3D mesh into parts that can be seamlessly joined (b). Each part is independently used to compute a replacement library, representative of the deforming part in the input (c). StopShop iteratively optimizes the library and a mapping from each frame of the input animation to the pieces in the library. Libraries are 3D printed and each frame is assembled according to the optimized mapping (d). Filmed in sequence, the animation is realized as a stop motion film (e). Computer animation in conjunction with 3D printing has the potential to used as the preferred technique for producing high-quality facial positively impact traditional stop-motion animation. As 3D printing every animation in stop motion film [Priebe 2011]. frame of a computer animation is prohibitively slow and expensive, 3D Faces and 3D models in general are created digitally (or physi- printed stop-motion can only be viable if animations can be faithfully re- cally sculpted and scanned) to produce a replacement library that produced using a compact library of 3D printed and efficiently assemblable covers the expressive range of the 3D model. This library, typically parts. We thus present the first system for processing computer animation containing thousands of variations of a deformable model is then 3D sequences (typically faces) to produce an optimal set of replacement parts for use in 3D printed stop-motion animation. Given an input animation printed and cataloged.
    [Show full text]
  • Meet Geri: the New Face of Animation
    SAVE THIS | EMAIL THIS | Close Meet Geri: The New Face of Animation Meet Geri: The New Face of Animation Pixar`s new short film advances the art and science of character animation Barbara Robertson The marriage of technology and art is not always an easy alliance. Taken to its extreme, the partnership pits left brain versus right brain, logic versus feeling, cold versus warm. Yet out of this conflict, a kind of creativity can emerge that neither side could produce alone. In the history of computer graphics, there are numerous beautiful examples of this creativity--and some of the most brilliant have been produced at Pixar Animation Studios. The most recent blending of Pixar`s state-of-the-art graphics technology with story-telling and animation, is Geri`s Game, a 4-1/2-minute animated short film that premiered in Los Angeles last November, in the nick of time for Academy Award Nominations. Academy Award honors are not new at Pixar: John Lasseter received a nomination in 1986 for Luxo, Jr. and an Oscar in 1988 for Tin Toy. What`s new is that this film marks the debut of a new director at Pixar, Jan Pinkava, and that Pinkava`s film is the first short animation to be produced by Pixar in eight years. Whether or not Geri`s Game joins its predecessors at Pixar by receiving an Oscar nomination this year, the film is likely to have as much impact on computer graphics animation as Pixar`s earlier shorts did--in terms of both art and technology.
    [Show full text]
  • Glift: Generic Data Structures for Graphics Hardware
    Glift: Generic Data Structures for Graphics Hardware By AARON ELIOT LEFOHN B.A. Chemistry (Whitman College) 1997 M.S. Physical Chemistry (University of Utah) 2001 M.S. Computer Science (University of Utah) 2004 DISSERTATION Submitted in partial satisfaction of the requirements for the degree of DOCTOR OF PHILOSOPHY in Computer Science in the OFFICE OF GRADUATE STUDIES of the UNIVERSITY OF CALIFORNIA DAVIS Approved: Committee in charge 2006 –i– Glift: Generic Data Structures for Graphics Hardware Copyright 2006 by Aaron Eliot Lefohn –ii– To Karen and Kaia. –iii– Acknowledgments I am humbled by the large number of people who have directly and indirectly contributed to this thesis. Throughout my time at UC Davis, I have had the great fortune to work with an outstand- ing collection of colleagues at UC Davis, Pixar, the University of Utah, Stanford, NVIDIA, the University of North Carolina, the University of Virginia and elsewhere. I begin by thanking my advisor, John Owens. I consider the most important traits in a graduate advisor to be trust and a passionate interest in my work. John has provided everything I needed to succeed and repeatedly put my best interests before his own. His passion for and interest in my work propelled me through the inevitable low points of research and encouraged me to take the risks required for true innovation. I cannot thank John enough for promoting my work and giving me the freedom to explore, even when it meant that I published four papers that are not part of this thesis. I also want to thank my committee members, Ken Joy, Bernd Hamann, Oliver Staadt, and Nina Amenta, for their feedback and comments.
    [Show full text]
  • Coherent Noise for Non-Photorealistic Rendering
    Coherent Noise for Non-Photorealistic Rendering Michael Kass∗ Davide Pesare † Pixar Animation Studios Abstract velocity fields. We then take a block of white noise as a function of (x,y,t) and filter it, taking into account the depth and velocity fields A wide variety of non-photorealistic rendering techniques make use and their consequent occlusion relationships. The result is what we of random variation in the placement or appearance of primitives. call a coherent noise field. Each frame alone looks like independent In order to avoid the “shower-door” effect, this random variation white noise, but the variation from frame to frame is consistent with should move with the objects in the scene. Here we present coher- the movement in the scene. The resulting noise can be queried by ent noise tailored to this purpose. We compute the coherent noise non-photorealistic rendering algorithms to create random variation with a specialized filter that uses the depth and velocity fields of a with uniform image-plane spatial properties that nonetheless appear source sequence. The computation is fast and suitable for interac- firmly attached to the 2d projections of the 3D objects. tive applications like games. 2 Previous Work CR Categories: I.3.3 [Computer Graphics]—Picture/Image Gen- eration; I.4.3 [Image Processing and Computer Vision]—contrast Bousseau et al. [2007] developed a technique for watercolor styl- enhancement, filtering ization that can be used for very similar purposes to the present work. Their method is based on the idea of advecting texture co- Keywords: Non-photorealistic rendering, noise, painterly render- ordinates.
    [Show full text]