1117 search results - page 128 / 224 » Partial Models of Extended Generalized Logic Programs |
141
click to vote
ICFP
2004
ACM
16 years 1 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
LOPSTR
1998
Springer
15 years 5 months ago
1998
Springer
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
120
click to vote
PLDI
2005
ACM
15 years 7 months ago
2005
ACM
Ad-hoc networks of mobile devices such as smart phones and PDAs represent a new and exciting distributed system architecture. Building distributed applications on such an architec...
110
click to vote
CPAIOR
2009
Springer
15 years 8 months ago
2009
Springer
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
KBSE
2007
IEEE
15 years 7 months ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...