$\require{mediawiki-texvc}$

연합인증

연합인증 가입 기관의 연구자들은 소속기관의 인증정보(ID와 암호)를 이용해 다른 대학, 연구기관, 서비스 공급자의 다양한 온라인 자원과 연구 데이터를 이용할 수 있습니다.

이는 여행자가 자국에서 발행 받은 여권으로 세계 각국을 자유롭게 여행할 수 있는 것과 같습니다.

연합인증으로 이용이 가능한 서비스는 NTIS, DataON, Edison, Kafe, Webinar 등이 있습니다.

한번의 인증절차만으로 연합인증 가입 서비스에 추가 로그인 없이 이용이 가능합니다.

다만, 연합인증을 위해서는 최초 1회만 인증 절차가 필요합니다. (회원이 아닐 경우 회원 가입이 필요합니다.)

연합인증 절차는 다음과 같습니다.

최초이용시에는
ScienceON에 로그인 → 연합인증 서비스 접속 → 로그인 (본인 확인 또는 회원가입) → 서비스 이용

그 이후에는
ScienceON 로그인 → 연합인증 서비스 접속 → 서비스 이용

연합인증을 활용하시면 KISTI가 제공하는 다양한 서비스를 편리하게 이용하실 수 있습니다.

Interprocedural slicing of computer programs using dependence graphs 원문보기

IPC분류정보
국가/구분 United States(US) Patent 등록
국제특허분류(IPC7판)
  • G06F-009/45
출원번호 US-0324321 (1989-03-08)
발명자 / 주소
  • Reps Thomas (Madison WI) Horwitz Susan (Madison WI) Binkley David (Madison WI)
출원인 / 주소
  • Wisconsin Alumni Research Foundation (Madison WI 02)
인용정보 피인용 횟수 : 65  인용 특허 : 0

초록

Programs having multiple procedures are analyzed by creating a system dependence graph which includes a program dependence graph representing the main program, procedure dependence graphs for each of the auxiliary procedures, and additional edges that represent direct dependencies between a call sit

대표청구항

A method carried out by a digital computer for constructing a system dependence graph for a computer program system having multiple procedures, comprising the steps of: (a) for each procedure of the system, constructing its procedure dependence graph; (b) for each call site in the program, introduci

이 특허를 인용한 특허 (65)

  1. Ghosh, Somnath; Krishnaiyer, Rakesh; Li, Wei; Kanhere, Abhay; Kulkarni, Dattatraya; Lim, Chu-cheow; Ng, John L., Alias-free test for dynamic array structures.
  2. Grover, Vinod; Stratton, John A., Allocating memory for local variables of a multi-threaded program for execution in a single-threaded environment.
  3. Biggerstaff, Ted J., Anticipatory optimization with composite folding.
  4. Shimomura Takao,JPX, Automatic bug locator for automatically locating bugs through interaction with an operator.
  5. Odani Kensuke,JPX ; Tanaka Akira,JPX ; Tanaka Hirohisa,JPX, Compiler for optimizing memory instruction sequences by marking instructions not having multiple memory address paths.
  6. Peyton ; Jr. John T. ; de Jong Stuart, Compiler with inter-modular procedure optimization.
  7. Gulwani, Sumit; Zuleger, Florian Franz; Juvekar, Sudeep Dilip, Computing a symbolic bound for a procedure.
  8. Blainey Robert James,CAX ; Donawa Christopher Michael,CAX ; McInnes James Lawrence,CAX, Connectivity based program partitioning.
  9. Blomstedt, Joseph; Wang, Cheng; Wu, Youfeng, Context-sensitive slicing for dynamically parallelizing binary programs.
  10. Snyder, Michael; Blandy, Jim, Debugger system using tracepoints for computer software.
  11. Isard, Michael A.; Birrell, Andrew D.; Yu, Yuan, Description language for structured graphs.
  12. LaRowe, Gavin H.; Herr, II, Bruce W., Distributed platform for network analysis.
  13. Hundt, Robert; Ramasamy, Vinodha; Gouriou, Eric; Babcock, David J.; Lofgren, Thomas C.; Rivera, Jose German; Krishnaswamy, Umesh, Dynamic instrumentation of an executable program by means of causing a breakpoint at the entry point of a function and providing instrumentation code.
  14. Bishop John, Enabling troubleshooting of subroutines with greatest execution time/input data set size relationship.
  15. Grover, Vinod; Aarts, Bastiaan Joannes Matheus; Murphy, Michael; Kolhe, Jayant B.; Pormann, John Bryan; Saylor, Douglas, Execution of retargetted graphics processor accelerated code by a general purpose processor.
  16. Abadi, Aharon; Ettinger, Ran; Fieldman, Yishai; Bnayahu, Jonathan, Fine slicing: generating an executable bounded slice for program.
  17. Ju Dz-ching ; Gillies David M., Global control flow treatment of predicated code.
  18. Wu, Youfeng; Adl-Tabatabai, Ali; Berson, David A.; Fang, Jesse; Gupta, Rajiv, Hierarchical software path profiling.
  19. Srivastava Amitabh, Link time optimization via dead code elimination, code motion, code partitioning, code grouping, loop analysis with code motion, loop invariant analysis and active variable to register analysis.
  20. Srivastava Amitabh, Link time optimization with translation to intermediate program and following optimization techniques including program.
  21. Yu, Yuan; Gunda, Pradeep Kumar; Zhuang, Li, Management of data and computation in data centers.
  22. Kraft, Johan, Method and a system for searching for parts of a computer program which affects a given symbol.
  23. Ito, Makiko; Miyake, Hideo; Suga, Atsuhiro, Method and apparatus for analyzing large scale program and generation of code from degenerated program dependence graph.
  24. Sukumaran, Srihari; Sethu, Ramesh, Method and apparatus for analyzing software.
  25. Sukumaran, Srihari; Sethu, Ramesh, Method and apparatus for analyzing software including a calibrated value.
  26. Odnert Daryl (Boulder Creek CA) Santhanam Vatsa (Sunnyvale CA), Method and apparatus for compiling computer programs with interprocedural register allocation.
  27. Choi Jong-Deok ; Field John H. ; Ramalingam Ganesan ; Tip Frank, Method and apparatus for slicing class hierarchies.
  28. Biggerstaff Ted J., Method and system for anticipatory optimization of computer programs.
  29. Simonyi, Charles, Method and system for generating a computer program.
  30. Simonyi Charles, Method and system for generating and displaying a computer program.
  31. Zhao, Kan, Method and system for presenting and analyzing software source code through intermediate representation.
  32. Zhao, Kan, Method and system for presenting and analyzing software source code through intermediate representation.
  33. Simonyi Charles, Method and system for reducing an intentional program tree represented by high-level computational constructs.
  34. Simonyi Charles, Method and system for reducing an intentional program tree represented by high-level computational constructs.
  35. Simonyi Charles, Method and system for reducing an intentional program tree represented by high-level computational constructs.
  36. Simonyi Charles, Method and system for reducing an intentional program tree represented by high-level computational constructs.
  37. Simonyi Charles, Method and system for reducing an intentional program tree represented by high-level computational constructs.
  38. Arnold, Matthew R.; Fink, Stephen J.; Grove, David P.; Hind, Michael J.; Sweeney, Peter F.; Whaley, John, Method for characterizing program execution by periodic call stack inspection.
  39. Guan, Xiaohong; Zheng, Qinghua; Liu, Ting; Wang, Haijun, Method for test case reduction based on program behavior slices.
  40. Onder, Soner, Methods and systems for ordering instructions using future values.
  41. Odani Kensuke,JPX ; Sayama Junko,JPX ; Tanaka Akira,JPX, Optimization apparatus for removing hazards by arranging instruction order.
  42. Chandrasekharan Iyer ; Ajay Sethi, Optimizing parameter passing.
  43. Ngo Viet N. ; Tsai Wei-Tek, Outer loop vectorization.
  44. Clemm, Geoffrey M.; Komar, Paul; Mehra, Maneesh, Parallel development of a software system.
  45. Clemm, Geoffrey M.; Komar, Paul; Mehra, Maneesh, Parallel development of a software system.
  46. Clemm, Geoffrey M.; Komar, Paul; Mehra, Maneesh, Parallel development of a software system.
  47. Clemm, Geoffrey M.; Komar, Paul; Mehra, Maneesh, Parallel development of a software system.
  48. Clemm, Geoffrey M.; Komar, Paul; Mehra, Maneesh, Parallel development of a software system.
  49. Clemm, Geoffrey M.; Komar, Paul; Mehra, Maneesh, Parallel development of a software system.
  50. Landi William A. ; Altucher Rita Z., Partition based alias analyzer for pointers.
  51. Grover, Vinod; Aarts, Bastiaan Joannes Matheus; Murphy, Michael, Partitioning CUDA code for execution by a general purpose processor.
  52. Abadi, Aharon; Bnayahu, Jonathan; Ettinger, Ran; Feldman, Yishai, Plan-based program slicing.
  53. Abadi, Aharon; Bnayahu, Jonathan; Ettinger, Ran; Feldman, Yishai, Plan-based program slicing.
  54. Stanfill, Craig W., Processing transactions using graph-based computations including instances of computation graphs associated with the transactions.
  55. Nakaike, Takuya; Kondoh, Goh; Kitayama, Fumihiko; Hirose, Shinichi, Program editing apparatus, program editing method, and program for splitting a program file.
  56. Russell, Jeffry Thomas, Program slicing for codesign of embedded systems.
  57. Grover, Vinod; Aarts, Bastiaan Joannes Matheus; Murphy, Michael; Beylin, Boris; Kolhe, Jayant B.; Saylor, Douglas, Retargetting an application program for execution by a general purpose processor.
  58. Sweeney Peter F. ; Tip Frank, Rule-based engine for transformation of class hierarchy of an object-oriented program.
  59. Abadi, Aharon; Abadi, Moria; Ben-Harrush, Idan, Screen oriented data flow analysis.
  60. Poon, Hoifung; Toutanova, Kristina; Parikh, Ankur P., Semantic parsing for complex knowledge extraction.
  61. Kamakura, Jyunichi; Baba, Kazuya, System analysis apparatus and method, and storage medium storing system analysis program.
  62. Wagner, Timothy Allen; Garms, Jess; Hanson, Timothy, System and method for managing cross project dependencies at development time.
  63. Grover, Vinod; Aarts, Bastiaan Joannes Matheus; Murphy, Michael, Thread-local memory reference promotion for translating CUDA code for execution by a general purpose processor.
  64. Grover, Vinod; Aarts, Bastiaan Joannes Matheus; Murphy, Michael, Variance analysis for translating CUDA code for execution by a general purpose processor.
  65. Larus James R. ; Fraser Christopher W., Whole program path profiling.
섹션별 컨텐츠 바로가기

AI-Helper ※ AI-Helper는 오픈소스 모델을 사용합니다.

AI-Helper 아이콘
AI-Helper
안녕하세요, AI-Helper입니다. 좌측 "선택된 텍스트"에서 텍스트를 선택하여 요약, 번역, 용어설명을 실행하세요.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.

선택된 텍스트

맨위로