Domain engineering
D Bjørner - Formal Methods: State of the Art and New Directions, 2010 - Springer
Before software can be designed we must know its requirements. Before requirements can
be expressed we must understand the domain. So it follows, from our dogma, that we must …
be expressed we must understand the domain. So it follows, from our dogma, that we must …
Some tips on writing proof scores in the OTS/CafeOBJ method
K Ogata, K Futatsugi - … , Meaning, and Computation: Essays dedicated to …, 2006 - Springer
The OTS/CafeOBJ method is an instance of the proof score approach to systems analysis,
which has been mainly devoted by researchers in the OBJ community. We describe some …
which has been mainly devoted by researchers in the OBJ community. We describe some …
Domain Science and Engineering
D Bjørner - Monographs in Theoretical Computer Science. An …, 2021 - Springer
A Foundation for Software Development Dines Bjørner Page 1 Domain Science and Engineering
A Foundation for Software Development Dines Bjørner Monographs in Theoretical Computer …
A Foundation for Software Development Dines Bjørner Monographs in Theoretical Computer …
From domain to requirements
D Bjørner - Concurrency, Graphs and Models: Essays dedicated to …, 2008 - Springer
We first present a summary of essentials of domain engineering, its motivation, and its
modelling of abstractions of domains through the modelling of the intrinsics, support …
modelling of abstractions of domains through the modelling of the intrinsics, support …
Reasoning (on) service component ensembles in rewriting logic
Programming autonomic systems with massive number of heterogeneous components
poses a number of challenges to language designers and software engineers and requires …
poses a number of challenges to language designers and software engineers and requires …
On mereologies in computing science
D Bjørner - Reflections on the Work of CAR Hoare, 2010 - Springer
In this paper we solve the following problems:∙ We give a formal model of a large class of
mereologies, with simple entities modelled as parts and their relations by connectors.∙ We …
mereologies, with simple entities modelled as parts and their relations by connectors.∙ We …
Compositionality: Ontology and Mereology of Domains.
D Bjørner, A Eir - Concurrency, compositionality, and correctness, 2010 - Springer
In this discursive paper we discuss compositionality of (i) simple entities,(ii) operations,(iii)
events, and (iv) behaviours. These four concepts,(i)–(iv), together define a concept of …
events, and (iv) behaviours. These four concepts,(i)–(iv), together define a concept of …
Simulation-based verification for invariant properties in the OTS/CafeOBJ method
K Ogata, K Futatsugi - Electronic Notes in Theoretical Computer Science, 2008 - Elsevier
The OTS/CafeOBJ method is a formal method to model systems, specify models and verify
that models satisfy properties. We propose a way to verify that a state machine S satisfies …
that models satisfy properties. We propose a way to verify that a state machine S satisfies …
[HTML][HTML] Foundations of logic programming in hybrid logics with user-defined sharing
D Găină - Theoretical Computer Science, 2017 - Elsevier
The present contribution advances an abstract notion of hybrid logic by supplementing the
definition of institution with an additional structure to extract frames. The foundation of logic …
definition of institution with an additional structure to extract frames. The foundation of logic …
Downward Löwenheim–Skolem theorem and interpolation in logics with constructors
D Găină - Journal of Logic and Computation, 2017 - academic.oup.com
The present article describes a method for proving Downward Löwenheim–Skolem
Theorem within an arbitrary institution satisfying certain logic properties. In order to …
Theorem within an arbitrary institution satisfying certain logic properties. In order to …