Titlebook: Dependable Software Engineering: Theories, Tools, and Applications; Second International Martin Fr?nzle,Deepak Kapur,Naijun Zhan Conference

Cabg318

Reducing State Explosion for Software Model Checking with Relaxed Memory Consistency Models,ying protocols of concurrent copying garbage collection algorithms. To the best of our knowledge, this is the first model checking of the concurrent copying protocols under relaxed memory consistency models.

Bernstein-test

Identifying XML Schema Constraints Using Temporal Logic,ed to parent and ancestor nodes, we made some modifications to Computational Tree Logic(CTL) with backward temporal operators, and developed model checking algorithms for automatically identifying XML Schema constraints. Compared with traditional methods, our method is more flexibility.

異常

遭遇

A Complete Approximation Theory for Weighted Transition Systems,entify a complete axiomatization for this logic, thus solving a long-standing open problem in this field. All our results are proven for a class of WTSs without the image-finiteness restriction, a fact that makes this development general and robust.

FECT

Zephyrus2: On the Fly Deployment Optimization Using SMT and CP Technologies,ve problems involving hundreds of components to be deployed on hundreds of virtual machines . This significant speed-up, combined with an improved specification format, enables Zephyrus2 to interactively support on the fly decision making.

IRATE

Formalization of Fault Trees in Higher-Order Logic: A Deep Embedding Approach, are in turn used to formalize other commonly used FT gates, i.e., NAND, NOR, XOR, Inhibit, Comparator and majority Voting, and the formal verification of their failure probability expressions. For illustration purposes, we present a formal failure analysis of a communication gateway software for the next generation air traffic management system.

parasite

否決

https://doi.org/10.1007/978-3-642-67592-8r-approximation of the WCET. The system may still be unschedulable under the approximation. A further schedulability checking is then performed by encoding to the reachability problem of .. The methodology is thus sound and complete.

Immobilize

出沒(méi)

Schedulability Analysis of Timed Regular Tasks by Under-Approximation on WCET,r-approximation of the WCET. The system may still be unschedulable under the approximation. A further schedulability checking is then performed by encoding to the reachability problem of .. The methodology is thus sound and complete.