6274 search results - page 430 / 1255 » Proofs, Programs, Processes |
181
click to vote
FOSSACS
2007
Springer
16 years 1 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
197
click to vote
IFM
2007
Springer
16 years 29 days ago
2007
Springer
We present an approach to modelling Abadi–Cardelli-style object calculi as Unifying Theories of Programming (UTP) designs. Here we provide a core object calculus with an operatio...
171
click to vote
FOCS
2006
IEEE
16 years 26 days ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
196
Voted
ACL2
2006
ACM
16 years 24 days ago
2006
ACM
We describe an embedding of the ACL2 logic into higherorder logic. An implementation of this embedding allows ACL2 to be used as an oracle for higher-order logic provers. Categori...
169
click to vote
CSL
2005
Springer
16 years 11 days ago
2005
Springer
We give a Natural Deduction formulation of an adaptation of G¨odel’s functional (Dialectica) interpretation to the extraction of (more) efficient programs from (classical) proof...