Sciweavers

1895 search results - page 258 / 379
» Using ATL for Checking Models
Sort
View
CAV
2009
Springer
163views Hardware» more  CAV 2009»
16 years 5 months ago
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas...
Leonardo Mendonça de Moura, Yeting Ge
CAV
2009
Springer
176views Hardware» more  CAV 2009»
16 years 5 months ago
PAT: Towards Flexible Verification under Fairness
Recent development on distributed systems has shown that a variety of fairness constraints (some of which are only recently defined) play vital roles in designing self-stabilizing ...
Jun Sun 0001, Yang Liu 0003, Jin Song Dong, Jun Pa...
APN
2009
Springer
15 years 11 months ago
Compositional Service Trees
In the world of Service Oriented Architectures, one deals with networks of cooperating components. A component offers services; to deliver a service it possibly needs services of ...
Wil M. P. van der Aalst, Kees M. van Hee, Peter Ma...
142
Voted
DNA
2005
Springer
132views Bioinformatics» more  DNA 2005»
15 years 10 months ago
DNA Recombination by XPCR
The first step of the Adleman-Lipton extract model in DNA computing is the combinatorial generation of libraries. In this paper a new method is proposed for generating a initial p...
Giuditta Franco, Vincenzo Manca, Cinzia Giagulli, ...
PASTE
2004
ACM
15 years 10 months ago
Dynamically inferring temporal properties
Model checking requires a specification of the target system’s desirable properties, some of which are temporal. Formulating a property of the system based on either its abstrac...
Jinlin Yang, David Evans