Sciweavers

279 search results - page 36 / 56
» Applying Reduction Techniques to Software Functional Require...
Sort
View
FTRTFT
1998
Springer
15 years 2 months ago
On the Need for Practical Formal Methods
A controversial issue in the formal methods community is the degree to which mathematical sophistication and theorem proving skills should be needed to apply a formal method. A fun...
Constance L. Heitmeyer
AAAI
2008
15 years 4 days ago
Sparse Projections over Graph
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
Deng Cai, Xiaofei He, Jiawei Han
ICFP
2010
ACM
14 years 10 months ago
ReCaml: execution state as the cornerstone of reconfigurations
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
Jérémy Buisson, Fabien Dagnat
VSTTE
2010
Springer
14 years 7 months ago
Dafny Meets the Verification Benchmarks Challenge
A suite of verification benchmarks for software verification tools and techniques, presented at VSTTE 2008 [11], provides an initial catalogue of benchmark challenges for the Verif...
K. Rustan M. Leino, Rosemary Monahan
SAC
2006
ACM
14 years 9 months ago
Transforming OCL constraints: a context change approach
Integrity constraints (ICs) play a key role in the definition of conceptual schemas. In the UML, ICs are usually specified as invariants written in the OCL. However, due to the hi...
Jordi Cabot, Ernest Teniente