Sciweavers

162 search results - page 24 / 33
» rules 1997
Sort
View
INFOCOM
1997
IEEE
15 years 4 months ago
Analyzing Non-Determinism in Telecommunication Services Using P-Invariant of Petri-Net Model
The non-deterministic behaviors in telecommunication services are well-known as one of the most typical Feature Interactions, and they should be detected and eliminated from the t...
Masahide Nakamura, Yoshiaki Kakuda, Tohru Kikuno
IPPS
1997
IEEE
15 years 4 months ago
Time-Stamping Algorithms for Parallelization of Loops at Run-Time
In this paper, we present two new run-time algorithms for the parallelization of loops that have indirect access patterns. The algorithms can handle any type of loop-carried depen...
Cheng-Zhong Xu, Vipin Chaudhary
KBSE
1997
IEEE
15 years 4 months ago
Applying Concept Formation Methods to Object Identification in Procedural Code
Legacy software systems present a high level of entropy combined with imprecise documentation. This makes their maintenance more difficult, more time consuming, and costlier. In o...
Houari A. Sahraoui, Walcélio L. Melo, Hakim...
89
Voted
KBSE
1997
IEEE
15 years 4 months ago
NORA/HAMMR: Making Deduction-Based Software Component Retrieval Practical
Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This...
Johann Schumann, Bernd Fischer 0002
LICS
1997
IEEE
15 years 4 months ago
The Complexity of Subtype Entailment for Simple Types
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
Fritz Henglein, Jakob Rehof