Coronavirus (Covid-19): Latest updates and information
Skip to main content Skip to navigation

Formal Methods members' activities

The group meets regularly at its research seminars.

Recent research presentations by group members include the following:

[1]
John Fearnley. The complexity of strategy improvement for parity games, April 2009. Seminar at Warwick University, UK.
[2]
John Fearnley. LCP algorithms for discounted games, April 2009. 25th British Colloquium for Theoretical Computer Science (BCTCS), Warwick, UK.
[3]
Marcin Jurdzinski. Algorithms for solving infinite games, January 2009. Invited talk at 35th International Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlyn, Czech Republic.
[4]
Marcin Jurdzinski. Algorithms for solving infinite games on graphs, May 2009. ESF Games Spring School, Centro Residenziale Universitario, Bertinoro, Italy.
[5]
Marcin Jurdzinski. Average-price games on timed and hybrid automata, March 2009. Workshop on Timed Systems, Univerité Libre de Bruxelles, Belgium.
[6]
Ranko Lazic. Automata and logics on structures with data, August 2008; May 2009. Automata and Verification Workshop, Mons, Belgium; Seminar at Université Libre de Bruxelles, Belgium.
[7]
Ranko Lazic. The covering and boundedness problems for branching vector addition systems, May 2009. Workshop on Verification of Infinite-State Systems, Tel Aviv, Israel.
[8]
John Fearnley. Solving mean payoff parity games with strategy improvement, June 2008. Warwick Postgraduate Colloquium in Computer Science.
[9]
Marcin Jurdzinski. Algorithms for solving parity games, May 2008. AutoMathA Brainstorming and Cooperation Days on Mu-Calculus, Université de Lausanne, Switzerland.
[10]
Marcin Jurdzinski. Average-time games, December 2008. 29th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Bangalore, India.
[11]
Marcin Jurdzinski. Concavely-priced timed automata, September 2008. 6th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS), St Malo, France.
[12]
Marcin Jurdzinski. Optimality equations and strategy improvement for solving games on timed and hybrid automata, June 2008. Invited talk at Réunion des Groupes de Travail ``Jeux'' et CMF, Bordeaux, France.
[13]
Marcin Jurdzinski. A simple P-matrix linear complementarity problem for discounted games, July 2008. Workshop on Logic and Algorithms, International Centre for Mathematical Sciences, University of Edinburgh, UK.
[14]
Marcin Jurdzinski. Strategy improvement algorithms for timed and hybrid automata, August 2008. Workshop on Automata and Verification, Mons-Hainaut University, Belgium.
[15]
Ranko Lazic. Algorithmic properties of logics and automata for trees with data, May, October and November 2007; April and May 2008. Seminars at Warwick University, UK, Bath University, UK, York University, UK, EPFL, Switzerland and LSV, ENS Cachan, France.
[16]
Ranko Lazic. Nets with tokens which carry data, June 2007; May 2008. 28th International Conference on Application and Theory of Petri Nets and Other Models of Concurrency (ICATPN), Siedlce, Poland; Seminar at LSV, ENS Cachan, France.
[17]
Marcin Jurdzinski. Alternation-free modal mu-calculus for data trees, July 2007. 22nd Annual IEEE Symposium on Logic in Computer Science (LICS), Wroclaw, Poland.
[18]
Marcin Jurdzinski. Reachability-time games on timed automata, July 2007. 34th Annual Collquium on Automata, Languages and Programming (ICALP), Wroclaw, Poland.
[19]
Marcin Jurdzinski. A deterministic subexponential algorithm for solving parity games, January and July 2006. ACM/SIAM Symposium on Discrete Algorithms (SODA'06), Miami, USA and Annual Meeting of EU RTN GAMES, Isaac Newton Institute, Cambridge, UK.
[20]
Marcin Jurdzinski. Strategy improvement algorithms for solving timed games, May 2006. Seminar at University of Edinburgh, UK and Workshop on Constraints and Verification, Isaac Newton Institute, Cambridge, UK.
[21]
Marcin Jurdzinski. Subexponential algorithms for solving parity games, August, November, and December 2006. Invited talk at the 3rd Workshop on Games in Design and Verification (GDV'06), Seattle, USA; seminars at University of Warsaw, Poland; University of Wroclaw, Poland; and Université Libre de Bruxelles, Belgium.
[22]
Ranko Lazic. A counterexample-guided refinement tool for open procedural programs, January 2006. Seminar at Oxford University, UK.
[23]
Ranko Lazic. Logics and automata for words and trees with data, December 2006. Seminar at Novi Sad University, Serbia.
[24]
Ranko Lazic. LTL with the freeze quantifier and register automata, March (twice), April, July and August (twice) 2006. Seminar at Warwick University, UK, Seminar at Oxford University, UK, 22nd British Colloquium for Theoretical Computer Science (BCTCS), University of Wales, Swansea, UK, GAMES Network Annual Meeting, Newton Institute, Cambridge, UK, Conference in Topology and Theoretical Computer Science (in honour of Peter Collins and Mike Reed), Oxford, UK and 21st Annual IEEE Symposium on Logic in Computer Science (LICS), Seattle, Washington, USA.
[25]
Ranko Lazic. Safely freezing LTL, September, October (twice) and December 2006. Seminar at LSV, ENS Cachan, France, Seminar at Warwick University, UK, Seminar at Oxford University, UK and 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Kolkata, India.
[26]
Ranko Lazic. Software model checking with game semantics, data abstraction refinement and learning component assumptions, August 2006. Games for Logic and Programming Languages II (GaLoP), Seattle, Washington, USA.
[27]
Marcin Jurdzinski. Algorithms for mean payoff and parity games, April and November 2005. Seminar at Oxford University, UK and LSE, London, UK.
[28]
Marcin Jurdzinski. Algorithms for solving stochastic games, September 2005. Invited tutorial at the Annual Meeting of EU RTN GAMES, Paris, France and at Conference on on the Quantitative Evaluation of Systems (QEST'05), Torino, Italy.
[29]
Ranko Lazic. Data-abstraction refinement: A game semantic approach, July, August and September (twice) 2005. Games in Design and Verification Workshop (GDV), Edinburgh, UK, Algebraic Process Calculi: The First Twenty Five Years and Beyond, Bertinoro, Italy, Seminar at LSV, ENS Cachan, France and GAMES Network Annual Meeting, Paris, France.
[30]
Ranko Lazic. Decidability of reachability for polymorphic systems with arrays: A complete classification, January 2005. Seminar at Oxford University, UK.
[31]
Ranko Lazic. On the freeze quantifier in constraint LTL: decidability and complexity, June 2005. 12th International Symposium on Temporal Representation and Reasoning (time), Burlington, Vermont, USA.