Sciweavers

827 search results - page 109 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
TPHOL
2005
IEEE
15 years 6 months ago
A Structured Set of Higher-Order Problems
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
Christoph Benzmüller, Chad E. Brown
103
Voted
ICDCS
2003
IEEE
15 years 6 months ago
Enhancing The Fault-Tolerance of Nonmasking Programs
In this paper, we focus on automated techniques to enhance the fault-tolerance of a nonmasking fault-tolerant program to masking. A masking program continually satisfies its spec...
Sandeep S. Kulkarni, Ali Ebnenasir
116
Voted
DLOG
2004
15 years 2 months ago
Extended Query Facilities for Racer and an Application to Software-Engineering Problems
er reports on a pragmatic query language for Racer. The abstract syntax and semantics of this query language is defined. Next, the practical relevance of this query language is sh...
Volker Haarslev, Ralf Möller, Ragnhild Van De...
145
Voted
CI
2000
114views more  CI 2000»
15 years 17 days ago
A Guided Tour through Some Extensions of the Event Calculus
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
SEFM
2006
IEEE
15 years 6 months ago
Product Automata and Process Algebra
We define a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is defin...
Kamal Lodaya