Gist is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with -regular objectives; and (b) synthesizes reasonable environment assumptions f...
Krishnendu Chatterjee, Thomas A. Henzinger, Barbar...
Systems ought to behave reasonably even in circumstances that are not anticipated in their specifications. We propose a definition of robustness for liveness specifications which p...
Roderick Bloem, Krishnendu Chatterjee, Karin Greim...
We present a graphical toolset for verifying AADL models, which are gaining widespread acceptance in aerospace, automobile and avionics industries for comprehensively specifying sa...
Marco Bozzano, Alessandro Cimatti, Joost-Pieter Ka...
Analysis of Symbolic Executions Aws Albarghouthi1 , Arie Gurfinkel2 , Ou Wei1,3 , and Marsha Chechik1 1 Department of Computer Science, University of Toronto, Canada 2 Software Eng...
Aws Albarghouthi, Arie Gurfinkel, Ou Wei, Marsha C...
We show a new and constructive proof of the following language-theoretic result: for every context-free language L, there is a bounded context-free language L L which has the same...
We describe a practical method for reasoning about realistic concurrent programs. Our method allows global two-state invariants that restrict update of shared state. We provide sim...
Ernie Cohen, Michal Moskal, Wolfram Schulte, Steph...
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
Krishnendu Chatterjee, Thomas A. Henzinger, Barbar...
We consider the class of finite-state programs executed by an unbounded number of replicated threads communicating via shared variables. The thread-state reachability problem for t...
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...