4513 search results - page 575 / 903 » Logic programming with satisfiability |
165
click to vote
ICFP
2012
ACM
13 years 6 months ago
2012
ACM
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
142
click to vote
ICSE
2008
IEEE-ACM
16 years 5 months ago
2008
IEEE-ACM
Dynamically discovering likely program invariants from concrete test executions has emerged as a highly promising software engineering technique. Dynamic invariant inference has t...
158
click to vote
ESOP
2009
Springer
15 years 11 months ago
2009
Springer
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
237
click to vote
POPL
2007
ACM
16 years 4 months ago
2007
ACM
It is well recognized that JavaScript can be exploited to launch browser-based security attacks. We propose to battle such attacks using program instrumentation. Untrusted JavaScr...
143
click to vote
AGP
2003
IEEE
15 years 8 months ago
2003
IEEE
Abstract. The interest in the area of non-monotonic reasoning and declarative logic programming is growing rapidly after the recent development of a number of Answer Set Programmin...