442 search results - page 38 / 89 » Proof Abstraction for Imperative Languages |
126
click to vote
LICS
1994
IEEE
15 years 6 months 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 ...
100
click to vote
IFIP
2004
Springer
15 years 7 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...
105
click to vote
JUCS
2008
15 years 1 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...
130
click to vote
POPL
2011
ACM
14 years 4 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...
146
click to vote
DALT
2005
Springer
15 years 7 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...