4370 search results - page 372 / 874 » Algebra of Logic Programming |
208
click to vote
POPL
2011
ACM
14 years 6 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
124
click to vote
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
109
click to vote
CIE
2007
Springer
15 years 9 months ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
110
click to vote
SE
2008
15 years 4 months ago
2008
: In many of today's application programs, security functionality is inseparably intertwined with the actual mission-purpose logic. As a result, the trusted code base is unnec...
120
click to vote
PPDP
2010
Springer
15 years 1 months ago
2010
Springer
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...