Sciweavers

2702 search results - page 35 / 541
» Practically Applicable Formal Methods
Sort
View
CSMR
2005
IEEE
15 years 3 months ago
Discovering Unanticipated Dependency Schemas in Class Hierarchies
Object-oriented applications are difficult to extend and maintain, due to the presence of implicit dependencies in the inheritance hierarchy. Although these dependencies often co...
Gabriela Arévalo, Stéphane Ducasse, ...
ERSHOV
2003
Springer
15 years 3 months ago
Integration of Functional and Timed Testing of Real-Time and Concurrent Systems
The article presents an approach to model based testing of complex systems based on a generalization of finite state machines (FSM) and input output state machines (IOSM). The app...
Victor V. Kuliamin, Alexandre Petrenko, Nick V. Pa...
ACST
2006
14 years 11 months ago
Experimental study of hybrid-type distributed maximal constraint satisfaction algorithm
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
Masato Noto, Masahito Kurihara
BMCBI
2006
112views more  BMCBI 2006»
14 years 9 months ago
Algorithms for incorporating prior topological information in HMMs: application to transmembrane proteins
Background: Hidden Markov Models (HMMs) have been extensively used in computational molecular biology, for modelling protein and nucleic acid sequences. In many applications, such...
Pantelis G. Bagos, Theodore D. Liakopoulos, Stavro...
FMCAD
2008
Springer
14 years 11 months ago
A Theory of Mutations with Applications to Vacuity, Coverage, and Fault Tolerance
The quality of formal specifications and the circuits they are written for can be evaluated through checks such as vacuity and coverage. Both checks involve mutations to the specif...
Orna Kupferman, Wenchao Li, Sanjit A. Seshia