1076 search results - page 50 / 216 » Operations on proofs and labels |
ESOP
2004
Springer
14 years 1 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
13 years 9 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...
FUIN
2007
13 years 7 months 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...
ECCC
2010
13 years 7 months 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
13 years 7 months 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.