Results 1  10
of
42
The Heterogeneous Tool Set
 of Lecture Notes in Computer Science
, 2007
"... Abstract. Heterogeneous specification becomes more and more important because complex systems are often specified using multiple viewpoints, involving multiple formalisms. Moreover, a formal software development process may lead to a change of formalism during the development. However, current resea ..."
Abstract

Cited by 59 (32 self)
 Add to MetaCart
(Show Context)
Abstract. Heterogeneous specification becomes more and more important because complex systems are often specified using multiple viewpoints, involving multiple formalisms. Moreover, a formal software development process may lead to a change of formalism during the development. However, current research in integrated formal methods only deals with adhoc integrations of different formalisms. The heterogeneous tool set (Hets) is a parsing, static analysis and proof management tool combining various such tools for individual specification languages, thus providing a tool for heterogeneous multilogic specification. Hets is based on a graph of logics and languages (formalized as socalled institutions), their tools, and their translations. This provides a clean semantics of heterogeneous specification, as well as a corresponding proof calculus. For proof management, the calculus of development graphs (known from other largescale proof management systems) has been adapted to heterogeneous specification. Development graphs provide an overview of the (heterogeneous) specification module hierarchy and the current proof state, and thus may be used for monitoring the overall correctness of a heterogeneous development. 1
Highlevel nets with nets and rules as tokens
 In Proc. of ICATPN 2005
, 2005
"... Abstract. HighLevel net models following the paradigm “nets as tokens” have been studied already in the literature with several interesting applications. In this paper we propose the new paradigm “nets and rules as tokens”, where in addition to nets as tokens also rules as tokens are considered. Th ..."
Abstract

Cited by 34 (14 self)
 Add to MetaCart
Abstract. HighLevel net models following the paradigm “nets as tokens” have been studied already in the literature with several interesting applications. In this paper we propose the new paradigm “nets and rules as tokens”, where in addition to nets as tokens also rules as tokens are considered. The rules can be used to change the net structure. This leads to the new concept of highlevel net and rule systems, which allows to integrate the token game with rulebased transformations of P/Tsystems. The new concept is based on algebraic highlevel nets and on the main ideas of graph transformation systems. We introduce the new concept with the case study “House of Philosophers”, a dynamic extension of the wellknown dining philosophers. In the main part we present a basic theory for rulebased transformations of P/Tsystems and for highlevel nets with nets and rules as tokens leading to the concept of highlevel net and rule systems.
Development Graphs  Proof Management for Structured Specifications
, 2005
"... Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work, we extend development graphs with hiding (e.g. hidden operations). Hiding is a particularly difficult to realize operat ..."
Abstract

Cited by 29 (19 self)
 Add to MetaCart
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work, we extend development graphs with hiding (e.g. hidden operations). Hiding is a particularly difficult to realize operation, since it does not admit such a good decomposition of the involved specifications as other structuring operations do. We develop both a semantics and proof rules for development graphs with hiding. The rules are proven to be sound, and also complete relative to an oracle for conservative extensions. We also show that an absolutely complete set of rules cannot exist. The whole framework is developed in a way independent of the underlying logical system (and thus also does not prescribe the nature of the parts of a specification that may be hidden). We also show how various other logic independent specification formalisms can be mapped into development graphs; thus, development graphs can serve as a kernel formalism for management of proofs and of change.
An OntologyDriven Management of Change
, 2006
"... Current document management systems (DMS) are designed to coordinate the collaborative creation and maintenance process of documents through the provision of a centralized repository. The focus is primarily on managing documents themselves. Relations between and within documents and effects of chang ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Current document management systems (DMS) are designed to coordinate the collaborative creation and maintenance process of documents through the provision of a centralized repository. The focus is primarily on managing documents themselves. Relations between and within documents and effects of changes are largely neglected. To avoid inefficiencies, conflicts, and delays the support of modification management is indispensable. Here I present the design of the LOCUTOR system that aims to provide management of change functionality for arbitrary XML documents ranging from informal, e.g. instruction or construction manuals, to formal documents.
Qualitative constraint calculi: Heterogeneous verification of composition tables
 In 20th International FLAIRS Conference
, 2007
"... In the domain of qualitative constraint reasoning, a subfield of AI which has evolved in the past 25 years, a large number of calculi for efficient reasoning about spatial and temporal entities has been developed. Reasoning techniques developed for these constraint calculi typically rely on socalle ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
In the domain of qualitative constraint reasoning, a subfield of AI which has evolved in the past 25 years, a large number of calculi for efficient reasoning about spatial and temporal entities has been developed. Reasoning techniques developed for these constraint calculi typically rely on socalled composition tables of the calculus at hand, which allow for replacing semantic reasoning by symbolic operations. Often these composition tables are developed in a quite informal, pictorial manner and hence composition tables are prone to errors. In view of possible safety critical applications of qualitative calculi, however, it is desirable to formally verify these composition tables. In general, the verification of composition tables is a tedious task, in particular in cases where the semantics of the calculus depends on higherorder constructs such as sets. In this paper we address this problem by presenting a heterogeneous proof method that allows for combining a higherorder proof assistance system (such as Isabelle) with an automatic (first order) reasoner (such as SPASS or VAMPIRE). The benefit of this method is that the number of proof obligations that is to be proven interactively with a semiautomatic reasoner can be minimized to an acceptable level.
M.: What is a multimodeling language
 In: WADT. LNCS
, 2009
"... Abstract. In large software projects often multiple modeling languages are used in order to cover the different domains and views of the application and the language skills of the developers appropriately. Such “multimodeling ” raises many methodological and semantical questions, ranging from sema ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Abstract. In large software projects often multiple modeling languages are used in order to cover the different domains and views of the application and the language skills of the developers appropriately. Such “multimodeling ” raises many methodological and semantical questions, ranging from semantic consistency of the models written in different sublanguages to the correctness of model transformations between the sublanguages. We provide a first formal basis for answering such questions by proposing semantically wellfounded notions of a multimodeling language and of semantic correctness for model transformations. In our approach, a multimodeling language consists of a set of sublanguages and syntax of the sublanguages is given by MOF metamodels. The semantics of a multimodeling language is given by associating an institution, i.e., an appropriate logic, to each of its sublanguages. The correctness of model transformations is defined by semantic connections between the institutions. 1
CASL specifications of qualitative calculi
 Spatial Information Theory: Cognitive and Computational Foundations, Proceedings of COSIT’05, LNCS 3693
, 2005
"... Abstract. In AI a large number of calculi for efficient reasoning about spatial and temporal entities have been developed. The most prominent temporal calculi are the point algebra of linear time and Allen’s interval calculus. Examples of spatial calculi include mereotopological calculi, Frank’s car ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
(Show Context)
Abstract. In AI a large number of calculi for efficient reasoning about spatial and temporal entities have been developed. The most prominent temporal calculi are the point algebra of linear time and Allen’s interval calculus. Examples of spatial calculi include mereotopological calculi, Frank’s cardinal direction calculus, Freksa’s double cross calculus, Egenhofer and Franzosa’s intersection calculi, and Randell, Cui, and Cohn’s region connection calculi. These calculi are designed for modeling specific aspects of space or time, respectively, to the effect that the class of intended models may vary widely with the calculus at hand. But from a formal point of view these calculi are often closely related to each other. For example, the spatial region connection calculus RCC5 may be considered a coarsening of Allen’s (temporal) interval calculus. And vice versa, intervals can be used to represent spatial objects that feature an internal direction. The central question of this paper is how these calculi as well as their mutual dependencies can be axiomatized by algebraic specifications. This question will be investigated within the framework of the Common Algebraic Specification Language (CASL), a specification language developed by the Common Framework Initiative for algebraic specification and development (COFI). We explain scope and expressiveness of CASL by discussing the specifications of some of the calculi mentioned before. 1
Towards a System Model for Ensembles
 In Festschrift in honor of Carolyn Talcott, volume 7000 of LNCS
, 2011
"... Abstract. Ensembles—softwareintensive systems with massive numbers of nodes or complex interactions between nodes, operating in open and nondeterministic environments and dynamically adapting to changes in their environment or requirements—pose many challenges to software development. We present ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. Ensembles—softwareintensive systems with massive numbers of nodes or complex interactions between nodes, operating in open and nondeterministic environments and dynamically adapting to changes in their environment or requirements—pose many challenges to software development. We present first steps towards a system model for ensembles that allows us to express requirements using a wide variety of logics and fitness criteria over arbitrary preorders. Using this system model we then give a precise definition of “blackbox ” adaptation and show how this naturally leads to a preorder of adaptability on ensembles. 1
A coalgebraic approach to the semantics of the ambient calculus
 ALGEBRA AND COALGEBRA IN COMPUTER SCIENCE
, 2005
"... Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example is the ambient calculus. Due to the complexity of the involved spatial reduction, there is — in contrast to the situatio ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example is the ambient calculus. Due to the complexity of the involved spatial reduction, there is — in contrast to the situation in standard process algebra — up to now no satisfying coalgebraic representation of a mobile process calculus. Here, we discuss a coalgebraic denotational semantics for the ambient calculus, viewed as a step towards a generic coalgebraic framework for modelling mobile systems. Crucial features of our modelling are a set of GSOS style transition rules for the ambient calculus, a hardwiring of the socalled hardening relation in the functorial signature, and a setbased treatment of hidden name sharing. The formal representation of this framework is cast in the algebraiccoalgebraic specification language CoCasl.