On the public citation graph

Data-Abstraction Refinement: A Game Semantic Approach

0 signed · 65 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.2000.2917openalex-snapshot

On Full Abstraction for PCF: I, II, and III

inferredcites →https://doi.org/10.1006/inco.2000.2930openalex-snapshot

Full Abstraction for PCF

inferredcites →https://doi.org/10.1007/10722167_15openalex-snapshot

Counterexample-Guided Abstraction Refinement

inferredcites →https://doi.org/10.1007/11537328_4openalex-snapshot

The BLAST Software Verification System

inferredcites →https://doi.org/10.1007/11691372_20openalex-snapshot

Compositional Model Extraction for Higher-Order Concurrent Programs

inferredcites →https://doi.org/10.1007/11691617_17openalex-snapshot

A Counterexample-Guided Refinement Tool for Open Procedural Programs

inferredcites →https://doi.org/10.1007/11901433_29openalex-snapshot

Assume-Guarantee Software Verification Based on Game Semantics

inferredcites →https://doi.org/10.1007/3-540-44585-4_25openalex-snapshot

The SLAM Toolkit

inferredcites →https://doi.org/10.1007/3-540-44829-2_17openalex-snapshot

Software Verification with BLAST

inferredcites →https://doi.org/10.1007/3-540-45022-x_10openalex-snapshot

Reasoning about Idealized ALGOL Using Regular Languages

inferredcites →https://doi.org/10.1007/3-540-45937-5_13openalex-snapshot

Modular Static Program Analysis

inferredcites →https://doi.org/10.1007/3-540-46002-0_12openalex-snapshot

Relative Completeness of Abstraction Refinement for Software Model Checking

inferredcites →https://doi.org/10.1007/978-1-4612-4118-8_4openalex-snapshot

The Essence of Algol

inferredcites →https://doi.org/10.1007/978-1-4757-3851-3_10openalex-snapshot

Linearity, Sharing and State: A Fully Abstract Game Semantics for Idealized Algol with Active Expressions

inferredcites →https://doi.org/10.1007/978-3-540-24727-2_16openalex-snapshot

Angelic Semantics of Fine-Grained Concurrency

inferredcites →https://doi.org/10.1007/978-3-540-24730-2_32openalex-snapshot

Applying Game Semantics to Compositional Software Modeling and Verification

inferredcites →https://doi.org/10.1007/978-3-540-27836-8_58openalex-snapshot

Syntactic Control of Concurrency

inferredcites →https://doi.org/10.1007/978-3-540-30482-1_18openalex-snapshot

CSP Representation of Game Semantics for Second-Order Idealized Algol

inferredcites →https://doi.org/10.1007/978-3-540-31871-2_18openalex-snapshot

Sense Matrix Model and Discrete Cosine Transform

inferredcites →https://doi.org/10.1007/978-3-540-31982-5_13openalex-snapshot

Third-Order Idealized Algol with Iteration Is Decidable

inferredcites →https://doi.org/10.1007/bfb0026425openalex-snapshot

A new approach to control flow analysis

inferredcites →https://doi.org/10.1007/bfb0055067openalex-snapshot

Generalised flowcharts and games

inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot

Introduction to automata theory, languages and computation

inferredcites →https://doi.org/10.1016/j.tcs.2005.10.032openalex-snapshot

Syntactic control of concurrency

inferredcites →https://doi.org/10.1016/s0304-3975(03)00315-3openalex-snapshot

The regular-language semantics of second-order idealized ALGOL

inferredcites →https://doi.org/10.1109/lics.1997.614931openalex-snapshot

Full abstraction for functional languages with control

inferredcites →https://doi.org/10.1109/lics.1999.782637openalex-snapshot

A fully abstract game semantics for finite nondeterminism

inferredcites →https://doi.org/10.1109/lics.1999.782639openalex-snapshot

Non-deterministic games and program analysis: An application to security

inferredcites →https://doi.org/10.1109/lics.2001.932487openalex-snapshot

A fully abstract game semantics of local exceptions

inferredcites →https://doi.org/10.1109/lics.2002.1029833openalex-snapshot

Observational equivalence of 3rd-order Idealized Algol is decidable

inferredcites →https://doi.org/10.1145/234528.234740openalex-snapshot

Abstract interpretation

inferredcites →https://doi.org/10.1145/333580.333584openalex-snapshot

Program analysis games

inferredcites →https://doi.org/10.1145/503272.503274openalex-snapshot

The S LAM project

inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot

Abstract interpretation

inferredcites →https://doi.org/10.1145/565816.503274openalex-snapshot

The S LAM project

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11691372_20openalex-snapshot

Compositional Model Extraction for Higher-Order Concurrent Programs

inferred← citeshttps://doi.org/10.1007/11691617_17openalex-snapshot

A Counterexample-Guided Refinement Tool for Open Procedural Programs

inferred← citeshttps://doi.org/10.1007/11901433_29openalex-snapshot

Assume-Guarantee Software Verification Based on Game Semantics

inferred← citeshttps://doi.org/10.1007/978-3-319-11851-2_6openalex-snapshot

Ensuring Secure Non-interference of Programs by Game Semantics

inferred← citeshttps://doi.org/10.1007/978-3-319-32582-8_2openalex-snapshot

Symbolic Game Semantics for Model Checking Program Families

inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_5openalex-snapshot

The Safe Lambda Calculus

inferred← citeshttps://doi.org/10.1007/978-3-540-78800-3_7openalex-snapshot

On-the-Fly Techniques for Game-Based Software Model Checking

inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2_8openalex-snapshot

Compositional Predicate Abstraction from Game Semantics

inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_51openalex-snapshot

Homer: A Higher-Order Observational Equivalence Model checkER

inferred← citeshttps://doi.org/10.1007/978-3-642-15576-5_14openalex-snapshot

Horizontal Partitioning by Predicate Abstraction and Its Application to Data Warehouse Design

inferred← citeshttps://doi.org/10.1007/978-3-642-16265-7_10openalex-snapshot

A Compositional Method for Deciding Equivalence and Termination of Nondeterministic Programs

inferred← citeshttps://doi.org/10.1007/978-3-642-19325-5_8openalex-snapshot

A Compositional Method for Deciding Program Termination

inferred← citeshttps://doi.org/10.1007/978-3-642-39614-4_9openalex-snapshot

Verifying Data Independent Programs Using Game Semantics

inferred← citeshttps://doi.org/10.1007/s10009-006-0005-yopenalex-snapshot

Compositional software verification based on game semantics and process algebra

inferred← citeshttps://doi.org/10.1007/s10009-006-0021-yopenalex-snapshot

Some current topics in model checking

inferred← citeshttps://doi.org/10.1007/s10009-009-0100-yopenalex-snapshot

Special section on advances in reachability analysis and decision procedures: contributions to abstraction-based system verification

inferred← citeshttps://doi.org/10.1007/s10009-010-0143-0openalex-snapshot

Data-abstraction refinement: a game semantic approach

inferred← citeshttps://doi.org/10.1007/s40687-018-0163-zopenalex-snapshot

A game-semantic model of computation

inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.011openalex-snapshot

Definability and Full Abstraction

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.01.016openalex-snapshot

Program verification using symbolic game semantics

inferred← citeshttps://doi.org/10.1016/j.tcs.2017.09.029openalex-snapshot

Verifying annotated program families using symbolic game semantics

inferred← citeshttps://doi.org/10.1017/s0960129520000250openalex-snapshot

Dynamic game semantics

inferred← citeshttps://doi.org/10.1109/lics.2009.25openalex-snapshot

Clipping: A Semantics-Directed Syntactic Approximation

inferred← citeshttps://doi.org/10.1109/lics.2009.26openalex-snapshot

Applications of Game Semantics: From Program Analysis to Hardware Synthesis

inferred← citeshttps://doi.org/10.1145/1292316.1292326openalex-snapshot

Game-based safety checking with Mage

inferred← citeshttps://doi.org/10.1145/2371316.2371352openalex-snapshot

Parameterized verification of open procedural programs

inferred← citeshttps://doi.org/10.1145/3672608.3707849openalex-snapshot

Weakest Safe Context Synthesis by Symbolic Game Semantics and Logical Abduction

inferred← citeshttps://doi.org/10.2168/lmcs-5(1:3)2009openalex-snapshot

The Safe Lambda Calculus

inferred← citeshttps://doi.org/10.4204/eptcs.119.15openalex-snapshot

Slot Games for Detecting Timing Leaks of Programs

inferred← citeshttps://doi.org/10.4204/eptcs.256.1openalex-snapshot

Probabilistic Analysis Based On Symbolic Game Semantics and Model Counting

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.