A methodology for synthesis of recursive functional programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
A generalization of Dijkstra's calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Relational Calculus with Set Operators, Its Safety, and Equivalent Graphical Languages
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
Experimental results from an automatic test case generator
ACM Transactions on Software Engineering and Methodology (TOSEM)
Projecting functional models of imperative programs
ACM SIGPLAN Notices
Systems analysis: a systemic analysis of a conceptual model
Communications of the ACM
An Introduction to Proving the Correctness of Programs
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Final Data Types and Their Specification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstract data types and software validation
Communications of the ACM
Design of Multi-Invariant Data Structures for Robust Shared Accesses in Multiprocessor Systems
IEEE Transactions on Software Engineering
Heuristics used by HERBY for semantic tree theorem proving
Annals of Mathematics and Artificial Intelligence
Induction Proofs with Partial Functions
Journal of Automated Reasoning
The Semantic Binary Relationship Model of information
SIGIR '84 Proceedings of the 7th annual international ACM SIGIR conference on Research and development in information retrieval
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
Experience with an experimental compiler generator based on denotational semantics
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Verification of a monitor specification
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Research paradigms in computer science
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Some classes of naturally provable programs
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Some extensions to algebraic specifications
Proceedings of an ACM conference on Language design for reliable software
Knowledge about programs: A model and case study
Proceedings of the international conference on Reliable software
Proceedings of the international conference on Reliable software
A view of program verification
Proceedings of the international conference on Reliable software
On formal and informal proofs for program correctness
ACM SIGPLAN Notices
Journal of Functional Programming
Errors in 'process synchronization in database systems'
ACM SIGMOD Record
Theory of computation on abstract/concrete computer automata
ACM SIGACT News
On teaching theoretical foundations of Computer Science
ACM SIGACT News
Encyclopedia of Computer Science
Automatic generation of polynomial invariants of bounded degree using abstract interpretation
Science of Computer Programming
Polynomial approximations of the relational semantics of imperative programs
Science of Computer Programming
Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time
Theoretical Computer Science
Integration of declarative and constraint programming
Theory and Practice of Logic Programming
Preserving coordination properties when transforming concurrent system components
Proceedings of the 2008 ACM symposium on Applied computing
The 4-way deterministic tiling problem is undecidable
Theoretical Computer Science
A learning-based term-weighting approach for information retrieval
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Knowledge and reasoning in program synthesis
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Relational Methods in the Analysis of While Loops: Observations of Versatility
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
On the computational complexity of dynamic slicing problems for program schemas
Mathematical Structures in Computer Science - Programming Language Interference and Dependence
Properties Complementary to Program Self-Reference
Fundamenta Informaticae
Properties complementary to program self-reference
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.03 |
From the Publisher:Defining his subject as making the art of verifying computer programs (debugging) into a science, the author addresses both practical and theoretical aspects of the process. A self-contained treatment, it includes selected concepts of computability theory and mathematical logic, and each chapter concludes with bibliographic remarks, references, and problems. This book is a classic text on sequential program verification; it has been widely translated from the original Hebrew and is much in demand among graduate students in the field of computer science (it may also be used as an undergraduate text for advanced classes). Unabridged republication of the edition published by McGraw-Hill, New York, 1974. 77 Figures.