1226 search results - page 45 / 246 » Proofs, Programs and Abstract Complexity |
133
Voted
KI
1990
Springer
15 years 6 months ago
1990
Springer
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
193
Voted
CAV
2003
Springer
15 years 6 months ago
2003
Springer
odular Abstraction Refinement Thomas A. Henzinger1 , Ranjit Jhala1 , Rupak Majumdar1 , and Shaz Qadeer2 1 University of California, Berkeley 2 Microsoft Research, Redmond Abstract....
101
click to vote
AISC
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Assumptions about the domains of partial functions are necessary in state-of-the-art proof assistants. On the other hand when mathematicians write about partial functions...
106
Voted
CSMR
1998
IEEE
15 years 7 months ago
1998
IEEE
AbstractA large body of research in the measurement of software complexity has been focused on imperative programs, but little eort has been made for logic programs. In this paper,...
107
Voted
TGC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Ghost variables are assignable variables that appear in program annotations but do not correspond to physical entities. They are used to facilitate specification and ver...