1445 search results - page 133 / 289 » Abstract Interpretation of Logic Programs |
135
click to vote
BIRTHDAY
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
145
click to vote
CADE
1992
Springer
15 years 7 months ago
1992
Springer
network of theories. Results are typically proved in compact, abstract theories, and then transported as needed to more concrete theories, or indeed to Supported by the MITRE-Spon...
126
click to vote
APSEC
2008
IEEE
15 years 9 months ago
2008
IEEE
Memory usage analysis is an important problem for resource-constrained mobile devices, especially under mission- or safety-critical circumstances. Program codes running on or bein...
148
click to vote
AMAST
1991
Springer
15 years 6 months ago
1991
Springer
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurr...
116
click to vote
LICS
2005
IEEE
15 years 8 months ago
2005
IEEE
Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions g...