Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages
Countable nondeterminism and random assignment
Journal of the ACM (JACM)
A generalized iterative construct and its semantics
ACM Transactions on Programming Languages and Systems (TOPLAS)
Predicate-transformer semantics of general recursion
Acta Informatica
Communications of the ACM
Concurrent Processes and Their Syntax
Journal of the ACM (JACM)
Predicative programming Part I
Communications of the ACM
A generalized control structure and its formal definition
Communications of the ACM
Nondeterminism in logics of programs
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
First-Order Dynamic Logic
A Discipline of Programming
Mathematical Theory of Computation
Mathematical Theory of Computation
Implementation of a non-deterministic loop
ACM SIGCSE Bulletin
Adding fair choice to Dijkstra's calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algebraic approaches to nondeterminism—an overview
ACM Computing Surveys (CSUR)
On the Practical Need for Abstraction Relations to Verify Abstract Data Type Representations
IEEE Transactions on Software Engineering
A refinement calculus for the synthesis of verified hardware descriptions in VHDL
ACM Transactions on Programming Languages and Systems (TOPLAS)
Synthesis of concurrent systems with many similar processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Avoiding exponential explosion: generating compact verification conditions
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Predicate abstraction for software verification
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Partial correctness for probabilistic demonic programs
Theoretical Computer Science
Using data groups to specify and check side effects
PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Theoretical Computer Science
An arithmetic theory of consistency enforcement
Acta Cybernetica
Modular Verification of Data Abstractions with Shared Realizations
IEEE Transactions on Software Engineering
Specification Diagrams for Actor Systems
Higher-Order and Symbolic Computation
Effect Preservation as a Means for Achieving Update Consistency
FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
Towards a Tailored Theory of Consistency Enforcement in Databases
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
On the Semantics of Refinement Calculi
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Foundations of a Constraint-Based Illustrator
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
A Theory of Generalised Substitutions
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Enhancing the Pre- and Postcondition Technique for More Expressive Specifications
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
A Fixpoint Theory for Non-monotonic Parallelism
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
A Generalization of Dijkstra's Calculus to Typed Program Specifications
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Towards effect preservation of updates with loops
Integrity and internal control in information systems V
A fixpoint theory for non-monotonic parallelism
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Program Adaptation via Output-Constraint Specialization
Higher-Order and Symbolic Computation
Verifying mutual exclusion and liveness properties with split preconditions
Journal of Computer Science and Technology
Generating error traces from verification-condition counterexamples
Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
Efficient weakest preconditions
Information Processing Letters
Algebras of modal operators and partial correctness
Theoretical Computer Science - Algebraic methodology and software technology
ACM Transactions on Programming Languages and Systems (TOPLAS)
A refinement calculus for logic programs
Theory and Practice of Logic Programming
Science of Computer Programming
Engineering and theoretical underpinnings of retrenchment
Science of Computer Programming
From Predicates to Programs: The Semantics of a Method Language
Electronic Notes in Theoretical Computer Science (ENTCS)
HOL-Boogie -- An Interactive Prover for the Boogie Program-Verifier
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Automatic construction of simple artifact-based business processes
Proceedings of the 12th International Conference on Database Theory
Term transformers: A new approach to state
ACM Transactions on Programming Languages and Systems (TOPLAS)
Enabledness and termination in refinement algebra
Science of Computer Programming
HOL-Boogie--An Interactive Prover-Backend for the Verifying C Compiler
Journal of Automated Reasoning
Electronic Notes in Theoretical Computer Science (ENTCS)
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
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Efficient weakest preconditions
Information Processing Letters
Expression transformers in B-GSL
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Probabilistic termination in B
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
Automata- and logic-based pattern languages for tree-structured data
Proceedings of the 2nd international conference on Semantics in databases
Lifting general correctness into partial correctness is ok
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
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
Knowledge and games in modal semirings
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
Preference and non-deterministic choice
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
To goto where no statement has gone before
VSTTE'10 Proceedings of the Third international conference on Verified software: theories, tools, experiments
Partial, total and general correctness
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Unifying theories of programming that distinguish nontermination and abort
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Reasoning about loops in total and general correctness
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Formal Methods in System Design
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
Unifying recursion in partial, total and general correctness
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
A Theory of Synchronous Relational Interfaces
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving Reachability in B using Substitution Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Boogie: a modular reusable verifier for object-oriented programs
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Non-termination in unifying theories of programming
RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
An imperative extension to alloy
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
The challenge of probabilistic event B
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Computations and relational bundles
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Omega algebra, demonic refinement algebra and commands
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Monotone predicate transformers as up-closed multirelations
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
On two dually nondeterministic refinement algebras
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Refinement algebra with operators for enabledness and termination
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Of probabilistic wp and CSP - and compositionality
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
A fixpoint semantics of event systems with and without fairness assumptions
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Recasting hoare and he's unifying theory of programs in the context of general correctness
IW-FM'01 Proceedings of the 5th Irish conference on Formal Methods
Specification and refinement in general correctness
3FACS'98 Proceedings of the 3rd BCS-FACS conference on Northern Formal Methods
Finding common ground: choose, assert, and assume
Proceedings of the 2012 Workshop on Dynamic Analysis
Unifying correctness statements
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
LOGIC BASED PROGRAMMED STRUCTURE REWRITING SYSTEMS
Fundamenta Informaticae
Ramsey vs. lexicographic termination proving
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
An overview of the Leon verification system: verification by translation to recursive functions
Proceedings of the 4th Workshop on Scala
Reasoning about nondeterminism in programs
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Under-Approximating loops in c programs for fast counterexample detection
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Extended designs algebraically
Science of Computer Programming
Linking Unifying Theories of Program refinement
Science of Computer Programming
Set-theoretic models of computations
Theories of Programming and Formal Methods
| Hi-index | 0.00 |
Dijsktra's calculus of guarded commands can be generalized and simplified by dropping the law of the excluded miracle. This paper gives a self-contained account of the generalized calculus from first principles through the semantics of recursion. The treatment of recursion uses the fixpoint method from denotational semantics. The paper relies only on the algebraic properties of predicates; individual states are not mentioned (except for motivation). To achieve this, we apply the correspondence between programs and predicates that underlies predicative programming.The paper is written from the axiomatic semantic point of view, but its contents can be described from the denotational semantic point of view roughly as follows: The Plotkin-Apt correspondence between wp semantics and the Smyth powerdomain is extended to a correspondence between the full wp/wlp semantics and the Plotkin powerdomain extended with the empty set.