1058 search results - page 3 / 212 » It's Doomed; We Can Prove It |
PODC
1990
ACM
13 years 10 months ago
1990
ACM
Abstract. We introduce a novel extension of propositional modal logic that is interpreted over Kripke structures in which a value is associated with every possible world. These val...
SAC
2010
ACM
14 years 27 days ago
2010
ACM
Program bugs remain a major challenge for software developers and various tools have been proposed to help with their localization and elimination. Most present-day tools are base...
ICFP
2005
ACM
14 years 6 months ago
2005
ACM
Applied Type System (ATS) is recently proposed as a framework for designing and formalizing (advanced) type systems in support of practical programming. In ATS, the definition of ...
TPHOL
1999
IEEE
13 years 10 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
IGPL
1998
13 years 5 months ago
1998
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...