Sciweavers

1076 search results - page 57 / 216
» Operations on proofs and labels
Sort
View
BIRTHDAY
2008
Springer
13 years 9 months ago
Linear Recurrence Relations for Graph Polynomials
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...
Eldar Fischer, Johann A. Makowsky
JLP
2007
130views more  JLP 2007»
13 years 7 months ago
A compositional coalgebraic model of fusion calculus
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...
Maria Grazia Buscemi, Ugo Montanari
CADE
2006
Springer
14 years 8 months ago
Combining Type Theory and Untyped Set Theory
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...
Chad E. Brown
JFPLC
2004
13 years 9 months ago
Explications pour comprendre la trace d'un solveur de contraintes sur domaines finis
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...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
JAR
2008
98views more  JAR 2008»
13 years 7 months ago
A Mechanical Analysis of Program Verification Strategies
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...
Sandip Ray, Warren A. Hunt Jr., John Matthews, J. ...