1818 search results - page 88 / 364 » Granularity-Adaptive Proof Presentation |
186
click to vote
ECOOPW
1999
Springer
15 years 10 months ago
1999
Springer
The model checking of applications of aspects is explained, by showing the stages and proof obligations when a collection of generic aspects (called a superimposition) is combined...
154
click to vote
TPHOL
1999
IEEE
15 years 10 months ago
1999
IEEE
We present a development of Universal Algebra inside Type Theory, formalized using the proof assistant Coq. We define the notion of a signature and of an algebra over a signature. ...
165
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
In [10], Misra introduced the powerlist data structure, which is well suited to express recursive, data-parallel algorithms. In particular, Misra showed how powerlists could be use...
152
click to vote
TABLEAUX
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. We define sequent-style calculi for nominal tense logics characterized by classes of modal frames that are first-order definable by certain Π0 1 -formulae and Π0 2 -...
162
click to vote
TPHOL
1998
IEEE
15 years 10 months ago
1998
IEEE
Abstraction in a Higher-Order Logic Framework Marco Benini Sara Kalvala Dirk Nowotka Department of Computer Science University of Warwick, Coventry, CV4 7AL, United Kingdom We pres...