Pages that link to "Item:Q1341754"
From MaRDI portal
The following pages link to A syntactic approach to type soundness (Q1341754):
Displaying 50 items.
- Formal verification of concurrent programs with Read-write locks (Q351980) (← links)
- The rewriting logic semantics project: a progress report (Q393080) (← links)
- Flag-based big-step semantics (Q516041) (← links)
- The spirit of ghost code (Q518394) (← links)
- A WSDL-based type system for asynchronous WS-BPEL processes (Q537948) (← links)
- Delegation by object composition (Q553899) (← links)
- simpA: an agent-oriented approach for programming concurrent applications on top of Java (Q608358) (← links)
- From CML to its process algebra (Q672132) (← links)
- Certifying low-level programs with hardware interrupts and preemptive threads (Q835764) (← links)
- Compilation of extended recursion in call-by-value functional languages (Q848739) (← links)
- A core calculus for correlation in orchestration languages (Q861302) (← links)
- Backwards type analysis of asynchronous method calls (Q953530) (← links)
- Typing termination in a higher-order concurrent imperative language (Q979082) (← links)
- An overview of the K semantic framework (Q987974) (← links)
- Type inference and strong static type checking for Promela (Q988201) (← links)
- Amalgamating sessions and methods in object-oriented languages with generics (Q1004058) (← links)
- A type safe state abstraction for coordination in JAVA-like languages (Q1006341) (← links)
- Mobility control via passports (Q1012123) (← links)
- Coinductive big-step operational semantics (Q1012129) (← links)
- A rewriting logic approach to operational semantics (Q1012130) (← links)
- A simplified account of polymorphic references (Q1334643) (← links)
- A note on ``A simplified account of polymorphic references'' (Q1350743) (← links)
- A linear logical framework (Q1400718) (← links)
- Mechanising a type-safe model of multithreaded Java with a verified compiler (Q1663233) (← links)
- A type system for counting instances of software components (Q1758151) (← links)
- Weak updates and separation logic (Q1758657) (← links)
- Syntactic type soundness results for the region calculus (Q1854515) (← links)
- Modular statically typed multimethods (Q1854533) (← links)
- Modular structural operational semantics (Q1878712) (← links)
- Type inference for record concatenation and subtyping (Q1887147) (← links)
- A functional approach to generic programming using adaptive traversals (Q1929347) (← links)
- A list-machine benchmark for mechanized metatheory (Q1945921) (← links)
- Reconciling method overloading and dynamically typed scripting languages (Q2275534) (← links)
- Abstracting models of strong normalization for classical calculi (Q2291828) (← links)
- Dynamic structural operational semantics (Q2329443) (← links)
- A graph-based generic type system for object-oriented programs (Q2418638) (← links)
- A reduction semantics for direct-style asynchronous observables (Q2423763) (← links)
- Matching MyType to subtyping (Q2442957) (← links)
- On a monadic semantics for freshness (Q2566026) (← links)
- A Classical Realizability Model for a Semantical Value Restriction (Q2802494) (← links)
- A context-based approach to proving termination of evaluation (Q2805157) (← links)
- Equational Reasoning About Quantum Protocols (Q2822505) (← links)
- Structuring operational semantics: simplification and computation (Q2864160) (← links)
- Prototyping concurrent systems with agents and artifacts: framework and core calculus (Q2866321) (← links)
- A rewriting logic approach to operational semantics (extended abstract) (Q2871834) (← links)
- Semantic subtyping with an SMT solver (Q2913944) (← links)
- From Rewriting Logic, to Programming Language Semantics, to Program Verification (Q2945730) (← links)
- Context-Free Session Type Inference (Q2988669) (← links)
- Polymorphic Contracts (Q3000571) (← links)
- Proving Isolation Properties for Software Transactional Memory (Q3000572) (← links)