764 search results - page 149 / 153 » On the Expressibility of Stable Logic Programming |
ISSTA
2009
ACM
15 years 4 months ago
2009
ACM
Exception analysis and points-to analysis are typically done in complete separation. Past algorithms for precise exception analysis (e.g., pairing throw clauses with catch stateme...
75
Voted
PLDI
2006
ACM
15 years 3 months ago
2006
ACM
Progressing beyond the productivity of present-day languages appears to require using domain-specific knowledge. Domain-specific languages and libraries (DSLs) proliferate, but ...
VMCAI
2004
Springer
15 years 2 months ago
2004
Springer
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
PASTE
2010
ACM
14 years 11 months ago
2010
ACM
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
102
click to vote
AIPS
2009
14 years 10 months ago
2009
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...