Initiality, induction, and computability
Algebraic methods in semantics
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
Models and equality for logical programming
II and Colloquium on Functional and Logic Programming and Specifications (CFLP) on TAPSOFT '87: Advanced Seminar on Foundations of Innovative Software Development
Stepwise refinement process with modularity
ICSE '89 Proceedings of the 11th international conference on Software engineering
Software process a` la algebra: OBJ for OBJ
ICSE '90 Proceedings of the 12th international conference on Software engineering
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)
A logical approach to discrete math
A logical approach to discrete math
A logical theory of concurrent objects and its realization in the Maude language
Research directions in concurrent object-oriented programming
Logical support for modularisation
Papers presented at the second annual Workshop on Logical environments
Hiding and behaviour: an institutional approach
A classical mind
An object-oriented modeling method for algebraic specifications in CafeOBJ
ICSE '97 Proceedings of the 19th international conference on Software engineering
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Towards an Algebraic Semantics for the Object Paradigm
Selected papers from the 9th Workshop on Specification of Abstract Data Types Joint with the 4th COMPASS Workshop on Recent Trends in Data Type Specification
A Category-Based Equational Logic Semantics to Constraint Programming
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
Implementation of Term Rewritings with the Evaluation Strategy
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Design and Implementation of Parallel TRAM
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
TRAM: An Abstract Machine for Order-Sorted Conditioned Term Rewriting Systems
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
The Semantics of CLEAR, A Specification Language
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
A hierarchical structuring method for functional software systems
ICSE '82 Proceedings of the 6th international conference on Software engineering
The specification and application to programming of abstract data types.
The specification and application to programming of abstract data types.
Putting theories together to make specifications
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
Simple termination of context-sensitive rewriting
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Modular termination of context-sensitive rewriting
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
System Presentation -- CARIBOO: An induction based proof tool for termination with strategies
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Pinnacles of software engineering: 25 years of formal methods
Annals of Software Engineering
A Formal Object Approach to the Design of ZML
Annals of Software Engineering
Context-sensitive rewriting strategies
Information and Computation
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Termination of Rewriting With Strategy Annotations
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Improving On-Demand Strategy Annotations
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Non-deterministic Computations in ELAN
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Verifying Behavioural Specifications in CafeOBJ Environment
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Using Algebraic Specification Techniques in Development of Object-Oriented Frameworks
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Termination of on-demand rewriting and termination of OBJ programs
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Simplification and termination of strategies in rule-based languages
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Journal of Functional Programming
Computing constructor forms with non terminating rewrite programs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Proving termination of context-sensitive rewriting by transformation
Information and Computation
Science of Computer Programming
Induction for positive almost sure termination
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Monitoring conversational web services
2nd international workshop on Service oriented software engineering: in conjunction with the 6th ESEC/FSE joint meeting
Termination of rewriting under strategies
ACM Transactions on Computational Logic (TOCL)
Predicting and Learning Executability of Composite Web Services
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
On-demand strategy annotations revisited: An improved on-demand evaluation strategy
Theoretical Computer Science
A rule-based approach for automated generation of kinetic chemical mechanisms
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Automated generation of kinetic chemical mechanisms using rewriting
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Context-sensitive dependency pairs
Information and Computation
Fostering proof scores in CafeOBJ
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Enhanced semantic access to formal software models
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
SVG web environment for z specification language
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
A proof of weak termination providing the right way to terminate
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Principles of proof scores in CafeOBJ
Theoretical Computer Science
| Hi-index | 0.00 |
CAFE is the name of a network based environment now under development for supporting systematic creation, checking, verification, and maintenance of formal specifications. CAFE has an algebraic specification language called CafeOBJ as its main specification language, and adopts an algebraic specification paradigm as its foundation. CafeOBJ is a successor of the OBJ language, and has important new features for concurrency and behavioral specifications. Concurrency and behavior are specified based on rewriting logic and behavioral (hidden sorted) algebra respectively. These new features make it possible to provide powerful language constructs for formal object oriented specifications. CAFE is designed to be a network based environment. For sharing specification documents systematically over networks, a new document formatting language called Forsdonnet (FORmal Specification Document ON NETwork) is designed by extending HTML. Forsdonnet includes constructs for formal and informal specifications, commands for executing (prototyping) and cheeking/verifying CafeOBJ specifications, etc. Forsdonnet is designed to be based on already established standard network infrastructure components like HTML and Netscape Navigator. The paper gives an overview and design considerations of the CAFE environment, featuring mainly CafeOBJ and Forsdonnet languages.