Results 1  10
of
55,301
ON UNICYCLIC REFLEXIVE GRAPHS
"... A simple graph is said to be reflexive if the second largest eigenvalue of its (0,1)adjacency matrix does not exceed 2. Based on some recent results on reflexive graphs with more cycles and some new observations, we construct in this paper several classes of maximal unicyclic reflexive graphs. 1. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A simple graph is said to be reflexive if the second largest eigenvalue of its (0,1)adjacency matrix does not exceed 2. Based on some recent results on reflexive graphs with more cycles and some new observations, we construct in this paper several classes of maximal unicyclic reflexive graphs. 1.
Reflexive Graphs and Parametric Polymorphism
, 1993
"... this paper is to understand why that is a parametric categorical model. In [10] Ma and Reynolds propose a parametricity hypothesis for a functor between categorical models of polymorphism which essentially requires that there is an extension of (a certain form of) an identity relation functor which ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
presented in [10] can be viewed as a "parametric completion". We shall also follow the suggestion of Ma in [9] that subtyping is a kind of parametricity requirement and show how to fit subtyping in the same setup. The basic idea is to use reflexive graphs of categories as in [12]. We shall employ
Atomic Compactness and Reflexive Graphs.
, 1996
"... A first order structure M with universe M is atomic compact if every system of atomic formulas with parameters in M is satisfiable in M provided each of its finite subsystems is. The definition of atomic compactness goes back to Weglorz [Weg]. It extends to general first order structures the notion ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
of equational compactness, first considered by I. Kaplansky and J. Løs for Abelian groups, and later by J. Mycielsky for general algebras (see [Myc]). We present here miscellaneous results about atomic compactness of reflexive graphs. Contents 1 Preliminaries. 2 2 Graphs. 3 2.1 Conventions
DISTRIBUTIVE LATTICE POLYMORPHISM ON REFLEXIVE GRAPHS
"... Abstract. In this paper we give two characterisations of the class of reflexive graphs admitting distributive lattice polymorphisms and use these characterisations to attack the problem of finding a polynomial time recognition algorithm for these graphs. We provide a polynomial time recognition alg ..."
Abstract
 Add to MetaCart
Abstract. In this paper we give two characterisations of the class of reflexive graphs admitting distributive lattice polymorphisms and use these characterisations to attack the problem of finding a polynomial time recognition algorithm for these graphs. We provide a polynomial time recognition
NEARUNANIMITY FUNCTIONS AND VARIETIES OF REFLEXIVE GRAPHS
, 2008
"... Let H be a graph and k ≥ 3. A nearunanimity function of arity k is a mapping g from the ktuples over V (H) toV (H) such that g(x1,x2,...,xk) is adjacent to g(x ′ 1,x ′ 2,...,x ′ k) whenever xix ′ i ∈ E(H) for each i =1, 2,...,k, and g(x1,x2,...,xk) =a whenever at least k − 1of the xi’s equal a. ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
. Feder and Vardi proved that, if a graph H admits a nearunanimity function, then the homomorphism extension (or retraction) problem for H is polynomial time solvable. We focus on nearunanimity functions on reflexive graphs. The best understood are reflexive chordal graphs H: they always admit a near
Parametricity as a Notion of Uniformity in Reflexive Graphs
, 2002
"... data types embody uniformity in the form of information hiding. Information hiding enforces the uniform treatment of those entities that dier only on hidden information. ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
data types embody uniformity in the form of information hiding. Information hiding enforces the uniform treatment of those entities that dier only on hidden information.
Efficiently computing static single assignment form and the control dependence graph
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1991
"... In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point that advanced optimization features become undesirable. Recently, static single ass ..."
Abstract

Cited by 997 (8 self)
 Add to MetaCart
assignment form and the control dependence graph have been proposed to represent data flow and control flow propertiee of programs. Each of these previously unrelated techniques lends efficiency and power to a useful class of program optimization. Although both of these structures are attractive
Article No. TB971812 List Homomorphisms to Reflexive Graphs
, 1996
"... Let H be a fixed graph. We introduce the following list homomorphism problem: Given an input graph G and for each vertex v of G a ``list' ' L(v) V(H), decide whether or not there is a homomorphism f:G H such that f(v)#L(v) for each v#V(G). We discuss this problem primarily in the context o ..."
Abstract
 Add to MetaCart
of reflexive graphs, i.e., graphs in which each vertex has a loop. We give a polynomial time algorithm to solve the problem when H is an interval graph and prove that when H is not an interval graph the problem is NPcomplete. If the lists are restricted to induce connected subgraphs of H, we give a polynomial
Goaldirected Requirements Acquisition
 SCIENCE OF COMPUTER PROGRAMMING
, 1993
"... Requirements analysis includes a preliminary acquisition step where a global model for the specification of the system and its environment is elaborated. This model, called requirements model, involves concepts that are currently not supported by existing formal specification languages, such as goal ..."
Abstract

Cited by 572 (17 self)
 Add to MetaCart
, such as goals to be achieved, agents to be assigned, alternatives to be negotiated, etc. The paper presents an approach to requirements acquisition which is driven by such higherlevel concepts. Requirements models are acquired as instances of a conceptual metamodel. The latter can be represented as a graph
A Survey of Program Slicing Techniques
 JOURNAL OF PROGRAMMING LANGUAGES
, 1995
"... A program slice consists of the parts of a program that (potentially) affect the values computed at some point of interest, referred to as a slicing criterion. The task of computing program slices is called program slicing. The original definition of a program slice was presented by Weiser in 197 ..."
Abstract

Cited by 777 (8 self)
 Add to MetaCart
A program slice consists of the parts of a program that (potentially) affect the values computed at some point of interest, referred to as a slicing criterion. The task of computing program slices is called program slicing. The original definition of a program slice was presented by Weiser in 1979. Since then, various slightly different notions of program slices have been proposed, as well as a number of methods to compute them. An important distinction is that between a static and a dynamic slice. The former notion is computed without making assumptions regarding a program's input, whereas the latter relies on some specific test case. Procedures, arbitrary control flow, composite datatypes and pointers, and interprocess communication each require a specific solution. We classify static and dynamic slicing methods for each of these features, and compare their accuracy and efficiency. Moreover, the possibilities for combining solutions for different features are investigated....
Results 1  10
of
55,301