1397 search results - page 161 / 280 » On the Need for Practical Formal Methods |
297
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to p...
177
click to vote
ICFP
2002
ACM
16 years 6 months ago
2002
ACM
Multi-stage programming languages provide a convenient notation for explicitly staging programs. Staging a definitional interpreter for a domain specific language is one way of de...
159
click to vote
PEPM
2010
ACM
16 years 3 months ago
2010
ACM
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
170
click to vote
ASPDAC
2005
ACM
16 years 1 days ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
183
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal st...