38 search results - page 5 / 8 » Mathematical Foundations of Answer Set Programming |
141
Voted
PLDI
2011
ACM
14 years 4 months ago
2011
ACM
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
125
Voted
ICFP
2005
ACM
16 years 1 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
160
Voted
AML
2011
14 years 8 months ago
2011
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
134
Voted
COMPSAC
2010
IEEE
14 years 11 months ago
2010
IEEE
The advent of emerging technologies such as Web services, service-oriented architecture, and cloud computing has enabled us to perform business services more efficiently and effect...
130
Voted
ISSAC
2004
Springer
15 years 6 months ago
2004
Springer
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...