Sciweavers

909 search results - page 146 / 182
» Generic Programming: An Introduction
Sort
View
MJ
2007
87views more  MJ 2007»
14 years 10 months ago
Using SAT-based techniques in power estimation
Recent algorithmic advances in Boolean satisfiability (SAT), along with highly efficient solver implementations, have enabled the successful deployment of SAT technology in a wi...
Assim Sagahyroon, Fadi A. Aloul
ML
2007
ACM
122views Machine Learning» more  ML 2007»
14 years 10 months ago
Status report: hot pickles, and how to serve them
The need for flexible forms of serialisation arises under many circumstances, e.g. for doing high-level inter-process communication or to achieve persistence. Many languages, inc...
Andreas Rossberg, Guido Tack, Leif Kornstaedt
POPL
2008
ACM
15 years 11 months ago
Relational inductive shape analysis
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
Bor-Yuh Evan Chang, Xavier Rival
PPDP
2005
Springer
15 years 4 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...
ADAEUROPE
2000
Springer
15 years 3 months ago
On Persistent and Reliable Streaming in Ada
Saving internal program data for further use is one of the most useful ideas in programming. Developing general features to provide such data saving/ restoring is a very active res...
Jörg Kienzle, Alexander B. Romanovsky