Sciweavers

159 search results - page 10 / 32
» Specifying Proof Systems in Linear Logic with Subexponential...
Sort
View
POPL
2004
ACM
15 years 10 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
FLOPS
2010
Springer
15 years 4 months ago
Beluga: Programming with Dependent Types, Contextual Data, and Contexts
The logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code...
Brigitte Pientka
IS
2006
14 years 9 months ago
Composition of Semantic Web services using Linear Logic theorem proving
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses a Semantic Web service language (DAML-S)...
Jinghai Rao, Peep Küngas, Mihhail Matskin
FSTTCS
2009
Springer
15 years 4 months ago
Automata and temporal logic over arbitrary linear time
Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running sys...
Julien Cristau
RE
2004
Springer
15 years 2 months ago
From Aspectual Requirements to Proof Obligations for Aspect-Oriented Systems
Aspect-oriented software development (AOSD) techniques support systematic modularization and composition of crosscutting concerns. Though AOSD techniques have been proposed to han...
Shmuel Katz, Awais Rashid