24th International Workshop on Verification of Infinite-State Systems

  • INFINITY 2026 is a 1-day satellite workshop of ICALP 2026
  • Royal Holloway, University of London (Egham, UK)
  • Monday, July 6, 2026

The aim of the INFINITY workshop is to provide a forum for researchers interested in the development of mathematical techniques for the analysis and verification of systems with infinitely many states. The focus of this year’s edition of INFINITY is on fine-grained questions in automata theory and verification.

Typical examples of infinite-state systems include models such as Vector Addition Systems (VAS), Petri nets, and automata with data structures, which correspond to key classes of systems studied in the ICALP Track B community. At the same time, in the ICALP Track A community a theory of fine-grained complexity has developed, aiming to obtain precise lower bounds on the running time, usually conditional on well-established hypotheses.

The goal of this workshop is to bring together researchers from both communities to exchange recent developments, identify common challenges, and foster new collaborations.

Invited speakers

TBA

Register

Registration is required for attendance and is handled via the main ICALP registration system (to open soon).

Local info

The workshop will take place in person at Royal Holloway, University of London, UK, as a satellite workshop of ICALP 2026. Royal Holloway is located in Egham, Surrey, which is approximately 20 miles (40 minutes by rail) from central London.

The campus is a 15-20 minute walk from Egham station, which has regular train services from London Waterloo and Reading. For guidance on travel and accommodation, as well as local information and suggested hotels, we recommend checking the main ICALP website.

Acknowledgements

We are grateful to the Engineering and Physical Sciences Research Council (EPSRC, UK) for support. [EP/X03027X/1]

Organisation

INFINITY 2026 is organised by:

For questions about the workshop, please contact the organisers by email.

       @@@@@@@@::                          @@@@@@@:::       
    @@@@@@@@@@@@@@:..-                @@@@@@@@@@@@@@@:::    
  @@@@@@@@@@@@@@%%%##              @@@@@@@@@@@@@@@@@@@#::+  
 @@@@+::::  ::.%#***+=-         @@@@@@@@@@*:::::  @@@@@@::: 
 @@@::::          =-:.       @@@@@@@@=:::::         @@@@::: 
@@@::::                   @@@@@@@-::::::             @@@@:::
@@@::::                @@@@@@@:::::::                @@@@:::
@@@::::             @@@@@@::::::::                   @@@@:::
 @@@::::         @@@@@:::::::::           +         @@@@::: 
 @@@::::::. @@@@@:::::::::::       .:        %%@ :@@@@#:::: 
  @@@+:::::::::::::::::::          =+**  ..::::::::::::::=  
    @@@::::::::::::::+                @%@@::::::::::::::    
       @@@:::::::                          @@::::::::
\( 0 / \infty \)