Revising UNITY programs: Possibilities and limitations

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

Volumn 3974 LNCS, Issue , 2006, Pages 275-290

  Ebnenasir, Ali ^a   Kulkarni, Sandeep S ^a   Bonakdarpour, Borzoo ^a  

^a Michigan State University   (United States)

Author keywords

Formal methods, program synthesis; UNITY

Indexed keywords

INVARIANT PROPERTIES; NP COMPLETE; POLYNOMIAL TIME COMPLEXITY; PROGRAM STATE; PROGRAM SYNTHESIS; UNITY;

ARTIFICIAL INTELLIGENCE;

POLYNOMIAL APPROXIMATION;

EID: 84870849292     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11795490_22     Document Type: Conference Paper

References (23)

1. K. M. Chandy and J. Misra. Parallel Program Design: A Foundation. AddisonWesley, 1988.
2. B. Alpern and F. B. Schneider. Defining liveness. Information Processing Letters, 21:181-185, 1985.
3. Ali Ebnenasir and Sandeep Kulkarni. Automatic addition of liveness. Technical Report MSU-CSE-04-22, Department of Computer Science, Michigan State University, East Lansing, Michigan, June 2004.
4. E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1990.
5. E.A. Emerson and E.M. Clarke. Using branching time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2(3):241-266, 1982. (Pubitemid 14566074)
6. Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6(1):68-93, 1984.
7. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proceedings of the 16th ACM Symposium on Principles of Programming Languages, pages 179-190, 1989.
8. A. Pnueli and R. Rosner. On the synthesis of an asynchronous reactive module. In Proceeding of 16th International Colloqium on Automata, Languages, and Programming, Lee. Notes in Computer Science 372, Springer-Verlag:652-671, 1989.
9. A. Arora, P. C. Attie, and E. A. Emerson. Synthesis of fault-tolerant concurrent programs. ACM Transactions on Programming Languages and Systems (TOPLAS), 26(1):125-185, 2004. (A preliminary version of this paper appeared in Proceedings of the 17th ACM Symposium on Principles of Distributed Computing, 1998.).
10. P. Attie. Synthesis of large concurrent programs via pairwise composition. CONCUR '99: 10th International Conference on Concurrency Theory, Lecture Notes In Computer Science, 1664:130-145, 1999.
11. P. Attie and A. Emerson. Synthesis of concurrent programs for an atomic read/write model of computation. ACM TOPLAS, 23(2):187-242, March 2001. (A preliminary version of this paper appeared in PODC96.).
12. S. S. Kulkarni and A. Arora. Automating the addition of fault-tolerance. Proceedings of the 6th International Symposium of Formal Techniques in Real-Time and Fault-Tolerant Systems, pages 82-93, 2000.
13. S. S. Kulkarni, A. Arora, and A. Chippada. Polynomial time synthesis of Byzantine agreement. Symposium on Reliable Distributed Systems, pages 130-139, 2001.
14. S. S. Kulkarni and A. Ebnenasir. The complexity of adding failsafe fault-tolerance. Proceedings of the 22nd International Conference on Distributed Computing Systems, pages 337-344, 2002.
15. S. S. Kulkarni and A. Ebnenasir. Enhancing the fault-tolerance of nonmasking programs. Proceedings of the 23rd International Conference on Distributed Computing Systems, pages 441-449, 2003.
16. S. S. Kulkarni and A. Ebnenasir. Automated synthesis of multitolerance. In Proceedings of the International Conference on Dependable Systems and Networks, Palazzo dei Congressi, Florence, Italy, pages 209 - 218, June 28 - July 1 2004.
17. K. Havelund and G. Rosu. Runtime verification. Formal Methods in System Design. Special issue dedicated to RV'01, 24(2), 2004.
18. F. Chen, M. D'Amorim, and G. Rosu. A formal monitoring-based framework for software development and analysis. Sixth International Conference on Formal Engineering Methods (ICFEM), pages 357-372, November 2004.
19. Bernd Fisher, Johann Schumann, and Mike Whalen. Synthesizing certified code. Proceedings of the International Symposium of Formal Methods Europe (FME'02), Lecture Notes In Computer Science, 2391:431-450, 2002.
20. Ewen Denney, Bernd Fischer, and Johann Schumann. Adding assurance to automatically generated code. In Proceedings the 8th IEEE International Symposium on High Assurance Systems Engineering (HASE 2004), pages 297-299, March 2004.
21. Klaus Havelund and Grigore Rosu. Synthesizing monitors for safety properties. In Tools and Algorithms for Construction and Analysis of Systems (TACAS'02), volume 2280 of Lecture Notes in Computer Science, pages 342-356, October 2002.
22. K. Sen, G. Rosu, and G. Agha. Runtime safety analysis of multithreaded programs. In ACM SIGSOFT Conference on the Foundations of Software Engineering /European Software Engineering Conference, Helsinki, Finland, pages 337-346, 2003.
23. E.A. Emerson. Handbook of Theoretical Computer Science: Chapter 16, Temporal and Modal Logic. Elsevier Science Publishers B. V., 1990.