Sciweavers

40 search results - page 6 / 8
» PDL over Accelerated Labeled Transition Systems
Sort
View
APLAS
2007
ACM
15 years 9 months ago
Complete Lattices and Up-To Techniques
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
Damien Pous
IANDC
2010
83views more  IANDC 2010»
15 years 4 months ago
Static analysis of topology-dependent broadcast networks
Broadcast semantics poses significant challenges over point-to-point communication when it comes to formal modelling and analysis. Current approaches to analysing broadcast netwo...
Sebastian Nanz, Flemming Nielson, Hanne Riis Niels...
ESEC
1997
Springer
15 years 10 months ago
Verification of Liveness Properties Using Compositional Reachability Analysis
The software architecture of a distributed program can be represented by a hierarchical composition of subsystems, with interacting processes at the leaves of the hierarchy. Compo...
Shing-Chi Cheung, Dimitra Giannakopoulou, Jeff Kra...
CAV
2010
Springer
225views Hardware» more  CAV 2010»
15 years 9 months ago
Merit: An Interpolating Model-Checker
Abstract. We present the tool MERIT, a CEGAR model-checker for safety propf counter-systems, which sits in the Lazy Abstraction with Interpolants (LAWI) framework. LAWI is parametr...
Nicolas Caniart
FMCAD
2006
Springer
15 years 9 months ago
Post-reboot Equivalence and Compositional Verification of Hardware
We introduce a finer concept of a Hardware Machine, where the set of post-reboot operation states is explicitly a part of the FSM definition. We formalize an ad-hoc flow of combin...
Zurab Khasidashvili, Marcelo Skaba, Daher Kaiss, Z...