The abstract data type (ADT) is the basis for the information-hiding design philosophy that makes software easier to analyze and understand, and that support maintenance and reuse. For these reasons, ADTs can be used ...
详细信息
The abstract data type (ADT) is the basis for the information-hiding design philosophy that makes software easier to analyze and understand, and that support maintenance and reuse. For these reasons, ADTs can be used to write contracts between specifiers that describe type requirements in an abstract and declarative way and programmers that implement components for these requirements. The construction of components from software specifications could not be a systematic activity if the specification language has powerful abstraction and expression capabilities. Therefore, it is very important to study different forms of type specification in order to understand its programming repercussions. The form of specification is essential to consider a type specification as a rigorous and effective functional contract for components between a specifier and a programmer.
‘Almost-certain eventualities’ are liveness properties that hold with probability 1. ‘Abstract probabilities’ are probabilities in transition systems about which we know only that they are neither 0 nor 1. Vardi [...
‘Almost-certain eventualities’ are liveness properties that hold with probability 1. ‘Abstract probabilities’ are probabilities in transition systems about which we know only that they are neither 0 nor 1. Vardi [17] showed that almost-certain properties in linear temporal logic depend only on abstract probabilities, rather than on the probabilities' precise values; we discuss the extent to which a similar result holds in quantitative temporal logic [9,10], and we show how to specialise the logic to those cases. The aim is to provide a simpler calculus than the full logic, one that is in a certain sense complete for proving almost-certain eventualities from abstract-probabilistic assumptions. We consider briefly the complexity of the specialised logic.
A new decision procedure for the existential fragment of ordering constraints expressed using the recursive path ordering is presented. This procedure is nondeterministic and checks whether a set of constraints is sol...
详细信息
One of the major difficulties in controlling software development project cost overruns and schedule delays has been developing practical and accurate software cost models. Software development could be modeled as an ...
详细信息
One of the major difficulties in controlling software development project cost overruns and schedule delays has been developing practical and accurate software cost models. Software development could be modeled as an economic production process and we therefore propose a theoretical approach to software cost modeling. Specifically, we present the Minimum Software Cost Model (MSCM), derived from economic production theory and systems optimization. The MSCM model is compared with other widely used software cost models, such as COCOMO and SLIM, on the basis of goodness of fit and quality of estimation using software project data sets available in the literature. Judged by both criteria, the MSCM model is comparable to, if not better than, the SLIM, and significantly better than the rest of the models. In addition, the MSCM model provides some insights about the behavior of software development processes and environment, which could be used to formulate guidelines for better software project management polic es and practices.
Precedent studies have revealed a strong relationship between discrete events formalisms and formalisms for temporal reasoning in Artificial Intelligence. Both areas typically deal with temporal or dynamic domains, bu...
详细信息
Several methods to compute the prime implicants and the prime implicates of a negation normal form (NNF) formula are developed and implemented. An algorithm PI is introduced that is an extension to negation normal for...
详细信息
Path dissolution is an inferencing mechanism for classical logic that efficiently generalizes the method of analytic tableaux. Two features that both methods enjoy are (in the propositional case) strong completeness a...
详细信息
暂无评论