4340 search results - page 465 / 868 » Formal Methods and Cryptography |
204
click to vote
TLDI
2009
ACM
16 years 3 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
180
click to vote
TLDI
2009
ACM
16 years 3 months ago
2009
ACM
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
179
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the...
157
click to vote
FMCAD
2009
Springer
16 years 1 months ago
2009
Springer
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...
174
click to vote
FMCAD
2009
Springer
16 years 1 months ago
2009
Springer
—Boolean manipulation and existential quantification of numeric variables from linear arithmetic (LA) formulas is at the core of many program analysis and software model checkin...