Unifying functional, object-oriented and relational programming with logical semantics
Research directions in object-oriented programming
Parameterized programming in OBJ2
ICSE '87 Proceedings of the 9th international conference on Software Engineering
Proceedings of the first Franco-Japanese Symposium on Programming of future generation computers
A logical theory of concurrent objects
OOPSLA/ECOOP '90 Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Theoretical Computer Science
Logical foundations of cafeOBJ
Theoretical Computer Science - Rewriting logic and its applications
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
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
A hierarchical structuring method for functional software systems
ICSE '82 Proceedings of the 6th international conference on Software engineering
ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
Putting theories together to make specifications
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
Verifying Design with Proof Scores
Verified Software: Theories, Tools, Experiments
Fostering proof scores in CafeOBJ
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Principles of proof scores in CafeOBJ
Theoretical Computer Science
| Hi-index | 0.00 |
Formal methods are still expected to improve the practice of software engineering. The areas in which formal methods will play important roles include at least: (1) distributed component software, (2) network/system security, (3) embedded systems. Formal methods are better supported by formal specification languages equipped with formal verification capability.CafeOBJ is a formal specification language equipped with verification methodologies based on algebraic specification technique. CafeOBJ is an executable wide spectrum language based on multiple logical foundations; mainly based on initial and hidden algebras. Static aspects of systems are specified in terms of initial algebras, and dynamic aspects of systems are specified in terms of hidden algebras.CafeOBJ is the first algebraic specification language which incorporates observational (or behavioral) specifications based on hidden algebras in a serious way. Observational specifications in CafeOBJ can be seen as a nice combination of static and dynamic specifications, and facilitate natural and transparent specification and verification of complex systems.This paper gives an overview of CafeOBJ language system and formal methods based on the language. Some parts of this paper are updated and modified versions of the parts of already published book or papers such as [10, 18, 3, 7].