8,989 research outputs found
Heterogeneous Semantics and Unifying Theories
Model-driven development is being used increasingly in the development of modern computer-based systems. In the case of cyber-physical systems (including robotics and autonomous systems) no single modelling solution is adequate to cover all aspects of a system, such as discrete control, continuous dynamics, and communication networking. Instead, a heterogeneous modelling solution must be adopted. We propose a theory engineering technique involving Isabelle/HOL and Hoare & Heās Unifying Theories of Programming. We illustrate this approach with mechanised theories for building a contractual theory of sequential programming, a theory of pointer-based programs, and the reactive theory underpinning CSPās process algebra. Galois connections provide the mechanism for linking these theories
Heterogeneous Proxytypes Extended: Integrating Theory-like Representations and Mechanisms with Prototypes and Exemplars
The paper introduces an extension of the proposal according to which
conceptual representations in cognitive agents should be intended as heterogeneous
proxytypes. The main contribution of this paper is in that it details how
to reconcile, under a heterogeneous representational perspective, different theories
of typicality about conceptual representation and reasoning. In particular, it
provides a novel theoretical hypothesis - as well as a novel categorization algorithm
called DELTA - showing how to integrate the representational and reasoning
assumptions of the theory-theory of concepts with the those ascribed to the
prototype and exemplars-based theories
Service Semantics Classification: an Approach Towards Modular Service Ontology
Since service systems are becoming increasingly complex in emerging technology, business, legal and economics environments, service abstractions are necessary to master this complexity. However, the term āserviceā means different things to different people in different disciplines, which implies that any attempt to define general purpose service abstractions must address the disambiguation of the term. Service ontologies and service knowledge management efforts mainly aim at elucidating service semantics. Each discipline has multiple biased service-related concepts, so that in order to build comprehensive multi-disciplinary service models, the service-related concepts of the involved disciplines have to be integrated and structured in a consistent way. We claim that this requires a modular approach in which general purpose service semantics can be further extended or specialised with domain-specific concepts. Service-related and domain-specific concepts can be integrated and structured in many different ways. This paper proposes a semantics classification scheme based on service aspects that are essential for a services ecosystem
Unifying heterogeneous state-spaces with lenses
Most verification approaches embed a model of program state into their semantic treatment. Though a variety of heterogeneous state-space models exists,they all possess common theoretical properties one would like to capture abstractly,such as the common algebraic laws of programming. In this paper,we propose lenses as a universal state-space modelling solution. Lenses provide an abstract interface for manipulating data types through spatially-separated views. We define a lens algebra that enables their composition and comparison,and apply it to formally model variables and alphabets in Hoare and Heās Unifying Theories of Programming (UTP). The combination of lenses and relational algebra gives rise to a model for UTP in which its fundamental laws can be verified. Moreover,we illustrate how lenses can be used to model more complex state notions such as memory stores and parallel states. We provide a mechanisation in Isabelle/HOL that validates our theory,and facilitates its use in program verification
A theorem prover-based analysis tool for object-oriented databases
We present a theorem-prover based analysis tool for object-oriented database systems with integrity constraints. Object-oriented database specifications are mapped to higher-order logic (HOL). This allows us to reason about the semantics of database operations using a mechanical theorem prover such as Isabelle or PVS. The tool can be used to verify various semantics requirements of the schema (such as transaction safety, compensation, and commutativity) to support the advanced transaction models used in workflow and cooperative work. We give an example of method safety analysis for the generic structure editing operations of a cooperative authoring system
- ā¦