Results 1  10
of
251
On the Equivalence of Topological Relations
 International Journal of Geographical Information Systems
, 1995
"... Abstract. Analysis of global geographic phenomena requires nonplanar models. In the past, models for topological relations have focused either on a twodimensional or a threedimensional space. When applied to the surface of a sphere, however, neither of the two models suffices. For the twodimensio ..."
Abstract

Cited by 150 (22 self)
 Add to MetaCart
Abstract. Analysis of global geographic phenomena requires nonplanar models. In the past, models for topological relations have focused either on a twodimensional or a threedimensional space. When applied to the surface of a sphere, however, neither of the two models suffices. For the twodimensional planar case, the eight binary topological relations between spatial regions are well known from the 9intersection model. This paper systematically develops the binary topological relations that can be realized on the surface of a sphere. Between two regions on the sphere there are three binary relations that cannot be realized in the plane. These relations complete the conceptual neighborhood graph of the eight planar topological relations in a regular fashion, providing evidence for a regularity of the underlying mathematical model. The analysis of the algebraic compositions of spherical topological relations indicates that spherical topological reasoning often provides fewer ambiguities than planar topological reasoning. Finally, a comparison with the relations that can be realized for onedimensional, ordered cycles draws parallels to the spherical topological relations. 1
Java Quality Assurance by Detecting Code Smells
 in Proceedings of the 9th Working Conference on Reverse Engineering. IEEE Computer
, 2002
"... Software inspection is a known technique for improving software quality. It involves carefully examining the code, the design, and the documentation of software and checking these for aspects that are known to be potentially problematic based on past experience. Code smells are a metaphor to describ ..."
Abstract

Cited by 147 (5 self)
 Add to MetaCart
(Show Context)
Software inspection is a known technique for improving software quality. It involves carefully examining the code, the design, and the documentation of software and checking these for aspects that are known to be potentially problematic based on past experience. Code smells are a metaphor to describe patterns that are generally associated with bad design and bad programming practices. Originally, code smells are used to find the places in software that could benefit from refactoring. In this paper, we investigate how the quality of code can be automatically assessed by checking for the presence of code smells and how this approach can contribute to automatic code inspection. We present an approach for the automatic detection and visualization of code smells and discuss how this approach can be used in the design of a software inspection tool. We illustrate the feasibility of our approach with the development of jCOSMO, a prototype code smell browser that detects and visualizes code smells in JAVA source code. Finally, we show how this tool was applied in a case study. Keywords: software inspection, quality assurance, Java, refactoring, code smells.
Logics for Hybrid Systems
 Proceedings of the IEEE
, 2000
"... This paper offers a synthetic overview of, and original contributions to, the use of logics and formal methods in the analysis of hybrid systems ..."
Abstract

Cited by 138 (13 self)
 Add to MetaCart
(Show Context)
This paper offers a synthetic overview of, and original contributions to, the use of logics and formal methods in the analysis of hybrid systems
Complexity and Algorithms for Reasoning About Time: A GraphTheoretic Approach
, 1992
"... Temporal events are regarded here as intervals on a time line. This paper deals with problems in reasoning about such intervals when the precise topological relationship between them is unknown or only partially specified. This work unifies notions of interval algebras in artificial intelligence ..."
Abstract

Cited by 100 (11 self)
 Add to MetaCart
Temporal events are regarded here as intervals on a time line. This paper deals with problems in reasoning about such intervals when the precise topological relationship between them is unknown or only partially specified. This work unifies notions of interval algebras in artificial intelligence with those of interval orders and interval graphs in combinatorics. The satisfiability, minimal labeling, all solutions and all realizations problems are considered for temporal (interval) data. Several versions are investigated by restricting the possible interval relationships yielding different complexity results. We show that even when the temporal data comprises of subsets of relations based on intersection and precedence only, the satisfiability question is NPcomplete. On the positive side, we give efficient algorithms for several restrictions of the problem. In the process, the interval graph sandwich problem is introduced, and is shown to be NPcomplete. This problem is als...
On Binary Constraint Problems
 Journal of the ACM
, 1994
"... The concepts of binary constraint satisfaction problems can be naturally generalized to the relation algebras of Tarski. The concept of pathconsistency plays a central role. Algorithms for pathconsistency can be implemented on matrices of relations and on matrices of elements from a relation algeb ..."
Abstract

Cited by 98 (2 self)
 Add to MetaCart
The concepts of binary constraint satisfaction problems can be naturally generalized to the relation algebras of Tarski. The concept of pathconsistency plays a central role. Algorithms for pathconsistency can be implemented on matrices of relations and on matrices of elements from a relation algebra. We give an example of a 4by4 matrix of infinite relations on which no iterative local pathconsistency algorithm terminates. We give a class of examples over a fixed finite algebra on which all iterative local algorithms, whether parallel or sequential, must take quadratic time. Specific relation algebras arising from interval constraint problems are also studied: the Interval Algebra, the Point Algebra, and the Containment Algebra. 1 Introduction The logical study of binary relations is classical [8], [9], [51], [52], [56], [53], [54]. Following this tradition, Tarski formulated the theory of binary relations as an algebraic theory called relation algebra [59] 1 . Constraint satis...
PairDense Relation Algebras
 Transactions of the American Mathematical Society
, 1991
"... The central result of this paper is that every pairdense relation algebra is completely representable. A relation algebra is said to be pairdense if every nonzero element below the identity contains a "pair". A pair is the relation algebraic analogue of a relation of the form fha; ai ..."
Abstract

Cited by 83 (9 self)
 Add to MetaCart
The central result of this paper is that every pairdense relation algebra is completely representable. A relation algebra is said to be pairdense if every nonzero element below the identity contains a "pair". A pair is the relation algebraic analogue of a relation of the form fha; ai ; hb; big (with a = b allowed). In a simple pairdense relation algebra, every pair is either a "point" (an algebraic analogue of fha; aig) or a "twin" (a pair which contains no point). In fact, every simple pairdense relation algebra A is completely representable over a set U iff jU j = + 2, where is the number of points of A and is the number of twins of A.
Structural Manipulations of Software Architecture Using Tarski Relational Algebra
, 1998
"... A software architecture is typically drawn as a nested set of box and arrow diagrams. The boxes represent components of the software system and the edges represent interactions. These diagrams correspond to typed graphs, in which there are a number of "types" or "colors" of edges ..."
Abstract

Cited by 74 (9 self)
 Add to MetaCart
A software architecture is typically drawn as a nested set of box and arrow diagrams. The boxes represent components of the software system and the edges represent interactions. These diagrams correspond to typed graphs, in which there are a number of "types" or "colors" of edges, and in which there is a distinguished "contain" relation that represents the system hierarchy (the nesting of boxes). During reverse engineering, one often transforms such diagrams in various ways to make them easier to understand. These transformations include edge aggregation, box abstraction (closing a box to hide its contents), and box separation (separating a box from its surrounding system). Such transformations are essential in helping make software architecture diagrams useful in practice. This paper shows how structural manipulations such as these can be specified and automatically carried out in a notation based on Tarski's relational algebra. The operators in this algebra include relational composi...
Action Logic and Pure Induction
 Logics in AI: European Workshop JELIA '90, LNCS 478
, 1991
"... In FloydHoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as onthefly assertions whose truth is evaluated along intervals instead of at states. Action logic is an equational theory ACT conservatively ex ..."
Abstract

Cited by 67 (6 self)
 Add to MetaCart
(Show Context)
In FloydHoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as onthefly assertions whose truth is evaluated along intervals instead of at states. Action logic is an equational theory ACT conservatively extending the equational theory REG of regular expressions with operations preimplication a!b (had a then b) and postimplication b/a (b ifever a). Unlike REG, ACT is finitely based, makes a reflexive transitive closure, and has an equivalent Hilbert system. The crucial axiom is that of pure induction, (a!a) = a!a. This work was supported by the National Science Foundation under grant number CCR8814921. 1 Introduction Many logics of action have been proposed, most of them in the past two decades. Here we define action logic, ACT, a new yet simple juxtaposition of old ideas, and show off some of its attractive aspects. The language of action logic is that of equational regular expressio...
The Second Calculus of Binary Relations
 In Proceedings of MFCS'93
, 1993
"... We view the Chu space interpretation of linear logic as an alternative interpretation of the language of the Peirce calculus of binary relations. Chu spaces amount to Kvalued binary relations, which for K = 2 n we show generalize nary relational structures. We also exhibit a fourstage unique fa ..."
Abstract

Cited by 64 (18 self)
 Add to MetaCart
We view the Chu space interpretation of linear logic as an alternative interpretation of the language of the Peirce calculus of binary relations. Chu spaces amount to Kvalued binary relations, which for K = 2 n we show generalize nary relational structures. We also exhibit a fourstage unique factorization system for Chu transforms that illuminates their operation. 1 Introduction In 1860 A. De Morgan [DM60] introduced a calculus of binary relations equivalent in expressive power to one whose formulas, written in today's notation, are inequalities a b between terms a; b; . . . built up from variables with the operations of composition a; b, converse a, and complement a \Gamma . In 1870 C.S. Peirce [Pei33] extended De Morgan's calculus with Boolean connectives a + b and ab, Boolean constants 0 and 1, and an identity 1 0 for composition. In 1895 E. Schroder devoted a book [Sch95] to the calculus, and further extended it with the operations of reflexive transitive closure, a ...