1101 search results - page 190 / 221 » Forcing in proof theory |
174
Voted
CL
2012
Springer
13 years 6 months ago
2012
Springer
Distributed logic programming languages, that allow both facts and programs to be distributed among different nodes in a network, have been recently proposed and used to declarati...
170
Voted
ICFP
2012
ACM
13 years 6 months ago
2012
ACM
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
246
Voted
POPL
2007
ACM
16 years 3 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
245
Voted
POPL
2006
ACM
16 years 3 months ago
2006
ACM
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
150
Voted
ICFP
2007
ACM
16 years 3 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...