A two-phase monadic approach is presented for monadically slicing programs with procedures. In the monadic slice algorithm for interprocedural programs, phase 1 initializes the slice table of formal parameters in a pr...A two-phase monadic approach is presented for monadically slicing programs with procedures. In the monadic slice algorithm for interprocedural programs, phase 1 initializes the slice table of formal parameters in a procedure with the given labels, and then captures the callees＇ influence on callers when analyzing call statements. Phase 2 captures the callees＇ dependence on callers by replacing all given labels appearing in the corresponding sets of formal parameters. By the introduction of given labels, this slice method can obtain similar summary information in system-dependence-graph（SDG）-based algorithms for addressing the calling-context problem. With the use of the slice monad transformer, this monadic slicing approach achieves a high level of modularity and flexibility. It shows that the monadic interprocedural algorithm has less complexity and it is not less precise than SDG algorithms.展开更多
With the scale of programs becoming increasingly bigger, and the complexity degree higher, how to select program fragments for slicing has become an important research topic. A new type of criterion called interesting...With the scale of programs becoming increasingly bigger, and the complexity degree higher, how to select program fragments for slicing has become an important research topic. A new type of criterion called interesting index is proposed for selecting parts of procedures or procedure fragments to do program slicing. This new criterion considers not only the subjective aspects in users, namely users' emphasis on the time efficiency, storage capacity or readability, but also the objective aspect in large procedures. It also represents the benefit of the users, while displaying the many-faceted roles that program slicing plays. In this way users call proceed with program slicing to large systems or unfinished systems.展开更多
Though Unified Modeling Language (UML) has been widely used in software development, the major problems confronted lie in comprehension and testing. Dependence analysis is an important approach to analyze, understand,...Though Unified Modeling Language (UML) has been widely used in software development, the major problems confronted lie in comprehension and testing. Dependence analysis is an important approach to analyze, understand, test and maintain programs. A new kind of dependence analysis method for UML class diagrams is developed. A set of dependence relations is definedcorresponding to the relations among classes. Thus, the dependence graph of UML class diagram can be constructed from these dependence relations. Based on this model, both slicing and measurement coupling are further given as its two applications.展开更多
This letter proposes a hybrid method for computing dynamic program slicing. The key element is to construct a Coverage-Testing-based Dynamic Dependence Graph (CTDDG),which makes use of both dynamic and static informat...This letter proposes a hybrid method for computing dynamic program slicing. The key element is to construct a Coverage-Testing-based Dynamic Dependence Graph (CTDDG),which makes use of both dynamic and static information to get execution status. The approach overcomes the limitations of previous dynamic slicing methods, which have to redo slicing if slice criterion changes.展开更多
To describe a semiconductor wafer fabrication flow availably, a new modeling method of extended hybrid Petri nets （EHPNs） was proposed. To model the discrete part and continuous part of a complex photolithography pr...To describe a semiconductor wafer fabrication flow availably, a new modeling method of extended hybrid Petri nets （EHPNs） was proposed. To model the discrete part and continuous part of a complex photolithography process, hybrid Petri nets （HPNs） were introduced. To cope with the complexity of a photolithography process, object-oriented methods such as encapsulation and classifications were integrated with HPN models. EHPN definitions were presented on the basis of HPN models and object-oriented methods. Object-oriented hybrid Petri subnet models were developed for each typical physical object and an EHPN modeling procedure steps were structured. To demonstrate the feasibility and validity of the proposed modeling method, a real wafer photolithography case was used to illustrate the modeling procedure. dynamic modeling of a complex photolithography process effectively The modeling results indicate that the EHPNs can deal with the dynamic modeling of a complex photolithography process effectively.展开更多
Petri net is an important tool to model and analyze concurrent systems,but Petri net models are frequently large and complex,and difficult to understand and modify.Slicing is a technique to remove unnecessary parts wi...Petri net is an important tool to model and analyze concurrent systems,but Petri net models are frequently large and complex,and difficult to understand and modify.Slicing is a technique to remove unnecessary parts with respect to a criterion for analyzing programs,and has been widely used in specification level for model reduction,but researches on slicing of Petri nets are still limited.According to the idea of program slicing,this paper extends slicing technologies of Petri nets to four kinds of slices,including backward static slice,backward dynamic slice,forward static slice and forward dynamic slice.Based on the structure properties,the algorithms of obtaining two kinds of static slice are constructed.Then,a new method of slicing backward dynamic slice is proposed based on local reachability graph which can locally reflect the dynamic properties of Petri nets.At last,forward dynamic slice can be obtained through the reachability marking graph under a special marking.The algorithms can be used to reduce the size of Petri net,which can provide the basic technical support for simplifying the complexity of formal verification and analysis.展开更多
Sequence assembling is an important step for bioinformatics study.With the help of next generation sequencing(NGS)technology,high throughput DNA fragment(reads)can be randomly sampled from DNA or RNA molecular sequenc...Sequence assembling is an important step for bioinformatics study.With the help of next generation sequencing(NGS)technology,high throughput DNA fragment(reads)can be randomly sampled from DNA or RNA molecular sequence.However,as the positions of reads being sampled are unknown,assembling process is required for combining overlapped reads to reconstruct the original DNA or RNA sequence.Compared with traditional Sanger sequencing methods,although the throughput of NGS reads increases,the read length is shorter and the error rate is higher.It introduces several problems in assembling.Moreover,paired-end reads instead of single-end reads can be sampled which contain more information.The existing assemblers cannot fully utilize this information and fails to assemble longer contigs.In this article,we will revisit the major problems of assembling NGS reads on genomic,transcriptomic,metagenomic and metatranscriptomic data.We will also describe our IDBA package for solving these problems.IDBA package has adopted several novel ideas in assembling,including using multiple k,local assembling and progressive depth removal.Compared with existence assemblers,IDBA has better performance on many simulated and real sequencing datasets.展开更多
The evolvable multiprocessor (EvoMP), as a novel multiprocessor system-on-chip (MPSoC) machine with evolvable task decomposition and scheduling, claims a major feature of low-cost and efficient fault tolerance. Non-ce...The evolvable multiprocessor (EvoMP), as a novel multiprocessor system-on-chip (MPSoC) machine with evolvable task decomposition and scheduling, claims a major feature of low-cost and efficient fault tolerance. Non-centralized control and adaptive distribution of the program among the available processors are two major capabilities of this platform, which remarkably help to achieve an efficient fault tolerance scheme. This letter presents the operational as well as architectural details of this fault tolerance scheme. In this method, when a processor becomes faulty, it will be eliminated of contribution in program execution in remaining run-time. This method also utilizes dynamic rescheduling capability of the system to achieve the maximum possible efficiency after processor reduction. The results confirm the efficiency and remarkable advantages of the proposed approach over common redundancy based techniques in similar systems.展开更多
基金The National Outstanding Young Scientist Foundation by NSFC(No.60703086,60503020)
文摘A two-phase monadic approach is presented for monadically slicing programs with procedures. In the monadic slice algorithm for interprocedural programs, phase 1 initializes the slice table of formal parameters in a procedure with the given labels, and then captures the callees＇ influence on callers when analyzing call statements. Phase 2 captures the callees＇ dependence on callers by replacing all given labels appearing in the corresponding sets of formal parameters. By the introduction of given labels, this slice method can obtain similar summary information in system-dependence-graph（SDG）-based algorithms for addressing the calling-context problem. With the use of the slice monad transformer, this monadic slicing approach achieves a high level of modularity and flexibility. It shows that the monadic interprocedural algorithm has less complexity and it is not less precise than SDG algorithms.
文摘With the scale of programs becoming increasingly bigger, and the complexity degree higher, how to select program fragments for slicing has become an important research topic. A new type of criterion called interesting index is proposed for selecting parts of procedures or procedure fragments to do program slicing. This new criterion considers not only the subjective aspects in users, namely users' emphasis on the time efficiency, storage capacity or readability, but also the objective aspect in large procedures. It also represents the benefit of the users, while displaying the many-faceted roles that program slicing plays. In this way users call proceed with program slicing to large systems or unfinished systems.
文摘Though Unified Modeling Language (UML) has been widely used in software development, the major problems confronted lie in comprehension and testing. Dependence analysis is an important approach to analyze, understand, test and maintain programs. A new kind of dependence analysis method for UML class diagrams is developed. A set of dependence relations is definedcorresponding to the relations among classes. Thus, the dependence graph of UML class diagram can be constructed from these dependence relations. Based on this model, both slicing and measurement coupling are further given as its two applications.
文摘This letter proposes a hybrid method for computing dynamic program slicing. The key element is to construct a Coverage-Testing-based Dynamic Dependence Graph (CTDDG),which makes use of both dynamic and static information to get execution status. The approach overcomes the limitations of previous dynamic slicing methods, which have to redo slicing if slice criterion changes.
基金Project(60574054) supported by the National Natural Science Foundation of China
文摘To describe a semiconductor wafer fabrication flow availably, a new modeling method of extended hybrid Petri nets （EHPNs） was proposed. To model the discrete part and continuous part of a complex photolithography process, hybrid Petri nets （HPNs） were introduced. To cope with the complexity of a photolithography process, object-oriented methods such as encapsulation and classifications were integrated with HPN models. EHPN definitions were presented on the basis of HPN models and object-oriented methods. Object-oriented hybrid Petri subnet models were developed for each typical physical object and an EHPN modeling procedure steps were structured. To demonstrate the feasibility and validity of the proposed modeling method, a real wafer photolithography case was used to illustrate the modeling procedure. dynamic modeling of a complex photolithography process effectively The modeling results indicate that the EHPNs can deal with the dynamic modeling of a complex photolithography process effectively.
基金Supported by the National Natural Science Foundation of China(No.90818023)the National Basic Research Program of China(No.2010CB328101)+2 种基金Shanghai Science&Technology Research Plan(No.09JC1414200,09510701300)"Dawn"Program of Shanghai Education Commission,Program for Changjiang Scholars and Innovative Research Team in University(PCSIRT),National Major Projects of Scienceand Technology(No.2009ZX01036-001-002:part 5)Natural Science Foundation of Educational Government of Anhui Province(No.KJ2011A086)
文摘Petri net is an important tool to model and analyze concurrent systems,but Petri net models are frequently large and complex,and difficult to understand and modify.Slicing is a technique to remove unnecessary parts with respect to a criterion for analyzing programs,and has been widely used in specification level for model reduction,but researches on slicing of Petri nets are still limited.According to the idea of program slicing,this paper extends slicing technologies of Petri nets to four kinds of slices,including backward static slice,backward dynamic slice,forward static slice and forward dynamic slice.Based on the structure properties,the algorithms of obtaining two kinds of static slice are constructed.Then,a new method of slicing backward dynamic slice is proposed based on local reachability graph which can locally reflect the dynamic properties of Petri nets.At last,forward dynamic slice can be obtained through the reachability marking graph under a special marking.The algorithms can be used to reduce the size of Petri net,which can provide the basic technical support for simplifying the complexity of formal verification and analysis.
基金supported in part by Hong Kong GRF HKU 7111/12E, 719611EShenzhen Basic Research Project JCYJ20120618143038947 (SIRI/04/04/2012/05)Outstanding Researcher Award (102009124).
文摘Sequence assembling is an important step for bioinformatics study.With the help of next generation sequencing(NGS)technology,high throughput DNA fragment(reads)can be randomly sampled from DNA or RNA molecular sequence.However,as the positions of reads being sampled are unknown,assembling process is required for combining overlapped reads to reconstruct the original DNA or RNA sequence.Compared with traditional Sanger sequencing methods,although the throughput of NGS reads increases,the read length is shorter and the error rate is higher.It introduces several problems in assembling.Moreover,paired-end reads instead of single-end reads can be sampled which contain more information.The existing assemblers cannot fully utilize this information and fails to assemble longer contigs.In this article,we will revisit the major problems of assembling NGS reads on genomic,transcriptomic,metagenomic and metatranscriptomic data.We will also describe our IDBA package for solving these problems.IDBA package has adopted several novel ideas in assembling,including using multiple k,local assembling and progressive depth removal.Compared with existence assemblers,IDBA has better performance on many simulated and real sequencing datasets.
文摘The evolvable multiprocessor (EvoMP), as a novel multiprocessor system-on-chip (MPSoC) machine with evolvable task decomposition and scheduling, claims a major feature of low-cost and efficient fault tolerance. Non-centralized control and adaptive distribution of the program among the available processors are two major capabilities of this platform, which remarkably help to achieve an efficient fault tolerance scheme. This letter presents the operational as well as architectural details of this fault tolerance scheme. In this method, when a processor becomes faulty, it will be eliminated of contribution in program execution in remaining run-time. This method also utilizes dynamic rescheduling capability of the system to achieve the maximum possible efficiency after processor reduction. The results confirm the efficiency and remarkable advantages of the proposed approach over common redundancy based techniques in similar systems.
