Pages that link to "Item:Q4066568"
From MaRDI portal
The following pages link to Guarded commands, nondeterminacy and formal derivation of programs (Q4066568):
Displaying 50 items.
- Trusting computations: a mechanized proof from partial differential equations to actual program (Q2398899) (← links)
- A genetically modified Hoare logic (Q2422014) (← links)
- An automatic method for the dynamic construction of abstractions of states of a formal model (Q2452756) (← links)
- The weakest specifunction (Q2484065) (← links)
- Compiling quantum programs (Q2484067) (← links)
- An optimal self-stabilizing strarvation-free alternator (Q2575834) (← links)
- Assumption propagation through annotated programs (Q2628303) (← links)
- Deadlock analysis in networks of communicating processes (Q2638755) (← links)
- Axioms for signatures with domain and demonic composition (Q2663185) (← links)
- The refinement calculus of reactive systems (Q2672236) (← links)
- Knowledge forgetting in propositional \(\mu\)-calculus (Q2679422) (← links)
- Automated reasoning for probabilistic sequential programs with theorem proving (Q2695373) (← links)
- Defining actions in concurrent declarative programming (Q2841291) (← links)
- Set-Theoretic Models of Computations (Q2842623) (← links)
- Quantum programming with mixed states (Q2864175) (← links)
- Observable behavior of dynamic systems: component reasoning for concurrent objects (Q2864507) (← links)
- Deriving Real-Time Action Systems Controllers from Multiscale System Specifications (Q2908563) (← links)
- A Relation-Algebraic Approach to Multirelations and Predicate Transformers (Q2941166) (← links)
- Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism (Q2974777) (← links)
- The Essence of Higher-Order Concurrent Separation Logic (Q2988664) (← links)
- An abstract interpretation-based model for safety semantics (Q2995468) (← links)
- ADAPTIVE DISTRIBUTED MUTUAL EXCLUSION BY DYNAMIC TOPOLOGY SWITCHING (Q2997929) (← links)
- A High-Level Language for Modeling Algorithms and Their Properties (Q2999308) (← links)
- Association of Under-Approximation Techniques for Generating Tests from Models (Q3012965) (← links)
- FORMALISMS FOR SPECIFYING MARKOVIAN POPULATION MODELS (Q3016219) (← links)
- ON FORMAL AND COGNITIVE SEMANTICS FOR SEMANTIC COMPUTING (Q3062792) (← links)
- Dynamic Frames in Java Dynamic Logic (Q3067542) (← links)
- Precondition Inference from Intermittent Assertions and Application to Contracts on Collections (Q3075478) (← links)
- Modelling declassification policies using abstract domain completeness (Q3103614) (← links)
- Computing Preconditions and Postconditions of While Loops (Q3105751) (← links)
- Compositional Reasoning (Q3176370) (← links)
- Combining Model Checking and Testing (Q3176377) (← links)
- Secure Guarded Commands (Q3297842) (← links)
- Fairness for Infinitary Control (Q3449624) (← links)
- Constructive Polychronous Systems (Q3455857) (← links)
- Recounting the Rationals: Twice! (Q3521981) (← links)
- Secure Microkernels, State Monads and Scalable Refinement (Q3543657) (← links)
- Hoare type theory, polymorphism and separation (Q3546051) (← links)
- Multiple Viewpoint Contract-Based Specification and Design (Q3602999) (← links)
- Formalisms for Specifying Markovian Population Models (Q3646248) (← links)
- Quantitative Analysis under Fairness Constraints (Q3648696) (← links)
- Some Variants of the Weakest Precondition in Nondeterminism (Q3723689) (← links)
- Programming with generators (Q3769940) (← links)
- (Q3883458) (← links)
- Church-Rosser converters (Q3899522) (← links)
- THE Σλ-CALCULUS AND DERIVED PROGRAM FORMS (Q3980023) (← links)
- Process algebra with four-valued logic (Q4443411) (← links)
- AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗ (Q4485121) (← links)
- Iris from the ground up: A modular foundation for higher-order concurrent separation logic (Q4625160) (← links)
- Programmed graph transformations and graph transformation units in GRACE (Q4645271) (← links)
