330 search results - page 63 / 66 » On Modular Termination Proofs of General Logic Programs |
WWW
2003
ACM
14 years 8 months ago
2003
ACM
SweetDeal is a rule-based approach to representation of business contracts that enables software agents to create, evaluate, negotiate, and execute contracts with substantial auto...
SIGSOFT
2006
ACM
14 years 8 months ago
2006
ACM
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
ISSTA
2004
ACM
14 years 1 months ago
2004
ACM
The notion that certain procedures are atomic is a fundamental correctness property of many multithreaded software systems. A procedure is atomic if for every execution there is a...
ECOOP
2004
Springer
14 years 1 months ago
2004
Springer
Design patterns are a standard means to create large software systems. However, with standard object-oriented techniques, typical implementations of such patterns are not themselv...
EMSOFT
2007
Springer
14 years 2 months ago
2007
Springer
We explain the design of the interpretation-based static analyzer Astr´ee and its use to prove the absence of run-time errors in safety-critical codes. Categories and Subject Des...