Results 21 to 30 of about 491 (95)
Manifest domains:analysis and description [PDF]
, 2017 We show that manifest domains, an understanding of which are a prerequisite for software requirements prescriptions, can be precisely described: narrated and formalised.
Bjørner, Dines
core +1 more source
Verifying behavioural specifications in CafeOBJ environment [PDF]
, 1999 In this paper, we present techniques for automated verification of behavioural specifications using hidden algebra. Two non-trivial examples, the Alternating Bit Protocol and a snooping cache coherence protocol, are presented with complete specification code and proof scores for CafeOBJ verification system.
Akira Mori, Kokichi Futatsugi
openaire +1 more source
Formal verification of multitask hybrid systems by the OTS/CafeOBJ method
International Conferences on Software Engineering and Knowledge Engineering, 2021 Hybrid systems combine both continuous and discrete behaviors, which occur frequently in safety-critical applications in various domains including Internet-of-Things (IoT) and Cyber-Physical Systems (CPS) applications such as health care, transportation, and robotics.
Masaki Nakamura 0001 +3 more
openaire +1 more source
Service-oriented logic programming [PDF]
, 2015 We develop formal foundations for notions and mechanisms needed to support service-oriented computing. Our work builds on recent theoretical advancements in the algebraic structures that capture the way services are orchestrated and in the processes that
Ionut Tutu, Jose Fiadeiro, Reiko Heckel
core +5 more sources
Maude: specification and programming in rewriting logic [PDF]
, 2002 Maude is a high-level language and a high-performance system supporting executable specification and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational specification and programming
Clavel, M. +6 more
core
The role of logical interpretations on program development [PDF]
, 2014 Stepwise refinement of algebraic specifications is a well known formal methodology for program development. However, traditional notions of refinement based on signature morphisms are often too rigid to capture a number of relevant transformations in the
Alexandre Madeira +3 more
core +3 more sources
Proof Scores in the OTS/CafeOBJ Method [PDF]
, 2003 A way to write proof scores showing that distributed systems have invariant properties in algebraic specification languages is described, which has been devised through several case studies. The way makes it possible to divide a formula stating an invariant property under discussion into reasonably small ones, each of which is proved by writing proof ...
Kazuhiro Ogata 0001, Kokichi Futatsugi
openaire +1 more source
Automated verification of termination certificates [PDF]
, 2012 In order to increase user confidence, many automated theorem provers provide certificates that can be independently verified. In this paper, we report on our progress in developing a standalone tool for checking the correctness of certificates for the ...
Blanqui, Frédéric, Ly, Kim Quyen
core +2 more sources
Towards Formal Fault Tree Analysis using Theorem Proving
, 2015 Fault Tree Analysis (FTA) is a dependability analysis technique that has been widely used to predict reliability, availability and safety of many complex engineering systems.
Ahmed, Waqar, Hasan, Osman
core +1 more source
A method for rigorous design of reconfigurable systems [PDF]
, 2016 Reconfigurability, understood as the ability of a system to behave differently in different modes of operation and commute between them along its lifetime, is a cross-cutting concern in modern Software Engineering.
Barbosa, L. S. +3 more
core +3 more sources