Run-time verification of annotated software code

Data processing: software development – installation – and managem – Software program development tool – Testing or debugging

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

10346583

ABSTRACT:
Verification of a software program may be automated by receiving a program source file comprising program source code and at least one formal specification annotation, extracting the at least one formal specification annotation from the program source file, compiling the program source code and linking the compiled program and the at least one extracted formal specification annotation to create an executable program that includes at least one reference to an executable formal specification module. According to one aspect, a virtual machine includes a target virtual machine for executing one or more program implementation instructions, and a formal virtual machine for executing one or more formal specification modules corresponding to one or more program implementation instructions and configured to call a formal specification module, and to compare a first result obtained by executing the program implementation instructions with a second result obtained by the call to the formal specification module.

REFERENCES:
patent: 5490249 (1996-02-01), Miller
patent: 5652835 (1997-07-01), Miller
patent: 5659754 (1997-08-01), Grove et al.
patent: 5668999 (1997-09-01), Gosling
patent: 5740441 (1998-04-01), Yellin et al.
patent: 5748964 (1998-05-01), Gosling
patent: 5887161 (1999-03-01), Cheong et al.
patent: 5999731 (1999-12-01), Yellin et al.
patent: 5999732 (1999-12-01), Bak et al.
patent: 6038378 (2000-03-01), Kita et al.
patent: 6063132 (2000-05-01), DeCamp et al.
patent: 6092147 (2000-07-01), Levy et al.
patent: 6466947 (2002-10-01), Arnold et al.
patent: 6477702 (2002-11-01), Yellin et al.
patent: 6959432 (2005-10-01), Crocker
patent: 6996802 (2006-02-01), de Jong
patent: 2002/0093856 (2002-07-01), Baentsch et al.
patent: 0 605 872 (1993-12-01), None
patent: 0 751 458 (1996-05-01), None
patent: 0 821 305 (1997-07-01), None
patent: 00/00890 (2000-01-01), None
David Basin et al., “Java Bytecode Verification by Model Checking”, pp. 491-494.
Joachim Posegga et al., “Byte Code Verification for Java Smart Cards Based on Model Checking”, Sep. 16-18, pp. 175-190.
Dean, Jeffrey, “ProfileMe: Hardware Support for Instruction-Level Profiling on Out-of-Order Processors”, IEEE, 1997.
Zhao, Jianjun “Applying Program Dependence Analysis to Java Software” Fukuoka Kogyo Daigaku Kenkyu Ronshu, Research Bulletin of Fukuoka Institute of Technology, 1998, vol. 31, No. 1, pp. 29-41.
Tran, N. et al., “Common Runtime Support for Assertions”,Trusted Components Workshop Jan. 8-11, 2003, Prato, Italy, pp. 1-5, [Online] Jan. 9, 2003. (XP002283455).
Abramson, D. et al., “Guard: A Tool for Migrating Scientific Applications to the .NET Framework”,2002 International Conference on Computational Science(ICCS 2002), Amsterdam, The Netherlands, pp. 834-843, [Online] Apr. 21, 2002. (XP002283456).
Abramson, D. et al., “Implementation Techniques for a Parallel Relative Debugger”,International Conference on Parallel Architectures and Compilation Techniques(PACT '96), Boston, Massachusetts, USA, pp. 1-9, [Online] Oct. 20-23, 1996. (XP002283457).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Run-time verification of annotated software code does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Run-time verification of annotated software code, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Run-time verification of annotated software code will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3893652

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.