Data processing: software development – installation – and managem – Software program development tool – Testing or debugging
Reexamination Certificate
2011-04-12
2011-04-12
Deng, Anna (Department: 2191)
Data processing: software development, installation, and managem
Software program development tool
Testing or debugging
C717S141000
Reexamination Certificate
active
07926039
ABSTRACT:
An improved method for automatically improving the precision of an extrapolation operator used, for example, in software program verification in connection with the static analysis and model checking of the software programs which rely on fix-point computation. In particular, a new extrapolation-with-care-set operator, together with a method for gradually increasing the precision of this operation by tightening the care set.
REFERENCES:
patent: 7346486 (2008-03-01), Ivancic et al.
patent: 7363202 (2008-04-01), Campbell et al.
patent: 7421680 (2008-09-01), DeLine et al.
patent: 2001/0010091 (2001-07-01), Noy
patent: 2004/0205394 (2004-10-01), Plutowski
patent: 2005/0102723 (2005-05-01), Van Den Nieuwelaar et al.
patent: 2005/0229044 (2005-10-01), Ball
patent: 2005/0235257 (2005-10-01), Ball et al.
patent: 2006/0179383 (2006-08-01), Blass et al.
Boel et al. “On Forbidden State Problems for a Class of Controlled Petri Nets”, IEEE Transactions on Automatic Control, vol. 40, No. 10, Oct. 1995, pp. 1717-1731.
Alberto Bemporad, “Modeling, Control, and Reachability Analysis of Discrete-Time Hybrid Systems” DISC School—Apr. 2003, pp. 1-82.
Alexander E. Kostin, “Reachability Analysis in T-Invariant-Less Nets”, IEEE Transactions on Automatic Control, vol. 48, No. 6, Jun. 2003. pp. 1019-1064.
Narayan et al. “Reachability Analysis Using Partitioned-ROBDDs”, Fujitsu Laboratories of America, 1997 IEEE, pp. 388-393.
P.Cousot and R.Cousot, “Static Determination of Dynamic Properties of Programs” in International Symposium on Programming; pp. 106-126; 1976.
E.M. Clarke and E.A.Emerson; “Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic”; in Proceedings of Workshops on Logics of Programs; pp. 57-71; Springer, 1981.
J.P. Quielle and J.Sifakis, “Specifications and Verification of Concurrent systems in CESAR”, in Symposium on Programming, 1981.
P.Cousot and N. Halbawachs; “Automatic Discovery of Linear Restraints Among Variables of a Program”; in Symposium on Principles of Programming Languages; pp. 84-96; 1978.
N. Halbwachas, Y.E.Proy, and P.roumanoff, “Verification of Real Time Systems Using Linear Relation Analysis”, Formal Methods in Systems Design, 11(2); 157-185, 1977.
N.Halbwachs, “Delay Analysis in Synchronous Programs”, in Computer Aided Verification, pp. 333-346, Springer, 1993, LNCS 697.
T.R.Gerber and W.Pugh, “Symbolic Model Checking of Infinite State Systems using Pressberger Arithmetic”, in Computer Aided Verification, pp. 400-411, Springer, 1997, LNCS 1254.
R.Bagnara, P.M. Hill and E.Zaffanella, “Widening Operators for Powerset Domains”, in Verification, Model Checking and Abstract Interpretation, pp. 135-148, Springer, 2004, LNCS 2937.
T.Bultan, R.Gerber, and C.League, “Verifying Systems with Integer Constraints and Boolean Predicates: A Composite Approach”, in International Symposium on Software Testing and Analysis, pp. 113-123, 1998.
T.A. Henzinger and P.H.Ho, “A Note on Abstract Interpretation Strategies for Hybrid Automata”, in Hybrid Systems II, pp. 252-264, Springer 1995, LNCS 999.
F.Bourdoncle, “Abstract Interpretation by Dynamic Partitioning”, J.Funct.Program., 2(4); 407-423; 1992.
B.Jeannet, N.Halbwachs and P.Raymond, “Dynamic Partitioning in Analysis of Numerical Properties”, in International Symposium on Static Analysis, pp. 39-50; Springer 2005.
R.Bagnara, P.M.Hill, E.Ricci and E.Zaffanella, “Precise Widening Operators for Convex Polyhedra”, in International Symposium on Static Analysis, pp. 337-354, Springer 2004.
E.Clarke, O.Grumberg, S.Jha, Y.Lu and H.Veith, “Counterexample-guided Abstraction Refinement”, in Computer Aided Verification, pp. 154-169, Springer, 2000, LNCS 1855.
S.Graf and H.Saidi, “Construction of Abstract State Graphs with PVS”, in Computer Aided Verification, pp. 72-83, Springer 1997, LNCS 1254.
T.A.Henzinger, R.Jhala, R.Majumdar and G.Sutre, “Lazy Abstraction” in Principles of Programming Languages, pp. 58-70, 2002.
F.Ivanicic, I.Shlyakhter, A.Gupta, M.K.Ganai, Z.Yang and P.Ashar, “F=SOFT Software Verification Platform” in Computer Aided Verification, pp. 301-306, Springer, 2005, LNCS 3576.
R.Giacobazzi, F.Ranzato, and F.Scozzari, “Making Abstract Interpretations Complete”, J.ACM, 47(2):361-416, 2000.
B.S.Gulavani and S.K.Rajamani, “Counterexample Driven Refinement for Abstract Interpretation”, in Tools and Algorithms for the Construction and Analysis of Systems, pp. 474-488, Springer 2006, LNCS 3920.
Gupta Aarti
Wang Chao
Yang Zijiang
Brosemer Jeffrey J.
Deng Anna
Kolodka Joseph
NEC Laboratories America, Inc.
LandOfFree
Reachability analysis for program verification does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Reachability analysis for program verification, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reachability analysis for program verification will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2713631