Results 1  10
of
13
Certifying DomainSpecific Policies
, 2001
"... Proofchecking code for compliance to safety policies potentially enables a productoriented approach to certain aspects of software certification. To date, previous research has focused on generic, lowlevel programminglanguage properties such as memory type safety. In this paper we consider proof ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
Proofchecking code for compliance to safety policies potentially enables a productoriented approach to certain aspects of software certification. To date, previous research has focused on generic, lowlevel programminglanguage properties such as memory type safety. In this paper we consider proofchecking higherlevel domainspecific properties for compliance to safety policies. The paper first describes a framework related to abstract interpretation in which compliance to a class of certification policies can be efficiently calculated. Membership equational logic is shown to provide a rich logic for carrying out such calculations, including partiality, for certification. The architecture for a domainspecific certifier is described, followed by an implemented case study. The case study considers consistency of abstract variable attributes in code that performs geometric calculations in Aerospace systems.
Tossing Algebraic Flowers down the Great Divide
 In People and Ideas in Theoretical Computer Science
, 1999
"... Data Types and Algebraic Semantics The history of programming languages, and to a large extent of software engineering as a whole, can be seen as a succession of ever more powerful abstraction mechanisms. The first stored program computers were programmed in binary, which soon gave way to assembly l ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
Data Types and Algebraic Semantics The history of programming languages, and to a large extent of software engineering as a whole, can be seen as a succession of ever more powerful abstraction mechanisms. The first stored program computers were programmed in binary, which soon gave way to assembly languages that allowed symbolic codes for operations and addresses. fortran began the spread of "high level" programming languages, though at the time it was strongly opposed by many assembly programmers; important features that developed later include blocks, recursive procedures, flexible types, classes, inheritance, modules, and genericity. Without going into the philosophical problems raised by abstraction (which in view of the discussion of realism in Section 4 may be considerable), it seems clear that the mathematics used to describe programming concepts should in general get more abstract as the programming concepts get more abstract. Nevertheless, there has been great resistance to u...
Relative Complexity of Algebras
, 1981
"... A simple algebraic model is proposed fr measuring the relative complexity of programming systems. The appropriateness of this model is illustrated by its use as a framework for the statement and proof of results dealing with codingindependent limitations on the relative complexity of basic alge ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
A simple algebraic model is proposed fr measuring the relative complexity of programming systems. The appropriateness of this model is illustrated by its use as a framework for the statement and proof of results dealing with codingindependent limitations on the relative complexity of basic algebras.
Certifying DomainSpecific Policies
"... Proofchecking code for compliance to safe _ policies potentially enables a productoriented approach to certain aspects of software certification. To date, previous research has focused on generic, lowlevel programminglanguage properties such as memory type safety. In this paper we consider proof ..."
Abstract
 Add to MetaCart
(Show Context)
Proofchecking code for compliance to safe _ policies potentially enables a productoriented approach to certain aspects of software certification. To date, previous research has focused on generic, lowlevel programminglanguage properties such as memory type safety. In this paper we consider proofchecking higherlevel domainspecific properties for compliance to safety policies. The paper first describes a framework related to abstract interpretation in which compliance to a class of certification policies can be efficiently calculated. Membership equational logic is shown to provide a rich logic for carrying out such calculations, including partiality, for certification. The architecture for a domainspecific certifier is described, Jbllowed by an implemented case study. The case study considers consistency of abstract variable attributes in code that performs geometric calculations in Aerospace systems. 1.
ContextFree Grammars:; Covers, Normal Forms, and Parsing
 LECTURE NOTES IN COMPUTER SCIENCE
, 1980
"... ..."
Systems Theory Relative Complexity of Algebras
"... Abstract. A simple algebraic model is proposed for measuring the relative complexity of programming systems. The appropriateness of this model is illustrated by its use as a framework for the statement and proof of results dealing with codingindependent limitations on the relative complexity of bas ..."
Abstract
 Add to MetaCart
Abstract. A simple algebraic model is proposed for measuring the relative complexity of programming systems. The appropriateness of this model is illustrated by its use as a framework for the statement and proof of results dealing with codingindependent limitations on the relative complexity of basic algebras. I.
Live Graphical Computing Logic, Virtual Trees, and Visualization
"... Abstract The paper is a preliminary overview to a virtual tree computing logic with applications to Virtual Reality. Metacontextual logic is combined with Morph Gentzen, a new computing logic the author presented in 1997. It has applications towards Virtual Reality VR computing since the trees on ..."
Abstract
 Add to MetaCart
Abstract The paper is a preliminary overview to a virtual tree computing logic with applications to Virtual Reality. Metacontextual logic is combined with Morph Gentzen, a new computing logic the author presented in 1997. It has applications towards Virtual Reality VR computing since the trees on the languages can carry visual structures via definition known at syntax. The languages are called “Intelligent ” in the sense that there are designated function symbols on the syntax with explicit signature annotations, for example having to have 11 functions only on a subsignture. Generic diagrams for models are defined as yet a second order lift from context. The techniques allowed us to define a computational linguistics and model theory for “intelligent languages, ” i.e. agent augmented languages. Applications to visual computing with agent JAVA are alluded to.