3535 search results - page 479 / 707 » Logic Program Specialisation |
255
Voted
FSTTCS
2010
Springer
15 years 3 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
211
click to vote
LOGCOM
2010
15 years 28 days ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
180
Voted
TKDE
2010
15 years 26 days ago
2010
We exploit the spreadsheet metaphor to make deductive problem-solving methods available to the vast population of spreadsheet end users. In particular, we show how the function-bas...
153
Voted
CSL
2006
Springer
15 years 9 months ago
2006
Springer
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
182
click to vote
CCS
2011
ACM
14 years 6 months ago
2011
ACM
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...