|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | A QUANTIFIER-ELIMINATION BASED HEURISTIC FOR AUTOMATICALLY GENERATING INDUCTIVE ASSERTIONS FOR PROGRAMS显示文摘用量词消除的一个方法为自动地产生程序 invariants/inductive 断言被建议。给一个程序,引入的断言,在一个理论作为 parameterized 假设了公式,与程序地点被联系。在引入的断言的参数被由保证引入的断言被导致程序的联系地点的所有实行路径确实保存在参数上产生限制发现。方法能被用来发现在一个环的入口仍然保持不变的变量不变性质的循环。parameterized 公式能被一个一个地考虑实行路径连续地精制;启发规则能为决定路径在被考虑的顺序被开发。如果可得到,象前提和帖子一样的变量调节的节目的初始化,能也被用来进一步精制假设不变。方法不取决于一个程序的前提 andpostcondition 的可获得性。这样产生的参数上的限制为参数的可能的价值被解决。如果没有解决方案是可能的,这意味着那一假设形式不变不是可能的在做产生联系确认条件的假设 / 近似下面为循环存在。不同如果参量的限制是可解决的,那么在为产生这些限制的方法上的某些条件下面,最强壮可能假设形式不变能从参量的限制的很一般的答案被产生。途径为表示断言象 Presburger 算术一样用多项式方程的连词的逻辑语言被说明。 | Deepak KAPUR | 2006 | Journal of Systems Science & Complexity2006，19，3： | 3 |
| 2 | Comprehensive G?bner Basis Theory for a Parametric Polynomial Ideal and the Associated Completion Algorithm显示文摘Gr?bner basis theory for parametric polynomial ideals is explored with the main objective of mimicking the Gr?bner basis theory for ideals. Given a parametric polynomial ideal, its basis is a comprehensive Gr?bner basis if and only if for every specialization of its parameters in a given field, the specialization of the basis is a Gr?bner basis of the associated specialized polynomial ideal.For various specializations of parameters, structure of specialized ideals becomes qualitatively different even though there are significant relationships as well because of finiteness properties. Key concepts foundational to Gr?bner basis theory are reexamined and/or further developed for the parametric case:(i) Definition of a comprehensive Gr?bner basis,(ii) test for a comprehensive Gr?bner basis,(iii) parameterized rewriting,(iv) S-polynomials among parametric polynomials,(v) completion algorithm for directly computing a comprehensive Gr?bner basis from a given basis of a parametric ideal. Elegant properties of Gr?bner bases in the classical ideal theory, such as for a fixed admissible term ordering,a unique Gr?bner basis can be associated with every polynomial ideal as well as that such a basis can be computed from any Gr?bner basis of an ideal, turn out to be a major challenge to generalize for parametric ideals; issues related to these investigations are explored. A prototype implementation of the algorithm has been successfully tried on many examples from the literature. | KAPUR Deepak | 2017 | Journal of Systems Science & Complexity2017，30，1： | 2 |
| 3 | Conditional Congruence Closure over Uninterpreted and Interpreted Symbols显示文摘A framework for generating congruence closure and conditional congruence closure of ground terms over uninterpreted as well as interpreted symbols satisfying various properties is proposed. It is based on some of the key concepts from Kapur's congruence closure algorithm(RTA97)for ground equations based on introducing new symbols for all nonconstant subterms appearing in the equation set and using ground completion on uninterpreted constants and puri?ed equalities over interpreted symbols belonging to different theories. In the original signature, the resulting rewrite systems may be nonterminating but they still generate canonical forms. A byproduct of this framework is a constant Horn completion algorithm using which ground canonical Horn rewrite systems can be generated for conditional ground theories.New effcient algorithms for generating congruence closure of conditional and unconditional equations on ground terms over uninterpreted symbols are presented. The complexity of the conditional congruence closure is shown to be O(n*log(n)), which is the same as for unconditional ground equations.The proposed algorithm is motivated by our attempts to generate effcient and succinct interpolants for the quanti?er-free theory of equality over uninterpreted function symbols which are often a conjunction of conditional equations and need additional simpli?cation. A completion algorithm to generate a canonical conditional rewrite system from ground conditional equations is also presented. The framework is general and ?exible and is used later to develop congruence closure algorithms for cases when function symbols satisfy simple properties such as commutativity, nilpotency, idempotency and identity as well as their combinations. Interesting outcomes include algorithms for canonical rewrite systems for ground equational and conditional theories on uninterpreted and interpreted symbols leading to generation of canonical forms for ground terms, constrained terms and Horn equations. | KAPUR Deepak | 2019 | Journal of Systems Science & Complexity2019，32，1： | 1 |
| 4 | Automatic generation of polynomial invariants of bounded degree using abstract interpretation 显示文摘 | EnricRodr' lguez-Carbonell Deepak Kapur | 2007 | Sci Comput Program2007，64，1： | 1 |
| 5 | An abstract in- terpretation approach for automatic generation of polynomi- al invariants 显示文摘 | EnricRodr'l guez-Carbonell Deepak Kapur | 2004 | SAS2004，3148，： | 1 |
| 6 | ON INVARIANT CHECKING显示文摘Checking whether a given formula is an invariant at a given program location(especially,inside a loop) can be quite nontrivial even for simple loop programs,given that it is in general an undecidable property.This is especially the case if the given formula is not an inductive loop invariant,as most automated techniques can only check or generate inductive loop invariants.In this paper,conditions are identified on simple loops and formulas when this check can be performed automatically.A general theorem is proved which gives a necessary and sufficient condition for a formula to be an invariant under certain restrictions on a loop.As a byproduct of this analysis,a new kind of loop invariant inside the loop body,called inside-loop invariant,is proposed.Such an invariant is more general than an inductive loop invariant typically used in the Floyd-Hoare axiomatic approach to program verification.The use of such invariants for program debugging is explored;it is shown that such invariants can be more useful than traditional inductive loop invariants especially when one is interested in checking extreme/side conditions such as underflow,accessing array/collection data structures outside the range,divide by zero,etc. | ZHANG Zhihai KAPUR Deepak | 2013 | Journal of Systems Science & Complexity2013，26，3： | 0 |
| 7 | Bimatoprost引起眼部周围皮肤色素沉着组织病理学研究显示文摘目的:研究卢美根引起眼部周围皮肤色素沉着的光镜和超微结构的改变。
方法:取使用卢美根后患者和对照患者的眼睑组织活检标本.进行光镜和透射电镜关。利用图形分析器。在Fontana-Masson-染色切片上计数黑色素颗粒。抗S100和CD3抗体进行免疫组化分析。计数阳性标记的细胞。
结果:在光镜下。黑色素颗粒数量在使用卢美根后患者的眼睑标本中明显增加。电镜下显示皮肤的黑色素细胞具有明显的粗面内质网和丰富的正常大小的色素颗粒。与正常标本相比处于不同的成熟阶段。使用卢美根后眼睑标本的角化细胞与正常对照相比显示丰富的成熟色素颗粒。此外值得注意的是。两种标本中都没有非典型的色素细胞。S100-阳性的黑色素细胞在使用卢美根和对照组眼睑标本的数量相当。两组中几乎没有CD-3和CD-68阳性的细胞。
结论:Bimatoprost引起的眼周色素沉着是由黑色素生成增加所致。在观察的标本上没有证据显示黑色素细胞增殖或前列腺素诱导的炎症反应发生。 | Rashmi Kapur Smajo Osmanovic Sami Toyran Deepak P. Edward 陆遥(译) 赵光喜(校) | 2006 | 美国医学会眼科杂志(中文版)2006，18，4： | 0 |
| 8 | 结膜黏液表皮样癌:透明细胞变异型显示文摘结膜黏液表皮样癌是一种罕见的结膜新生物,是唾液腺的常见恶性肿瘤.在结膜上它往往类似于鳞状细胞癌.肿瘤的组织学起源被认为是多能造血母细胞,还可能有黏液分秘成分,因此肿瘤由黏液分泌细胞组成其间混合表皮细胞。 | Rashmi Kapur Joel Sugar Deepak P.Edward 冯云(译) 赵光喜(校) | 2006 | 美国医学会眼科杂志(中文版)2006，18，4： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员