1076 search results - page 57 / 216 » Operations on proofs and labels |
109
click to vote
BIRTHDAY
2008
Springer
15 years 2 months ago
2008
Springer
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving add...
111
click to vote
JLP
2007
15 years 19 days ago
2007
This paper is a further step in exploring the labelled transitions and bisimulations of fusion calculi. We follow a recent theory by the same authors and previously applied to the...
87
Voted
CADE
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. We describe a second-order type theory with proof irrelevance. Within this framework, we give a representation of a form of Mac Lane set theory and discuss automated supp...
147
click to vote
JFPLC
2004
15 years 2 months ago
2004
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
JAR
2008
15 years 22 days ago
2008
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...