@inproceedings{4377, author = {Hoenicke,Jochen and Leino, K Rustan and Podelski,Andreas and Schäf,Martin and Thomas Wies}, pages = {338 -- 353}, publisher = {Springer}, title = {{It's Doomed; We Can Prove It}}, doi = {1557}, year = {2009}, } @inproceedings{4383, abstract = {Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptions are often violated in realistic settings, as STM implementations run on relaxed memory models, with the atomicity of operations as provided by the hardware. This paper presents the first approach to verify STMs under relaxed memory models with atomicity of 32 bit loads and stores, and read-modify-write operations. We present RML, a new high-level language for expressing concurrent algorithms with a hardware-level atomicity of instructions, and whose semantics is parametrized by various relaxed memory models. We then present our tool, FOIL, which takes as input the RML description of an STM algorithm and the description of a memory model, and automatically determines the locations of fences, which if inserted, ensure the correctness of the STM algorithm under the given memory model. We use FOIL to verify DSTM, TL2, and McRT STM under the memory models of sequential consistency, total store order, partial store order, and relaxed memory order.}, author = {Guerraoui, Rachid and Thomas Henzinger and Vasu Singh}, pages = {321 -- 336}, publisher = {Springer}, title = {{Software transactional memory on relaxed memory models}}, doi = {10.1007/978-3-642-02658-4_26}, volume = {5643}, year = {2009}, } @inproceedings{4385, author = {Dragojevic,Aleksandar and Guerraoui, Rachid and Singh, Anmol V and Vasu Singh}, pages = {7 -- 16}, publisher = {ACM}, title = {{Preventing versus curing: avoiding conflicts in transactional memories}}, doi = {1533}, year = {2009}, } @inproceedings{4391, author = {Pavol Cerny and Alur, Rajeev}, pages = {173 -- 187}, publisher = {Springer}, title = {{Automated Analysis of Java Methods for Confidentiality}}, doi = {1548}, year = {2009}, } @inproceedings{4403, abstract = {For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. In this paper, we consider algorithmic verification of programs that use boolean variables, and in addition, access a single read-only array whose length is potentially unbounded, and whose elements range over a potentially unbounded data domain. We show that the reachability problem, while undecidable in general, is (1) Pspace-complete for programs in which the array-accessing for-loops are not nested, (2) decidable for a restricted class of programs with doubly-nested loops. The second result establishes connections to automata and logics defining languages over data words.}, author = {Alur, Rajeev and Cerny, Pavol and Weinstein, Scott}, location = {Coimbra, Portugal}, pages = {86 -- 101}, publisher = {Springer}, title = {{Algorithmic analysis of array-accessing programs}}, doi = {10.1007/978-3-642-04027-6_9}, volume = {5771}, year = {2009}, } @inproceedings{4453, abstract = {We present an on-the-fly abstraction technique for infinite-state continuous -time Markov chains. We consider Markov chains that are specified by a finite set of transition classes. Such models naturally represent biochemical reactions and therefore play an important role in the stochastic modeling of biological systems. We approximate the transient probability distributions at various time instances by solving a sequence of dynamically constructed abstract models, each depending on the previous one. Each abstract model is a finite Markov chain that represents the behavior of the original, infinite chain during a specific time interval. Our approach provides complete information about probability distributions, not just about individual parameters like the mean. The error of each abstraction can be computed, and the precision of the abstraction refined when desired. We implemented the algorithm and demonstrate its usefulness and efficiency on several case studies from systems biology.}, author = {Thomas Henzinger and Maria Mateescu and Wolf, Verena}, pages = {337 -- 352}, publisher = {Springer}, title = {{Sliding-window abstraction for infinite Markov chains}}, doi = {10.1007/978-3-642-02658-4_27}, volume = {5643}, year = {2009}, } @inproceedings{4535, abstract = {Molecular noise, which arises from the randomness of the discrete events in the cell, significantly influences fundamental biological processes. Discrete -state continuous-time stochastic models (CTMC) can be used to describe such effects, but the calculation of the probabilities of certain events is computationally expensive. We present a comparison of two analysis approaches for CTMC. On one hand, we estimate the probabilities of interest using repeated Gillespie simulation and determine the statistical accuracy that we obtain. On the other hand, we apply a numerical reachability analysis that approximates the probability distributions of the system at several time instances. We use examples of cellular processes to demonstrate the superiority of the reachability analysis if accurate results are required.}, author = {Didier, Frédéric and Thomas Henzinger and Maria Mateescu and Wolf, Verena}, pages = {173 -- 188}, publisher = {Springer}, title = {{Approximation of event probabilities in noisy cellular processes}}, doi = {10.1007/978-3-642-03845-7_12}, volume = {5688}, year = {2009}, } @inproceedings{4540, abstract = {Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit average, or discounted sum of the transition weights. We study expressiveness and closure questions about these quantitative languages. We first show that the set of words with value greater than a threshold can be non-w-regular for deterministic limit-average and discounted-sum automata, while this set is always w-regular when the threshold is isolated (i.e., some neighborhood around the threshold contains no word). In the latter case, we prove that the w-regular language is robust against small perturbations of the transition weights. We next consider automata with transition weights 0 or 1 and show that they are as expressive as general weighted automata in the limit-average case, but not in the discounted-sum case. Third, for quantitative languages L-1 and L-2, we consider the operations max(L-1, L-2), min(L-1, L-2), and 1-L-1, which generalize the boolean operations on languages, as well as the sum L-1 + L-2. We establish the closure properties of all classes of quantitative languages with respect to these four operations.}, author = {Chatterjee, Krishnendu and Doyen, Laurent and Henzinger, Thomas A}, pages = {199 -- 208}, publisher = {IEEE}, title = {{Expressiveness and closure properties for quantitative languages}}, doi = {10.1109/LICS.2009.16}, year = {2009}, } @inproceedings{4542, abstract = {Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real number L(w) computed as the maximal value of all runs over w, and the value of a run r is a function of the sequence of weights that appear along r. There are several natural functions to consider such as Sup, LimSup, LimInf, limit average, and discounted sum of transition weights. We introduce alternating weighted automata in which the transitions of the runs are chosen by two players in a turn-based fashion. Each word is assigned the maximal value of a run that the first player can enforce regardless of the choices made by the second player. We survey the results about closure properties, expressiveness, and decision problems for nondeterministic weighted automata, and we extend these results to alternating weighted automata. For quantitative languages L 1 and L 2, we consider the pointwise operations max(L 1,L 2), min(L 1,L 2), 1 − L 1, and the sum L 1 + L 2. We establish the closure properties of all classes of alternating weighted automata with respect to these four operations. We next compare the expressive power of the various classes of alternating and nondeterministic weighted automata over infinite words. In particular, for limit average and discounted sum, we show that alternation brings more expressive power than nondeterminism. Finally, we present decidability results and open questions for the quantitative extension of the classical decision problems in automata theory: emptiness, universality, language inclusion, and language equivalence.}, author = {Chatterjee, Krishnendu and Doyen, Laurent and Henzinger, Thomas A}, location = {Wroclaw, Poland}, pages = {3 -- 13}, publisher = {Springer}, title = {{Alternating weighted automata}}, doi = {10.1007/978-3-642-03409-1_2}, volume = {5699}, year = {2009}, } @inproceedings{4543, abstract = {The synthesis of a reactive system with respect to all omega-regular specification requires the solution of a graph game. Such games have been extended in two natural ways. First, a game graph can be equipped with probabilistic choices between alternative transitions, thus allowing the, modeling of uncertain behaviour. These are called stochastic games. Second, a liveness specification can he strengthened to require satisfaction within all unknown but bounded amount of time. These are called finitary objectives. We study. for the first time, the, combination of Stochastic games and finitary objectives. We characterize the requirements on optimal strategies and provide algorithms for Computing the maximal achievable probability of winning stochastic games with finitary parity or Street, objectives. Most notably the set of state's from which a player can win with probability . for a finitary parity objective can he computed in polynomial time even though no polynomial-time algorithm is known in the nonfinitary case.}, author = {Chatterjee, Krishnendu and Henzinger, Thomas A and Horn, Florian}, location = {High Tatras, Slovakia}, pages = {34 -- 54}, publisher = {Springer}, title = {{Stochastic games with finitary objectives}}, doi = {10.1007/978-3-642-03816-7_4}, volume = {5734}, year = {2009}, } @inproceedings{4544, abstract = {We consider concurrent games played on graphs. At every round of a game, each player simultaneously and independently selects a move; the moves jointly determine the transition to a successor state. Two basic objectives are the safety objective to stay forever in a given set of states, and its dual, the reachability objective to reach a given set of states. We present in this paper a strategy improvement algorithm for computing the value of a concurrent safety game, that is, the maximal probability with which player 1 can enforce the safety objective. The algorithm yields a sequence of player-1 strategies which ensure probabilities of winning that converge monotonically to the value of the safety game. Our result is significant because the strategy improvement algorithm provides, for the first time, a way to approximate the value of a concurrent safety game from below. Since a value iteration algorithm, or a strategy improvement algorithm for reachability games, can be used to approximate the same value from above, the combination of both algorithms yields a method for computing a converging sequence of upper and lower bounds for the values of concurrent reachability and safety games. Previous methods could approximate the values of these games only from one direction, and as no rates of convergence are known, they did not provide a practical way to solve these games.}, author = {Krishnendu Chatterjee and de Alfaro, Luca and Thomas Henzinger}, pages = {197 -- 206}, publisher = {SIAM}, title = {{Termination criteria for solving concurrent safety and reachability games}}, doi = {10.1137/1.9781611973068.23}, year = {2009}, } @inproceedings{4545, abstract = {A stochastic game is a two-player game played oil a graph, where in each state the successor is chosen either by One of the players, or according to a probability distribution. We Survey Stochastic games with limsup and liminf objectives. A real-valued re-ward is assigned to each state, and the value of all infinite path is the limsup (resp. liminf) of all rewards along the path. The value of a stochastic game is the maximal expected value of an infinite path that call he achieved by resolving the decisions of the first player. We present the complexity of computing values of Stochastic games and their subclasses, and the complexity, of optimal strategies in such games. }, author = {Chatterjee, Krishnendu and Doyen, Laurent and Henzinger, Thomas A}, location = {Rhodos, Greece}, pages = {1 -- 15}, publisher = {Springer}, title = {{A survey of stochastic games with limsup and liminf objectives}}, doi = {10.1007/978-3-642-02930-1_1}, volume = {5556}, year = {2009}, }