Verifying the correctness of real-time system models by traditional approaches that depend on the exploration of the entire system state space is impractical for large systems. In contrast, testing allows the search for violations of a property to be narrowed to a relatively small portion of the overall state space based on assumptions regarding the structure of an implementation. We present a hybrid approach that exploits formal methods to verify subcomponents of a system and testing to gain confidence in the correctness of the assembled system. The feasibility of the approach is demonstrated by application of the method to a process algebra model of the
|
2315
|
Graph-based algorithms for Boolean function manipulation
– Bryant
- 1986
|
|
2004
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
1393
|
A theory of timed automata
– Alur, Dill
- 1994
|
|
1345
|
The Temporal Logic of Reactive and Concurrent Systems
– Manna, Pnueli
- 1991
|
|
1128
|
Monads for functional programming
– Wadler
- 1992
|
|
1128
|
Symbolic Model Checking
– McMillan
- 1993
|
|
1069
|
A calculus of communicating systems
– Milner
- 1980
|
|
996
|
Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications
– Clarke, Emerson, et al.
- 1986
|
|
947
|
A Logic for Authentication
– Burrows, Abadi, et al.
- 1990
|
|
910
|
Temporal and modal logic
– Emerson
- 1990
|
|
723
|
Symbolic Boolean manipulation with ordered binary-decision diagrams
– Bryant
- 1992
|
|
640
|
Depth-First Search and Linear Graph Algorithms
– Tarjan
- 1972
|
|
556
|
An Introduction to Modal Logic
– Hughes, Cresswell
- 1968
|
|
549
|
Model Checking and Abstraction
– Clarke, Grumberg, et al.
|
|
461
|
The complexity of relational query languages
– Vardi
- 1982
|
|
460
|
P.: An automata-theoretic approach to automatic program verification
– Vardi, Wolper
- 1986
|
|
457
|
Symbolic model checking without BDDs
– Biere, Cimatti, et al.
- 1999
|
|
436
|
Systematic Design of Program Analysis Frameworks
– Cousot, Cousot
- 1979
|
|
383
|
Semantics of context-free languages
– Knuth
- 1968
|
|
373
|
Symbolic model checking: 10 states and beyond
– Burch, Clarke, et al.
- 1992
|
|
353
|
Three-Dimensional Computer Vision
– Faugeras
- 1993
|
|
351
|
Automata for modeling real-time systems
– Alur, Dill
- 1990
|
|
325
|
Model-checking for real-time systems
– Alur, Courcoubetis, et al.
- 1990
|
|
311
|
Software Testing Techniques
– Beizer
- 1990
|
|
294
|
Results on the propositional -calculus
– Kozen
- 1983
|
|
285
|
Propositional dynamic logic of regular programs
– Fischer, Ladner
- 1979
|
|
268
|
On the development of reactive systems
– Harel, Pnueli
- 1985
|
|
268
|
Relational queries computable in polynomial time
– Immerman
- 1986
|
|
254
|
The Jackknife, the Bootstrap, and Other Resampling Plans
– EFRON
- 1982
|
|
249
|
Proof methods for modal and intuitionistic logics
– Fitting
- 1983
|
|
233
|
A stubborn attack on state explosion
– Valmari
- 1991
|
|
232
|
On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication
– Bryant
- 1991
|
|
221
|
Sorting and Searching, volume 3 of The Art of Computer Programming
– Knuth
- 1998
|
|
211
|
Automated Analysis of Cryptographic Protocols Using Murphi
– Mitchell, Mitchell, et al.
- 1997
|
|
210
|
On the temporal analysis of fairness
– Gabbay, Pnueli, et al.
- 1980
|
|
207
|
Symbolic model checking for sequential circuit verification
– Burch, Clarke, et al.
- 1994
|
|
200
|
The NRL protocol analyzer: An overview
– Meadows
- 1996
|
|
199
|
Abstract interpretation of reactive systems
– Dams, Gerth, et al.
- 1997
|
|
195
|
Algebraic decision diagrams and their applications. Formal methods in system design
– Bahar, Frohm, et al.
- 1997
|
|
194
|
Geometric Invariance in Computer Vision
– Mundy, Zisserman
- 1992
|
|
189
|
Tense Logic and the Theory of Linear Order
– Kamp
- 1968
|
|
185
|
Modal and temporal logics
– Stirling
- 1992
|
|
181
|
Statistical Optimization for Geometric Computation: Theory and Practice
– Kanatani
- 1996
|
|
174
|
Symbolic model checking using SAT procedures instead of BDDs
– Biere, Cimatti, et al.
- 1999
|
|
168
|
Temporal logic can be more expressive
– Wolper
- 1983
|
|
167
|
Synthesis of synchronization skeletons for branching time temporal logic
– Clarke, Emerson
- 1981
|
|
157
|
PolyP - a polytypic programming language extension. Pages 470{482 of: POPL'97
– Jansson, Jeuring
- 1997
|
|
157
|
What good is temporal logic
– Lamport
- 1983
|
|
155
|
Kendall’s Advanced Theory of Statistics
– Kendall
- 1994
|
|
155
|
Considerations on floyd-hoare logic
– Pratt
- 1976
|
|
