77 search results - page 15 / 16 » Logical Interpretation: Static Program Analysis Using Theore... |
CORR
2002
Springer
13 years 4 months ago
2002
Springer
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...
AGP
1999
IEEE
13 years 9 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
PEPM
2010
ACM
13 years 7 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
VMCAI
2004
Springer
13 years 10 months ago
2004
Springer
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
CADE
2005
Springer
14 years 5 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...