See this document in CiteSeerX!

Program Verification By Calculating Relations  (Make Corrections)  
Jacques Carette, Ryszard Janicki and Yun Zhai + Department of Computing...



  Home/Search   Context   Related

 
View or download:
cas.mcmaster.ca/~c...atingRelations.pdf
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  cas.mcmaster.ca/~c...publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We show how properties of an interesting class of imperative programs can be verifed by means of relational modelling and symbolic computation. (Update)

Active bibliography (related documents):   More   All
0.5:   Foundations of the Trace Assertion Method of Module Interface.. - Janicki (1997)   (Correct)
0.1:   Solving Constraints Involving Indexed Variables - Nikolik, Hamlet (1997)   (Correct)
0.1:   Rethinking the Taxonomy of Fault Detection Techniques - Young, Taylor (1991)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ ryszard-program,
  author = "Jacques Carette Ryszard",
  title = "Program Verification By Calculating Relations",
  url = "citeseer.ist.psu.edu/761173.html" }
Citations (may not include all citations):
650   An Axiomatic Basis of Computer Programming (context) - Hoare - 1969
415   Efficiently computing static single assignment form and the .. - Cytron, Ferrante et al. - 1991
86   Cambridge University Press (context) - Wolfram, Book - 1999
84   A completeness theorem for Kleene algebras and the algebra o.. - Kozen - 1994
49   Symbolic Execution and program testing (context) - King - 1976
26   SELECT-A formal system for testing and debugging programs by.. (context) - Elspas, Boyer et al. - 1975
15   UNISEX: A UNixbased symbolic Executor for Pascal (context) - Kemmerer, Eckmann - 1985
14   Symbolic Testing and the DISSECT Symbolic Evaluation System (context) - Howden - 1977
12   Proving algorithms by tail function (context) - Mazurkiewicz - 1971
8   Maple Programming Guide (context) - Monagan, Geddes et al. - 1998
2   Analysis of Coroutines by Means of Vectors of Coroutines (context) - Janicki - 1979
1   Definable operations in general algebras and the theory of a.. (context) - Beki - 1969
1   An anlysis of programs by algebraic means (context) - Blikle - 1977
1   The Derivation of Algorithms (context) - Kaldewaij - 1990
1   Automated Generation of Loop Invariants by Recurrence Solvin.. (context) - acs, Jebelean
1   Program Verification Using Automatic Generation of Invariant.. (context) - guez-Carbonell, Kapur - 2005
1   Advanced Symbolic Analysis for Compilers (context) - Scholz, Fahringer - 2003
1   hidden for reviewing process (context) - or, Thesis
1   Symbolic Evaluation of Programs: A look at Loop Analysis (context) - Cheatham, Townley - 1976
http://maude.cs.uiuc.edu

Documents on the same site (http://www.cas.mcmaster.ca/~carette/publications.html):   More
Understanding Expression Simplification - Carette (2004)   (Correct)
Linear Algebra Using Maple's LargeExpressions Package - Carette, Zhou, Jeffrey.. (2006)   (Correct)
Trustable Communication between Mathematics Systems - Carette, Farmer, Wajs (2003)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC