Sciweavers

1226 search results - page 33 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
LICS
2002
IEEE
15 years 6 months ago
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...
Sophie Laplante, Richard Lassaigne, Fréd&ea...
CORR
2008
Springer
179views Education» more  CORR 2008»
15 years 2 months ago
Induction and Co-induction in Sequent Calculus
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...
Alwen Tiu, Alberto Momigliano
FMOODS
2007
15 years 3 months ago
Pict Correctness Revisited
The Pict programming language is an implementation of the π-calculus in which executions of π-calculus terms are specified via an abstract machine. An important property of any ...
Philippe Bidinger, Adriana B. Compagnoni
JDCTA
2010
150views more  JDCTA 2010»
14 years 8 months ago
Proof as Composition: An approach for the Large-granularity Web Services Composition
The large-granularity Web services are a new form of Web services. In contrast to the traditional Web services, they often have more interfaces, encapsulate more complex business ...
Yuyu Yin, Ying Li, Jianwei Yin, ShuiGuang Deng
ESOP
1992
Springer
15 years 6 months ago
A Provably Correct Compiler Generator
We have designed, implemented, and proved the correctness of a compiler generator that accepts action semantic descriptions of imperative programming languages. The generated comp...
Jens Palsberg