1204 search results - page 118 / 241 » Termination of Polynomial Programs |
175
Voted
POPL
2003
ACM
16 years 1 months ago
2003
ACM
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow ...
100
Voted
ICLP
2004
Springer
15 years 6 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
116
click to vote
TPHOL
2003
IEEE
15 years 6 months ago
2003
IEEE
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...
92
Voted
PAMI
2006
15 years 21 days ago
2006
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
108
Voted
SAS
2007
Springer
15 years 6 months ago
2007
Springer
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...