442 search results - page 31 / 89 » Proof Abstraction for Imperative Languages |
CSL
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. This paper is part of a general project of developing a systematic and algebraic proof theory for nonclassical logics. Generalizing our previous work on intuitionistic-su...
MFCS
1994
Springer
14 years 24 days ago
1994
Springer
We introduce in this paper new communication and synchronization constructs which allow deterministic processes, communicating asynchronously via unbounded FIFO bu ers, to cope wi...
CIE
2008
Springer
13 years 10 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
FOSSACS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
SE
2008
13 years 10 months ago
2008
: In this paper we present the language Monaco, which is a DSL for programming event-based, reactive automation solutions. The main purpose of the language is to bring automation p...