Samson Abramsky & Guy McCusker (1996):
Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions.
Electr. Notes Theor. Comput. Sci. 3,
pp. 2–14,
doi:10.1016/S1571-0661(05)80398-6.
Mateus Borges, Antonio Filieri, Marcelo d'Amorim, Corina S. Pasareanu & Willem Visser (2014):
Compositional solution space quantification for probabilistic software analysis.
In: Michael F. P. O'Boyle & Keshav Pingali: ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI'14.
ACM,
pp. 15,
doi:10.1145/2594291.2594329.
Vincent Danos & Russell Harmer (2002):
Probabilistic game semantics.
ACM Trans. Comput. Log. 3(3),
pp. 359–382,
doi:10.1145/507382.507385.
Aleksandar Dimovski (2010):
A Compositional Method for Deciding Equivalence and Termination of Nondeterministic Programs.
In: 8th International Conference on Integrated Formal Methods, IFM'10,
LNCS 6396.
Springer,
pp. 121–135,
doi:10.1007/978-3-642-16265-7_10.
Aleksandar Dimovski (2012):
Symbolic Representation of Algorithmic Game Semantics.
In: Proceedings Third International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2012,,
EPTCS 96,
pp. 99–112,
doi:10.4204/EPTCS.96.8.
Aleksandar Dimovski (2013):
Slot Games for Detecting Timing Leaks of Programs.
In: Proceedings Fourth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2013,,
EPTCS 119,
pp. 166–179,
doi:10.4204/EPTCS.119.15.
Aleksandar Dimovski, Dan R. Ghica & Ranko Lazic (2005):
Data-Abstraction Refinement: A Game Semantic Approach.
In: 12th International Symposium on Static Analysis, SAS '05,
LNCS 3672.
Springer,
pp. 102–117,
doi:10.1007/11547662_9.
Aleksandar Dimovski & Ranko Lazic (2007):
Compositional software verification based on game semantics and process algebra.
STTT 9(1),
pp. 37–51,
doi:10.1007/s10009-006-0005-y.
Aleksandar S. Dimovski (2014):
Ensuring Secure Non-interference of Programs by Game Semantics.
In: Security and Trust Management - 10th International Workshop, STM 2014. Proceedings,
LNCS 8743.
Springer,
pp. 81–96,
doi:10.1007/978-3-319-11851-2_6.
Aleksandar S. Dimovski (2014):
Program verification using symbolic game semantics.
Theor. Comput. Sci. 560,
pp. 364–379,
doi:10.1016/j.tcs.2014.01.016.
Aleksandar S. Dimovski (2016):
Symbolic Game Semantics for Model Checking Program Families.
In: Dragan Bosnacki & Anton Wijs: Proceedings of 23rd International Symposium on Model Checking Software, SPIN'16,
LNCS 9641.
Springer,
pp. 19–37,
doi:10.1007/978-3-319-32582-8_2.
Bruno Dutertre (2014):
Yices 2.2.
In: Computer Aided Verification - 26th International Conference, CAV 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 18-22, 2014. Proceedings,
pp. 737–744,
doi:10.1007/978-3-319-08867-9_49.
Antonio Filieri, Corina S. Pasareanu & Willem Visser (2013):
Reliability analysis in symbolic pathfinder.
In: 35th International Conference on Software Engineering, ICSE '13.
IEEE Computer Society,
pp. 622–631,
doi:10.1109/ICSE.2013.6606608.
Jaco Geldenhuys, Matthew B. Dwyer & Willem Visser (2012):
Probabilistic symbolic execution.
In: Mats Per Erik Heimdahl & Zhendong Su: International Symposium on Software Testing and Analysis, ISSTA 2012.
ACM,
pp. 166–176,
doi:10.1145/2338965.2336773.
Dan R. Ghica & Guy McCusker (2003):
The regular-language semantics of second-order Idealized ALGOL.
Theor. Comput. Sci. 309(1-3),
pp. 469–502,
doi:10.1016/S0304-3975(03)00315-3.
Russell Harmer & Guy McCusker (1999):
A Fully Abstract Game Semantics for Finite Nondeterminism.
In: 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999,
pp. 422–430,
doi:10.1109/LICS.1999.782637.
J. M. E. Hyland & C.-H. Luke Ong (2000):
On Full Abstraction for PCF: I, II, and III.
Inf. Comput. 163(2),
pp. 285–408,
doi:10.1006/inco.2000.2917.
Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter & James Worrell (2013):
Algorithmic probabilistic game semantics - Playing games with automata.
Formal Methods in System Design 43(2),
pp. 285–312,
doi:10.1007/s10703-012-0173-1.
Marta Z. Kwiatkowska, Gethin Norman & David Parker (2002):
Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach.
In: Joost-Pieter Katoen & Perdita Stevens: Tools and Algorithms for the Construction and Analysis of Systems, 8th International Conference, TACAS 2002, Proceedings,
LNCS 2280.
Springer,
pp. 52–66,
doi:10.1007/3-540-46002-0_5.
Jesús A. De Loera, Raymond Hemmecke, Jeremiah Tauzer & Ruriko Yoshida (2004):
Effective lattice point counting in rational convex polytopes.
J. Symb. Comput. 38(4),
pp. 1273–1302,
doi:10.1016/j.jsc.2003.04.003.
Andrzej S. Murawski & Joël Ouaknine (2005):
On Probabilistic Program Equivalence and Refinement.
In: CONCUR 2005 - Concurrency Theory, 16th International Conference, CONCUR 2005, Proceedings,
LNCS 3653.
Springer,
pp. 156–170,
doi:10.1007/11539452_15.
John C. Reynolds (1997):
The essence of Algol.
In: O'Hearn, P.W., Tennent, R.D. (eds), Algol-like languages, Birkhaüser,
doi:10.1007/978-1-4612-4118-8_4.
eptcs@eptcs.org