899 search results - page 23 / 180 » A CTL-Based Logic for Program Abstractions |
POPL
2005
ACM
14 years 7 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
bstractions for Secure Server-Side Scripting Dachuan Yu Ajay Chander Hiroshi Inamura Igor Serikov DoCoMo Communications Laboratories USA 3240 Hillview Avenue Palo Alto, CA 94304 {y...
CADE
2001
Springer
14 years 7 months ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
PEPM
1993
ACM
13 years 11 months ago
1993
ACM
In this tutorial the specialisation of declarative logic programs is presented. The main correctness results are given, and the outline of a basic algorithm for partial evaluation...
LOPSTR
2004
Springer
14 years 23 days ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...