Initiality, induction, and computability
Algebraic methods in semantics
Data structures and program transformation
Science of Computer Programming
Higher-order functions considered unnecessary for higher-order programming
Research topics in functional programming
Co-induction in relational semantics
Theoretical Computer Science
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Terminal coalgebras in well-founded set theory
Theoretical Computer Science
Occasioned practices in the work of software engineers
Requirements engineering
Requirements engineering as the reconciliation of social and technical issues
Requirements engineering
Proof of correctness of object representations
A classical mind
Behavioural and abstractor specifications
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Objects and classes, co-algebraically
Object orientation with parallelism and persistence
Abstract data types and the development of data structures
Communications of the ACM
Software Engineering Economics
Software Engineering Economics
Algebraic Semantics of Imperative Programs
Algebraic Semantics of Imperative Programs
An Object-Oriented Tool for Tracing Requirements
IEEE Software
Coalgebra semantics for hidden algebra: Parameterised objects an inheritance
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Behavioural Equivalence, Bisimulation, and Minimal Realisation
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
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
Mongruences and Cofree Coalgebras
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Context Induction: a Proof Principle for Behavioural Abstractions
DISCO '90 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
Universal Realization, Persistent Interconnection and Implementation of Abstract Modules
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Towards a Provably Correct Compiler for OBJ3
PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Categories of Models for Concurrency
Seminar on Concurrency, Carnegie-Mellon University
Proceedings of the Second International Conference on Algebraic and Logic Programming
Initial Algebra and Final Coalgebra Semantics for Concurrency
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
A Typed Lambda Calculus with Categorical Type Constructors
Category Theory and Computer Science
Category Theory and Computer Science
Distributed cooperative formal methods tools
ASE '97 Proceedings of the 12th international conference on Automated software engineering (formerly: KBSE)
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Universal coalgebra: a theory of systems
Universal coalgebra: a theory of systems
The specification and application to programming of abstract data types.
The specification and application to programming of abstract data types.
Hidden algebra and concurrent distributed software
ACM SIGSOFT Software Engineering Notes
What is the coalgebraic analogue of Birkhoff's variety theorem?
Theoretical Computer Science
On implementing behavioral rewriting
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Web-Based Support for Cooperative Software Engineering
Annals of Software Engineering
Formalising Ontologies and Their Relations
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Behavioral abstraction is hiding information
Theoretical Computer Science - Selected papers of CMCS'03
Observational Refinement Process
Electronic Notes in Theoretical Computer Science (ENTCS)
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
On the algebraic structure of declarative programming languages
Theoretical Computer Science
An introduction to algebraic semiotics, with application to user interface design
Computation for metaphors, analogy, and agents
| Hi-index | 0.00 |
This paper unveils and motivates an ambitious programme of hidden algebraic research in software engineering. We begin with an outline of our general goals, continue with an overview of results, and conclude with a discussion of some future plans. The main contribution is powerful hidden coinduction techniques for proving behavioural correctness of concurrent systems, and several mechanical proofs are given using OBJ3. We also show how modularization, bisimulation, transition systems, concurrency and combinations of the functional, constraint, logic and object paradigms fit into hidden algebra.