Sciweavers

417 search results - page 74 / 84
» Results on Reasoning about Updates in Transaction Logic
Sort
View
133
Voted
FTCS
1998
144views more  FTCS 1998»
15 years 1 months ago
Improving Software Robustness with Dependability Cases
Programs fail mainly for two reasons: logic errors in the code, and exception failures. Exception failures can account for up to 2/3 of system crashes [6], hence are worthy of ser...
Roy A. Maxion, Robert T. Olszewski
95
Voted
LISP
2008
105views more  LISP 2008»
15 years 12 days ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
Francisco Durán, Salvador Lucas, Claude Mar...
SAC
2008
ACM
14 years 12 months ago
Flexible pointer analysis using assign-fetch graphs
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
Marcio Buss, Daniel Brand, Vugranam C. Sreedhar, S...
108
Voted
JLP
2010
85views more  JLP 2010»
14 years 7 months ago
Synchronous Kleene algebra
The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner's SCCS calculus. The resulting algebraic structure ...
Cristian Prisacariu
ICDT
2009
ACM
175views Database» more  ICDT 2009»
16 years 1 months ago
Structural characterizations of schema-mapping languages
Schema mappings are declarative specifications that describe the relationship between two database schemas. In recent years, there has been an extensive study of schema mappings a...
Balder ten Cate, Phokion G. Kolaitis