Online minimization of transition systems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Algebraic specification of communication protocols
Algebraic specification of communication protocols
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Property preserving abstractions for the verification of concurrent systems
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Automatic Generation of Invariants
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Verification by augmented finitary abstraction
Information and Computation
A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Program Flow Analysis: Theory and Application
Program Flow Analysis: Theory and Application
Abstracting WS1S Systems to Verify Parameterized Networks
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Model-Checking for Extended Timed Temporal Logics
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Verifying Universal Properties of Parameterized Networks
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Optimality in Abstractions of Model Checking
SAS '95 Proceedings of the Second International Symposium on Static Analysis
Provably Correct Compiler Development and Implementation
CC '92 Proceedings of the 4th International Conference on Compiler Construction
Experiments in Theorem Proving and Model Checking for Protocol Verification
FME '96 Proceedings of the Third International Symposium of Formal Methods Europe on Industrial Benefit and Advances in Formal Methods
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Generating Finite-State Abstractions of Reactive Systems Using Decision Procedures
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Computing Abstractions of Infinite State Systems Compositionally and Automatically
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
InVeST: A Tool for the Verification of Invariants
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Syntactic Program Transformations for Automatic Abstraction
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
An Iterative Approach to Language Containment
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Proof-checking a data link protocol.
Proof-checking a data link protocol.
Abstraction in Software Model Checking: Principles and Practice (Tutorial Overview and Bibliography)
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Counter-Example Based Predicate Discovery in Predicate Abstraction
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Relative Completeness of Abstraction Refinement for Software Model Checking
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Shape Analysis through Predicate Abstraction and Model Checking
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Software Model Checking with Abstraction Refinement
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
A strategy for efficiently verifying requirements
Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
Efficient Verification of Sequential and Concurrent C Programs
Formal Methods in System Design
A theory of normed simulations
ACM Transactions on Computational Logic (TOCL)
Certifying cryptographic protocols by abstract model-checking and proof concretization
ACM SIGBED Review - Special issues on workshop on innovative techniques for certification of embedded systems
Formal Verification for C Program
Informatica
Decision Procedures for the Grand Challenge
Verified Software: Theories, Tools, Experiments
Formula-Dependent Abstraction for CTL Model Checking
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Finer Is Better: Abstraction Refinement for Rewriting Approximations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Compositional Verification for Component-Based Systems and Application
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
D-Finder: A Tool for Compositional Deadlock Detection and Verification
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Refinement of Trace Abstraction
SAS '09 Proceedings of the 16th International Symposium on Static Analysis
Bug hunting with false negatives
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
A counterexample-guided abstraction-refinement framework for markov decision processes
ACM Transactions on Computational Logic (TOCL)
Workflow soundness revisited: checking correctness in the presence of data while staying conceptual
CAiSE'10 Proceedings of the 22nd international conference on Advanced information systems engineering
Compositional CLP-based test data generation for imperative languages
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Accurate theorem proving for program verification
ISoLA'04 Proceedings of the First international conference on Leveraging Applications of Formal Methods
An incremental approach to abstraction-carrying code
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Abstraction refinement via inductive learning
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Abstraction refinement for termination
SAS'05 Proceedings of the 12th international conference on Static Analysis
Incremental formal verification of hardware
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
State/Event software verification for branching-time specifications
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
A practical and complete approach to predicate refinement
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Fixpoint-guided abstraction refinements
SAS'07 Proceedings of the 14th international conference on Static Analysis
| Hi-index | 0.00 |
We present a methodology for constructing abstractions and refining them by analyzing counter-examples. We also present a uniform verification method that combines abstraction, model-checking and deductive verification in a novel way. In particular, it allows and shows how to use the set of reachable states of the abstract system in a deductive proof even when the abstract model does not satisfy the specification and when it simulates the concrete system with respect to a weaker simulation notion than Milner's.