442 search results - page 38 / 89 » Proof Abstraction for Imperative Languages |
LICS
1994
IEEE
14 years 24 days ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
Abstract The computational proof model of Bellare and Rogaway for cryptographic protocol analysis is complemented by providing a formal specification of the actions of the adversa...
JUCS
2008
13 years 8 months ago
2008
: A goal of software product lines is the economical assembly of programs in a family of programs. In this paper, we explore how theorems about program properties may be integrated...
POPL
2011
ACM
12 years 11 months ago
2011
ACM
The technique of trace-based just-in-time compilation was introduced by Bala et al. and was further developed by Gal et al. It currently enjoys success in Mozilla Firefox’s Java...
DALT
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This paper extends a programming language for implementing cognitive agents with the capability to explicitly represent beliefs and reason about them. In this programming...