Results 1  10
of
6,126
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 790 (10 self)
 Add to MetaCart
, 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
DatatypeGeneric Termination Proofs
"... Datatypegeneric programs are programs that are parameterised by a datatype. We review the allegorical foundations of a methodology of designing datatypegeneric programs. The notion of Freductivity, where F parametrises a datatype, is reviewed and a number of its properties are presented. The prop ..."
Abstract
 Add to MetaCart
Datatypegeneric programs are programs that are parameterised by a datatype. We review the allegorical foundations of a methodology of designing datatypegeneric programs. The notion of Freductivity, where F parametrises a datatype, is reviewed and a number of its properties are presented
Shared Axiomatizations and Virtual Datatypes
"... In the form of a literate Haskell program, we provide a “shared axiomatization ” of Peano arithmetics, a bitstack representation of bijective base2 arithmetics, hereditarily finite sets (ZFset theory with the negation of the axiom of infinity and induction) and a few other equivalent constructs, ..."
Abstract
 Add to MetaCart
In the form of a literate Haskell program, we provide a “shared axiomatization ” of Peano arithmetics, a bitstack representation of bijective base2 arithmetics, hereditarily finite sets (ZFset theory with the negation of the axiom of infinity and induction) and a few other equivalent constructs, that turn out to express basic programming language concepts ranging from lists, sets and multisets, to trees, graphs and hypergraphs. The “axiomatization ” is described as a progressive refinement of Haskell type classes with examples of instances converging to an efficient implementation in terms of arbitrary length integers and bit operations. The resulting framework, extended with combinators providing isomorphisms between equivalent data representations, virtualizes data types as isomorphisms to a common representation supporting safe transfer of operations in the presence of polymorphic types. The selfcontained source code of the paper is available at
Complex Matching of RDF Datatype Properties
"... lapaesleme @ ic.uff.br Abstract. Property mapping is a fundamental component of ontology matching, and yet there is little support that goes beyond the identification of single property matches. Real data often requires some degree of composition, trivially exemplified by the mapping of FirstName, L ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
lapaesleme @ ic.uff.br Abstract. Property mapping is a fundamental component of ontology matching, and yet there is little support that goes beyond the identification of single property matches. Real data often requires some degree of composition, trivially exemplified by the mapping of First
Complex Matching of RDF Datatype Properties
"... Property mapping is a fundamental component of ontology matching, and yet there is little support that goes beyond the identification of single property matches. Real data often requires some degree of composition, trivially exemplified by the mapping of “first name”, “last name ” to “full name ” ..."
Abstract
 Add to MetaCart
Property mapping is a fundamental component of ontology matching, and yet there is little support that goes beyond the identification of single property matches. Real data often requires some degree of composition, trivially exemplified by the mapping of “first name”, “last name ” to “full name
Comparing DatatypeGeneric Libraries in Haskell
 UNDER CONSIDERATION FOR PUBLICATION IN J. FUNCTIONAL PROGRAMMING
, 2011
"... Datatypegeneric programming is parametrizing programs by the structure, or “shape” of datatypes, letting us write, for example, generic traversal or prettyprinting once and apply them to any data type whose shape we can represent. Although more than two decades old, the field has been vigorously g ..."
Abstract
 Add to MetaCart
Datatypegeneric programming is parametrizing programs by the structure, or “shape” of datatypes, letting us write, for example, generic traversal or prettyprinting once and apply them to any data type whose shape we can represent. Although more than two decades old, the field has been vigorously
Truly modular (co)datatypes for Isabelle/HOL
, 2014
"... We extended Isabelle/HOL with a pair of definitional commands for datatypes and codatatypes. They support mutual and nested (co)recursion through wellbehaved type constructors, including mixed recursion–corecursion, and are complemented by syntaxes for introducing primitively (co)recursive functi ..."
Abstract

Cited by 9 (8 self)
 Add to MetaCart
We extended Isabelle/HOL with a pair of definitional commands for datatypes and codatatypes. They support mutual and nested (co)recursion through wellbehaved type constructors, including mixed recursion–corecursion, and are complemented by syntaxes for introducing primitively (co
c © 1999 BCS Generalised folds for nested datatypes
"... Abstract. Nested datatypes generalise regular datatypes in much the same way that contextfree languages generalise regular ones. Although the categorical semantics of nested types turns out to be similar to the regular case, the fold functions are more limited because they can only describe natura ..."
Abstract
 Add to MetaCart
Abstract. Nested datatypes generalise regular datatypes in much the same way that contextfree languages generalise regular ones. Although the categorical semantics of nested types turns out to be similar to the regular case, the fold functions are more limited because they can only describe
Generic Datatypes a ̀ la Carte
"... Formal reasoning in proof assistants, also known as mechanization, has high development costs. Building modular reusable components is a key issue in reducing these costs. A stumbling block for reuse is that inductive definitions and proofs are closed to extension. This is a manifestation of the ..."
Abstract
 Add to MetaCart
of the expression problem that has been addressed by the MetaTheory a ̀ la Carte (MTC) framework in the context of programming language metatheory. However, MTC’s use of extensible Churchencodings is unsatisfactory. This paper takes a better approach to the problem with datatypegeneric programming (DGP
Foundational, Compositional (Co)datatypes for HigherOrder Logic  Category Theory Applied to Theorem Proving
"... Higherorder logic (HOL) forms the basis of several popular interactive theorem provers. These follow the definitional approach, reducing highlevel specifications to logical primitives. This also applies to the support for datatype definitions. However, the internal datatype construction used in H ..."
Abstract

Cited by 16 (10 self)
 Add to MetaCart
Higherorder logic (HOL) forms the basis of several popular interactive theorem provers. These follow the definitional approach, reducing highlevel specifications to logical primitives. This also applies to the support for datatype definitions. However, the internal datatype construction used
Results 1  10
of
6,126