Sciweavers

394 search results - page 44 / 79
» Formal polytypic programs and proofs
Sort
View
CSFW
1999
IEEE
14 years 10 days ago
A Meta-Notation for Protocol Analysis
Most formal approaches to security protocol analysis are based on a set of assumptions commonly referred to as the "Dolev-Yao model." In this paper, we use a multiset re...
Iliano Cervesato, Nancy A. Durgin, Patrick Lincoln...
POPL
2004
ACM
14 years 8 months ago
Separation and information hiding
We investigate proof rules for information hiding, using the recent formalism of separation logic. In essence, we use the separating conjunction to partition the internal resource...
Peter W. O'Hearn, Hongseok Yang, John C. Reynolds
ACL2
2006
ACM
14 years 2 months ago
Adding parallelism capabilities to ACL2
We have implemented parallelism primitives that permit an ACL2 programmer to parallelize execution of ACL2 functions. We (1) introduce logical definitions for these primitives, (...
David L. Rager
ESOP
2005
Springer
14 years 1 months ago
A Type System Equivalent to a Model Checker
ite-state abstraction scheme such as predicate abstraction. The type system, which is also parametric, type checks exactly those programs that are accepted by the model checker. It...
Mayur Naik, Jens Palsberg
KR
1998
Springer
14 years 6 days ago
What Robots Can Do
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot,...
Hector J. Levesque