[...]the Buddhist prama system and the authenticity of the Buddhas words stood, in reality, in a reciprocal relation: the structuring of the former was done within the limits of the latter, and the latter was meant to...
详细信息
[...]the Buddhist prama system and the authenticity of the Buddhas words stood, in reality, in a reciprocal relation: the structuring of the former was done within the limits of the latter, and the latter was meant to be supported by the former.6 HAYES, however, stresses the vicious character of a different circle where the Buddhas authority is derived from his teaching of the four noble truths, when he summarises, we know that the Buddha is trustworthy because it was he who taught us all the things we Buddhists believe.7 We can leave these variants of the circle aside, however, withthe preliminary remark that these latter circles turn out to be vicious, while I and VETTER, as I understand him, think that our circles are nothing of the *** circles of VETTER (1964), NAGATOMI (1980), STEINKELLNER(1982), and HAYES (1984) were discussed again and analysed by Eli FRANCO (1999).
[...]flawless teaching must be the effect (krya) of the perfect spiritual attainments of some one who is able to speak flawlessly and who does not intend to deceive.
[...]the Buddhas authority is established.8I agree withthis non-circular derivation of the Buddhas authority in the tradition.
According to the dictionary this basic use has long been semantically extended to general use, such that the dictionary gives examples from writing since the 18th century where the term is applied to many things other than arguments and inferences, e. g., valid method, valid knowledge, validity of the notion etc.
[...]the phrase the Buddha is or has become a prama means the Buddha is or has become like a prama, and the usage of a rhetorical instrument such as that of a metaphor carries in addition the meaning of the Buddha is or has become a prama in the strict and true sense of the term.
the work on a visual formalism for specification of concurrent systems is presented. It is proposed to match requirements of state-of-the-art component-based design methods. Special emphasis is given to specification ...
详细信息
the work on a visual formalism for specification of concurrent systems is presented. It is proposed to match requirements of state-of-the-art component-based design methods. Special emphasis is given to specification of heterogeneous systems in which the different models of computation can be mixed together. We briefly summarize recent research related to the topic and give a sketch of the basic ideas for definition of the proposed language. the already achieved results of our work are presented as well.
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context of finite model theory. the character...
详细信息
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context of finite model theory. the characterization is tight and purely combinatorial. Our first application of this result is a surprising proof that the minimum space of refuting a 3-CNF formula is always bounded from below by the minimum width of refuting it (minus 3). this solves a well-known open problem. the second application is the unification of several width lower bound arguments, and a new width lower bound for the dense linear order principle. Since we also show that this principle has resolution refutations of polynomial size, this provides yet another example showing that the size-width relationship is tight.
We propose a practical parallel on-the-fly algorithm for enumerative LTL (linear temporal logic) model checking. the algorithm is designed for a cluster of workstations communicating via MPI (message passing interface...
详细信息
ISBN:
(纸本)9780769520353
We propose a practical parallel on-the-fly algorithm for enumerative LTL (linear temporal logic) model checking. the algorithm is designed for a cluster of workstations communicating via MPI (message passing interface). the detection of cycles (faulty runs) effectively employs the so called back-level edges. In particular, a parallel level-synchronized breadth-first search of the graph is performed to discover back-level edges. For each level, the back-level edges are checked in parallel by a nested depth-first search to confirm or refute the presence of a cycle. Several optimizations of the basic algorithm are presented and advantages and drawbacks of their application to distributed LTL model-checking are discussed. Experimental implementation of the algorithm shows promising results.
Dynamic detection of program invariants is emerging as an important research area with many challenging problems. Generating suitable test cases that support accurate detection of program invariants is crucial to the ...
详细信息
ISBN:
(纸本)9780769520353
Dynamic detection of program invariants is emerging as an important research area with many challenging problems. Generating suitable test cases that support accurate detection of program invariants is crucial to the dynamic approach of program invariant detection. In this paper, we propose a new structural coverage criterion called invariant-coverage criterion for dynamic detection of program invariants. We also show how the invariant-coverage criterion can be used to improve the accuracy of dynamically detected invariants. We first used the Daikon tool to report likely program invariants using the branch coverage and all definition-use pair coverage test suites for several programs. We then generated invariant-coverage suites for these likely invariants. When Daikon was run withthe invariant-coverage suites, several spurious invariants reported earlier by the branch coverage and definition-use pair coverage test suites were removed from the reported invariants. Our approach also produced more meaningful invariants than randomly generated test suites.
We present a method for performing fault localization using similar program spectra. Our method assumes the existence of a faulty run and a larger number of correct runs. It then selects according to a distance criter...
详细信息
ISBN:
(纸本)9780769520353
We present a method for performing fault localization using similar program spectra. Our method assumes the existence of a faulty run and a larger number of correct runs. It then selects according to a distance criterion the correct run that most resembles the faulty run, compares the spectra corresponding to these two runs, and produces a report of "suspicious" parts of the program. Our method is widely applicable because it does not require any knowledge of the program input and no more information from the user than a classification of the runs as either "correct" or "faulty". To experimentally validate the viability of the method, we implemented it in a tool, Whither, using basic block profiling spectra. We experimented with two different similarity measures and the Siemens suite of 132 programs with injected bugs. To measure the success of the tool, we developed a generic method for establishing the quality of a report. the method is based on the way an "ideal user" would navigate the program using the report to save effort during debugging. the best results obtained were, on average, above 50%, meaning that our ideal user would avoid looking half of the program.
Unit testing, a common step in software development, presents a challenge. When produced manually, unit test suites are often insufficient to identify defects. the main alternative is to use one of a variety of automa...
详细信息
ISBN:
(纸本)9780769520353
Unit testing, a common step in software development, presents a challenge. When produced manually, unit test suites are often insufficient to identify defects. the main alternative is to use one of a variety of automatic unit test generation tools: these are able to produce and execute a large number of test inputs that extensively exercise the unit under test. However, without a priori specifications, developers need to manually verify the outputs of these test executions, which is generally impractical. To reduce this cost, unit test selection techniques may be used to help select a subset of automatically generated test inputs. then developers can verify their outputs, equip them with test oracles, and put them into the existing test suite. In this paper, we present the operational violation approach for unit test selection, a black-box approach without requiring a priori specifications. the approach dynamically generates operational abstractions from executions of the existing unit test suite. Any automatically generated tests violating the operational abstractions are identified as candidates for selection. In addition, these operational abstractions can guide test generation tools to produce better tests. To experiment dynamic approach, we integrated the use of Daikon (a dynamic invariant detection tool) and Jtest (a commercial Java unit testing tool). An experiment is conducted to assess this approach.
18thinternational Symposium of Cipa by D. M. Barber, p.505 48th Photogrammetric Week by A. T. Smart, p.506 5thconference on Optical 3D Measurement Techniques by G. Hunter, p.509
18thinternational Symposium of Cipa by D. M. Barber, p.505 48th Photogrammetric Week by A. T. Smart, p.506 5thconference on Optical 3D Measurement Techniques by G. Hunter, p.509
In this paper we show that the language of declarative logicprogramming (DLP) with answer sets and its extensions can be used to specify database evolution due to updates and active rules, and to verify correctness o...
详细信息
ISBN:
(纸本)0769515312
In this paper we show that the language of declarative logicprogramming (DLP) with answer sets and its extensions can be used to specify database evolution due to updates and active rules, and to verify correctness of active rules with respect to a specification described using temporal logic and aggregate operators. We classify the specification of active rules into four kind of constraints which can be expressed using a particular extension of DLP called Smodels. Smodels allows us to specify the evolution, to specify the constraints, and to enumerate all possible initial database states and initial updates. Together, these can be used to analyze all possible evolution paths of an active database system to verify if they satisfy a set of given constraints.
暂无评论