Sciweavers

276 search results - page 32 / 56
» Representing Transition Systems by Logic Programs
Sort
View
ECOOPW
1998
Springer
13 years 12 months ago
Mapping Business Processes to Software Design Artifacts
This paper explains the structure of a project repository, which enables you to trace business processes and business rules to the architecture and design of the software system. T...
Pavel Hruby
APLAS
2009
ACM
14 years 2 months ago
Proving Copyless Message Passing
Handling concurrency using a shared memory and locks is tedious and error-prone. One solution is to use message passing instead. We study here a particular, contract-based flavor ...
Jules Villard, Étienne Lozes, Cristiano Cal...
PPDP
2009
Springer
14 years 2 months ago
Reasoning with hypothetical judgments and open terms in hybrid
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
Amy P. Felty, Alberto Momigliano
DC
2010
13 years 7 months ago
Model checking transactional memories
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh
HICSS
1998
IEEE
128views Biometrics» more  HICSS 1998»
13 years 12 months ago
A Situation Calculus Model of Hypertext
We utilize the situation calculus to develop a logical model of hypertext systems. The work builds upon the earlier work of Bieber and Kimbrough in the logical modeling of hyperte...
Richard B. Scherl, Michael Bieber, Fabio Vitali