6274 search results - page 145 / 1255 » Proofs, Programs, Processes |
173
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
163
click to vote
TACAS
2010
Springer
16 years 1 months ago
2010
Springer
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
154
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
We describe the mechanization of recent examples of compositional reasoning, due to Charpentier and Chandy [4]. The examples illustrate a new theory for composition proposed by Ch...
150
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
As a general framework, UNITY does not offer any specific facility for the design of distributed systems. For such systems, distribution aspects must be represented at a low level,...
208
click to vote
TGC
2010
Springer
15 years 4 months ago
2010
Springer
Static analysers are becoming so complex that it is crucial to ascertain the soundness of their results in a provable way. In this paper we develop a certified checker in Coq that ...