Sciweavers

3773 search results - page 735 / 755
» Logical Reasoning
Sort
View
ERLANG
2008
ACM
14 years 11 months ago
Gradual typing of erlang programs: a wrangler experience
Currently most Erlang programs contain no or very little type information. This sometimes makes them unreliable, hard to use, and difficult to understand and maintain. In this pap...
Konstantinos F. Sagonas, Daniel Luna
FOAL
2008
ACM
14 years 11 months ago
Incremental analysis of interference among aspects
Often, insertion of several aspects into one system is desired and in that case the problem of interference among the different aspects might arise, even if each aspect individual...
Emilia Katz, Shmuel Katz
TOPLAS
2008
138views more  TOPLAS 2008»
14 years 9 months ago
Decomposing bytecode verification by abstract interpretation
act Interpretation C. BERNARDESCHI, N. DE FRANCESCO, G. LETTIERI, L. MARTINI, and P. MASCI Universit`a di Pisa Bytecode verification is a key point in the security chain of the Jav...
Cinzia Bernardeschi, Nicoletta De Francesco, Giuse...
JACM
2002
163views more  JACM 2002»
14 years 9 months ago
Formal verification of standards for distance vector routing protocols
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gu...
OOPSLA
2010
Springer
14 years 7 months ago
Composable specifications for structured shared-memory communication
In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication. Our approa...
Benjamin P. Wood, Adrian Sampson, Luis Ceze, Dan G...