Sciweavers

5671 search results - page 855 / 1135
» A Semantic Approach to Interpolation
Sort
View
SAS
1999
Springer
117views Formal Methods» more  SAS 1999»
15 years 11 months ago
Abstracting Cryptographic Protocols with Tree Automata
ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...
David Monniaux
TPHOL
1998
IEEE
15 years 11 months ago
Program Abstraction in a Higher-Order Logic Framework
Abstraction in a Higher-Order Logic Framework Marco Benini Sara Kalvala Dirk Nowotka Department of Computer Science University of Warwick, Coventry, CV4 7AL, United Kingdom We pres...
Marco Benini, Sara Kalvala, Dirk Nowotka
AMAST
1998
Springer
15 years 11 months ago
An Algebraic View of Program Composition
Abstract. We propose a general categorical setting for modeling program composition in which the call-by-value and call-by-name disciplines fit as special cases. Other notions of c...
Pietro Cenciarelli
225
Voted
CC
1998
Springer
134views System Software» more  CC 1998»
15 years 11 months ago
Flow Logics for Constraint Based Analysis
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
Hanne Riis Nielson, Flemming Nielson
CCS
1998
ACM
15 years 11 months ago
A Specification of Java Loading and Bytecode Verification
This paper gives a mathematical specification the Java Virtual Machine (JVM) bytecode verifier. The specification is an axiomatic description of the verifier that makes precise su...
Allen Goldberg