8232 search results - page 112 / 1647 » Dynamic Logic Programming |
159
click to vote
CADE
2001
Springer
16 years 7 months ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
205
Voted
LPAR
1992
Springer
15 years 10 months ago
1992
Springer
We describe some of the techniques which have been used to implement METATEM, a programming language based on temporal logic, and address problems such as non-determinism and loopi...
169
click to vote
FMCAD
2008
Springer
15 years 8 months ago
2008
Springer
We present a general approach for verifying safety properties of Lustre programs automatically. Key aspects of the approach are the choice of an expressive first-order logic in wh...