1948 search results - page 101 / 390 » Formalizing Mirror Theory |
158
click to vote
CCS
2008
ACM
15 years 7 months ago
2008
ACM
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
258
click to vote
POPL
2009
ACM
16 years 6 months ago
2009
ACM
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...
163
click to vote
CADE
2007
Springer
16 years 5 months ago
2007
Springer
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
197
click to vote
HASKELL
2009
ACM
15 years 12 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
137
click to vote
KR
2000
Springer
15 years 9 months ago
2000
Springer
We propose to extend the ontology of logical AI to include approximate objects, approximate predicates and approximate theories. Besides the ontology we treat the relations among ...