Sciweavers

Share
24 search results - page 1 / 5
» Matrix Interpretations on Polyhedral Domains
Sort
View
RTA
2010
Springer
10 years 8 months ago
Polynomially Bounded Matrix Interpretations
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...
Johannes Waldmann
ASIAN
2006
Springer
152views Algorithms» more  ASIAN 2006»
10 years 8 months ago
Inferring Disjunctive Postconditions
Polyhedral analysis [9] is an abstract interpretation used for automatic discovery of invariant linear inequalities among numerical varia program. Convexity of this abstract domain...
Corneliu Popeea, Wei-Ngan Chin
SOFSEM
2010
Springer
11 years 1 months ago
Improved Matrix Interpretation
We present a new technique to prove termination of Term Rewriting Systems, with full automation. A crucial task in this context is to find suitable well-founded orderings. A popul...
Pierre Courtieu, Gladys Gbedo, Olivier Pons
WSC
2007
10 years 6 months ago
Optimistic parallel discrete event simulation of the event-based transmission line matrix method
In this paper we describe a technique for efficient parallelization of digital wave guide network (DWN) models based on an interpretation of the finite difference time domain (F...
David W. Bauer, Ernest H. Page
CSFW
2011
IEEE
9 years 4 months ago
Dynamic Enforcement of Knowledge-Based Security Policies
—This paper explores the idea of knowledge-based security policies, which are used to decide whether to answer queries over secret data based on an estimation of the querier’s ...
Piotr Mardziel, Stephen Magill, Michael Hicks, Mud...
books