Program repair suggestions from graphical state-transition specifications

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

Volumn 5048 LNCS, Issue , 2008, Pages 185-200

  Wang, Farn ^a   Cheng, Chih Hong ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Bisimulation; Cost; Equivalence; Evaluation; Graph theory; Repair; State graph; State transition relation

Indexed keywords

ALGORITHMS; EVOLUTIONARY ALGORITHMS; GRAPH THEORY; HEURISTIC ALGORITHMS; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; MAINTENANCE; MATHEMATICAL MODELS; SOFTWARE ENGINEERING; SPECIFICATIONS; TECHNOLOGY; COSTS;

(SEMI)AUTOMATA; BISIMULATION; DISTRIBUTED SYSTEMS; FORMAL TECHNIQUES; GRAPHICAL FORMALISMS; HEIDELBERG (CO); INTERNATIONAL CONFERENCES; PROGRAM MODELS; REPAIR ALGORITHMS; SPRINGER (CO); STATE GRAPHS; STATE TRANSITIONS;

REPAIR;

BISIMULATIONS; EQUIVALENCE; EVALUATION; STATE GRAPHS; STATE TRANSITIONS;

EID: 45749112590     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68855-6_12     Document Type: Conference Paper

References (17)

1. Ball, T., Rajamani, S.K.: Automatically Validating Temporal Safety Properties of Interfaces. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol. 2057, pp. 103-122. Springer, Heidelberg (2001)
2. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers 35(8), 677-691 (1986)
3. Buccafurri, F., Eiter, T., Gottlob, G., Leone, N.: Enhancing Model Checking in Verification by AI Techniques. Artificial Intelligence 112(1), 55-93 (1999)
4. Bunke, H.: On a Relation between Graph Edit Distance and Maximum Common Subgraph. Pattern Recognition Letters 19, 255-259 (1997)
5. Clarke, E., Emerson, E.A.: Design and Synthesis of Synchronization Skeletons using Branching-Time Temporal Logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131. Springer, Heidelberg (1982)
6. Ding, Y., Zhang, Y.: A Logic Approach for LTL System Modification. In: Hacid, M.-S., Murray, N.V., Raś, Z.W., Tsumoto, S. (eds.) ISMIS 2005. LNCS (LNAI), vol. 3488, pp. 435-444. Springer, Heidelberg (2005)
7. Ding, Y., Zhang, Y.: Algorithms for CTL System Modification. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds.) KES 2005. LNCS (LNAI), vol. 3682. Springer, Heidelberg (2005)
8. Fisler, K., Vardi, M.Y.: Bisimulation Minimization in an Automata-Theoretic Verification Framework. In: Gopalakrishnan, G.C., Windley, P. (eds.) FMCAD 1998. LNCS, vol. 1522. Springer, Heidelberg (1998)
9. Griesmayer, A., Bloem, R., Cook, B.: Repair of Boolean Programs with an Application to C. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144. Springer, Heidelberg (2006)
10. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
11. http://javaddlib.sourceforge.net/jdd/
12. Jobstmann, B., Griesmayer, A., Bloem, R.: Program Repair as a Game. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576. Springer, Heidelberg (2005)
13. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
14. Myers, G.J., Sandler, C., Badgett, T., Thomas, T.M.: The Art of Software Testing. Wiley, Chichester (2004)
15. Paige, R., Tarjan, R.E.: Three Partition Refinement Algorithms. SIAM J. 6, 973-989 (1987)
16. http://www.ifi.unizh.ch/ddis/research/semweb/simpack/
17. Tsay, Y.-K., Chen, Y.-F., Tsai, M.-H., Wu, K.-N., Chan, W.-C.: GOAL: A Graphical Tool for Manipulating Buchi Automata and Temporal Formulae. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424. Springer, Heidelberg (2007)