827 search results - page 83 / 166 » Proof-Theoretic Soundness and Completeness |
TYPES
1998
Springer
14 years 2 months ago
1998
Springer
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We t...
ALP
1997
Springer
14 years 2 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
TABLEAUX
1997
Springer
14 years 2 months ago
1997
Springer
Abstract. PA (Process algebra) is the name that has become common use to denote the algebra with a sequential and parallel operator (without communication), plus recursion. PA-proc...
LICS
1994
IEEE
14 years 2 months ago
1994
IEEE
Relational languages such as Ruby are used to derive circuits from abstract speci cations of their behaviour. Much reasoning is done informally in Ruby using pictorial representat...
KR
1994
Springer
14 years 2 months ago
1994
Springer
This paper analyzes a language for actions and the deontic modalities over actions -- i.e., the modalities permitted, forbidden and obligatory. The work is based on: (1) an action...