Pages that link to "Item:Q5348920"

The following pages link to Small bisimulations for reasoning about higher-order imperative programs (Q5348920):

Displaying 22 items.

• Refactoring and representation independence for class hierarchies (Q428866) (← links)
• First-order reasoning for higher-order concurrency (Q456466) (← links)
• Program equivalence in a simple language with state (Q456473) (← links)
• A bisimulation-like proof method for contextual properties in untyped \(\lambda \)-calculus with references and deallocation (Q615949) (← links)
• Linearity and bisimulation (Q997996) (← links)
• (Bi)simulations up-to characterise process semantics (Q1012122) (← links)
• Algorithmic games for full ground references (Q1650867) (← links)
• Complete trace models of state and control (Q2233464) (← links)
• Bisimulation and coinduction enhancements: a historical perspective (Q2280213) (← links)
• Towards `up to context' reasoning about higher-order processes (Q2286742) (← links)
• Modular Verification of Procedure Equivalence in the Presence of Memory Allocation (Q2988675) (← links)
• Full Abstraction at Package Boundaries of Object-Oriented Languages (Q3098051) (← links)
• New (Q3178271) (← links)
• A Sound and Complete Bisimulation for Contextual Equivalence in $$\lambda $$ -Calculus with Call/cc (Q3179291) (← links)
• A Complete, Co-inductive Syntactic Theory of Sequential Control and State (Q3184753) (← links)
• A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References (Q3644766) (← links)
• (Q5155670) (← links)
• (Q5155688) (← links)
• Equations, Contractions, and Unique Solutions (Q5278202) (← links)
• Reasoning about multi-stage programs (Q5371979) (← links)
• (Q5377471) (← links)
• From Applicative to Environmental Bisimulation (Q5739359) (← links)