Pages that link to "Item:Q5617313"

The following pages link to Program development by stepwise refinement (Q5617313):

Displaying 50 items.

• Declarative event based models of concurrency and refinement in psi-calculi (Q272301) (← links)
• Verification of distributed systems with local-global predicates (Q432134) (← links)
• Compositional noninterference from first principles (Q432152) (← links)
• An elementary and unified approach to program correctness (Q607408) (← links)
• A sheaf-theoretic approach to pattern matching and related problems (Q685382) (← links)
• Provably correct derivation of algorithms using FermaT (Q736840) (← links)
• Introducing extra operations in refinement (Q736913) (← links)
• Synthetic programming (Q761788) (← links)
• The shadow knows: refinement and security in sequential programs (Q923889) (← links)
• Comparing disjunctive modal transition systems with an one-selecting variant (Q953529) (← links)
• Programming with narrowing: a tutorial (Q968524) (← links)
• Interpolation in computing science: The semantics of modularization (Q1024120) (← links)
• Refinement for user interface designs (Q1047216) (← links)
• Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study (Q1100879) (← links)
• A calculus of refinements for program derivations (Q1111362) (← links)
• Datalogy - the Copenhagen tradition of computer science (Q1117684) (← links)
• On correct refinement of programs (Q1157144) (← links)
• Fundamental solutions of the eight queens problem (Q1161301) (← links)
• Algebraic implementation of abstract data types (Q1163361) (← links)
• Linear congruence equations for the solutions of the \(N\)-queens problem (Q1197990) (← links)
• An interactive graphics based visual modelling tool (Q1200856) (← links)
• Proving programs correct through refinement (Q1242447) (← links)
• A contribution to the programming calculus (Q1251058) (← links)
• Program composition via unification (Q1331925) (← links)
• On solving the progressive party problem as a MIP. (Q1422363) (← links)
• Program development schemata as derived rules (Q1583853) (← links)
• Parallel composition and decomposition of specifications (Q1602555) (← links)
• Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques (Q1640636) (← links)
• A verified SAT solver framework with learn, forget, restart, and incrementality (Q1663234) (← links)
• Formalizing network flow algorithms: a refinement approach in Isabelle/HOL (Q1722647) (← links)
• Refinement to imperative HOL (Q1739909) (← links)
• The conical methodology and the evolution of simulation model development (Q1805478) (← links)
• Lax naturality through enrichment (Q1923539) (← links)
• Stepwise refinement of heap-manipulating code in Chalice (Q1941869) (← links)
• Product optimization in stepwise design (Q2115903) (← links)
• Bridging arrays and ADTs in recursive proofs (Q2233489) (← links)
• Relational demonic fuzzy refinement (Q2336161) (← links)
• Automatic refinement to efficient data structures: a comparison of two approaches (Q2417948) (← links)
• Programming by induction (Q2549571) (← links)
• Proof of correctness of data representations (Q2554952) (← links)
• Construction and analysis of ground models and their refinements as a foundation for validating computer-based systems (Q2643128) (← links)
• The refinement calculus of reactive systems (Q2672236) (← links)
• Formalizing the Edmonds-Karp Algorithm (Q2829260) (← links)
• Property Preserving Refinement for Csp-Casl (Q3184734) (← links)
• Syntactic/semantic interactions in programmer behavior: A model and experimental results (Q3853123) (← links)
• Dave—a validation error detection and documentation system for fortran programs (Q4095829) (← links)
• A language-independent system to aid the development of structured programs (Q4098625) (← links)
• Data metastructures (Q4199506) (← links)
• Refiner: A Problem-Solving Environment for Scientific Simulator Creation (Q4456573) (← links)
• Modular action language (Q4593024) (← links)