Sciweavers

6608 search results - page 77 / 1322
» On the Completeness of Model Checking
Sort
View
UIST
1993
ACM
15 years 5 months ago
Model-based User Interface Design by Example and by Interview
Model-based user interface design is centered around a description of application objects and operations at a level of ion higher than that of code. A good model can be used to su...
Martin R. Frank, James D. Foley
ICFEM
2004
Springer
15 years 6 months ago
Timed Patterns: TCOZ to Timed Automata
Abstract. The integrated logic-based modeling language, Timed Communicating Object Z (TCOZ), is well suited for presenting complete and coherent requirement models for complex real...
Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun 00...
138
Voted
DAC
2004
ACM
16 years 1 months ago
A SAT-based algorithm for reparameterization in symbolic simulation
Parametric representations used for symbolic simulation of circuits usually use BDDs. After a few steps of symbolic simulation, state set representation is converted from one para...
Pankaj Chauhan, Edmund M. Clarke, Daniel Kroening
121
Voted
CONCUR
2001
Springer
15 years 5 months ago
Bounded Reachability Checking with Process Semantics
Bounded model checking has been recently introduced as an efficient verification method for reactive systems. In this work we apply bounded model checking to asynchronous systems....
Keijo Heljanko
BMCBI
2008
211views more  BMCBI 2008»
15 years 1 months ago
CPSP-tools - Exact and complete algorithms for high-throughput 3D lattice protein studies
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
Martin Mann, Sebastian Will, Rolf Backofen