Trans. Software Engineering, SE-3, June 1975.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....in software development is possible. 8.1 Software Reuse Krueger [34] is an excellent survey of software reuse, with criteria for practical effectiveness. Biggerstaff and Perlis [8] contains papers on theory and applications of reuse; artificial intelligence approaches are described in [1], 39] and [60] Mili [41] extensively surveys software reuse, emphasizing technical challenges. 8.2 Software Components The Programmer s Apprentice [61] was based on reuse of clich es, somewhat analogous to our generics. This project produced some good ideas but had limited success. KBEmacs, a ....

IEEE Trans. on Software Engineering, vol. 11, no. 11, Nov. 1985.

....and Perlis [4] contains papers on theory and applications of software reuse. Mili [29] provides an extensive survey of approaches to software reuse, emphasizing the technical challenges of reuse for software production. Artificial intelligence approaches to software engineering are described in [1], 28] and [41] Some papers from these sources are reviewed individually in this section. 23 6.2 Software Components Weide [52] proposes a software components industry analogous to the electronic components industry, based on formally specified and unchangeable components with rigid ....

IEEE Trans. on Software Engineering, vol. 11, no. 11, Nov. 1985.

....Politecnico di Bari Via Re David, 200 70125 Bari fdisciascio,doninig poliba.it Word Count: 5132 Abstract We present a simple description logic for semantic indexing in image retrieval. The language allows to describe complex shapes as composition of more simple ones, using linear transformations to describe the relative positions of shape components. An extensional semantics is provided, which allows us to formally de#ne reasoning services # such as recognition, subsumption, and satis#ability # and to study the computational properties of the formalism. The logic is devised ....

....recognition, allowing the image database administrator to correct or re#ne the description of the objects. We present here a description logic which deals only with exact recognition of two dimensional objects in images, i.e. recognition of objects by matching exactly their contour, up to linear transformations #rotations, scaling and translations#. Obviously, image recognition should allow for a certain degree of vagueness in matching shapes and identifying colors. However, we believe that before giving a logic of approximate recognition, the logic of exact recognition must be clearly stated ....

[Article contains additional citation context not shown here]

Trans. Software Engineering, 6#6#, 1980.

....Politecnico di Bari Via Re David, 200 70125 Bari fdisciascio,doninig poliba.it Word Count: 5132 Abstract We present a simple description logic for semantic indexing in image retrieval. The language allows to describe complex shapes as composition of more simple ones, using linear transformations to describe the relative positions of shape components. An extensional semantics is provided, which allows us to formally de#ne reasoning services # such as recognition, subsumption, and satis#ability # and to study the computational properties of the formalism. The logic is devised ....

....recognition, allowing the image database administrator to correct or re#ne the description of the objects. We present here a description logic which deals only with exact recognition of two dimensional objects in images, i.e. recognition of objects by matching exactly their contour, up to linear transformations #rotations, scaling and translations#. Obviously, image recognition should allow for a certain degree of vagueness in matching shapes and identifying colors. However, we believe that before giving a logic of approximate recognition, the logic of exact recognition must be clearly stated ....

[Article contains additional citation context not shown here]

Trans. Software Engineering, 14#5#, 1988.

....until the next stage. When one #nds a special type of fault, it is possible that he will soon #nd other faults of the same kind, and then as he proceeds further, since fewer such faults exist, the failure intensity decreases. Thus each lump in failure intensity could be associated with the transition from one testing stage to another during the testing process. By grouping failure intensity lumps in the data, we hope to minimize the noise associated with transition points during testing. The data points are selected according to neighbouring failure intensities. For example, if # i ## ....

....since fewer such faults exist, the failure intensity decreases. Thus each lump in failure intensity could be associated with the transition from one testing stage to another during the testing process. By grouping failure intensity lumps in the data, we hope to minimize the noise associated with transition points during testing. The data points are selected according to neighbouring failure intensities. For example, if # i ## i 1 # : # # j , and # j ## j 1 # : # # k then all the data points between t i and t k , excluding ## i ;t i # and ## k ;t k #,would be dropped due to grouping for ....

Trans. Software Engineering, Vol. 16, pp. 456-470, April 1990.

....paper, we motivate the need for a language like FIDO, and discuss our design and its implementation. We show how recursive data types, uni#cation, implicit coercions, and subtyping can be merged with a variation of predicate logic, called the Monadic Second order Logic #M2L# on trees. FIDO is translated #rst into pure M2L via suitable encodings, and #nally into #nite state automata through the MONA tool. 1 Introduction Finite state problems are everywhere, embedded in manylayers of software systems, but are often dif #cult to extract and solve computationally. This basic observation is ....

....values #labeled by # nite domains#, positions in recursive data values, and subsets of such positions. We show that many common programming language concepts #like subtyping, coercions, and uni#cation# make sense when the underlying semantics is based on assigning an automaton #and not a store transformer# to expressions. This semantic property allows us to view the compilation process as calculations on values that are deterministic, #nite state automata, just as an expression evaluator calculates on numbers to arrive at a result. That is, automata are the primitive objects that are ....

[Article contains additional citation context not shown here]

Trans. on Software Engineering, May 1997.

....human labor is the primary means employed to monitor the correctness of test case execution. Engineers may either manually derive correct output values # This researchwas partially supported by the Colorado Advanced Software Institute #CASI# and Storage Technology Corp. through a Technology Transfer Grant, #E#ective Speci#cations for Software Reliability Management. for each test case generated, or may manually inspect the output after each test run. This labor intensive process is both expensive and error prone. The process of determining the correctness of program output must be ....

Trans. Software Engineering, SE-11#4#:367#375, April 1985.

....is a process oriented discrete event simulation language embedded in C . Models can be executed sequentially or on a distributed system using Time Warp optimistic approach. Performance of distributed simulation can be enhanced if entities are allowed to share memory. Such an optimalization is not transparent and has to be hardwired in the model description. Maisie [2] is a process oriented language with a run time environment for conservative and optimistic approaches to distributed simulation. Its central construct is powerful wait statement for accepting incoming messages, with Boolean ....

....execution. Lookahead, or the ability to predict the future behaviour is important for the performance of conservative simulation protocols [5, 13] A simulation run could be more effective if some embedded knowledge is available (e.g. when server starts execution it knows a time of departure of transaction so the transaction can be propagated to next processors before a departure actually takes place) Each object in the simulation model should support a virtual method of a local lookahead information. The generic mechanism is responsible for computation of the lookahead for the whole ....

[Article contains additional citation context not shown here]

Trans. on software engineering, Vol. SE-5, No. 5, 1979, pp.

No context found.

Code Mobility. IEEE Trans. on Software Engineering, 24(5), 1998.

No context found.

Trans. Software Engineering, SE-3, June 1975.

No context found.

IEEE Trans. on Software Engineering, vol. 18, no. 1, pp. 9 - 18, January 1992.

No context found.

IEEE Trans. Software Engineering, 16#9#:1024#1043, September 1990.

No context found.

Models", IEEE Trans. Software Engineering, Vol. 18, No. 7, July 1992, pp. 563-574.

No context found.

IEEE Trans. Software Engineering, 16#9#:1044#1057, September 1990.

No context found.

IEEE Trans. on Software Engineering, SE-6#6#, Nov. 1980.

No context found.

IEEE Trans. on Software Engineering, 3#1#, 1977.

No context found.

IEEE Trans. Software Engineering, SE12 #2#:312#325, February 1986.

No context found.

IEEE Trans. Software Engineering, 21#3#:263#265, March 1995.

No context found.

J. L. Bentley, IEEE Trans. on Software Engineering, SE-5, (No. 4, July 1979), pp. 333-340.

No context found.

IEEE Trans. on Software Engineering. , SE-3(1) Sommerville, I., Sawyer, P., Kotonya, G. and Viller, S. 1995. Process Viewpoints. In Proc. Proc. 5th European Workshop on Software Process Technology, Amsterdam, The Netherlands.

No context found.

IEEE Trans. on Software Engineering. Bouajjani, A., R. Echahed and J. Sifakis (1993).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC