2432 search results - page 272 / 487 » Cryptographic logical relations |
186
click to vote
PPDP
2007
Springer
16 years 22 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...
173
click to vote
SIGCSE
2005
ACM
16 years 5 days ago
2005
ACM
Courses in Relational Databases largely use a domain-specific design approach different from that used in the rest of the curriculum. Use of the Unified Process, UML, and Design P...
162
click to vote
AO
2007
15 years 6 months ago
2007
As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into...
232
click to vote
TOCL
2012
13 years 9 months ago
2012
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...
282
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
PRISM is a probabilistic extension of Prolog. It is a high level language for probabilistic modeling capable of learning statistical parameters from observed data. After reviewing ...