David A. Schmidt  Home/Search
Context Related
| ksu.edu/~schmidt/p...sFestschrift.ps.gz 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: ksu.edu/~schmidt/papers/home (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: An abstraction is a property-preserving contraction of a program 's model into a smaller one that is suitable for automated analysis. (Update)
Cited by: More
A Logic for Information Flow Analysis with an Application to .. - Amtoft, Banerjee (2005) (Correct)
Similar documents (at the sentence level):
14.2%: Binary Relations for Abstraction and Refinement - Schmidt (2000) (Correct)
Active bibliography (related documents): More All
0.4: Automatically Proving the Correctness of Compiler.. - Lerner, Millstein.. (2003) (Correct)
0.3: Abstract Interpretation in the Operational Semantics Hierarchy - Schmidt (1997) (Correct)
0.3: Syntactic Model Reduction - Peng, Mokhtari, Tahar (2001) (Correct)
Similar documents based on text: More All
0.2: Should UML Be Used for Declarative Programming? - Schmidt (2001) (Correct)
0.2: Modal Transition Systems: A Foundation for Three-Valued.. - Huth, Jagadeesan.. (2000) (Correct)
0.1: From Trace Sets to Modal-Transition Systems by Stepwise Abstract.. - Schmidt (2001) (Correct)
Related documents from co-citation: More All
2: Information flow analysis in logical form - Amtoft, Banerjee - 2004
BibTeX entry: (Update)
David A. Schmidt. Structure-preserving binary relations for program abstraction. In The Essence of Computation: Complexity, Analysis, Transformation -- Essays dedicated to Neil D. Jones, number 2566 in Lecture Notes in Computer Science. Springer-Verlag, 2002. http://citeseer.ist.psu.edu/schmidt02structurepreserving.html More
@misc{ schmidt02structurepreserving,
author = "D. Schmidt",
title = "Structure-preserving binary relations for program abstraction",
text = "David A. Schmidt. Structure-preserving binary relations for program abstraction.
In The Essence of Computation: Complexity, Analysis, Transformation -- Essays
dedicated to Neil D. Jones, number 2566 in Lecture Notes in Computer Science.
Springer-Verlag, 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/schmidt02structurepreserving.html" }
Citations (may not include all citations):1933 Communication and Concurrency (context) - Milner - 1989
1399 Compilers: Principles (context) - Aho, Sethi et al. - 1986
828 Model Checking - Clarke, Grumberg et al. - 1999
312 Systematic design of program analysis frameworks (context) - Cousot, Cousot - 1979
229 Foundations for Programming Languages (context) - Mitchell - 1996
225 Flow Analysis of Computer Programs (context) - Hecht - 1977
204 Lecture Notes in Computer Science (context) - Milner, of et al. - 1980
193 Abstract interpretation: a uni ed lattice model for static a.. (context) - Cousot, Cousot - 1977
181 Principles of Program Analysis (context) - Nielson, Nielson et al. - 1999
155 ACM Transactions on Programming Languages and Systems (context) - Clarke, Grumberg et al. - 1994
152 Semantics of Programming Languages (context) - Gunter - 1992
142 Abstract interpretation frameworks (context) - Cousot, Cousot - 1992
97 and parametric polymorphism (context) - Reynolds, abstraction - 1983
54 Abstract interpretation: a semantics-based tool for program .. (context) - Jones, Nielson - 1995
51 Two-Level Functional Languages (context) - Nielson, Nielson - 1992
39 Abstract interpretation of reactive systems (context) - Dams, Gerth et al. - 1997
38 Counterexample-guided abstraction re nement (context) - Clarke, Grumberg et al. - 2000
38 Lecture Notes in Computer Science (context) - Park, automata et al. - 1981
36 Natural-semantics-based abstract interpretation (context) - Schmidt - 1995
31 Galois connections and computer science applications (context) - Melton, Strecker et al. - 1985
30 Two-level semantics and abstract interpretation (context) - Nielson - 1989
26 Property preserving abstractions for the veri cation of conc.. - Loiseaux, Graf et al. - 1995
22 Lecture Notes in Computer Science (context) - Cousot, Analysis et al. - 2001
16 Proving correctness of compiler optimizations by temporal lo.. - Lacey, Jones et al. - 2002
16 Data- ow analysis is model checking of abstract interpretati.. (context) - Schmidt - 1998
11 A relational framework for abstract interpretation (context) - Mycroft, Jones - 1985
10 Model checking: A tutorial introduction (context) - uller-Olm, Schmidt et al. - 1999
8 Veri cation tools for nite-state concurrent systems (context) - Clarke, Grumberg et al. - 1993
7 Higher-order abstract interpretation (context) - Cousot, Cousot - 1994
6 Lambda-de nability in the full type hierarchy (context) - Plotkin - 1980
6 Pair algebras and their application to automata theory (context) - Hartmanis, Streans - 1964
5 An inductive proof technique for interpreter equivalence (context) - McGowan - 1972
5 Property-oriented expansion (context) - Ste - 1996
4 Binary relations for abstraction and re nement (context) - Schmidt - 1999
3 Statecharts: a visual formalization for complex systems (context) - Harel - 1987
3 Data- ow analysis as model checking of abstract interpretati.. (context) - Schmidt, Ste - 1998
1 Systematic design of program transformations by abstract int.. (context) - Cousot, Cousot - 2002
1 Generating data- ow analysis algorithms for modal speci cati.. (context) - Ste - 1993
Documents on the same site (http://www.cis.ksu.edu/~schmidt/papers/home.html): More
Induction, Domains, Calculi: Strachey's Contributions to.. - Schmidt (1999) (Correct)
Binary Relations for Abstraction and Refinement - Schmidt (2000) (Correct)
Storeless Semantics and Separation Logic - Schmidt (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