Pages that link to "Item:Q4066568"

The following pages link to Guarded commands, nondeterminacy and formal derivation of programs (Q4066568):

Displaying 50 items.

• Weakest preconditions for pure Prolog programs (Q293340) (← links)
• Developments in concurrent Kleene algebra (Q299202) (← links)
• Command-based importance sampling for statistical model checking (Q313977) (← links)
• LCTD: test-guided proofs for C programs on LLVM (Q338629) (← links)
• Applicability conditions for plans with loops: computability results and algorithms (Q359973) (← links)
• Refinement-oriented models of Stateflow charts (Q436420) (← links)
• Automatic distributed code generation from formal models of asynchronous processes interacting by multiway rendezvous (Q516036) (← links)
• Mitigating covert channels based on analysis of the potential for communication (Q530557) (← links)
• Modular verification of multithreaded programs (Q557795) (← links)
• Transforming semantics by abstract interpretation (Q557807) (← links)
• Formal correctness proofs of a nondeterministic program (Q594577) (← links)
• An elementary and unified approach to program correctness (Q607408) (← links)
• On Euclid's algorithm and elementary number theory (Q627201) (← links)
• Adaptive broadcast by fault-tolerant spanning tree switching (Q666207) (← links)
• Formalizing Dijkstra's predicate transformer wp in weak second-order logic (Q673132) (← links)
• A model for synchronous switching circuits and its theory of correctness (Q685112) (← links)
• Complete proof rules for strong fairness and strong extreme fairness (Q685427) (← links)
• \(L\)-fuzzy strongest postcondition predicate transformers as \(L\)-idempotent linear or affine operators between semimodules of monotonic predicates (Q690918) (← links)
• Nondeterministic three-valued logic: isotonic and guarded truth-functions (Q792750) (← links)
• The axiomatic semantics of programs based on Hoare's logic (Q800712) (← links)
• A theory for the derivation of combination C-mos circuit designs (Q808726) (← links)
• Kleene under a modal demonic star (Q817579) (← links)
• Creol: A type-safe object-oriented model for distributed concurrent systems (Q854164) (← links)
• Revisiting sequential composition in process calculi (Q890611) (← links)
• Branching versus linear logics yet again (Q911747) (← links)
• Transforming generate-and-test programs to execute under committed-choice AND-parallelism (Q914360) (← links)
• Automatic generation of path conditions for concurrent timed systems (Q947796) (← links)
• Verification and falsification of programs with loops using predicate abstraction (Q968302) (← links)
• Alternating states for dual nondeterminism in imperative programming (Q974118) (← links)
• Ten years of Hoare's logic: A survey. II: Nondeterminism (Q1056534) (← links)
• Dataflow computing and Eager and Lazy evaluations (Q1077928) (← links)
• Comments on Morris's starvation-free solution to the mutual exclusion problem (Q1081301) (← links)
• A complete rule for equifair termination (Q1088401) (← links)
• The weakest prespecification (Q1091121) (← links)
• A shared memory algorithm and proof for the generalized alternative construct in CSP (Q1100889) (← links)
• Trace, failure and testing equivalences for communicating processes (Q1104076) (← links)
• A proof system for distributed processes (Q1106014) (← links)
• Appraising fairness in languages for distributed programming (Q1112589) (← links)
• Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic (Q1139368) (← links)
• On the total correctness of nondeterministic programs (Q1143163) (← links)
• A simple relation between relational and predicate transformer semantics for nondeterministic programs (Q1156476) (← links)
• On termination problems for finitely interpreted ALGOL-like programs (Q1161274) (← links)
• A unified approach for studying the properties of transition systems (Q1161289) (← links)
• Programs as partial graphs. I: Flow equivalence and correctness (Q1168723) (← links)
• Axiomatic semantics for ''escape'' statements (Q1182114) (← links)
• Defining conditional independence using collapses (Q1194331) (← links)
• Verification of distributed programs using representative interleaving sequences (Q1200917) (← links)
• Semantic models for total correctness and fairness (Q1208419) (← links)
• From algebra to operational semantics (Q1209325) (← links)
• Language design methods based on semantic principles (Q1225927) (← links)