249 search results - page 48 / 50 » Principals in Programming Languages: A Syntactic Proof Techn... |
ICSE
2005
IEEE-ACM
14 years 7 months ago
2005
IEEE-ACM
Existing spreadsheet systems allow users to change cells arbitrarily, which is a major source of spreadsheet errors. We propose a system that prevents errors in spreadsheets by re...
CP
2007
Springer
14 years 1 months ago
2007
Springer
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...
CP
2007
Springer
14 years 1 months ago
2007
Springer
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...
ISSAC
2004
Springer
14 years 25 days ago
2004
Springer
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...
COMPSAC
2003
IEEE
14 years 23 days ago
2003
IEEE
Over the past years, the reengineering of legacy software systems to object oriented platforms has received significant attention. In this paper, we present a generic re-engineeri...