Sciweavers

6274 search results - page 91 / 1255
» Proofs, Programs, Processes
Sort
View
KBSE
1999
IEEE
15 years 4 months ago
An Integration of Deductive Retrieval into Deductive Synthesis
Deductive retrieval and deductive synthesis are two conceptually closely related software development methods which apply theorem proving techniques to support the construction of...
Bernd Fischer 0002, Jon Whittle
CCS
2009
ACM
15 years 6 months ago
CoSP: a general framework for computational soundness proofs
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
Michael Backes, Dennis Hofheinz, Dominique Unruh
ESOP
1992
Springer
15 years 4 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
JLP
2008
91views more  JLP 2008»
14 years 12 months ago
Local variable scoping and Kleene algebra with tests
We explore the power of relational semantics and equational reasoning in the style of Kleene algebra for analyzing programs with mutable, statically scoped local variables. We prov...
Kamal Aboul-Hosn, Dexter Kozen
TCS
2008
14 years 11 months ago
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
Jean-François Dufourd