Sciweavers

181 search results - page 34 / 37
» Programming Language Techniques for Cryptographic Proofs
Sort
View
JELIA
1990
Springer
14 years 18 days ago
Semantic Interpretation as Higher-Order Deduction
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
Fernando C. N. Pereira
DICS
2006
13 years 10 months ago
Dependable Software
Achieving software reliability takes many complementary techniques, directed at the process or at the products. This survey summarizes some of the most fruitful ideas. 1 OVERVIEW ...
Bertrand Meyer
CP
2007
Springer
14 years 2 months ago
Limitations of Restricted Branching in Clause Learning
The techniques for making decisions, i.e., branching, play a central role in complete methods for solving structured CSP instances. In practice, there are cases when SAT solvers be...
Matti Järvisalo, Tommi A. Junttila
CP
2007
Springer
14 years 2 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
ISSAC
2004
Springer
185views Mathematics» more  ISSAC 2004»
14 years 1 months ago
Automatic generation of polynomial loop
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
Enric Rodríguez-Carbonell, Deepak Kapur