Operational semantics of rewriting with the on-demand evaluation strategy
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
Hidden algebra and concurrent distributed software
ACM SIGSOFT Software Engineering Notes
On Hoare logic and Kleene algebra with tests
ACM Transactions on Computational Logic (TOCL)
Dynamic connectors for concurrency
Theoretical Computer Science
Web-Based Support for Cooperative Software Engineering
Annals of Software Engineering
Normal forms for algebras of connections
Theoretical Computer Science
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
A 'Theory' Mechanism for a Proof-Verifier Based on First-Order Set Theory
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
An Overview of Compositional Translations
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Formalising Ontologies and Their Relations
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Using Algebraic Specification Techniques in Development of Object-Oriented Frameworks
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Can Intuition Become Rigorous? Foundations for UML Model Verification Tools
ISSRE '00 Proceedings of the 11th International Symposium on Software Reliability Engineering
Algebraic Semantics of an Imperative Programming Language
Programming and Computing Software
Hidden coinduction: behavioural correctness proofs for objects
Mathematical Structures in Computer Science
A survey of semantic description frameworks for programming languages
ACM SIGPLAN Notices
An Abstract Compiler Model as a Result of the Algebraic Semantics of a Programming Language
Programming and Computing Software
Undefinedness vs. underspecification in HALDEN ASL
Nordic Journal of Computing
Rewriting of imperative programs into logical equations
Science of Computer Programming
A formal approach to component adaptability
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
Roadmap for enhanced languages and methods to aid verification
Proceedings of the 5th international conference on Generative programming and component engineering
The rewriting logic semantics project
Theoretical Computer Science
Serfs: Dynamically-bound parameterized components
Journal of Systems and Software
Java+ITP: A Verification Tool Based on Hoare Logic and Algebraic Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated Software Engineering
A Rewriting Logic Approach to Operational Semantics (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Strategies and simulations in a semantic framework
Journal of Algorithms
Science of Computer Programming
Verifying Design with Proof Scores
Verified Software: Theories, Tools, Experiments
A rewriting logic approach to operational semantics
Information and Computation
Mathematical Structures in Computer Science
Closures in Binary Partial Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Modular Rewriting Semantics in Practice
Electronic Notes in Theoretical Computer Science (ENTCS)
The Rewriting Logic Semantics Project
Electronic Notes in Theoretical Computer Science (ENTCS)
Data constraints for validation of real-time software
SE '08 Proceedings of the IASTED International Conference on Software Engineering
Journal of Symbolic Computation
A new definitional specification language
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
Rule-based analysis of dimensional safety
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
On equality predicates in algebraic specification languages
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Action algebras and model algebras in denotational semantics
Semantics and algebraic specification
An introduction to algebraic semiotics, with application to user interface design
Computation for metaphors, analogy, and agents
AIMSA'10 Proceedings of the 14th international conference on Artificial intelligence: methodology, systems, and applications
A lightweight approach to datatype-generic rewriting
Journal of Functional Programming
Fostering proof scores in CafeOBJ
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Matching logic: an alternative to hoare/floyd logic
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Synthesis and emergence in engineering design problem solving
ecodesign'99 Proceedings of the First international conference on Environmentally conscious design and inverse manufacturing
Towards verification of SubCprograms with side effects
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
The rewriting logic semantics project: a progress report
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
JAHUEL: a formal framework for software synthesis
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Checking reachability using matching logic
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
The rewriting logic semantics project: A progress report
Information and Computation
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
From the Publisher:Algebraic Semantics of Imperative Programs presents a self-contained and novel "executable" introduction to formal reasoning about imperative programs. The authors' primary goal is to improve programming ability by improving intuition about what programs mean and how they run. The semantics of imperative programs is specified in a formal, implemented notation, the language OBJ; this makes the semantics highly rigorous yet simple, and provides support for the mechanical verification of program properties. OBJ was designed for algebraic semantics; its declarations introduce symbols for sorts and functions, its statements are equations, and its computations are equational proofs. Thus, an OBJ "program" is an equational theory, and every OBJ computation proves some theorem about such a theory. This means that an OBJ program used for defining the semantics of a program already has a precise mathematical meaning. Moreover, standard techniques for mechanizing equational reasoning can be used for verifying axioms that describe the effect of imperative programs on abstract machines. These axioms can then be used in mechanical proofs of properties of programs. Intended for advanced undergraduates or beginning graduate students, Algebraic Semantics of Imperative Programs contains many examples and exercises in program verification, all of which can be done in OBJ.