Sciweavers

338 search results - page 10 / 68
» Locally checkable proofs
Sort
View
ASE
2006
122views more  ASE 2006»
13 years 8 months ago
Combining Proof Plans with Partial Order Planning for Imperative Program Synthesis
The structured programming literature provides methods and a wealth of heuristic knowledge for guiding the construction of provably correct imperative programs. We investigate the...
Andrew Ireland, Jamie Stark
FOCS
1991
IEEE
13 years 11 months ago
A parallel algorithmic version of the Local Lemma
The Lov´asz Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results with...
Noga Alon
TLCA
2001
Springer
14 years 9 days ago
Strong Normalisation for a Gentzen-like Cut-Elimination Procedure
In this paper we introduce a cut-elimination procedure for classical logic, which is both strongly normalising and consisting of local proof transformations. Traditional cut-elimin...
Christian Urban
CAV
2010
Springer
168views Hardware» more  CAV 2010»
13 years 6 months ago
A Dash of Fairness for Compositional Reasoning
Abstract. Proofs of progress properties often require fairness assumptions. Incorporating global fairness assumptions in a compositional method is a challenge, however, given the l...
Ariel Cohen 0002, Kedar S. Namjoshi, Yaniv Sa'ar
JLP
2008
91views more  JLP 2008»
13 years 7 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