Sciweavers

1894 search results - page 96 / 379
» A TLA Proof System
Sort
View
AISC
2008
Springer
15 years 5 months ago
Automating Side Conditions in Formalized Partial Functions
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...
Cezary Kaliszyk
FOSSACS
2008
Springer
15 years 5 months ago
The Implicit Calculus of Constructions as a Programming Language with Dependent Types
Abstract. In this paper, we show how Miquel's Implicit Calculus of Constructions (ICC) can be used as a programming language featuring dependent types. Since this system has a...
Bruno Barras, Bruno Bernardo
SEMWIKI
2008
134views Data Mining» more  SEMWIKI 2008»
15 years 4 months ago
A Real Semantic Web for Mathematics Deserves a Real Semantics
Abstract. Mathematical documents, and their instrumentation by computers, have rich structure at the layers of presentation, metadata and semantics, as objects in a system for form...
Cezary Kaliszyk, Pierre Corbineau, Freek Wiedijk, ...
122
Voted
FMSD
2006
103views more  FMSD 2006»
15 years 3 months ago
Cones and foci: A mechanical framework for protocol verification
We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between ...
Wan Fokkink, Jun Pang, Jaco van de Pol
JUCS
2008
182views more  JUCS 2008»
15 years 3 months ago
Modularizing Theorems for Software Product Lines: The Jbook Case Study
: A goal of software product lines is the economical assembly of programs in a family of programs. In this paper, we explore how theorems about program properties may be integrated...
Don S. Batory, Egon Börger