Sciweavers

1950 search results - page 236 / 390
» Lambda-Free Logical Frameworks
Sort
View
CADE
2009
Springer
16 years 7 months ago
Superposition and Model Evolution Combined
We present a new calculus for first-order theorem proving with equality, ME+Sup, which generalizes both the Superposition calculus and the Model Evolution calculus (with equality)...
Peter Baumgartner, Uwe Waldmann
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
16 years 7 months ago
Polymorphic Fractional Capabilities
Abstract. The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed...
Hirotoshi Yasuoka, Tachio Terauchi
PERCOM
2009
ACM
16 years 7 months ago
DiaSim: A Parameterized Simulator for Pervasive Computing Applications
Abstract--Pervasive computing applications involve both software concerns, like any software system, and integration concerns, for the constituent networked devices of the pervasiv...
Wilfried Jouve, Julien Bruneau, Charles Consel
CADE
2008
Springer
16 years 6 months ago
Specification Predicates with Explicit Dependency Information
Specifications of programs use auxiliary symbols to encapsulate concepts for a variety of reasons: readability, reusability, structuring and, in particular, for writing recursive d...
Richard Bubel, Reiner Hähnle, Peter H. Schmit...
CADE
2006
Springer
16 years 6 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