2432 search results - page 136 / 487 » Cryptographic logical relations |
127
Voted
KR
2010
Springer
15 years 4 months ago
2010
Springer
We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence...
129
Voted
CSFW
2007
IEEE
15 years 4 months ago
2007
IEEE
We present interpretations of type systems for secure information flow in Hoare logic, complementing previous encodings in binary (e.g. relational) program logics. Treating base-l...
121
click to vote
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
100
click to vote
ICALP
2000
Springer
15 years 4 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
88
Voted
JUCS
2008
15 years 20 days ago
2008
Abstract: This paper describes a Java-based framework for developing componentbased software systems supporting adaptation with logic laws and considering component interactions as...