Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
May I borrow your logic? (Transporting logical structures along maps)
Theoretical Computer Science - Special issue: algebraic development techniques
Algebraic Foundations of Systems Specification
Algebraic Foundations of Systems Specification
Logical systems for structured specifications
Theoretical Computer Science
Relating CASL with other specification languages: the institution level
Theoretical Computer Science
Extending Development Graphs with Hiding
FASE '01 Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering
Towards an Evolutionary Formal Software-Development Using CASL
WADT '99 Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques
Institution Independent Static Analysis for CASL
WADT '01 Selected papers from the 15th International Workshop on Recent Trends in Algebraic Development Techniques
Combining Logics: Parchments Revisited
WADT '01 Selected papers from the 15th International Workshop on Recent Trends in Algebraic Development Techniques
Combining and representing logical systems using model-theoretic parchments
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Subsorted Partial Higher-Order Locig as an Extension of CASL
WADT '99 Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques
Extending Casl by Late Binding
WADT '99 Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques
Moving Between Logical Systems
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
CASL-CHART: A Combination of Statecharts and of the Algebraic Specification Language CASL
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
CoFI: The Common Framework Initiative for Algebraic Specification and Development
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Integrating HOL-CASL into the Development Graph Manager MAYA
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
State-Based Extensions of CASL
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Comorphism-Based Grothendieck Logics
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The Development Graph Manager MAYA
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Integrating HOL-CASL into the Development Graph Manager MAYA
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
Towards an Evolutionary Formal Software Development
Proceedings of the 16th IEEE international conference on Automated software engineering
A Heterogeneous Approach to UML Semantics
Concurrency, Graphs and Models
Toward specifications for reconfigurable component systems
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Change management for heterogeneous development graphs
Verification, induction termination analysis
Change management for heterogeneous development graphs
Verification, induction termination analysis
| Hi-index | 0.00 |
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. Often, different aspects of a software system have to be specified in different logics, since the construction of a huge logic covering all needed features would be too complex to be feasible. Therefore, we introduce heterogeneous development graphs as a means to cope with heterogeneous specifications.We cover both the semantics and the proof theory of heterogeneous development graphs. A proof calculus can be obtained either by combining proof calculi for the individual logics, or by representing these in some "universal" logic like higher-order logic in a coherent way and then "borrowing" its calculus for the heterogeneous language.