Sciweavers

1020 search results - page 35 / 204
» Tight Semantics for Logic Programs
Sort
View
ERSHOV
2001
Springer
14 years 1 months ago
Reexecution-Based Analysis of Logic Programs with Delay Declarations
A general semantics-based framework for the analysis of logic programs with delay declarations is presented. The framework incorporates well known refinement techniques based on r...
Agostino Cortesi, Baudouin Le Charlier, Sabina Ros...
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 8 months ago
Mechanized semantics
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
Xavier Leroy
ICFP
2005
ACM
14 years 8 months ago
Types with semantics: soundness proof assistant
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
Olha Shkaravska
WCET
2008
13 years 10 months ago
Towards Predicated WCET Analysis
In this paper, we propose the use of constraint logic programming as a way of modeling contextsensitive execution-times of program segments. The context-sensitive constraints are ...
Amine Marref, Guillem Bernat
APLAS
2007
ACM
14 years 24 days ago
The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer
We rationally reconstruct the core of the Coccinelle system, used for automating and documenting collateral evolutions in Linux device drivers. A denotational semantics of the syst...
Neil D. Jones, René Rydhof Hansen