Titlebook: Computer Aided Verification; 15th International C Warren A. Hunt,Fabio Somenzi Conference proceedings 2003 Springer-Verlag Berlin Heidelber

Oration

我邪惡

Rabbit: A Tool for BDD-Based Verification of Real-Time Systemsmodular modeling. The tool provides reachability analysis and refinement checking, both implemented using the data structure BDD. Good variable orderings for the BDDs are computed from the modular structure of the model and an estimate of the BDD size. This leads to a significant performance improve

宇宙你

Making Predicate Abstraction Efficient:redundancy. A predicate is redundant if any of the following three holds (i) the predicate is equivalent to a propositional function of other predicates. (ii) removing the predicate preserves safety properties satisfied by the abstract model (iii) removing it preserves bisimulation equivalence. We a

Coeval

A Symbolic Approach to Predicate Abstractionbottlenecks of this approach is the extremely large number of decision procedures calls that are required to construct the abstract state space. In this paper we propose the use of a symbolic decision procedure and its application for predicate abstraction. The advantage of the approach is that it r

Somber

Unbounded, Fully Symbolic Model Checking of Timed Automata Using Boolean Methodstion logic to quantified Boolean logic. Our technique preserves the interpretation of clocks over the reals and can check any property in timed computation tree logic. The core operations of eliminating quantifiers over real variables and deciding the validity of separation logic formulas are respec

宣傳

Digitizing Interval Duration Logicnse time logic for specifying properties of real-time systems. Validity checking of IDL formulae is in general undecidable. A corresponding discrete-time logic QDDC has decidable validity..In this paper, we consider a reduction of IDL validity question to QDDC validity using notions of digitization.

mosque

Obscure

Hybrid Acceleration Using Real Vector Automatan. Our solution is based on accelerating the state-space exploration by computing symbolically the repeated effect of control cycles. The computed sets of configurations are represented by ., the expressive power of which is beyond that of the first-order additive theory of reals and integers. This

引起

BALE

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/233378.jpg