From boolean to quantitative synthesis

Embedded Systems Week 2011, ESWEEK 2011 - Proceedings of the 9th ACM International Conference on Embedded Software, EMSOFT'11

Volumn , Issue , 2011, Pages 149-154

  Erný, Pavol Č ^a   Henzinger, Thomas A ^a  

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

Author keywords

Quantitative models; Quantitative synthesis; Synthesis

Indexed keywords

COMPUTATIONAL POWER; CONSTRAINT SOLVING; DATA RACES; ERROR PRONES; INFORMATION FLOWS; PROGRAM CODE; PROGRAMMER PRODUCTIVITY; QUANTITATIVE MODELS; QUANTITATIVE OBJECTIVES; QUANTITATIVE SYNTHESIS; SHARED DATA; SOLUTION SPACE; SYNCHRONIZATION MECHANISMS;

EMBEDDED SYSTEMS; FAULT TOLERANCE; SPECIFICATIONS;

EMBEDDED SOFTWARE;

EID: 80455129104     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2038642.2038666     Document Type: Conference Paper

References (42)

1. A. Biermann. Automatic programming: A tutorial on formal methodologies. J. Symb. Comput., 1(2):119-142, 1985. (Pubitemid 16568032)
2. R. Bloem, K. Chatterjee, K. Greimel, T. Henzinger, B. Jobstmann, and R. Singh. Specification-centered robustness. In SIES, pages 176-185, 2011.
3. R. Bloem, K. Chatterjee, T. Henzinger, and B. Jobstmann. Better quality in synthesis through quantitative objectives. In CAV, 2009.
4. U. Boker, K. Chatterjee, T. Henzinger, and O. Kupferman. Temporal specifications with accumulative values. In LICS, 2011.
5. P. Černý, K. Chatterjee, and T. Henzinger. The complexity of quantitative information ow problems. In CSF, pages 205-218, 2011.
6. P. Černý, K. Chatterjee, T. Henzinger, A. Radhakrishna, and R. Singh. Quantitative synthesis for concurrent programs. In CAV, pages 243-259, 2011.
7. P. Černý, T. Henzinger, and A. Radhakrishna. Simulation distances. In CONCUR, pages 253-268, 2010.
8. A. Chakrabarti, L. de Alfaro, T. Henzinger, and M. Stoelinga. Resource interfaces. In EMSOFT, pages 117-133, 2003.
9. K. Chatterjee and L. Doyen. Energy parity games. In ICALP (2), pages 599-610, 2010.
10. K. Chatterjee, L. Doyen, and T. Henzinger. Quantitative languages. ACM Trans. Comput. Log., 11(4), 2010.
11. K. Chatterjee, T. Henzinger, B. Jobstmann, and R. Singh. Measuring and synthesizing systems in probabilistic environments. In CAV, pages 380-395, 2010.
12. K. Chatterjee, T. Henzinger, B. Jobstmann, and R. Singh. Quasy: Quantitative synthesis tool. In TACAS, pages 267-271, 2011.
13. K. Chatterjee, T. Henzinger, and M. Jurdzinski. Mean-payoff parity games. In LICS, pages 178-187, 2005. (Pubitemid 41462565)
14. K. Chatterjee, T. Henzinger, and V. Prabhu. Timed parity games: Complexity and robustness. In FORMATS, pages 124-140, 2008.
15. S. Cherem, T. Chilimbi, and S. Gulwani. Inferring locks for atomic sections. In PLDI, pages 304-315, 2008.
16. A. Church. Logic, arithmetic, and automata. In Proceedings of the International Congress of Mathematicians, 1962.
17. D. Clark, S. Hunt, and P. Malacaria. A static analysis for quantifying information ow in a simple imperative language. Journal of Computer Security, 15(3):321-371, 2007. (Pubitemid 46868450)
18. E. Clarke and E. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. Workshop on Logic of Programs, 1981.
19. L. de Alfaro, M. Faella, T. Henzinger, R. Majumdar, and M. Stoelinga. Model checking discounted temporal properties. Theor. Comput. Sci., 345(1):139-170, 2005. (Pubitemid 41562544)
20. L. de Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga. The element of surprise in timed games. In CONCUR, pages 142-156, 2003.
21. L. de Alfaro, V. Raman, M. Faella, and R. Majumdar. Code aware resource management. In EMSOFT, pages 191-202, 2005. (Pubitemid 41833017)
22. M. Emmi, J. Fischer, R. Jhala, and R. Majumdar. Lock allocation. In POPL, pages 291-296, 2007.
23. E. Filiot, N. Jin, and J.-F. Raskin. An antichain algorithm for LTL realizability. In CAV, pages 263-277, 2009.
24. E. Grädel, W. Thomas, and T. Wilke, editors. Automata, Logics, and Infinite Games: A Guide to Current Research, volume 2500 of Lecture Notes in Computer Science. Springer, 2002.
25. S. Gulwani. Automating string processing in spreadsheets using input-output examples. In POPL, pages 317-330, 2011.
26. B. Jobstmann, S. Galler, M. Weiglhofer, and R. Bloem. Anzu: A tool for property synthesis. In CAV, pages 258-262, 2007.
27. B. Jobstmann, A. Griesmayer, and R. Bloem. Program repair as a game. In CAV, pages 226-238, 2005. (Pubitemid 41431736)
28. V. Kuncak, M. Mayer, R. Piskac, and P. Suter. Complete functional synthesis. In PLDI, pages 316-329, 2010.
29. N. Lynch. Distributed Algorithms. Morgan Kaufmann, 1997.
30. O. Maler, A. Pnueli, and J. Sifakis. On the synthesis of discrete controllers for timed systems (an extended abstract). In STACS, pages 229-242, 1995.
31. Z. Manna and R. Waldinger. A deductive approach to program synthesis. ACM Trans. Program. Lang. Syst., 2(1):90-121, 1980.
32. H. Payer, H. Röck, C. Kirsch, and A. Sokolova. Scalability versus semantics of concurrent fifo queues. In PODC, pages 331-332, 2011.
33. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In POPL, 1989.
34. A. Puri. Theory of Hybrid Systems and Discrete Event Systems. PhD thesis, EECS Department, University of California, Berkeley, 1995.
35. D. Smith. KIDS: A semiautomatic program development system. IEEE Trans. Software Eng., 16(9):1024-1043, 1990.
36. A. Solar-Lezama, G. Arnold, L. Tancau, R. Bodík, V. Saraswat, and S. Seshia. Sketching stencils. In PLDI, pages 167-178, 2007. (Pubitemid 47630685)
37. A. Solar-Lezama, C. Jones, and R. Bodík Sketching concurrent data structures. In PLDI, 2008.
38. A. Solar-Lezama, R. Rabbah, R. Bodík, and K. Ebcioglu. Programming by sketching for bit-streaming programs. In PLDI, 2005.
39. M. Vechev, E. Yahav, and G. Yorsh. Abstraction-guided synthesis of synchronization. In POPL, 2010.
40. R. Wilhelm, S. Altmeyer, C. Burguière, D. Grund, J. Herter, J. Reineke, B. Wachter, and S. Wilhelm. Static timing analysis for hard real-time systems. In VMCAI, 2010.
41. H. Yasuoka and T. Terauchi. Quantitative information ow - verification hardness and possibilities. In CSF, pages 15-27, 2010.
42. U. Zwick and M. Paterson. The complexity of mean payoff games on graphs. Theor. Comput. Sci., 158(1&2):343-359, 1996. (Pubitemid 126411935)