188 search results - page 29 / 38 » Logic of Proofs for Bounded Arithmetic |
ENTCS
2008
14 years 11 months ago
2008
RZ is a tool which translates axiomatizations of mathematical structures to program specifications using the realizability interpretation of logic. This helps programmers correctl...
TACAS
2010
Springer
15 years 6 months ago
2010
Springer
The theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solv...
104
click to vote
PODS
2007
ACM
15 years 11 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
FOSSACS
2007
Springer
15 years 5 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...
103
click to vote
TLCA
2005
Springer
15 years 5 months ago
2005
Springer
αProlog is a logic programming language which is well-suited for rapid prototyping of type systems and operational semantics of typed λ-calculi and many other languages involving...