899 search results - page 64 / 180 » A CTL-Based Logic for Program Abstractions |
180
Voted
MKM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Formal verification of numerical programs is notoriously difficult. On the one hand, there exist automatic tools specialized in floatingpoint arithmetic, such as Gappa...
132
Voted
LPNMR
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
137
click to vote
CADE
2010
Springer
15 years 5 months ago
2010
Springer
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...
152
Voted
LPNMR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic program...
152
click to vote
LOPSTR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...