Sciweavers

718 search results - page 9 / 144
» Extraction of Structured Programs from Specification Proofs
Sort
View
LOGCOM
2007
126views more  LOGCOM 2007»
13 years 7 months ago
A Structural Proof of the Soundness of Rely/guarantee Rules
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...
Joey W. Coleman, Cliff B. Jones
AMAST
2010
Springer
13 years 2 months ago
Matching Logic: An Alternative to Hoare/Floyd Logic
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
Grigore Rosu, Chucky Ellison, Wolfram Schulte
ACL
2009
13 years 5 months ago
Mining User Reviews: from Specification to Summarization
This paper proposes a method to extract product features from user reviews and generate a review summary. This method only relies on product specifications, which usually are easy...
Xinfan Meng, Houfeng Wang
TABLEAUX
1995
Springer
13 years 11 months ago
On Transforming Intuitionistic Matrix Proofs into Standard-Sequent Proofs
We present a procedure transforming intuitionistic matrix proofs into proofs within the intuitionistic standard sequent calculus. The transformation is based on L. Wallen’s proof...
Stephan Schmitt, Christoph Kreitz
IS
2010
13 years 6 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley