Results 1  10
of
11
An Overview of the Tatami Project
, 2000
"... This paper describes the Tatami project at UCSD, which is developing a system to support distributed cooperative software development over the web, and in particular, the validation of concurrent distributed software. The main components of our current prototype are a proof assistant, a generator fo ..."
Abstract

Cited by 13 (8 self)
 Add to MetaCart
This paper describes the Tatami project at UCSD, which is developing a system to support distributed cooperative software development over the web, and in particular, the validation of concurrent distributed software. The main components of our current prototype are a proof assistant, a generator for documentation websites, a database, an equational proof engine, and a communication protocol to support distributed cooperative work. We believe behavioral specification and verification are important for software development, and for this purpose we use first order hidden logic with equational atoms. The paper also briefly describes some novel user interface design methods that have been developed and applied in the project
Webbased support for cooperative software engineering
 Annals of Software Engineering
, 2001
"... recent advances in web technology, interface design, and specification. Our effort to improve the usability of such systems has led us into algebraic semiotics, while our effort to develop better formal methods for distributed concurrent systems has led us into hidden algebra and fuzzy logic. This p ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
recent advances in web technology, interface design, and specification. Our effort to improve the usability of such systems has led us into algebraic semiotics, while our effort to develop better formal methods for distributed concurrent systems has led us into hidden algebra and fuzzy logic. This paper discusses the Tatami system design, especially its software architecture, and its user interface principles. New work in the latter area includes an extension of algebraic semiotics to dynamic multimedia interfaces, and integrating Gibsonian affordances with algebraic semiotics. 1
unknown title
"... of Grigore Ro,su is approved, and it is acceptable in quality and form for publication on microfilm: ..."
Abstract
 Add to MetaCart
of Grigore Ro,su is approved, and it is acceptable in quality and form for publication on microfilm:
An Overview of the Tatami Project
"... This paper describes the Tatami project at UCSD, which is developing a system to support distributed cooperative software development over the web, and in particular, the validation of concurrent distributed software. The main components of our current prototype are a proof assistant, a generator fo ..."
Abstract
 Add to MetaCart
This paper describes the Tatami project at UCSD, which is developing a system to support distributed cooperative software development over the web, and in particular, the validation of concurrent distributed software. The main components of our current prototype are a proof assistant, a generator for documentation websites, a database, an equational proof engine, and a communication protocol to support distributed cooperative work. We believe behavioral speci cation and veri cation are important for software development, and for this purpose we use rst order hidden logic with equational atoms. The paper also brie y describes some novel user interface design methods that have been developed and applied in the project. 1.
Behavioral Abstraction is Information Hiding
"... We show that for any behavioral Sigmaspecification B there is an ordinary algebraic specification ~ B over a larger signature, such that a model behaviorally satisfies B if and only if it satisfies ~ B, where is the information hiding operator exporting only the Sigmatheorems of ~ B. The idea is t ..."
Abstract
 Add to MetaCart
We show that for any behavioral Sigmaspecification B there is an ordinary algebraic specification ~ B over a larger signature, such that a model behaviorally satisfies B if and only if it satisfies ~ B, where is the information hiding operator exporting only the Sigmatheorems of ~ B. The idea is to add machinery for contexts and experiments (sorts, operations and equations), use it, and then hide it. We develop a procedure, called unhiding, that takes a finite B and produces a finite ~ B. The practical aspect of this procedure is that one can use any standard equational or inductive theorem prover to derive behavioral theorems, even if neither equational reasoning nor induction is sound for behavioral satisfaction.
A Hidden Approach to Program Behavior, Translation and Optimization
"... A user will perceive a compiler as correct if he or she cannot visibly distinguish between the behavior of a program interpreted in the source language semantics and the behavior of the compiled version of the same program. This allows to use the visible behavior of a program as a correctness argume ..."
Abstract
 Add to MetaCart
A user will perceive a compiler as correct if he or she cannot visibly distinguish between the behavior of a program interpreted in the source language semantics and the behavior of the compiled version of the same program. This allows to use the visible behavior of a program as a correctness argument for program translation as well as optimization.
Modular Semantics for ModelOriented Design by
"... Modern systems engineering mandates the integration of heterogeneous models in design and analysis. This has given rise to the notion of modeloriented design where specifications can be defined, translated, and composed. A common aspect that modelcentered tools and languages share is the capabili ..."
Abstract
 Add to MetaCart
Modern systems engineering mandates the integration of heterogeneous models in design and analysis. This has given rise to the notion of modeloriented design where specifications can be defined, translated, and composed. A common aspect that modelcentered tools and languages share is the capability of using different models of computation together. As a result, the heterogeneous components of a particular system can be expressed in their most natural representation. We propose a framework that supports the representation of a variety of computational models. An important part to any representation is the provision of a formal semantics that defines its correctness. We accordingly define a precise and modular semantics that uses the notion of institutions to provide meaning to wellformed syntactic elements. Institutions relate specifications to mathematical models such as algebras and coalgebras. The formal semantics thus defined allows us to derive consistency of designs and to reason about system specifications. These specifications are written in the Rosetta language. Rosetta supports describing the ontology of a formalism or model of
IOS Press Institutionindependent Ultraproducts
"... Abstract. We generalise the ultraproducts method from conventional model theory to an institutionindependent (i.e. independent of the details of the actual logic formalised as an institution) framework based on a novel very general treatment of the semantics of some important concepts in logic, mode ..."
Abstract
 Add to MetaCart
Abstract. We generalise the ultraproducts method from conventional model theory to an institutionindependent (i.e. independent of the details of the actual logic formalised as an institution) framework based on a novel very general treatment of the semantics of some important concepts in logic, model theoretic approaches to ultraproducts based on category theory, our work makes essential use of concepts central to institution theory, such as signature morphisms and model reducts. The institutionindependent fundamental theorem on ultraproducts is presented in a modular manner, different combinations of its various parts giving different results in different logics or institutions. We present applications to institutionindependent compactness, axiomatizability, and higher order sentences, and illustrate our concepts and results with examples from four different algebraic specification logics. In the introduction we also discuss the relevance of our institutionindependent approach to the model theory of algebraic specification and computing science, but also to classical and abstract model theory.