Sciweavers

531 search results - page 88 / 107
» Data structure repair using goal-directed reasoning
Sort
View
ISKO
1997
49views more  ISKO 1997»
13 years 9 months ago
Frontiers in Conceptual Navigation
This paper was prepared for a lecture at a recent meeting of the German Chapter of ISKO devoted to Wissensorganisation mit Multimedialen Techniken [Knowledge Organization with Mul...
Kim H. Veltman
ACTA
2010
191views more  ACTA 2010»
13 years 8 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar
FMSD
2006
140views more  FMSD 2006»
13 years 8 months ago
Dealing with practical limitations of distributed timed model checking for timed automata
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
Víctor A. Braberman, Alfredo Olivero, Ferna...
CN
1998
95views more  CN 1998»
13 years 8 months ago
The Limits of Web Metadata, and Beyond
The World Wide Web currently has a huge amount of data, with practically no classification information, and this makes it extremely difficult to handle effectively. It has been re...
Massimo Marchiori
POPL
2005
ACM
14 years 8 months ago
Downgrading policies and relaxed noninterference
In traditional information-flow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express securi...
Peng Li, Steve Zdancewic