Summary of dynamically discovering likely program invariants

No abstract is available for this paper.

• Publication year

  2001

• Venue

  Proceedings IEEE International Conference on Software Maintenance. ICSM 2001

• Publication date

  2001-11-07

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/ICSM.2001.972767
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Automatic Generation and Checking of Program Specifications

  2002cited by this paper
• Automated support for program refactoring using invariants

  2001cited by this paper
• Static verification of dynamically detected program invariants: Integrating Daikon and ESC/Java

  2001cited by this paper
• Bandera: extracting finite-state models from Java source code

  2000cited by this paper
• Quickly detecting relevant program invariants

  2000cited by this paper
• Version Space Algebra and its Application to Programming by Demonstration

  2000cited by this paper
• Java examples - in a nutshell: a tutorial companion to java in a nutshell: covers java 2 version 1.4 (3. ed)

  2000cited by this paper
• Unification-based pointer analysis with directional assignments

  2000cited by this paper
• Dynamically discovering likely program invariants

  2000cited by this paper
• A Decidable Logic for Describing Linked Data Structures

  1999cited by this paper
• Integrated Formal Verification: Using Model Checking with Automated Abstraction, Invariant Generation, and Theorem Proving

  1999cited by this paper
• SUIF Explorer: an interactive and interprocedural parallelizer

  1999cited by this paper
• The concept of dynamic analysis

  1999cited by this paper
• jContractor: A Reflective Java Library to Support Design by Contract

  1999cited by this paper
• Optimizing a Solver of Polymorphism Constraints: SEMI

  1999cited by this paper
• SoftSpec : software-based speculative parallelism via stride prediction

  1999cited by this paper
• Dependent types in practical programming

  1999cited by this paper
• Parametric shape analysis via 3-valued logic

  1999cited by this paper
• Intelligent Machinery and Mathematical Discovery

  1999cited by this paper
• A specification matching based approach to reverse engineering

  1999cited by this paper
• The Design of Program Analysis Services

  1999cited by this paper
• Research summary for dynamic detection of program invariants

  1999cited by this paper
• A deadlock detection tool for concurrent Java programs

  1999cited by this paper
• Dynamically discovering likely program invariants to support program evolution

  1999influential reference
• Automatic Program Transformation with JOIE

  1998cited by this paper
• Reasoning about Java classes

  1998cited by this paper
• Discovering models of software processes from event-based data

  1998cited by this paper
• Automatic generation of state invariants from requirements specifications

  1998cited by this paper
• The design and implementation of a certifying compiler

  1998cited by this paper
• An Extended Static Checker for Modular-3

  1998cited by this paper
• Java in a nutshell: A desktop quick reference

  1998cited by this paper
• An empirical analysis of instruction repetition

  1998cited by this paper
• Testing using log file analysis: tools, methods, and issues

  1998cited by this paper
• Extended static checking

  1998cited by this paper
• Eliminating array bound checking through dependent types

  1998cited by this paper
• Assessing the Effects of Flow-Sensitivity on Pointer Alias Analyses

  1998cited by this paper
• Empirical Studies of a Safe Regression Test Selection Technique

  1998cited by this paper
• Event-based detection of concurrency

  1998cited by this paper
• Promises: limited specifications for analysis and manipulation

  1998cited by this paper
• An empirical investigation of program spectra

  1998cited by this paper
• Inferring State Constraints for Domain-Independent Planning

  1998cited by this paper
• The Model Checker SPIN

  1997cited by this paper
• Automatic Generation of Invariants and Intermediate Assertions

  1997cited by this paper
• Verification of concurrent software with FLAVERS

  1997cited by this paper
• Evidence-based static branch prediction using machine learning

  1997cited by this paper
• Eraser: a dynamic data race detector for multi-threaded programs

  1997cited by this paper
• Lackwit: A Program Understanding Tool Based on Type Inference

  1997cited by this paper
• Software reliability via run-time result-checking

  1997cited by this paper
• Automatic Synthesis of Specifications from the Dynamic Observation of Reactive Programs

  1997cited by this paper
• Query-based debugging of object-oriented programs

  1997cited by this paper
• Java Virtual Machine

  1997cited by this paper
• An Industrial Strength Theorem Prover for a Logic Based on Common Lisp

  1997cited by this paper
• Software and Hardware for Exploiting Speculative Parallelism with a Multiprocessor

  1997cited by this paper
• Instrumentation and optimization of Win32/intel executables using Etch

  1997cited by this paper
• Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C

  1996cited by this paper
• Points-to analysis in almost linear time

  1996cited by this paper
• Automatically inferring properties of computer programs

  1996cited by this paper
• Program Analysis by Formal Transformation

  1996cited by this paper
• Powerful Techniques for the Automatic Generation of Invariants

  1996cited by this paper
• Static detection of dynamic memory errors

  1996cited by this paper
• Practical Program Understanding with Type Inference.

  1996cited by this paper
• Formal methods: state of the art and future directions

  1996cited by this paper
• ACL2 Theorems About Commercial Microprocessors

  1996cited by this paper
• A 1996 snapshot of computational learning theory

  1996cited by this paper
• Comparing Flow-Based Binding-Time Analyses

  1995cited by this paper
• Elimination of redundant array subscript range checks

  1995cited by this paper
• A Practical Approach to Programming With Assertions

  1995cited by this paper
• Strongest postcondition semantics as the formal basis for reverse engineering

  1995cited by this paper
• Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS

  1995cited by this paper
• Context-insensitive alias analysis reconsidered

  1995cited by this paper
• Efficient context-sensitive pointer analysis for c programs

  1995cited by this paper
• Temporal verification of reactive systems - safety

  1995cited by this paper
• Data flow analysis for verifying properties of concurrent programs

  1994cited by this paper
• Dynamic Memory Disambiguation Using the Memory Con ict Bu er

  1994cited by this paper
• LCLint: a tool for using specifications to check code

  1994cited by this paper
• Experiments on the effectiveness of dataflow- and control-flow-based test adequacy criteria

  1994cited by this paper
• Learning the Classic Description Logic: Theoretical and Experimental Results

  1994cited by this paper
• Speculative disambiguation: a compilation technique for dynamic memory disambiguation

  1994cited by this paper
• A study of pointer aliasing for software pipelining using run-time disambiguation

  1994cited by this paper
• Grammatically Biased Learning: Learning Logic Programs Using an Explicit Antecedent Description Language

  1994cited by this paper
• ATOM: a system for building customized program analysis tools

  1994cited by this paper
• Partial evaluation and automatic program generation

  1993cited by this paper
• Inferring constraints from multiple snapshots

  1993cited by this paper
• Larch: Languages and Tools for Formal Specification

  1993cited by this paper
• Watch what I do: programming by demonstration

  1993cited by this paper
• Deferred Compilation: The Automation of Run-Time Code Generation

  1993cited by this paper
• Knowledge Oriented Software Design, Extended Papers from the IFIP TC12 Workshop on Artificial Intelligence from the Information Processing Perspective - AIFIPP '92, Madrid, Spain, 14-15 September, 1992

  1993cited by this paper
• DUEL - A Very High-Level Debugging Language

  1993cited by this paper
• Abstractions for recursive pointer data structures: improving the analysis and transformation of imperative programs

  1992cited by this paper
• Dependent Types in Logic Programming

  1992cited by this paper
• Computational learning theory: survey and selected bibliography

  1992cited by this paper
• The Temporal Logic of Reactive and Concurrent Systems

  1991cited by this paper
• Theoretical Underpinnings of Version Spaces

  1991cited by this paper
• Analysis of pointers and structures

  1990cited by this paper
• The University of Washington illustrating compiler

  1990cited by this paper
• The Use of Self Checks and Voting in Software Error Detection: An Empirical Study

  1990cited by this paper
• Architectural support for register allocation in the presence of aliasing

  1990cited by this paper
• A fresh look at optimizing array bound checking

  1990cited by this paper
• Program derivation - the development of programs from specifications

  1990cited by this paper
• Does Imperfect Debugging Affect Software Reliability Growth?

  1989cited by this paper

• Data-driven lemma synthesis for interactive proofs

  2022cites this paper
• Automatic Loop Invariant Generation for Data Dependence Analysis

  2022cites this paper
• Test data generation using genetic programming

  2021cites this paper
• Campus Network and Systems Security Assessment Using Penetration Testing: The Case of the University of Education Winneba, Kumasi

  2021cites this paper
• Synthesizing contracts correct modulo a test generator

  2021cites this paper
• The Use of Likely Invariants as Feedback for Fuzzers

  2021influential citation
• CoFI: Consistency-Guided Fault Injection for Cloud Systems

  2020cites this paper
• Using likely invariants for test data generation

  2020cites this paper
• Program State Abstraction for Feedback-Driven Fuzz Testing using Likely Invariants

  2020cites this paper
• Putting the semantics into semantic versioning

  2020cites this paper
• Computing homomorphic program invariants

  2018influential citation
• Abstract State Machines, Alloy, B, TLA, VDM, and Z

  2018influential citation
• Parallel Property Checking with Symbolic Execution

  2018cites this paper
• Solver-Based Sketching of Alloy Models Using Test Valuations

  2018cites this paper
• Guiding RTL Test Generation Using Relevant Potential Invariants

  2018cites this paper
• Software Bug Localization Based on Key Range Invariants

  2018cites this paper
• Counterexample-guided approach to finding numerical invariants

  2017cites this paper
• Symlnfer: Inferring program invariants using symbolic states

  2017cites this paper
• Effective online software anomaly detection

  2017cites this paper
• Supporting oracle construction via static analysis

  2016cites this paper
• Towards Verified Artificial Intelligence

  2016cites this paper
• Frankencode: Creating Diverse Programs Using Code Clones

  2016cites this paper
• Static and dynamic analysis

  2016cites this paper
• Clustering and Dynamic Invariant Detection

  2015cites this paper
• Data provenance tracking for concurrent programs

  2015cites this paper
• Automated Test Oracles: A Survey

  2015cites this paper
• Discovering Algebraic Specifications for Java Classes ; CU-CS-985-04

  2015cites this paper
• Weakest preconditions and cumulative subgoal fulfillment

  2014cites this paper
• Search-based inference of polynomial metamorphic relations

  2014cites this paper
• DIG: A Dynamic Invariant Generator for Polynomial and Array Invariants

  2014cites this paper
• Generating profile-based signatures for online intrusion and failure detection

  2014cites this paper
• Synthesis of Infinite-State Abstractions and Their Use for Software Validation

  2014cites this paper
• Feedback-driven dynamic invariant discovery

  2014cites this paper
• Property differencing for incremental checking

  2014cites this paper
• Improving Test Suites via Generated Specifications by Michael Harder

  2014cites this paper
• Knowledge-based automatic generation of linear algebra algorithms and code

  2014cites this paper
• A Survey of Dynamic Program Analysis Techniques and Tools

  2014cites this paper
• Enhancing symbolic execution using memoization and incremental techniques

  2013influential citation
• System Support for Concurrent Software Reliability

  2013cites this paper
• Automated oracles: an empirical study on cost and effectiveness

  2013cites this paper
• From software failure to explanation

  2013cites this paper
• Contract Inferencing for Functional Programs

  2013cites this paper
• Dynamic Shape Analysis Using Spectral Graph Properties

  2012cites this paper
• Assertion-Directed Test Case Generation

  2012cites this paper
• The GISMOE challenge: constructing the pareto program surface using genetic programming to find better programs (keynote paper)

  2012cites this paper
• Automatic derivation of test cases for Java using an SMT solver and a PDG generator.

  2012influential citation
• Sciduction: Combining induction, deduction, and structure for verification and synthesis

  2012cites this paper
• Sketch of Implements for Mining Contracts Based on Framework of Software Quality Assurance

  2012cites this paper
• Weakest Preconditions and Cumulative Subgoal Fulfillment: A Comparison

  2012cites this paper
• Inference of Necessary Field Conditions with Abstract Interpretation

  2012cites this paper
• Using dynamic analysis to discover polynomial and array invariants

  2012cites this paper
• Program analyses for automatic and precise error detection

  2012cites this paper
• Using Sub-cases to Improve Log-based Oracles Inference

  2012cites this paper
• Automatic Error Detection Using Program Invariants for Fault Localization

  2012cites this paper
• Dynamic shape analysis of program heap using graph spectra: nier track

  2011cites this paper
• Hauberk: Lightweight Silent Data Corruption Error Detector for GPGPU

  2011cites this paper
• Probabilistic Instruction Cache Analysis Using Bayesian Networks

  2011cites this paper
• Research and optimization on dynamic performance analysis of code in embedded environment

  2011cites this paper
• Searching for invariants using genetic programming and mutation testing

  2011cites this paper
• Usable Verification of Object-Oriented Programs by Combining Static and Dynamic Techniques

  2011cites this paper
• Test Case Generation Based on Program Invariant and Adaptive Random Algorithm

  2011cites this paper
• Elimination of Redundant Invariants

  2011cites this paper
• Alattin: mining alternative patterns for defect detection

  2011cites this paper
• On the number and nature of faults found by random testing

  2011cites this paper
• Understanding failures through facts

  2011cites this paper
• Automatic Cross Validation of Multiple Specifications: A Case Study

  2010cites this paper
• OCAT: object capture-based automated testing

  2010cites this paper
• Deterministic and stochastic P systems for modelling cellular processes

  2010cites this paper
• Capture-based automated test input generation

  2010cites this paper
• Chapter 8 Automatic Inference and Effective Application of Temporal Specifications

  2010cites this paper
• Test Case Reduction Based on Program Invariant and Genetic Algorithm

  2010cites this paper
• Test Case Generation Based on Invariant Extraction

  2009influential citation
• Search Based Software Engineering: A Comprehensive Analysis and Review of Trends Techniques and Applications

  2009cites this paper
• Safe-commit analysis to facilitate team software development

  2009cites this paper
• Searching for Test Data

  2009cites this paper
• Universe Types - Topology, Encapsulation, Genericity, and Tools

  2009cites this paper
• Dynamical Detecting Technique of Nonfunctional Dependence Program Invariant

  2009cites this paper
• Research on Buffer Overflow Test Based on Invariant

  2009cites this paper
• Automatic Generation of Object Usage Specifications from Large Method Traces

  2009cites this paper
• Model Checking Merged Program Traces

  2009cites this paper
• Dynamically Discovering Functional Likely Program Invariants Based on Relational Database Theory

  2009cites this paper
• Inferring Dataflow Properties of User Defined Table Processors

  2009cites this paper
• Using formal specifications to support testing

  2009cites this paper
• Class invariants as abstract interpretation of trace semantics

  2009cites this paper
• Dynamically inferring, refining, and checking API usage protocols

  2009cites this paper
• Towards a Formal Model for Software Tamper Resistance

  2009cites this paper
• Detecting Functional Dependence Program Invariants Based on Data Mining

  2009cites this paper
• Synthesizing intensional behavior models by graph transformation

  2009cites this paper
• Wykrywanie, ocena skuteczności i optymalizacja asercji w programach

  2008cites this paper
• Dynamic inference of likely data preconditions over predicates by tree learning

  2008cites this paper
• Mining library specifications using inductive logic programming

  2008cites this paper
• Strengthening Inferred Specifications using Search Based Testing

  2008influential citation
• Contract-based tests in the software process and environment

  2008cites this paper
• Using formal methods to support testing

  2008cites this paper
• Assurance of dynamic adaptation in distributed systems

  2008cites this paper
• Analyzing and inferring the structure of code change

  2008cites this paper
• Deryaft

  2008cites this paper
• Challenges in Relational Learning for Real-Time Systems Applications

  2008influential citation
• Strategies for Random Contract-Based Testing

  2008influential citation
• Finding Faults: Manual Testing vs. Random+ Testing vs. User Reports

  2008cites this paper