Order-sorted model theory for temporal executable specifications

DOI10.1016/S0304-3975(96)00134-XzbMath0901.68028OpenAlexW2032196278MaRDI QIDQ1391744

Mara Alagić, Suad Alagic

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00134-x

zbMATH Keywords

temporal Horn clause logic basis

Mathematics Subject Classification ID

Logic programming (68N17) Theory of software (68N99)

Related Items (1)

Semantics of temporal classes

Uses Software

• METATEM

Cites Work

• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• Specifying Concurrent Program Modules
• Logical foundations of object-oriented and frame-based languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Order-sorted model theory for temporal executable specifications