A simple solution to Lamport's concurrent programming problem with linear wait
ICS '88 Proceedings of the 2nd international conference on Supercomputing
Algebraic specification of communication protocols
Algebraic specification of communication protocols
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
IEEE Transactions on Software Engineering
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Automatic generation of invariants and intermediate assertions
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Ten Years of Hoare's Logic: A Survey—Part I
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
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
InVeST: A Tool for the Verification of Invariants
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Finding Invariant assertions for proving programs
Proceedings of the international conference on Reliable software
Proof-checking a data link protocol.
Proof-checking a data link protocol.
STeP: The Stanford Temporal Prover
STeP: The Stanford Temporal Prover
On Proving Safety Properties by Integrating Static Analysis, Theorem Proving and Abstraction
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
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
Theorem Proving for Verification
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Incremental Verification by Abstraction
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A Technique for Invariant Generation
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Combining Theorem Proving and Model Checking through Symbolic Analysis
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
An Overview of Formal Verification for the Time-Triggered Architecture
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Verification Using Test Generation Techniques
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Symbolic Analysis of Transition Systems
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
Theorem proving for verification
Modeling and verification of parallel processes
Using SMT solvers to verify high-integrity programs
Proceedings of the second workshop on Automated formal methods
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
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
Instantiation-based invariant discovery
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Formal verification of pentium ® 4 components with symbolic simulation and inductive invariants
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Generating Invariant-Based Certificates for Embedded Systems
ACM Transactions on Embedded Computing Systems (TECS)
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.00 |
When proving invariance properties of programs, one is faced with twoproblems. The first problem is related to the necessity of proving tautologiesof the considered assertion language, whereas the second manifestsitself in the need of finding sufficiently strong invariants. This paper focuseson the second problem and describes techniques for the automatic generation ofinvariants. The first set of these techniques is applicable to sequentialtransition systems and allows deriving so-called local invariants,i.e., predicates which are invariant at some control location. The second isapplicable on networks of transition systems and allows combining localinvariants of the sequential components to obtain local invariants of the global system.