172 search results - page 20 / 35 » Automatic Termination Analysis of Logic Programs |
85
Voted
APLAS
2006
ACM
15 years 3 months ago
2006
ACM
This document contains the Isabelle/HOL sources underlying our paper A bytecode logic for JML and types [2], updated to Isabelle 2008. We present a program logic for a subset of s...
AGP
2003
IEEE
15 years 2 months ago
2003
IEEE
There are very few approaches to measure the execution costs of lazy functional (logic) programs. The use of a lazy execution mechanism implies that the complexity of an evaluation...
LOPSTR
2007
Springer
15 years 3 months ago
2007
Springer
Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of t...
CADE
2004
Springer
15 years 9 months ago
2004
Springer
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
157
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...