Sciweavers

493 search results - page 40 / 99
» Bounded LTL Model Checking with Stable Models
Sort
View
ATVA
2008
Springer
131views Hardware» more  ATVA 2008»
13 years 9 months ago
Computation Tree Regular Logic for Genetic Regulatory Networks
Model checking has proven to be a useful analysis technique not only for concurrent systems, but also for the genetic regulatory networks (Grns) that govern the functioning of livi...
Radu Mateescu, Pedro T. Monteiro, Estelle Dumas, H...
IFM
2010
Springer
147views Formal Methods» more  IFM 2010»
13 years 5 months ago
Symbolic Model-Checking of Optimistic Replication Algorithms
Abstract. The Operational Transformation (OT) approach, used in many collaborative editors, allows a group of users to concurrently update replicas of a shared object and exchange ...
Hanifa Boucheneb, Abdessamad Imine, Manal Najem
SAFECOMP
2010
Springer
13 years 6 months ago
Reliability Analysis of Safety-Related Communication Architectures
Abstract. In this paper we describe a novel concept for reliability analysis of communication architectures in safety-critical systems. This concept has been motivated by applicati...
Oliver Schulz, Jan Peleska
NFM
2011
242views Formal Methods» more  NFM 2011»
13 years 2 months ago
Model Checking Using SMT and Theory of Lists
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
Aleksandar Milicevic, Hillel Kugler
ENTCS
2007
119views more  ENTCS 2007»
13 years 7 months ago
Interpolant Learning and Reuse in SAT-Based Model Checking
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...
João Marques-Silva