Sciweavers

1689 search results - page 90 / 338
» Refining abstract interpretations
Sort
View
TCS
2008
15 years 4 months ago
A typed lambda calculus with intersection types
Intersection types are well-known to type theorists mainly for two reasons. Firstly, they type all and only the strongly normalizable lambda terms. Secondly, the intersection type...
Viviana Bono, Betti Venneri, Lorenzo Bettini
ENTCS
2000
120views more  ENTCS 2000»
15 years 4 months ago
Efficient Substitution in Hoare Logic Expressions
Substitution plays an important role in Hoare Logic, as it is used in interpreting assignments. When writing a computer-based realization of Hoare Logic, it is therefore important...
Roberto Virga
FMSD
2006
103views more  FMSD 2006»
15 years 4 months ago
Compositional SCC Analysis for Language Emptiness
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...
Chao Wang, Roderick Bloem, Gary D. Hachtel, Kavita...
CARDIS
1998
Springer
161views Hardware» more  CARDIS 1998»
15 years 8 months ago
Formal Proof of Smart Card Applets Correctness
: The new Gemplus smart card is based on the Java technology, embedding a virtual machine. The security policy uses mechanisms that are based on Java properties. This language prov...
Jean-Louis Lanet, Antoine Requet
FAC
2008
107views more  FAC 2008»
15 years 4 months ago
An incremental development of the Mondex system in Event-B
A development of the Mondex system was undertaken using Event-B and its associated proof tools. mental approach was used whereby the refinement between the abstract specification o...
Michael Butler, Divakar Yadav