Constructing contracts: Making discrete mathematics relevant to beginning programmers
Journal on Educational Resources in Computing (JERIC)
To use or not to use the goto statement: programming styles viewed from Hoare logic
Science of Computer Programming
Term transformers: A new approach to state
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theorem proving modulo based on Boolean equational procedures
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
On Euclid's algorithm and elementary number theory
Science of Computer Programming
Pointfree expression and calculation: from quantification to temporal logic
Formal Methods in System Design
Programming from galois connections
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Exercises in quantifier manipulation
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Algorithmic problem solving: three years on
TFM'06 Proceedings of the 2006 conference on Teaching Formal Methods: practice and experience
Verification conditions for source-level imperative programs
Computer Science Review
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
The algorithmics of solitaire-like games
Science of Computer Programming
| Hi-index | 0.00 |
From the Publisher:The book covers the elements of logic and program correctness that form the foundations of further study - the logical connectives and their algebraic properties, induction, quantifiers and program construction rules. Substantial examples of program construction are included. Many exercises are provided, all with detailed solutions.