Quantitative synthesis for concurrent programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6806 LNCS, Issue , 2011, Pages 243-259

  Černý, Pavol ^a   Chatterjee, Krishnendu ^a   Henzinger, Thomas A ^a   Radhakrishna, Arjun ^a   Singh, Rohit ^b  

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

2-PLAYER GRAPH GAMES; ALGORITHMIC METHODS; AVERAGE-CASE; CACHE ACCESS; CAPTURE SYSTEM; CONCURRENT PROGRAM; CONTEXT SWITCHING; DEADLOCK FREEDOM; FINITE-STATE; NON-DETERMINISM; PARAMETRIC PERFORMANCE; PERFORMANCE MODEL; PROGRAMMING PATTERNS; PROTOTYPE TOOLS; QUANTITATIVE OBJECTIVES; SHARED MEMORIES; SYNTHESIS PROBLEMS; WEIGHTED AUTOMATA;

ALGORITHMS; COMPUTER AIDED ANALYSIS; GAME THEORY; JAVA PROGRAMMING LANGUAGE; MEMORY ARCHITECTURE;

CACHE MEMORY;

EID: 79960350932     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22110-1_20     Document Type: Conference Paper

References (19)

1. Björklund, H., Sandberg, S., Vorobyov, S.: A discrete subexponential algorithm for parity games. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 663-674. Springer, Heidelberg (2003)
2. Bloem, R., Chatterjee, K., Henzinger, T.A., Jobstmann, B.: Better quality in synthesis through quantitative objectives. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 140-156. Springer, Heidelberg (2009)
3. Chatterjee, K., Henzinger, T.A., Jobstmann, B., Singh, R.: Measuring and synthesizing systems in probabilistic environments. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 380-395. Springer, Heidelberg (2010)
4. Chatterjee, K., Doyen, L., Gimbert, H., Henzinger, T.A.: Randomness for free. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 246-257. Springer, Heidelberg (2010)
5. Cherem, S., Chilimbi, T., Gulwani, S.: Inferring locks for atomic sections. In: PLDI, pp. 304-315 (2008)
6. Church, A.: Logic, arithmetic, and automata. In: Proceedings of the International Congress of Mathematicians (1962)
7. Clarke, E., Emerson, E.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Proc. Workshop on Logic of Programs, pp. 52-71 (1981)
8. Degorre, A., Doyen, L., Gentilini, R., Raskin, J.-F., Toruńczyk, S.: Energy and mean-payoff games with imperfect information. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol. 6247, pp. 260-274. Springer, Heidelberg (2010)
9. Filar, J., Vrieze, K.: Competitive Markov decision processes (1996)
10. Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Elsevier, Amsterdam (2008)
11. Holzmann, G.: The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley, Reading (2003)
12. Karp, R.: A characterization of the minimum cycle mean in a digraph. Discrete Mathematics 23, 309-311 (1978)
13. Larsen, K., Skou, A.: Bisimulation through probabilistic testing. In: POPL, pp. 344-352 (1989)
14. Papadimitriou, C.: Computational Complexity. Addison-Wesley Publishing, Reading (1994)
15. Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL, pp. 179- 190 (1989)
16. Solar-Lezama, A., Jones, C., Bodík, R.: Sketching concurrent data structures. In: PLDI, pp. 136-148 (2008)
17. Solar-Lezama, A., Rabbah, R., Bodík, R., Ebcioglu, K.: Programming by sketching for bit-streaming programs. In: PLDI, pp. 281-294 (2005)
18. Vardi, M.: Automatic verification of probabilistic concurrent finite-state programs. In: FOCS, pp. 327-338 (1985)
19. Vechev, M., Yahav, E., Yorsh, G.: Abstraction-guided synthesis of synchronization. In: POPL, pp. 327-338 (2010)