3693 search results - page 301 / 739 » Splitting a Logic Program |
172
click to vote
ICFP
2010
ACM
15 years 5 months ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
239
click to vote
LMCS
2006
15 years 4 months ago
2006
We show how to give a coherent semantics to programs that are well-specified in a version of separation logic for a language with higher types: idealized algol extended with heaps ...
134
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
128
click to vote
APLAS
2009
ACM
15 years 11 months ago
2009
ACM
Separation Algebras serve as models of Separation Logics; Share Accounting allows reasoning about concurrent-read/exclusive-write resources in Separation Logic. In designing a Conc...
136
click to vote
FMCO
2003
Springer
15 years 10 months ago
2003
Springer
In this paper we discuss the question which properties of a formally verified component are preserved when the component is changed due to an adaption to a new use. More specific...