3931 search results - page 155 / 787 » Separation logic and abstraction |
191
click to vote
ESOP
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
155
click to vote
ECSQARU
1999
Springer
15 years 10 months ago
1999
Springer
Intelligent agents embedded in physical environments need ity to connect, or anchor, the symbols used to perform abstract reasoning to the physical entities which these symbols ref...
177
click to vote
BMCBI
2007
15 years 6 months ago
2007
ent> <title> <p>Highlights from the Third International Society for Computational Biology (ISCB) Student Council Symposium at the Fifteenth Annual International Conf...
308
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
We define a type system, which may also be considered as a simple Hoare logic, for a fragment of an assembly language that deals with code pointers and jumps. The typing is aimed ...
181
click to vote
PPDP
2007
Springer
16 years 18 days ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...