Patent · US Expired

Declarative state space reduction in a transactional messaging language

US7343589B2 · kind B2 · utility

1Cited by
7References
49Claims
0Family size

Assignee

Inventors

Key dates

Filing dateJun 18, 2003
Grant dateMar 11, 2008
Priority date
Expiry dateJun 13, 2025

Classification

  • Technology area (CPC G)Physics
  • CPC primaryG06F8/43
  • WIPO fieldComputer technology
  • WIPO sectorElectrical engineering

Abstract

A XLANG/s compiler recognizes a statement in XLANG/s code to make an assumption as to the success or failure of a specified transaction. The assignment states of variables are tracked and changes to such states are recorded. While processing XLANG/s code, the compiler determines whether the assignment state of a particular correlation, operation or the like is correct for the transaction being performed. If not, the compiler may generate an error message. Moreover, by using declarative assumptions such as if(succeeded(T)) or if(!succeeded(T)), definite-assignment analysis of shared state variables may cross transactional boundaries.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.