1226 search results - page 142 / 246 » Proofs, Programs and Abstract Complexity |
133
Voted
B
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. In the area of networks, a common method to enforce a security policy expressed in a high-level language is based on an ad-hoc and manual rewriting process [24]. We argue...
104
click to vote
ICSE
2010
IEEE-ACM
15 years 8 months ago
2010
IEEE-ACM
Though verification tools are finding industrial use, the utility of engineering optimizations that make them scalable and usable is not widely known. Despite the fact that seve...
146
click to vote
ENTCS
2008
15 years 3 months ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
235
click to vote
POPL
2006
ACM
16 years 3 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
128
Voted
CSL
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We address a fundamental mismatch between the combinations of dynamics that occur in complex physical systems and the limited kinds of dynamics supported in analysis. Mod...