3624 search results - page 197 / 725 » Abstract Algebraic Logic |
190
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
150
click to vote
APSEC
2003
IEEE
15 years 10 months ago
2003
IEEE
Using the language Z for more than specification is hindered by the fact that its algebra of schemas is not monotonic with respect to refinement; so specification is modular, but ...
141
click to vote
AML
2006
15 years 6 months ago
2006
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
168
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Recently, graded modalities have been added to the semantics of two of the logics most commonly used by the computer science community:
146
click to vote
TPHOL
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract. This paper presents a separation-logic framework for reasoning about low-level C code in the presence of virtual memory. We describe ract, generic Isabelle/HOL framework ...