1076 search results - page 50 / 216 » Operations on proofs and labels |
118
click to vote
ESOP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
AISC
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Assumptions about the domains of partial functions are necessary in state-of-the-art proof assistants. On the other hand when mathematicians write about partial functions...
108
Voted
FUIN
2007
15 years 22 days ago
2007
The paper is concerned with algebras whose elements can be used to represent runs of a system, called processes. These algebras, called behaviour algebras, are categories with resp...
64
Voted
ECCC
2010
15 years 26 days ago
2010
An arithmetic read-once formula (ROF for short) is a formula (a circuit in which the fanout of every gate is at most 1) in which the operations are {+,
AOR
2007
15 years 27 days ago
2007
We corrected proofs of two results on the greedy algorithm for the Symmetric TSP and answered a question in Gutin and Yeo, Oper. Res. Lett. 30 (2002), 97–99.