313 search results - page 30 / 63 » Formalizing the Halting Problem in a Constructive Type Theor... |
PRDC
2006
IEEE
14 years 1 months ago
2006
IEEE
Dependable systems are usually designed with multiple instances of components or logical processes, and often possess symmetries that may be exploited in model-based evaluation. T...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we investigate two related aspects of the formalization of open interaction systems: how to specify norms, and how to enforce them by means of sanctions. The problem...
RSKT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A fundamental data modeling problem in geographical information systems and spatial database systems refers to an appropriate treatment of the vagueness or indeterminacy ...
HASKELL
2009
ACM
14 years 2 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
ICLP
2011
Springer
12 years 11 months ago
2011
Springer
Transaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many ad...