The following pages link to Thomas S. E. Maibaum (Q673999):
Displaying 50 items.
- On the Modularization Theorem for logical specifications (Q674000) (← links)
- Encapsulating deontic and branching time specifications (Q714879) (← links)
- (Q846526) (redirect page) (← links)
- Deontic action logic, atomic Boolean algebras and fault-tolerance (Q846527) (← links)
- Categorical foundations for structured specifications in \(\mathsf{Z}\) (Q903494) (← links)
- (Q1028975) (redirect page) (← links)
- On what exactly goes on when software is developed step-by-step. II: The sequel (Q1028976) (← links)
- (Q1192603) (redirect page) (← links)
- Temporal theories as modularisation units for concurrent system specification (Q1192604) (← links)
- A generalized approach to formal languages (Q1239608) (← links)
- Pumping lemmas for term languages (Q1250713) (← links)
- Categorical semantics of parallel program design (Q1356941) (← links)
- On a generalized modularization theorem (Q1607048) (← links)
- A theoretical framework for cardinality-based feature models: the semantics and computational aspects (Q1647962) (← links)
- Simulation relations for fault-tolerance (Q1688554) (← links)
- Interpolation in practical formal development (Q2716926) (← links)
- (Q2722043) (← links)
- What Is a Derived Signature Morphism? (Q2787340) (← links)
- Modeling Product Lines with Kripke Structures and Modal Logic (Q2787423) (← links)
- Satisfiability Calculus: The Semantic Counterpart of a Proof Calculus in General Logics (Q2848884) (← links)
- Towards a First-Order Deontic Action Logic (Q2890324) (← links)
- A Heterogeneous Characterisation of Component-Based System Design in a Categorical Setting (Q2938171) (← links)
- A Verification Logic for Rewriting Logic (Q3025340) (← links)
- Proof theory and computer programming (Q3032255) (← links)
- (Q3343424) (← links)
- (Q3345797) (← links)
- Temporal Reasoning over Deontic Specifications (Q3356299) (← links)
- A Propositional Tableaux Based Proof Calculus for Reasoning with Default Rules (Q3455758) (← links)
- Abstract Data Types and Type Theory: Theories as Types (Q3479540) (← links)
- A Tableaux System for Deontic Action Logic (Q3522041) (← links)
- A Complete and Compact Propositional Deontic Logic (Q3525078) (← links)
- Design in CommUnity with Extension Morphisms (Q3526941) (← links)
- Towards Managing Dynamic Reconfiguration of Software Systems in a Categorical Setting (Q3585055) (← links)
- Characterizing Locality (Encapsulation) with Bisimulation (Q3585056) (← links)
- Reasoning about System-Degradation and Fault-Recovery with Deontic Logic (Q3623815) (← links)
- (Q3709888) (← links)
- Higher order data types (Q3860824) (← links)
- (Q3875333) (← links)
- On the design and specification of message oriented programs (Q3891748) (← links)
- Conceptual modeling of data base operations (Q3933801) (← links)
- Continuous Data Types (Q3938467) (← links)
- A Constructive Presentation for the Modal Connective of Necessity (□) (Q4007157) (← links)
- (Q4138119) (← links)
- (Q4192939) (← links)
- (Q4250362) (← links)
- (Q4415071) (← links)
- (Q4417813) (← links)
- (Q4436991) (← links)
- (Q4518414) (← links)
- Faithful Modeling of Product Lines with Kripke Structures and Modal Logic (Q4621201) (← links)
