330 search results - page 50 / 66 » On Modular Termination Proofs of General Logic Programs |
ECOOP
2008
Springer
14 years 11 months ago
2008
Springer
Verification of object-oriented programs relies on object invariants which express consistency criteria of objects. The semantics of object invariants is subtle, mainly because of...
80
Voted
FOAL
2008
ACM
14 years 11 months ago
2008
ACM
Aspect Oriented Programming (AOP) has significant potential to separate functionality and cross-cutting concerns. In particular, AOP supports an incremental development process, i...
FOAL
2007
ACM
15 years 1 months ago
2007
ACM
The relation between aspects and monads is a recurring topic in discussions in the programming language community, although it has never been elaborated whether their resemblences...
118
click to vote
HASKELL
2009
ACM
15 years 4 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
112
click to vote
ACL2
2006
ACM
15 years 3 months ago
2006
ACM
A verifying compiler is one that emits both object code and a proof of correspondence between object and source code.1 We report the use of ACL2 in building a verifying compiler f...