Sciweavers

211 search results - page 15 / 43
» Reflective Programming in the Relational Algebra
Sort
View
ICALP
2010
Springer
15 years 1 months ago
Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals
In this paper, we focus our attention on the fragment of Halpern and Shoham's modal logic of intervals (HS) that features four modal operators corresponding to the relations &...
Angelo Montanari, Gabriele Puppis, Pietro Sala
168
Voted
POPL
2010
ACM
16 years 1 months ago
Toward a Verified Relational Database Management System
We report on our experience implementing a lightweight, fully verified relational database management system (RDBMS). The functional specification of RDBMS behavior, RDBMS impleme...
Avraham Shinnar, Greg Morrisett, J. Gregory Malech...
148
Voted
UTP
2010
15 years 1 months ago
Specification Coverage for Testing in Circus
Abstract. The Unifying Theories of Programming underpins the development of Circus, a state-rich process algebra for refinement. We have previously presented a theory of testing fo...
Ana Cavalcanti, Marie-Claude Gaudel
140
Voted
JAR
2006
236views more  JAR 2006»
15 years 3 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
129
Voted
CALCO
2005
Springer
119views Mathematics» more  CALCO 2005»
15 years 9 months ago
The Category Theoretic Solution of Recursive Program Schemes
This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the category-theoret...
Stefan Milius, Lawrence S. Moss