Sciweavers

72 search results - page 5 / 15
» Computational and Information-Theoretic Soundness and Comple...
Sort
View
SAS
1991
Springer
102views Formal Methods» more  SAS 1991»
13 years 11 months ago
Equational Logics
d Abstract) Marcelo Fiore1 Chung-Kil Hur2,3 Computer Laboratory University of Cambridge Cambridge, UK We introduce an abstract general notion of system of equations between terms,...
Yong Sun
ECOWS
2008
Springer
13 years 9 months ago
Beyond Soundness: On the Semantic Consistency of Executable Process Models
Executable business process models build on the specification of process activities, their implemented business functions (e.g., Web services) and the control flow between these a...
Ingo Weber, Jörg Hoffmann, Jan Mendling
LPAR
2010
Springer
13 years 5 months ago
A Simple Class of Kripke-Style Models in Which Logic and Computation Have Equal Standing
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
Michael Gabbay, Murdoch James Gabbay
WOLLIC
2009
Springer
14 years 2 months ago
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
Hugo Herbelin, Gyesik Lee
TC
2010
13 years 5 months ago
Formal Reliability Analysis Using Theorem Proving
—Reliability analysis has become a tool of fundamental importance to virtually all electrical and computer engineers because of the extensive usage of hardware systems in safety ...
Osman Hasan, Sofiène Tahar, Naeem Abbasi