Sciweavers

4126 search results - page 511 / 826
» Set based logic programming
Sort
View
PPDP
2005
Springer
15 years 9 months ago
Formal validation of pattern matching code
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
Claude Kirchner, Pierre-Etienne Moreau, Antoine Re...
ISSTA
2004
ACM
15 years 9 months ago
Exploiting purity for atomicity
The notion that certain procedures are atomic is a fundamental correctness property of many multithreaded software systems. A procedure is atomic if for every execution there is a...
Cormac Flanagan, Stephen N. Freund, Shaz Qadeer
DLS
2008
149views Languages» more  DLS 2008»
15 years 5 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani
ASE
2007
143views more  ASE 2007»
15 years 3 months ago
Composition inference for UML class diagrams
Knowing which associations are compositions is important in a tool for the reverse engineering of UML class diagrams. Firstly, recovery of composition relationships bridges the ga...
Ana Milanova
FUZZIEEE
2007
IEEE
15 years 10 months ago
Tolerance-based and Fuzzy-Rough Feature Selection
— One of the main obstacles facing the application of computational intelligence technologies in pattern recognition (and indeed in many other tasks) is that of dataset dimension...
Richard Jensen, Qiang Shen