scientific article

zbMath1483.68077arXiv1709.02092MaRDI QIDQ3384159

Aleksandar S. Dimovski

Publication date: 14 December 2021

Full work available at URL: https://arxiv.org/abs/1709.02092

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Applications of game theory (91A80) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (4)

Computing Program Reliability Using Forward-Backward Precondition Analysis and Model Counting ⋮ Verifying annotated program families using symbolic game semantics ⋮ Unnamed Item ⋮ Leafy automata for higher-order concurrency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Program verification using symbolic game semantics
• On full abstraction for PCF: I, II and III
• The regular-language semantics of second-order idealized ALGOL
• Algorithmic probabilistic game semantics. Playing games with automata
• Effective lattice point counting in rational convex polytopes
• Probabilistic game semantics
• Static Analysis
• CONCUR 2005 – Concurrency Theory

This page was built for publication: