Sciweavers

63 search results - page 6 / 13
» On the complexity of practical ATL model checking
Sort
View
ICTAI
2005
IEEE
15 years 3 months ago
Good Learning and Implicit Model Enumeration
A large number of practical applications rely on effective algorithms for propositional model enumeration and counting. Examples include knowledge compilation, model checking and ...
António Morgado, João P. Marques Sil...
ATAL
2008
Springer
14 years 11 months ago
Checking correctness of business contracts via commitments
Business contracts tend to be complex. In current practice, contracts are often designed by hand and adopted by their participants after, at best, a manual analysis. This paper mo...
Nirmit Desai, Nanjangud C. Narendra, Munindar P. S...
IANDC
2011
127views more  IANDC 2011»
14 years 4 months ago
On the consistency, expressiveness, and precision of partial modeling formalisms
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
Ou Wei, Arie Gurfinkel, Marsha Chechik
85
Voted
ENTCS
2008
87views more  ENTCS 2008»
14 years 9 months ago
A Lightweight Approach for the Semantic Validation of Model Refinements
Model Driven Engineering proposes the use of models at different levels of ion. Step by step validation of model refinements is necessary to guarantee the correctness of the final ...
Claudia Pons, Diego García
CONCUR
2007
Springer
15 years 1 months ago
Temporal Antecedent Failure: Refining Vacuity
We re-examine vacuity in temporal logic model checking. We note two disturbing phenomena in recent results in this area. The first indicates that not all vacuities detected in prac...
Shoham Ben-David, Dana Fisman, Sitvanit Ruah