Sciweavers

3738 search results - page 31 / 748
» Parametrized Logic Programming
Sort
View
TPHOL
1998
IEEE
14 years 2 days ago
Object-Oriented Verification Based on Record Subtyping in Higher-Order Logic
We show how extensible records with structural subtyping can be represented directly in Higher-Order Logic (HOL). Exploiting some specific properties of HOL, this encoding turns o...
Wolfgang Naraschewski, Markus Wenzel
FLOPS
2010
Springer
14 years 2 months ago
Automatically Generating Counterexamples to Naive Free Theorems
Disproof can be as important as proof in studying programs and programming languages. In particular, side conditions in a statement about program behavior are sometimes best unders...
Daniel Seidel, Janis Voigtländer
WCET
2008
13 years 9 months ago
Towards an Automatic Parametric WCET Analysis
Static WCET analysis obtains a safe estimation of the WCET of a program. The timing behaviour of a program depends in many cases on input, and an analysis could take advantage of ...
Stefan Bygde, Björn Lisper
SLP
1990
76views more  SLP 1990»
13 years 9 months ago
Partial Evaluation for Hierarchies of Logic Theories
We discuss the impact of Partial Evaluation within the framework of structured logic programming. We define a general scheme for Partial Evaluation to be applied to a wide class o...
Michele Bugliesi, Evelina Lamma, Paola Mello
JAIR
2008
104views more  JAIR 2008»
13 years 7 months ago
Sound and Complete Inference Rules for SE-Consequence
The notion of strong equivalence on logic programs with answer set semantics gives rise to a consequence relation on logic program rules, called SE-consequence. We present a sound...
Ka-Shu Wong