Predicate calculus and program semantics
Predicate calculus and program semantics
Teaching calculation and discrimination: a more effective curriculum
Communications of the ACM
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
A logical approach to discrete math
A logical approach to discrete math
Property specification patterns for finite-state verification
FMSP '98 Proceedings of the second workshop on Formal methods in software practice
Patterns in property specifications for finite-state verification
Proceedings of the 21st international conference on Software engineering
Our curriculum has become math-phobic!
Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers
Predicate Logic for Software Engineering
IEEE Transactions on Software Engineering
Linear and Branching Structures in the Semantics and Logics of Reactive Systems
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Proceedings of the IFIP TC2/WG2.1 Working Conference on Generic Programming
Mathematical reasoning in software engineering education
Communications of the ACM - Why CS students need math
Mathematical Structures in Computer Science
Functional declarative language design and predicate calculus: a practical approach
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Getting Formal Verification into Design Flow
FM '08 Proceedings of the 15th international symposium on Formal Methods
Extended Static Checking by Calculation Using the Pointfree Transform
Language Engineering and Rigorous Software Development
Using domain-independent problems for introducing formal methods
FM'06 Proceedings of the 14th international conference on Formal Methods
Pointfree expression and calculation: from quantification to temporal logic
Formal Methods in System Design
| Hi-index | 0.00 |
In temporal logic, calculational proofs beyond simple cases are often seen as challenging. The situation is reversed by making temporal logic calculational, yielding shorter and clearer proofs than traditional ones, and serving as a (mental) tool for unification and discovery. A side-effect of unifying theories is easier access by practicians. The starting point is a simple generic (software tool independent) Functional Temporal Calculus (FTC). Specific temporal logics are then captured via endosemantic functions . This concept reflects tacit conventions throughout mathematics and, once identified, is general and useful. FTC also yields a reasoning style that helps discovering theorems by calculation rather than just proving given facts. This is illustrated by deriving various theorems, most related to liveness issues in TLA+, and finding strengthenings of known results. Educational issues are addressed in passing.