Pushdown normal-form bisimulation: a nominal context-free approach to program equivalence
From MaRDI portal
Cites work
- A bisimulation for dynamic sealing
- A bisimulation for type abstraction and recursion
- A complete normal-form bisimilarity for state
- A complete, co-inductive syntactic theory of sequential control and state
- A contextual equivalence checker for IMJ*
- A Fully Abstract Trace Semantics for General References
- A new approach to abstract syntax with variable binding
- A system-level game semantics
- Abstracting abstract machines
- Automata theory in nominal sets
- Bisimulation, modal logic and model checking games
- CFA2: a context-free approach to control-flow analysis
- Compilation and equivalence of imperative objects
- Context-free languages over infinite alphabets
- Enhancements of the bisimulation proof method
- Equivalence in functional languages with effects
- From bounded checking to verification of equivalence via symbolic up-to techniques
- Full abstraction for PCF
- Fully abstract normal form bisimulation for call-by-value pcf
- Game Semantics for Interface Middleweight Java
- scientific article; zbMATH DE number 1232241 (Why is no real title available?)
- scientific article; zbMATH DE number 1330448 (Why is no real title available?)
- scientific article; zbMATH DE number 1499102 (Why is no real title available?)
- scientific article; zbMATH DE number 2242594 (Why is no real title available?)
- Inference rules for proving the equivalence of recursive procedures
- Kripke open bisimulation. A marriage of game semantics and operational techniques
- Normal form bisimulations for delimited-control operators
- Normal form simulation for McCarthy's \textsf{amb}
- On full abstraction for PCF: I, II and III
- Open Bisimulation for Aspects
- Operational nominal game semantics
- Program verification using symbolic game semantics
- Pushdown control-flow analysis for free
- Reachability analysis of pushdown automata: Application to model-checking
- Reachability in pushdown register automata
- Small bisimulations for reasoning about higher-order imperative programs
- State-dependent representation independence
- The impact of higher-order state and control effects on local relational reasoning
- The lazy lambda calculus in a concurrency scenario
- The marriage of bisimulations and Kripke logical relations
- The regular-language semantics of second-order idealized ALGOL
- Turing machines with atoms
- Typed Normal Form Bisimulation
This page was built for publication: Pushdown normal-form bisimulation: a nominal context-free approach to program equivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970220)
