Sciweavers

117 search results - page 21 / 24
» Program Extraction from Classical Proofs
Sort
View
ICSM
2005
IEEE
14 years 1 months ago
Context-Free Slicing of UML Class Models
In the work presented here, we introduce a method to automatically generate a subset of a UML class model based on a user-defined criterion. The goal of this work is to allow us to...
Huzefa H. Kagdi, Jonathan I. Maletic, Andrew Sutto...
EMSOFT
2007
Springer
13 years 11 months ago
Verification of device drivers and intelligent controllers: a case study
The soundness of device drivers generally cannot be verified in isolation, but has to take into account the reactions of the hardware devices. In critical embedded systems, interf...
David Monniaux
BMCBI
2008
78views more  BMCBI 2008»
13 years 7 months ago
A new protein linear motif benchmark for multiple sequence alignment software
Background: Linear motifs (LMs) are abundant short regulatory sites used for modulating the functions of many eukaryotic proteins. They play important roles in post-translational ...
Emmanuel Perrodou, Claudia Chica, Olivier Poch, To...
IUI
2010
ACM
14 years 4 months ago
Mobia Modeler: easing the creation process of mobile applications for non-technical users
The development of mobile applications has now extended from mobile network providers into the hands of ordinary people as organizations and companies encourage people to come up ...
Florence T. Balagtas-Fernandez, Max Tafelmayer, He...
ICALP
2007
Springer
14 years 1 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson