858 search results - page 92 / 172 » Abstract Interpretation Based Verification of Logic Programs |
149
click to vote
ICLP
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents a reactive programming and triggering framework for the coordination of a large number of distributed agents with shared knowledge. At the heart of this framewo...
188
click to vote
FMOODS
2008
15 years 7 months ago
2008
Reasoning about object-oriented programs is hard, due to , dynamic binding and the need for data abstraction and framing. Reasoning about concurrent object-oriented programs is eve...
154
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
168
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
318
click to vote
LPAR
2012
Springer
14 years 1 months ago
2012
Springer
Abstract. We present a novel counterexample generator for the interactive theorem prover Isabelle based on a compiler that synthesizes test data generators for functional programmi...