Initial computability, algebraic specifications, and partial algebras
Initial computability, algebraic specifications, and partial algebras
Specifications in an arbitrary institution
Information and Computation - Semantics of Data Types
Initial behavior semantics for algebraic specifications
Lecture notes in Computer Science on Recent trends in data type specification
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Larch: languages and tools for formal specification
Larch: languages and tools for formal specification
Hiding and behaviour: an institutional approach
A classical mind
A behavioural algebraic framework for modular system design with reuse
Selected papers from 9th workshop on Specification of abstract data types : recent trends in data type specification: recent trends in data type specification
Behavioural and abstractor specifications
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Behavioural theories and the proof of behavioural properties
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Specification of abstract data types
Specification of abstract data types
Correctness of a logical system for structured specifications
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Swinging Data Types: Syntax, Semantics, and Theory
Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification
Proving the Correctness of Algebraically Specified Software: Modularity and Observability Issues
AMAST '91 Proceedings of the Second International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
Proving the Correctness of Behavioural Implementations
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Behavioural Satisfaction and Equivalence in Concrete Model Categories
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
On the Duality between Observability and Reachability
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Component-Based Algebraic Specification and Verification in CafeOBJ
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Unit Testing for C88 ASL Architectural Specifications
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On the Integration of Observability and Reachability Concepts
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Simply Observable Behavioral Specification
APSEC '99 Proceedings of the Sixth Asia Pacific Software Engineering Conference
Verifying Design with Proof Scores
Verified Software: Theories, Tools, Experiments
Refinement by Interpretation in a General Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
Linking algebraic observational equivalence and bisimulation
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Coinduction for preordered algebra
Information and Computation
Fostering proof scores in CafeOBJ
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Observation and abstract behaviour in specification and implementation of state-based systems
IW-FM'01 Proceedings of the 5th Irish conference on Formal Methods
Institution-independent Ultraproducts
Fundamenta Informaticae
| Hi-index | 0.00 |
We present an institution of observational logic suited for state-based systems specifications. The institution is based on the notion of an observational signature (which incorporates the declaration of a distinguished set of observers) and on observational algebras whose operations are required to be compatible with the indistinguishability relation determined by the given observers. In particular, we introduce a homomorphism concept for observational algebras which adequately expresses observational relationships between algebras. Then we consider a flexible notion of observational signature morphism which guarantees the satisfaction condition of institutions w.r.t. observational satisfaction of arbitrary first-order sentences. From the proof theoretical point of view we construct a sound and complete proof system for the observational consequence relation. Then we consider structured observational specifications and we provide a sound and complete proof system for such specifications by using a general, institution-independent result of [6].