1445 search results - page 132 / 289 » Abstract Interpretation of Logic Programs |
136
click to vote
LICS
2008
IEEE
15 years 9 months ago
2008
IEEE
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
123
click to vote
FOSSACS
2009
Springer
15 years 9 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
CAISE
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This paper uses a framework drawn from work in the philosophy of science to characterize the concepts of program correctness that have been used in software engineering, ...
126
click to vote
CADE
2008
Springer
16 years 3 months ago
2008
Springer
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
140
click to vote
ECSQARU
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Even though in Artificial Intelligence, a set of classical logical formulae is often called a belief base, reasoning about beliefs requires more than the language of cla...