3931 search results - page 135 / 787 » Separation logic and abstraction |
153
click to vote
CSL
2003
Springer
15 years 11 months ago
2003
Springer
The semantics of class-based languages can be defined in terms of objects only [8, 7, 1] if classes are viewed as objects with a constructor method. One obtains a store in which m...
257
click to vote
ENTCS
2007
15 years 6 months ago
2007
Computing with failures is a typical programming technique in functional logic programs. However, there are also situations where a program should not fail (e.g., in a determinist...
151
click to vote
APLAS
2008
ACM
15 years 8 months ago
2008
ACM
This paper presents a verification technique for a concurrent Java-like language with reentrant locks. The verification technique is based on permissionaccounting separation logic....
146
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...
158
click to vote
CAV
2009
Springer
16 years 1 months ago
2009
Springer
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....