439 search results - page 17 / 88 » Instantiation-Based Automated Reasoning: From Theory to Prac... |
CSL
2010
Springer
14 years 9 months ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
ICLP
1997
Springer
15 years 1 months ago
1997
Springer
Array updates in single assignment languages generally require some copying of the array, and thus tend to be more expensive than in imperative languages. As a result, programs in...
KBSE
1997
IEEE
15 years 1 months ago
1997
IEEE
Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This...
LICS
1991
IEEE
15 years 1 months ago
1991
IEEE
Starting from a logic which speci es how to make deductions from a set of sentences (a ` at theory'), a way to generalise this toa partiallyordered bag ofsentences (a `struct...
110
click to vote
LICS
2012
IEEE
13 years 4 days ago
2012
IEEE
—This paper introduces HOpiPn, the higher-order pi-calculus with passivation and name creation, and develops an equivalence theory for this calculus. Passivation [Schmitt and Ste...