Filters








139 Hits in 2.7 sec

Resource Reachability Games on Pushdown Graphs [chapter]

Martin Lang
2014 Lecture Notes in Computer Science  
We consider two-player reachability games with additional resource counters on arenas that are induced by the configuration graphs of pushdown systems.  ...  For a play, we define the resource cost to be the highest occurring counter value. In this way, we quantify resources and memory that player 0 needs to win.  ...  This problem can be reduced to solving (normal) reachability games on pushdown graphs.  ... 
doi:10.1007/978-3-642-54830-7_13 fatcat:bguzwt34pneebeglogxo7fgzfq

Mean-Payoff Pushdown Games [article]

Krishnendu Chatterjee, Yaron Velner
2016 arXiv   pre-print
In this work we consider solving recursive game graphs (or pushdown game graphs) that can model the control flow of sequential programs with recursion.  ...  While pushdown games have been studied before with qualitative objectives, such as reachability and ω-regular objectives, in this work we study for the first time such games with the most well-studied  ...  We start with the description of finite-state game graphs, and then pushdown systems and its various equivalent models, followed by existing results and then our contribution. Games on graphs.  ... 
arXiv:1201.2829v3 fatcat:46sufj6durealjvbx3wvip5ngy

Saturation algorithms for model-checking pushdown systems

Arnaud Carayol, Matthew Hague
2014 Electronic Proceedings in Theoretical Computer Science  
We present a survey of the saturation method for model-checking pushdown systems.  ...  Pushdown reachability games One of the simplest winning conditions for a game is the reachability condition.  ...  The saturation technique also generalises to the analysis of two-players games played over the configuration graph of a pushdown systems.  ... 
doi:10.4204/eptcs.151.1 fatcat:546kymvwxnfgxikrpfr2ozl5ry

Mean-Payoff Pushdown Games

Krishnendu Chatterjee, Yaron Velner
2012 2012 27th Annual IEEE Symposium on Logic in Computer Science  
In this work we consider solving recursive game graphs (or pushdown game graphs) that can model the control flow of sequential programs with recursion.  ...  Two-player games on graphs are central in many problems in formal verification and program analysis such as synthesis and verification of open systems.  ...  Introduction Games on graphs. Two-player games played on finite-state graphs provide the mathematical framework to analyze several important problems in computer science as well as mathematics.  ... 
doi:10.1109/lics.2012.30 dblp:conf/lics/ChatterjeeV12 fatcat:np3mdikzubgn3jnqjtqfa7gip4

Infinite-state energy games

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke
2014 Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - CSL-LICS '14  
We consider generalized energy games played on infinite game graphs induced by pushdown automata (modelling recursion) or their subclass of one-counter automata.  ...  Energy games are a well-studied class of 2-player turn-based games on a finite graph where transitions are labeled with integer vectors which represent changes in a multidimensional resource (the energy  ...  Two-player reachability, Büchi and parity games on pushdown automata are EXPTIME-complete [18] , [5] , [21] , [22] .  ... 
doi:10.1145/2603088.2603100 dblp:conf/csl/AbdullaAHMKT14 fatcat:s77fktljqnb5xj7oepjihinzia

Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains [chapter]

Dejvuth Suwimonteerabuth, Stefan Schwoon, Javier Esparza
2006 Lecture Notes in Computer Science  
We show that the algorithm can be used to compute winning regions in pushdown games.  ...  Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems.  ...  Computing Attractors in Pushdown Games In [8] Cachat provided an algorithm for computing the winning positions of a player in a pushdown reachability game.  ... 
doi:10.1007/11901914_13 fatcat:2yepour47zedrea3y7czs43xv4

Infinite-State Energy Games [article]

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke
2014 arXiv   pre-print
We consider generalized energy games played on infinite game graphs induced by pushdown automata (modelling recursion) or their subclass of one-counter automata.  ...  Energy games are a well-studied class of 2-player turn-based games on a finite graph where transitions are labeled with integer vectors which represent changes in a multidimensional resource (the energy  ...  Two-player reachability, Büchi and parity games on pushdown automata are EXPTIME-complete [18] , [5] , [21] , [22] .  ... 
arXiv:1405.0628v1 fatcat:4txedyql35drbjkxdbbqgduodq

Automated techniques for higher-order program verification

Naoki KOBAYASHI, Luke ONG, David Van HORN
2013 Progress in Informatics  
Studies of game semantics have yielded compositional model checkers and automated program equivalence checkers for Algol-like programming languages, and studies of higher-order recursion schemes and pushdown  ...  The workshop also aimed for cross-fertilization of different techniques for higher-order program verification, such as game semantics, type theories, higher-order grammars and pushdown systems, control  ...  Such games provide models for programming languages with new resources such as fragments of ML.  ... 
doi:10.2201/niipi.2013.10.9 fatcat:xqfyvx6m25d4jcodwl373vlxlq

Games with Winning Conditions of High Borel Complexity [chapter]

Olivier Serre
2004 Lecture Notes in Computer Science  
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat et al.  ...  From this family, we deduce a family of decidable winning conditions of arbitrary finite Borel complexity for games played on finite graphs.  ...  , on a pushdown graph [24] ).  ... 
doi:10.1007/978-3-540-27836-8_95 fatcat:wslchiycxjdgjgmy2v2vcj6f54

Games with winning conditions of high Borel complexity

Olivier Serre
2006 Theoretical Computer Science  
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat et al.  ...  From this family, we deduce a family of decidable winning conditions of arbitrary finite Borel complexity for games played on finite graphs.  ...  , on a pushdown graph [24] ).  ... 
doi:10.1016/j.tcs.2005.10.024 fatcat:pdfyytpajjd2pgj6cnujy73fsm

Higher-Order Model Checking: An Overview

Luke Ong
2015 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science  
Acknowledgements: The author is grateful to Takeshi Tsukada for helpful comments on the paper.  ...  [13] have developed an algorithm C-SHORe that extends the saturation method on pushdown graphs to a backward reachability analysis of CPDA graphs.  ...  Consequently parity games on Caucal graphs [17] , [93] are a special case of this problem. The Caucal graphs have decidable MSO theories [17] .  ... 
doi:10.1109/lics.2015.9 dblp:conf/lics/Ong15 fatcat:55bfxqlkuzhbtgmzc32m46ooku

The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems

Matthew Hague, Anthony Widjaja To, Marc Herbstritt
2010 Foundations of Software Technology and Theoretical Computer Science  
We obtain tight bounds on data, expression, and combined-complexity for both (collapsible) higher-order pushdown systems and (collapsible) higher-order basic process algebra.  ...  Finally, we study (collapsible) higher-order basic process algebras as graph generators and show that they are almost as powerful as (collapsible) higher-order pushdown systems up to MSO interpretations  ...  Cachat and Walukiewicz [8] showed that a polynomial-size order-k pushdown game arena P with a reachability objective could be defined (depending only on m) with the following control states and properties  ... 
doi:10.4230/lipics.fsttcs.2010.228 dblp:conf/fsttcs/HagueT10 fatcat:iovhhrf5kneibenfgsagldi7ee

Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking [chapter]

Luke Ong
2013 Lecture Notes in Computer Science  
Collapsible pushdown automata are a generalisation of pushdown automata to higher-order stacks -which are iterations of stack of stacks -that contain symbols equipped with links.  ...  We study and compare the expressive power of the two models and the algorithmic properties of infinite structures such as trees and graphs generated by them.  ...  Acknowledgements Much of my work presented here is based on collaboration. I am grateful to all my collaborators for their help. Thanks are also due to EPSRC for financial support.  ... 
doi:10.1007/978-3-642-37064-9_3 fatcat:vmzogjyskfahbeklhyssyajvuy

C-SHORe

Christopher Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
2013 Proceedings of the 18th ACM SIGPLAN international conference on Functional programming - ICFP '13  
We introduce the first practical model-checking algorithm that acts on a generalisation of pushdown automata equi-expressive with HORS called collapsible pushdown systems (CPDS).  ...  In particular it is able to use information gathered from an approximate forward reachability analysis to guide its backward search.  ...  The saturation algorithm for CPDS that we introduced in [7], extending and improving [14] (and [5] ), follows a number of papers solving parity games on the configuration graphs of higher-order automata  ... 
doi:10.1145/2500365.2500589 dblp:conf/icfp/BroadbentCHS13 fatcat:dt2k4m7tungnhmvxfd2ydpkjma

Round-Bounded Control of Parameterized Systems [chapter]

Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder
2018 Lecture Notes in Computer Science  
In this paper, we extend this approach to a game-based setting.  ...  In that context, simple verification questions have a high complexity or, in the case of pushdown processes, are even undecidable.  ...  Pushdown processes: Games and model-checking. Inf. Comput., 164(2):234-263, 2001. 33. W. Zielonka. Infinite games on finitely coloured graphs with applications to au- tomata on infinite trees.  ... 
doi:10.1007/978-3-030-01090-4_22 fatcat:n3nod5br3valbjprijxtst5zpy
« Previous Showing results 1 — 15 out of 139 results