Sciweavers

20 search results - page 2 / 4
» State Set Management for SAT-based Unbounded Model Checking
Sort
View
FOSSACS
2005
Springer
14 years 3 months ago
Model Checking for Nominal Calculi
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto
ICALP
2003
Springer
14 years 3 months ago
Quantitative Analysis of Probabilistic Lossy Channel Systems
Many protocols are designed to operate correctly even in the case where the underlying communication medium is faulty. To capture the behaviour of such protocols, lossy channel sy...
Alexander Moshe Rabinovich
CAV
2005
Springer
129views Hardware» more  CAV 2005»
14 years 3 months ago
Symbolic Systems, Explicit Properties: On Hybrid Approaches for LTL Symbolic Model Checking
In this work we study hybrid approaches to LTL symbolic model checking; that is, approaches that use explicit representations of the property automaton, whose state space is often ...
Roberto Sebastiani, Stefano Tonetta, Moshe Y. Vard...
WWW
2004
ACM
14 years 10 months ago
Analysis of interacting BPEL web services
This paper presents a set of tools and techniques for analyzing interactions of composite web services which are specified in BPEL and communicate through asynchronous XML message...
Xiang Fu, Tevfik Bultan, Jianwen Su
ECBS
2010
IEEE
209views Hardware» more  ECBS 2010»
14 years 2 months ago
Continuous Verification of Large Embedded Software Using SMT-Based Bounded Model Checking
The complexity of software in embedded systems has increased significantly over the last years so that software verification now plays an important role in ensuring the overall pr...
Lucas Cordeiro, Bernd Fischer 0002, João Ma...