Konstantine Arkoudas, Martin Rinard  Home/Search
Context
Related
| mit.edu/~rinard/paper/rv04.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/~rinard/paper/ (more) Homepages: M.Rinard |
Rate this article:      (best)Comment on this article |
Abstract: This paper introduces a notion of certified computation whereby an algorithm not only produces a result r for a given input x, but also proves that r is a correct result for x. This can greatly enhance the credibility of the result: if we trust the axioms and inference rules that are used in the proof, then we can be assured that r is correct. Typically, the reasoning used in a certified computation is much simpler than the computation itself. We present and analyze two examples of certifying... (Update)
Active bibliography (related documents): More All
0.6: Certified Computation - Arkoudas (2001) (Correct)
0.5: Behavior Capture and Test for Verifying Evolving.. - Leonardo Mariani.. (Correct)
0.3: A Theory About First-Order Terms in ACL2 - Hidalgo (2002) (Correct)
Similar documents based on text: More All
0.2: Integrating Model Checking and Theorem - Proving For Relational (Correct)
0.1: Simplifying Transformations for Type-alpha Certificates - Arkoudas (2001) (Correct)
0.1: Boolean Algebra of Shape Analysis Constraints - Kuncak, Rinard (2004) (Correct)
BibTeX entry: (Update)
@misc{ arkoudas-deductive,
author = "Konstantine Arkoudas and Martin Rinard",
title = "Deductive Runtime Certification",
url = "citeseer.ist.psu.edu/arkoudas04deductive.html" }
Citations (may not include all citations):1274 Object-Oriented Software Construction (context) - Meyer - 1997
951 Computational Complexity (context) - Papadimitriou - 1994
718 Distributed Algorithms (context) - Lynch - 1996
434 A framework for defining logics - Harper, Honsell et al. - 1993
353 Term Rewriting and All That (context) - Baader, Nipkow - 1998
266 Information and Computation (context) - Coquand, Huet et al. - 1988
264 Safe kernel extensions without run-time checking - Necula, Lee - 1996
237 Software testing techniques (context) - Beizer - 1990
233 The formulae-as-types notion of construction (context) - Howard - 1980
192 Designing programs that check their work - Blum, Kannan - 1995
182 Logic for Problem Solving (context) - Kowalski - 1979
170 ACM Transactions on Programming Languages and Systems (context) - Martelli, Montanari et al. - 1982
150 Edinburgh LCF: A Mechanized Logic of Computation (context) - Gordon, Miller et al. - 1979
137 The design and implementation of a certifying compiler - Necula, Lee - 1998
61 Monitoring Java programs with Java PathExplorer - Havelund, Rosu - 2001
55 Software reliability via run-time result-checking - Wasserman, Blum - 1997
37 Universal Algebra for Computer Scientists (context) - Wechler - 1992
31 Jass - Java with assertions - Bartetzko - 2001
31 a theorem proving environment for higher-order logic (context) - Gordon, Melham et al. - 1993
30 CMC: A pragmatic approach to model checking real code - Musuvathi - 2002
24 An overview of JML tools and applications - Burdy - 2003
21 Verifying the unification algorithm in LCF - Paulson - 1985
18 Java-MaC: a Run-time Assurance Tool for Java Programs - Kim - 2001
15 Credible compilation with pointers - Rinard, Marinov - 1999
12 Lecture Notes in Computer Science (context) - Pnueli, Siegel et al. - 1998
11 implementing bottom-up procedures with code trees - Voronkov, of - 1995
9 A case study in model checking software systems - Wing, Mandana - 1997
8 The use of machines to assist in rigorous proof (context) - Milner - 1985
4 Towards monitoring-oriented programming: A paradigm combinin.. - Chen, Rosu - 2003
3 Mechanical verification of a rule-based unification algorith.. (context) - Ruiz-Reina - 1999
3 Lecture Notes in Computer Science (context) - Paulson, Theorem - 1994
2 Denotational Proof Languages (context) - Arkoudas - 2000
2 Spying on Components: A Runtime Verification Technique - Barnett, Schulte - 2001
1 Certification of Compiler Optimizations using Kleene Algebra.. (context) - Patron, Kozen - 1999
1 Generating structrually complex tests from declarative const.. (context) - Khurshid - 2003
Documents on the same site (http://www.cag.lcs.mit.edu/~rinard/paper/): More
Hierarchical Concurrency in Jade - Scales, Rinard, Lam, Anderson (Correct)
Commutativity Analysis: A Technique for Automatically.. - Rinard, Diniz (1996) (Correct)
Commutativity Analysis: A New Analysis Framework for.. - Rinard, Diniz (1996) (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