Sciweavers

68 search results - page 7 / 14
» Decision procedures for term algebras with integer constrain...
Sort
View
LFP
1994
129views more  LFP 1994»
13 years 8 months ago
Static Dependent Costs for Estimating Execution Time
We present the rst system for estimating and using datadependent expression execution times in a language with rst-class procedures and imperative constructs. The presence of rst-...
Brian Reistad, David K. Gifford
SACMAT
2009
ACM
14 years 1 months ago
An algebra for fine-grained integration of XACML policies
Collaborative and distributed applications, such as dynamic coalitions and virtualized grid computing, often require integrating access control policies of collaborating parties. ...
Prathima Rao, Dan Lin, Elisa Bertino, Ninghui Li, ...
POPL
2011
ACM
12 years 9 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
LFCS
2007
Springer
14 years 25 days ago
Verifying Balanced Trees
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Zohar Manna, Henny B. Sipma, Ting Zhang
CI
2011
93views more  CI 2011»
13 years 1 months ago
Supporting clinical processes and decisions by hierarchical planning and scheduling
This paper is focused on how a general-purpose hierarchical planning representation, based on the HTN paradigm, can be used to support the representation of oncology treatment pro...
Juan Fernández-Olivares, Luis A. Castillo, ...